Computer Science – Information Theory
Scientific paper
2006-12-12
Computer Science
Information Theory
3 pages, typos corrected, submitted to IEEE Transactions on Information Theory
Scientific paper
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.
Borissov Yuri
Lee Moon Ho
No associations
LandOfFree
Bounds on Key Appearance Equivocation for Substitution Ciphers has received 1 rating(s) and 0 review(s), resulting in an average rating of 3.85 on a scale from 1 to 5. The overall rating for this scientific paper is very good.
If you have personal experience with Bounds on Key Appearance Equivocation for Substitution Ciphers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on Key Appearance Equivocation for Substitution Ciphers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-117615