Скачать книгу

0 1 2 5 0 0 1 1 N O P Q R S T U V W X Y Z 0 0 1 0 3 3 0 0 1 1 3 0 2

      From this table, we deduce that since “e” likely enciphers to “I,” our fourth and final key letter is “E.”

      Putting all of this together, we have determined that the period n is Four, and the corresponding keyword is the word “code.” This gives the message, “The Vigenère cipher was created in the sixteenth century and was considered by everyone to be unbreakable until the twentieth century.”

      The method used above, though simple to use, is very effective in determining the keyword of a given cipher text passage. The reader should be aware that there may be times where it may take some more work to pin the keyword down, due to multiple period choices and ambiguities that may occur in the frequencies of cipher text letters.

      Remark

      During World War II, German troops were able to march unopposed through much of Eastern Europe. At the heart of this war machine was an encryption scheme that allowed commanders to transfer crucial planning data with near total secrecy. Before the invasion of Poland, three Polish cryptologists by the names of Marian Rejewski, Henry Zygalski, and Jerzy Róźycki were able to crack the majority of the Enigma code used by the German army. Fearing capture during the German invasion, they escaped to France, bringing with them vital secrets about the Enigma machine.

Photographs of the German Enigma machine. (a) the Enigma machine type-K, (b) the German Enigma machine display at the Naval Museum of Alberta, Canada, (c) the caption on the display at the Naval Museum of Alberta, Canada, (d) the Enigma machine type-K, power supply, and additional lamp panel.

      Source: Used with permission of the Naval Museum of Alberta, Canada.

Schematic illustration of a block diagram of the Enigma machine.

      It is worth noting some of the deficiencies in the machine design, as they made it possible for Allied cryptanalysts to eventually break the cipher. There is a very nice YouTube video, “Flaw in the Enigma Code ‐ Numberphile,” [Gri13], that talks about flaws in the Enigma machine. They note that a given letter of the alphabet might be mapped to any other letter, i.e. a letter is never encoded as itself. The number of permutations of n objects is n factorial, but if we insist that no object is mapped to itself, then the number of such permutations, i.e. the number of derangements of n objects, is reduced to approximately StartFraction n factorial Over e EndFraction, (where Скачать книгу