Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Rolf J. Blom

dblp:93/873 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1984
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
2 papers
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › information-theoretic security
key equivocation		 0.021984
An Upper Bound on the Key Equivocation for Pure Ciphers · IEEE Trans. Inf. Theory 1984
Sounds on key equivocation for simple substitution ciphers · IEEE Trans. Inf. Theory 1979
Cryptographic primitives and cryptanalysis › symmetric cryptography
substitution cipher		 0.011979
Sounds on key equivocation for simple substitution ciphers · IEEE Trans. Inf. Theory 1979
Coding theory › source coding › source modeling
memoryless source		 0.021984
An Upper Bound on the Key Equivocation for Pure Ciphers · IEEE Trans. Inf. Theory 1984
Sounds on key equivocation for simple substitution ciphers · IEEE Trans. Inf. Theory 1979

Methods — techniques the papers use, named apart from their topics

upper bounds · 0.0upper bound · 0.0exponential bounds · 0.0
YearPublicationVenuePosition
1984 An Upper Bound on the Key Equivocation for Pure Ciphers
abstract
An upper bound on key equivocation for a pure cipher applied on a memoryless message source is derived.
Rolf J. Blom
 IEEE Trans. Inf. Theory1
1979 Sounds on key equivocation for simple substitution ciphers
abstract
The equivocation of the key for a simple substitution cipher is upper and lower hounded, when the message source is memoryless. The hounds are shown to be exponentially tight. The results are compared with random ciphering. It is observed that the exponential behavior of the equivocation of the key is not determined by the redundancy in the message source, but by the symbol probabilities which are closest in a certain sense.
Rolf J. Blom
 IEEE Trans. Inf. Theory1