Cryptography: Theory and Practice by Douglas Stinson CRC Press, CRC Press LLC ISBN: 0849385210 Pub Date: 03/17/95 |
Previous | Table of Contents | Next |
Example 1.8
Suppose the key is K = 8, and the plaintext is
rendezvous.
We first convert the plaintext to a sequence of integers:
17 | 4 | 13 | 3 | 4 | 25 | 21 | 14 | 20 | 18 |
The keystream is as follows:
8 | 17 | 4 | 13 | 3 | 4 | 25 | 21 | 14 | 20 |
Now we add corresponding elements, reducing modulo 26:
25 | 21 | 17 | 16 | 7 | 3 | 20 | 9 | 8 | 12 |
In alphabetic form, the ciphertext is:
ZVRQHDUJIM.
Now lets look at how Alice decrypts the ciphertext. She will first convert the alphabetic string to the numeric string
25 | 21 | 17 | 16 | 7 | 3 | 20 | 9 | 8 | 12 |
Then she can compute
Next,
and so on. Each time she obtains another plaintext character, she also uses it as the next keystream element.
Of course, the Autokey Cipher is insecure since there are only 26 possible keys.
In the next section, we discuss methods that can be used to cryptanalyze the various cryptosystems we have presented.
In this section, we discuss some techniques of cryptanalysis. The general assumption that is usually made is that the opponent, Oscar, knows the cryptosystem being used. This is usually referred to as Kerckhoffs principle. Of course, if Oscar does not know the cryptosystem being used, that will make his task more difficult. But we do not want to base the security of a cryptosystem on the (possibly shaky) premise that Oscar does not know what system is being employed. Hence, our goal in designing a cryptosystem will be to obtain security under Kerckhoffs principle.
First, we want to differentiate between different levels of attacks on cryptosystems. The most common types are enumerated as follows.
In each case, the object is to determine the key that was used. We note that a chosen ciphertext attack is relevant to public-key cryptosystems, which we discuss in the later chapters.
We first consider the weakest type of attack, namely a ciphertext-only attack. We also assume that the plaintext string is ordinary English text, without punctuation or spaces. (This makes cryptanalysis more difficult than if punctuation and spaces were encrypted.)
Many techniques of cryptanalysis use statistical properties of the English language. Various people have estimated the relative frequencies of the 26 letters by compiling statistics from numerous novels, magazines, and newspapers. The estimates in Table 1.1 were obtained by Beker and Piper.
On the basis of the above probabilities, Beker and Piper partition the 26 letters into five groups as follows:
It may also be useful to consider sequences of two or three consecutive letters called digrams and trigrams, respectively. The 30 most common digrams are (in decreasing order) TH, HE, IN, ER, AN, RE, ED, ON, ES, ST, EN, AT, TO, NT, HA, ND, OU, EA, NG, AS, OR, TI, IS, ET, IT, AR, TE, SE, HI, and OF. The twelve most common trigrams are (in decreasing order) THE ING, AND, HER, ERE, ENT, THA, NTH, WAS, ETH, FOR, and DTH.
letter | probability | letter | probability |
---|---|---|---|
A | .082 | N | .067 |
B | .015 | O | .075 |
C | .028 | P | .019 |
D | .043 | Q | .001 |
E | .127 | R | .060 |
F | .022 | S | .063 |
G | .020 | T | .091 |
H | .061 | U | .028 |
I | .070 | V | .010 |
J | .002 | W | .023 |
K | .008 | X | .001 |
L | .040 | Y | .020 |
M | .024 | Z | .001 |
Previous | Table of Contents | Next |
Copyright © CRC Press LLC