Search: onr:"swepub:oai:DiVA.org:liu-132020" >
Bounds on key equiv...
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database