|
Cryptology
Cryptanalysis of Monoalphabetic Substitution (Approaches) |
a7Hzq .#5r< kÜ\as TâÆK$ ûj(Ö2 ñw%h:
Úk{4R f~`z8 ¤˜Æ+Ô „&¢Dø |
|
The cryptanalysis of monoalphabetic substitution starts with its
invariants—properties of a text that remain unchanged under a monoalphabetic substitution:
- The distribution of frequencies of single characters is invariant.
- That is a letter in the ciphertext occurs exactly as many times as the
corresponding letter in the plaintext.
- The same is true for bigrams (= pairs of letters), trigrams, etc.
- Repeated patterns in the plaintext show up also in the ciphertext.
Both of these invariant properties suggest cryptanalytic approaches:
- Statistical analysis,
- Pattern recognition (for example matching with the words of a dictionary).
Often the cryptanalyst combines both of these approaches, and supplements them with systematic guesses:
- Cryptography is mathematics,
- Cryptanalysis is struggling using all available aids,
mathematical support being one of the most important ones.
|
Only in rare situations cryptanalysis is completely algorithmic. But no matter which
method applies and how clean its theoretical basis is, the successful solution legitimates
the cryptanalyst.
Author: Klaus Pommerening, 1999-Oct-18;
last change: 2014-Feb-06.