第七章-传统加密技术演示幻灯片.pptVIP

For some centuries the Vigenère cipher was le chiffre indéchiffrable (the unbreakable cipher). As a result of a challenge, it was broken by Charles Babbage (the inventor of the computer) in 1854 but kept secret (possibly because of the Crimean War - not the first time governments have kept advances to themselves!). The method was independently reinvented by a Prussian, Friedrich Kasiski, who published the attack now named after him in 1863. However lack of major advances meant that various polyalphabetic substitution ciphers were used into the 20C. One very famous incident was the breaking of the Zimmermann telegram in WW1 which resulted in the USA entering the war. In general the approach is to find a number of duplicated sequences, collect all their distances apart, look for common factors, remembering that some will be random flukes and need to be discarded. Now have a series of monoalphabetic ciphers, each with original language letter frequency characteristics. Can attack these in turn to break the cipher. * The One-Time Pad is an evolution of the Vernham cipher, which was invented by Gilbert Vernham in 1918, and used a long tape of random letters to encrypt the message. An Army Signal Corp officer, Joseph Mauborgne, proposed an improvement using a random key that was truly as long as the message, with no repetitions, which thus totally obscures the original message. Since any plaintext can be mapped to any ciphertext given some key, there is simply no way to determine which plaintext corresponds to a specific instance of ciphertext. Security of Vigenère Ciphers have multiple ciphertext letters for each plaintext letter 每个明文字母对应多个密文字母 hence letter frequencies are obscured but not totally lost Distinguish attack区分单表还是Vigenère的步骤 see if look monoalphabetic or not start with letter frequencies 是否满足语言的统计特性 if not, then need to determine number of alphabets, since then can attach each 密钥词的长度 Kasiski Method method developed by Babbage(1854); Kasiski(1863) repetit