Change search
ReferencesLink to record
Permanent link

Direct link
Bounds on key equivocation for simple substitution ciphers
Linköping University, Department of Electrical Engineering. Linköping University, The Institute of Technology.
1979 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 25, no 1, 8-18 p.Article in journal (Refereed) Published
Abstract [en]

The equivocation of the key for a simple substitution cipher is upper and lower hounded, when the message source is memoryless. The hounds are shown to be exponentially tight. The results are compared with random ciphering. It is observed that the exponential behavior of the equivocation of the key is not determined by the redundancy in the message source, but by the symbol probabilities which are closest in a certain sense.

Place, publisher, year, edition, pages
IEEE , 1979. Vol. 25, no 1, 8-18 p.
National Category
Computer and Information Science Mathematics
URN: urn:nbn:se:liu:diva-132020DOI: 10.1109/TIT.1979.1055986OAI: diva2:1037264
The IEEE Transactions on Information Theory, January 1979

The title is incorrect in the IEEE version. The first word is Bounds, not Sounds.

Available from: 2016-10-14 Created: 2016-10-14 Last updated: 2016-10-14Bibliographically approved

Open Access in DiVA

Bounds on key equivocation for simple substitution ciphers(2273 kB)8 downloads
File information
File name FULLTEXT02.pdfFile size 2273 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Blom, Rolf
By organisation
Department of Electrical EngineeringThe Institute of Technology
In the same journal
IEEE Transactions on Information Theory
Computer and Information ScienceMathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 8 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

ReferencesLink to record
Permanent link

Direct link