Bounds on Key Appearance Equivocation for Substitution Ciphers

DOI10.1109/TIT.2007.896865MaRDI QIDQ3548832zbMATH OpenWikidataFDO

Authors

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0612064

Mathematics Subject Classification ID

Cryptography (94A60)

Abstract: The average conditional entropy of the key given the message and its corresponding cryptogram, H(K|M,C), which is reffer as a key appearance equivocation, was proposed as a theoretical measure of the strength of the cipher system under a known-plaintext attack by Dunham in 1980. In the same work (among other things), lower and upper bounds for H(S}_{M}|M^L,C^L) are found and its asymptotic behaviour as a function of cryptogram length L is described for simple substitution ciphers i.e. when the key space S_{M} is the symmetric group acting on a discrete alphabet M. In the present paper we consider the same problem when the key space is an arbitrary subgroup K of S_{M} and generalize Dunham's result.

Recommendations

• Equivocations for Homophonic Ciphers
• scientific article; zbMATH DE number 3893083
• An Upper Bound on the Key Equivocation for Pure Ciphers
• Error probabilities for simple substitution ciphers
• Equivocations for transposition ciphers

Cited in

(6)

• An Upper Bound on the Key Equivocation for Pure Ciphers
• Equivocations for transposition ciphers
• Equivocations for Homophonic Ciphers
• scientific article; zbMATH DE number 4168393 (Why is no real title available?)
• scientific article; zbMATH DE number 3963719 (Why is no real title available?)
• Error probabilities for simple substitution ciphers

This page was built for publication: Bounds on Key Appearance Equivocation for Substitution Ciphers

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