For a plaintext alphabet of size and entropy rate in bits per symbol, put . In the random-cipher approximation, the unicity distance scale is
where is cryptographic key Shannon entropy. Uniform cryptographic keys on a finite set give . For correlated plaintext, its one-symbol Shannon entropy cannot replace the entropy rate without justification.[ref]
For example, a 40-bit uniform cryptographic key and redundancy two bits per symbol suggest about twenty symbols under this model. This estimate does not bound computation time or guarantee unique recovery for each ciphertext. At zero redundancy it supplies no finite threshold; a probability-preserving source symmetry can also invalidate the random-cipher uniqueness intuition.

Articles by others on the same topic (0)

There are currently no matching articles.