Not exact matches
Of course, for most encrypted messages, there are way more than three
possible corresponding
plaintexts.
To get a sense of how the technique works, imagine an encryption scheme that takes only three
possible inputs, or
plaintexts — «A,» «B,» and «C» — and produces only three
possible outputs, or ciphertexts.
Even a
plaintext as simple as a nine - digit number has a billion
possible values, so the probabilities corresponding to an encoded Social Security number would describe a point in a billion - dimensional space.