An extension of the Shannon theory approach to cryptography

DOI10.1109/TIT.1977.1055709zbMATH Open0362.94030WikidataQ27940968 ScholiaQ27940968MaRDI QIDQ4137085FDOQ4137085

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)

• Shannon's random-cipher result and the generalized \(R\)-norm entropy of type \(\beta\)
• Shannon's random-cipher result and the R-norm information
• A generalization of Hellman's extension of Shannon's approach to cryptography
• Properties of two Shannon's ciphers
• Searching secrets rationally
• A new method to study genome mutations using the information entropy
• The simulation of random processes on digital computers with Chebyshev mixing transformations
• Comment on: ``Exposed-key weakness of \(\alpha \eta \) [Phys. Lett. A 370 (2007) 131]
• The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key
• Title not available (Why is that?)
• Some Results on the Information Theoretic Analysis of Cryptosystems

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)