An extension of the Shannon theory approach to cryptography

DOI10.1109/TIT.1977.1055709MaRDI QIDQ4137085zbMATH OpenWikidataFDO

Authors Martin Edward Hellman

Publication date 1977

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(11)

• A new method to study genome mutations using the information entropy
• Comment on: ``Exposed-key weakness of \(\alpha \eta \) [Phys. Lett. A 370 (2007) 131]
• Some results on the information theoretic analysis of cryptosystems
• scientific article; zbMATH DE number 4004063 (Why is no real title available?)
• Shannon's random-cipher result and the generalized \(R\)-norm entropy of type \(\beta\)
• Searching secrets rationally
• The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key
• A generalization of Hellman's extension of Shannon's approach to cryptography
• Shannon's random-cipher result and the R-norm information
• Properties of two Shannon's ciphers
• The simulation of random processes on digital computers with Chebyshev mixing transformations

This page was built for publication: An extension of the Shannon theory approach to cryptography

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