One Time Pad Cipher - Encryption
One Time Pad Cipher - Encryption
Encryption
GROUP THREE
Defination
Messages encrypted with keys based on randomness have the advantage that there is
theoretically no way to break the code by analyzing a succession of messages.
Each encryption is unique and bears no relation to the next encryption, making it
impossible to detect a pattern.
But with a one-time pad, the decrypting party must have access to the same key used to
encrypt the message; this raises the issue of how to get the key to the decrypting party
safely, or how to keep both keys secure.
One-time pad Cipher
One-time pads have been used when both parties started out at the same physical location
and then separated, each with knowledge of the keys in the one-time pad. The key used in
a one-time pad is called a secret key because if it is revealed, the messages encrypted with
it can be deciphered easily.
How does a one-time pad cipher work?
When a message is to be sent, the sender uses the secret key to encrypt each character one
at a time.
If a computer is used, each bit in the character -- which is usually eight bits in length -- is
exclusively OR'ed with the corresponding bit in the secret key. With a one-time pad, the
encryption algorithm is simply the XOR operation.
When there is some concern about how truly random the key is, it is sometimes combined
with another algorithm, such as MD5.
This kind of encryption can be considered 100% noise source used to mask the message,
and only the sender and receiver have the means to remove the noise.
Once the one-time pad is used, it cannot be reused. If it is reused, someone who intercepts
multiple messages can begin to compare them for similar coding for words that may occur
in several messages
Cont.…….
A simple example of how a one-time pad works is shown in the example below.
Here, we have a plaintext message of TEST.
We also have a random secret key of FVEB, which is the same length as the message sent.
Using the simple process of assigning a letter to a number, the plaintext message can be
translated to 19, 4, 18 and 19.
Using this same conversion method for the secret key, we get 5, 21, 4 and 1.
Adding the two together, we get 24, 25, 22 and 20; when converted back to alphabetic
letters, this gives us an encrypted message of YZWU. This message can then be decrypted
by reversing the steps.
How is one-time pad used?
Although a one-time pad is truly the only unbreakable encryption method, its use is
impractical for many modern applications because the system must meet the following
conditions:
The key must be the same size as the message being sent.
The key must be truly random.
Keys must never be reused.
Keys must be securely shared between the sending and receiving parties.