Kasiski Examination - A String Based Attack

A String Based Attack

The difficulty of using the Kasiski examination lies in finding repeated strings. This is a very hard task to perform manually, but computers can make it much easier. However, care is still required, since some repeated strings may just be coincidence, so that some of the repeat distances are misleading. The cryptanalyst has to rule out the coincidences to find the correct length. Then, of course, the monoalphabetic ciphertexts that result must be cryptanalyzed.

  1. A cryptanalyst looks for repeated groups of letters and counts the number of letters between the beginning of each repeated group. For instance if the ciphertext was FGXTHJAQWNFGXQ, the distance between FGX's is 10. The analyst records the distances for all repeated groups in the text.
  2. The analyst next factors each of these numbers. If any number is repeated in the majority of these factorings, it is likely to be the length of the keyword. This is because repeated groups are more likely to occur when the same letters are encrypted using the same key letters than by mere coincidence; this is especially true for long matching strings. The key letters are repeated at multiples of the key length, so most of the distances found in step 1 are likely to be multiples of the key length. A common factor is usually evident.
  3. Once the keyword length is known, the following observation of Babbage and Kasiski comes into play. If the keyword is N letters long, then every Nth letter must have been enciphered using the same letter of the keytext. Grouping every Nth letter together, the analyst has N "messages", each encrypted using a one-alphabet substitution, and each piece can then be attacked using frequency analysis.
  4. Using the solved message, the analyst can quickly determine what the keyword was. Or, in the process of solving the pieces, the analyst might use guesses about the keyword to assist in breaking the message.
  5. Once the interceptor knows the keyword, that knowledge can be used to read other messages that use the same key.

Read more about this topic:  Kasiski Examination

Famous quotes containing the words string, based and/or attack:

    Supposing everyone lived at one time what would they say. They would observe that stringing string beans is universal.
    Gertrude Stein (1874–1946)

    Foster the labor of our country by an undeviating metallic currency ... always recollecting that if labor is depressed neither commerce nor manufactures can flourish, as they are both based upon the production of labor, produced from the earth, or the mineral world.
    Andrew Jackson (1767–1845)

    I’ve seen things you people wouldn’t believe. Attack ships on fire off the shoulder of Orion. I watched seabeams glitter in the dark near the Tennhauser Gate. All those moments will be lost in time like tears in rain. Time to die.
    David Webb Peoples, U.S. screenwriter, and Ridley Scott. Roy Batty, Blade Runner, final words before dying—as an android he had a built-in life span that expired (1982)