One-Time Pad algorithm
It is the improvement of the Vernam Cipher , proposed by An Army Signal Corp officer, Joseph Mauborgne. It is the only available algorithm that is unbreakable(completely secure). The two requirements for the One-Time pad are The key should be randomly generated as long as the size of the message . The key is to be used to encrypt and decrypt a single message , and then it is discarded . So to encrypt every new message requires a new key of the same length as the new message in one-time pad. The ciphertext generated by the One-Time pad is random, so it does not have any statistical relation with the plain text. Let’s understand it by an example. Suppose that we are using a Vigenère scheme with 27 characters in which the twenty-seventh character is the space character, but with a one-time key that is as long as the message. Consider the ciphertext as given below ANKYODKYUREPFJBYOJDSPLREYIUNOFDOIUERFPLUYTS We now show two different decryptions using two different k...