PDF download Download Article PDF download Download Article

The Vigenère cipher is a method of encryption that uses a series of different "Caesar ciphers" based on the letters of a keyword. In a Caesar cipher, each letter in the passage is moved a certain number of letters over, to be replaced by the corresponding letter. For example, this would mean that in a Caesar cipher shift of three: A would become D; B would become E; C would become F etc. A Vigenère cipher builds on this method by using multiple Caesar ciphers at different points in the message; this article shows you how to use it. [1]

Sample Cipher and Messages

Method 1
Method 1 of 2:

Enciphering

PDF download Download Article
  1. [2]
  2. For this example we will use:
    LIME
    Advertisement
  3. For this example, we will use:
    WIKIHOWISTHEBEST
    [3]
  4. Do this until you run out of message:
    WIKIHOWISTHEBEST
    LIMELIMELIMELIME
    [4]
  5. In the example used for this article, the word
    LIME
    fits perfectly but when the keyword is not a perfect fit, there is no need to use the full word. For example:
    WIKIHOWISTHEBESTOFTHEBEST
    LIMELIMELIMELIMELIMELIMEL
  6. Go to the row of the first letter of the keyword in the Vigenère Square and go to the column of the first letter of the actual message and find the intersection point of the row and column. That's your cipher letter. [5]
  7. Using the sample Vigenère square given above, the first ciphertext letter is an H coming from row L and column W. So the ciphertext is:
    HQWMSWIMDBTIMMEX
  8. Advertisement
Method 2
Method 2 of 2:

Deciphering

PDF download Download Article
  1. [6]
  2. Look along it to find the first letter of the ciphered text in that row. Follow the column up to find the first letter of the encoded phrase at the top of the chart. [7]
  3. Advertisement

Community Q&A

Search
Add New Question
  • Question
    What kind of secret texting uses double letters, capital and lowercase?
    MePedro
    Community Answer
    Playfair uses pairs of capital letters. If you want to have lower case letters too, the alphabet of the classic ciphers could be enhanced. All modern ciphers support all kind of characters.
  • Question
    How does W and L equal L? I didn't get that as my answer.
    Community Answer
    It's not W + L = L, but L + L = W. You take the written L, check with your keyword letter written under (L), and on your board you will find W.
  • Question
    Can Vignere be used in combination with other ciphers (e.g. at-bash or a1z26)?
    Community Answer
    Yes, for instance: (your message), and if that was z gfxr cvd (not real message) you could just go: z=a, g=t, and so on.
See more answers
Ask a Question
      Advertisement

      Video

      Tips

      • Double check to make sure you encipher correctly. An erroneously enciphered text can be impossible to interpret correctly, and it is difficult to recognize a mistake without a double-check.
      • If you use a larger Vigènere square which includes both punctuation and spacing, the cipher becomes more difficult to break. This is especially so when the "keyword" or "key phrase" is as long or longer than the message. Then you are coming close to a so-called one-time pad.
      • You can automate this with appropriate software for visual programming and check whether you did it correctly.
      Show More Tips
      Submit a Tip
      All tip submissions are carefully reviewed before being published
      Name
      Please provide your name and last initial
      Thanks for submitting a tip for review!
      Advertisement

      Warnings

      • This cipher is not fool-proof (no cipher is) and can be quickly cracked. By current standards, the Vigenère cipher is extremely weak. Do not use this for anything truly top-secret. For stronger encryption research AES and RSA . This cipher can, however, be used with a one-time pad as a key (a truly random sequence with the same length as the text that is only used once) to produce a ciphertext that, as long as the key is secure, cannot be cracked faster than just doing a brute-force attack.
      Advertisement

      About This Article

      Thanks to all authors for creating a page that has been read 404,462 times.

      Did this article help you?

      Advertisement