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 EDBT 2026 / reviewers in the wild / expert

Dov Andelman

dblp:45/1958 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none

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

Theory of computation · 1 · 1 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
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › cryptanalysis › statistical cryptanalysis
maximum likelihood attack		 0.011982
On the cryptanalysis of rotor machines and substitution - permutation networks · IEEE Trans. Inf. Theory 1982
Cryptographic primitives and cryptanalysis › cryptanalysis
statistical cryptanalysis		 0.011982
On the cryptanalysis of rotor machines and substitution - permutation networks · IEEE Trans. Inf. Theory 1982

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

statistical estimation theory · 0.0maximum likelihood estimation · 0.0
YearPublicationVenuePosition
1982 On the cryptanalysis of rotor machines and substitution - permutation networks
abstract
A general cryptanalysis method is presented based on statistical estimation theory. It is applied to two systems of practical interest: rotor machines and substitution-permutation networks. To cryptanalyze these systems, the finite keyspace is imbedded in a continuous set and the key estimate is a proper quantization of the continuous maximum likelihood estimate. Promising cryptanalysis results of a rotor machine under a ciphertext only attack and a substitution-permutation network under a known plaintext attack are presented.
Dov Andelman, James A. Reeds
 IEEE Trans. Inf. Theory1