Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Unicity distance
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Relation with key entropy and plaintext redundancy== The unicity distance can equivalently be defined as the minimum amount of ciphertext required to permit a computationally unlimited adversary to recover the unique encryption key.<ref name=hac /> The expected unicity distance can then be shown to be:<ref name=hac /> : <math>U = H(k) / D</math> where ''U'' is the unicity distance, ''H''(''k'') is the entropy of the key space (e.g. 128 for 2<sup>128</sup> equiprobable keys, rather less if the key is a memorized pass-phrase). ''D'' is defined as the plaintext redundancy in bits per character. Now an alphabet of 32 characters can carry 5 bits of information per character (as 32 = 2<sup>5</sup>). In general the number of bits of information per character is {{math|log<sub>2</sub>(N)}}, where ''N'' is the number of characters in the alphabet and {{math|log<sub>2</sub>}} is the [[binary logarithm]]. So for English each character can convey {{math|log<sub>2</sub>(26) {{=}} 4.7}} bits of information. However the average amount of actual information carried per character in meaningful English text is only about 1.5 bits per character. So the plain text redundancy is ''D'' = 4.7 − 1.5 = 3.2.<ref name=hac /> Basically the bigger the unicity distance the better. For a one time pad of unlimited size, given the unbounded entropy of the key space, we have <math>U = \infty</math>, which is consistent with the [[one-time pad]] being unbreakable. === Unicity distance of substitution cipher === For a simple [[substitution cipher]], the number of possible keys is {{math|26! {{=}} 4.0329 Γ 10<sup>26</sup> {{=}} 2<sup>88.4</sup>}}, the number of ways in which the alphabet can be permuted. Assuming all keys are equally likely, {{math|''H''(''k'') {{=}} log<sub>2</sub>(26!) {{=}} 88.4}} bits. For English text {{math|''D'' {{=}} 3.2}}, thus {{math|''U'' {{=}} 88.4/3.2 {{=}} 28}}. So given 28 characters of ciphertext it should be theoretically possible to work out an English plaintext and hence the key.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)