Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Vigenere Cipher Algorithm

Cryptographic Algorithm

The Vigenere cipher is a polyalphabetic encryption algorithm that enciphers a message using a whole sequence of different Caesar cipher shifts rather than just one, with each letter of a repeating keyword setting the shift applied to the corresponding letter of the message. Despite carrying his name, the cipher was not invented by Blaise de Vigenere, who in 1586 actually described a different and stronger autokey cipher; the polyalphabetic method now known by his name was really devised by Giovan Battista Bellaso in 1553, and the two techniques were mixed up in later centuries. For roughly three hundred years the cipher was called le chiffre indechiffrable, the indecipherable cipher, and it genuinely resisted every attempt to break it until 1863, when Friedrich Kasiski published a general method of attack that exploited the repeating pattern created by a short keyword reused across a long message, finally ending its reputation for unbreakable security.

Facts
Time Complexity
Time Complexity (category)
Linear Time -- O(n) 1
Connections

In Field

Cryptography, Fields
Source Vigenère cipher (Wikipedia)
Sources
1. Vigenere Cipher Algorithm (Wikipedia)
Wikipedia infobox: time complexity linear
Quote, Wikipedia infobox: time complexity linear
linear
View the Source
Vigenère cipher (Wikipedia)
  • In Group: Classical Cipher, Lead section
    is a method of encrypting alphabetic text
  • In Field: Cryptography, Lead
    The Vigenère cipher (French pronunciation: [viʒnɛːʁ]) is a method of encrypting alphabetic text where each letter of the plaintext is encoded with a different Caesar cipher, whose increment is determined by the corresponding letter of another text, the key.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.