Breaking substitution ciphers using a relaxation algorithm

DOI10.1145/359168.359174zbMATH Open0414.94020OpenAlexW2053007711WikidataQ121463058 ScholiaQ121463058MaRDI QIDQ3050282FDOQ3050282

Authors: Shmuel Peleg, Azriel Rosenfeld 

Publication date: 1979

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359168.359174

zbMATH Keywords

cryptographyrelaxationprobabilistic classificationsubstitution ciphers

Mathematics Subject Classification ID

Communication, information (94A99)

Cited In (2)

• Attacking Letter Substitution Ciphers with Integer Programming
• Robust Dictionary Attack of Short Simple Substitution Ciphers

This page was built for publication: Breaking substitution ciphers using a relaxation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3050282)