An Upper Bound on the Key Equivocation for Pure Ciphers

DOI10.1109/TIT.1984.1056843MaRDI QIDQ3313770zbMATH OpenOpenAlexWikidataFDO

Authors Rolf J. Blom

Publication date 1984

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

Full work available at URL https://doi.org/10.1109/tit.1984.1056843

zbMATH Keywords

key equivocationmemoryless sourcepure ciphers

Mathematics Subject Classification ID

Information theory (general) (94A15)

Recommendations

• Bounds on Key Appearance Equivocation for Substitution Ciphers
• scientific article; zbMATH DE number 1421004
• scientific article; zbMATH DE number 3963719
• Error probabilities for simple substitution ciphers
• Equivocations for Homophonic Ciphers

Cited in

(3)

• Lower bounds for key length of k-wise almost independent permutations and certain symmetric-key encryption schemes
• A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers
• Bounds on Key Appearance Equivocation for Substitution Ciphers

This page was built for publication: An Upper Bound on the Key Equivocation for Pure Ciphers

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