Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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
Identifiers
URN: urn:nbn:se:liu:diva-132020DOI: 10.1109/TIT.1979.1055986OAI: oai:DiVA.org:liu-132020DiVA: diva2:1037264
Conference
The IEEE Transactions on Information Theory, January 1979
Note

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: 2017-11-29Bibliographically approved

Open Access in DiVA