Some Results on the Information Theoretic Analysis of Cryptosystems

DOI10.1007/978-1-4684-4730-9_24zbMath1487.94124OpenAlexW1556592207MaRDI QIDQ5019340

Helmut Jürgensen, David E. Matthews

Publication date: 8 January 2022

Published in: Advances in Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4684-4730-9_24

zbMATH Keywords

Chebyshev inequalityMarkov sourcecipher systemunicity distancesecrecy system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Measures of information, entropy (94A17)

Cites Work

• Statistical Methods in Markov Chains
• DES-like functions can generate the alternating group
• Communication Theory of Secrecy Systems*
• An extension of the Shannon theory approach to cryptography
• Sounds on key equivocation for simple substitution ciphers
• The existence of good cryptosystems for key rates greater than the message redundancy (Corresp.)
• LANGUAGE REDUNDANCY AND THE UNICITY POINT
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Results on the Information Theoretic Analysis of Cryptosystems