The Vigenère cipher extends the Caesar cipher by using a repeating keyword instead of a single shift. Each letter in the message is shifted by the position of the corresponding keyword letter (A=0, B=1...Z=25). For centuries it was considered unbreakable — it was cracked in the 1860s by Kasiski and Babbage using coincidence counting and key-period analysis. It is still studied as the foundation of polyalphabetic substitution ciphers.
The Kasiski test finds repeated ciphertext segments (which indicate the same plaintext encrypted with the same key segment), measures the distances between repetitions, and uses GCD to estimate the key length. Once the key length is known, the cipher reduces to n parallel Caesar ciphers — each broken by frequency analysis. The Index of Coincidence is another tool that distinguishes monoalphabetic from polyalphabetic ciphers and estimates key length.
Each plaintext letter is shifted by the value of the corresponding key letter (A=0 shift, B=1 shift, ..., Z=25 shift). Key "KEY": K=10, E=4, Y=24. Plaintext "HELLO" → H+10=R, E+4=I, L+24=J, L+10=V, O+4=S → "RIJVS".
No — it was broken in the 19th century. With a short keyword, even a few hundred characters of ciphertext can be broken with statistical analysis. It has no modern security applications.
A 26×26 grid where rows are shifts of the alphabet. Row A is the unshifted alphabet; row B is shifted 1; etc. To encrypt a letter with a key letter, find the column (plaintext) and row (key) and read the intersection.
A one-time pad is a Vigenère cipher where the key is as long as the message, used only once, and completely random. This is provably unbreakable (Shannon, 1949). The Vigenère cipher's weakness is its short, repeating key — fix both problems and you get the OTP.
See also the Caesar Cipher, AES Cipher, and the XOR Encryptor.