Editing Vigenère cipher (section)

==Variants==

===Running key===
The [[running key cipher|running key]] variant of the Vigenère cipher was also considered unbreakable at one time. For the key, this version uses a block of text as long as the plaintext. Since the key is as long as the message, the Friedman and Kasiski tests no longer work, as the key is not repeated.

If multiple keys are used, the effective key length is the [[least common multiple]] of the lengths of the individual keys.  For example, using the two keys <code>GO</code> and <code>CAT</code>, whose lengths are 2 and 3, one obtains an effective key length of 6 (the least common multiple of 2 and 3).  This can be understood as the point where both keys line up.

{|
| Plaintext: || <code>attackatdawn</code>
|-
| Key 1: || <code>GOGOGO'''GOGOGO'''</code>
|-
| Key 2: || <code>CATCAT'''CATCAT'''</code>
|-
| Ciphertext: || <code>IHSQIRIHCQCU</code>
|}

Encrypting twice, first with the key <code>GO</code> and then with the key <code>CAT</code> is the same as encrypting once with a key produced by encrypting one key with the other.

{|
| Plaintext: || <code>gogogo</code>
|-
| Key: || <code>CATCAT</code>
|-
| Ciphertext: || <code>IOZQGH</code>
|}

This is demonstrated by encrypting <code>attackatdawn</code> with <code>IOZQGH</code>, to produce the same ciphertext as in the original example.

{|
| Plaintext: || <code>attackatdawn</code>
|-
| Key: || <code>IOZQGHIOZQGH</code>
|-
| Ciphertext: || <code>IHSQIRIHCQCU</code>
|}

If key lengths are relatively prime, the effective key length is the product of the key lengths, and hence grows quickly as the individual key lengths are increased. For example, while the effective length of combined key lengths of 10, 12, and 15 characters is only 60 (2x2x3x5), that of key lengths of 8, 11, and 15 characters is 1320 (8x11x15).  If this effective key length is longer than the ciphertext, it achieves the same immunity to the Friedman and Kasiski tests as the running key variant.

If one uses a key that is truly random, is at least as long as the encrypted message, and is used only once, the Vigenère cipher is theoretically unbreakable.  However, in that case, the key, not the cipher, provides cryptographic strength, and such systems are properly referred to collectively as [[one-time pad]] systems, irrespective of the ciphers employed.

[[File:Confederate cipher wheel (Vigenere), captured at the surrender of Mobile, Alabama, in May 1865 - National Cryptologic Museum - DSC07710.JPG|thumb|left|Confederate cipher wheel, captured at the surrender of [[Mobile, Alabama]], in May 1865 – [[National Cryptologic Museum]]]]

===Variant Beaufort===

A simple variant is to encrypt by using the Vigenère decryption method and to decrypt by using Vigenère encryption. That method is sometimes referred to as "Variant Beaufort". It is different from the [[Beaufort cipher]], created by [[Francis Beaufort]], which is similar to Vigenère but uses a slightly modified enciphering mechanism and tableau. The Beaufort cipher is a [[reciprocal cipher]].

===Gronsfeld cipher===

Despite the Vigenère cipher's apparent strength, it never became widely used throughout Europe. The Gronsfeld cipher is a variant attributed by [[Gaspar Schott]] to Count Gronsfeld (Josse Maximilaan van [[Gronsveld]] né van Bronckhorst) but was actually used much earlier by an ambassador of Duke of Mantua in 1560s-1570s. It is identical to the Vigenère cipher except that it uses just a cipher alphabet of 10 characters, corresponding to the digits 0 to 9: a Gronsfeld key of 0123 is the same as a Vigenere key of ABCD. The Gronsfeld cipher is strengthened because its key is not a word, but it is weakened because it has just a cipher alphabet of 10 characters. It is Gronsfeld's cipher that became widely used throughout Germany and Europe, despite its weaknesses.

===Vigenèreʼs autokey cipher===

Vigenère actually invented a stronger cipher, an [[autokey cipher]]. The name "Vigenère cipher" became associated with a simpler polyalphabetic cipher instead. In fact, the two ciphers were often confused, and both were sometimes called ''le chiffre indéchiffrable''. Babbage actually broke the much-stronger autokey cipher, but Kasiski is generally credited with the first published solution to the fixed-key polyalphabetic ciphers.