Thumbnail
Access Restriction
Subscribed

Author Peleg, Shmuel ♦ Rosenfeld, Azriel
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Probabilistic classification ♦ Relaxation ♦ Cryptography ♦ Substitution ciphers
Abstract Substitution ciphers are codes in which each letter of the alphabet has one fixed substitute, and the word divisions do not change. In this paper the problem of breaking substitution ciphers is represented as a probabilistic labeling problem. Every code letter is assigned probabilities of representing plaintext letters. These probabilities are updated in parallel for all code letters, using joint letter probabilities. Iterating the updating scheme results in improved estimates that finally lead to breaking the cipher. The method is applied successfully to two examples.
Description Affiliation: Univ. of Maryland, College Park (Peleg, Shmuel; Rosenfeld, Azriel)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 22
Issue Number 11
Page Count 8
Starting Page 598
Ending Page 605


Open content in new tab

   Open content in new tab
Source: ACM Digital Library