Equivocations for Homophonic Ciphers

DOI10.1007/3-540-39757-4_6MaRDI QIDQ3728802zbMATH OpenOpenAlexFDO

Authors Andrea Sgarro

Publication date 1985

Published in Advances in cryptology. Proceedings of CRYPTO '84 (a workshop on the theory and application of cryptographic techniques held at the University of California, Santa Barbara, August 19--22, 1984) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-39757-4_6

zbMATH Keywords

cryptographykey spacesubstitution cipherconditional entropies

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60)

Recommendations

• Bounds on Key Appearance Equivocation for Substitution Ciphers
• scientific article; zbMATH DE number 3893083
• Error probabilities for simple substitution ciphers
• Efficient homophonic coding
• Properties of two Shannon's ciphers

Cited in

(7)

• The Zodiac killer ciphers
• An Upper Bound on the Key Equivocation for Pure Ciphers
• scientific article; zbMATH DE number 3956968 (Why is no real title available?)
• Equivocations for transposition ciphers
• Dial C for Cipher
• Attacking Letter Substitution Ciphers with Integer Programming
• Bounds on Key Appearance Equivocation for Substitution Ciphers

This page was built for publication: Equivocations for Homophonic Ciphers

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