Vigenère Cipher in Java
01:48 - Input Message and Key
02:38 - Mapping Key to Message
06:02 - Creating Vigenere Table
08:37 - Encryption
10:26 - Decryption
12:00 - key row to letter head of column
14:26 - Testing the working of cipher
-*- Support on Patreon: / voxelpixel
-*- Source Code: https://github.com/VoxelPixel
Hi!! In this video I'll be coding vigenère cipher encryption and decryption using Java
Vigenère Cipher is a form of polyalphabetic subsitution, its algorithm is as following:
Take plaintext and a key
repeat key till its total length is equal to plaintext.
create a 26x26 table containing letters of alphabets, from second row, each row's letters r shifted to left by one position
-Encryption-
To encrypt, take a letter in plaintext along with its corresponding letter in key
use plaintext letter as column index and key's letter as row of vigenère table
row-column intersection's value is the ciphertext letter
-Decryption-
To decrypt, take a letter in ciphertext along with its corresponding letter in key
use key's letter as row index and letter heading of column which contains cipher letter is the required plain text