Bounds on key equivocation for simple substitution ciphers
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
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.
Computer and Information Science Mathematics
IdentifiersURN: urn:nbn:se:liu:diva-132020DOI: 10.1109/TIT.1979.1055986OAI: oai:DiVA.org:liu-132020DiVA: 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.2016-10-142016-10-142016-10-14Bibliographically approved