3. OTP History
• First described by Frank Miller in 1882 the one-time pad was
re-invented in 1917 and patented a couple of years later. It is
July 28, 2012
derived from the Vernam cipher, named after Gilbert Vernam,
one of its inventors.
CRYPTO
• Used by spies of the former USSR (Russia) during the 1960s
• Used a stack of small very thin pages, each with a series
of random numbers on them. After use, a page would be
destroyed immediately
3
4. OTP-Working Mechanism
• The encryption-key has at least the same length as the
plaintext and consists of truely random numbers
July 28, 2012
• Each letter of the plaintext is 'mixed' with one element
from the OTP
• This results in a ciphertext that has no relation with the
CRYPTO
plaintext when the key is unknown. At the receiving end,
the same OTP is used to retrieve the original plaintext
4
5. OTP Rules
• The OTP should consist of truely random numbers
July 28, 2012
• Precisely two copies of the OTP should exist.
CRYPTO
• The OTP should only be used once.
• Both copies of the OTP are destroyed immediately after
use.
5
6. Why OTP is Unbreakable
• The key is atleast as long as the message
• The key is truly random (not auto-generated)
July 28, 2012
• Key and plain text calculated modulo 10/26/2
• Each key should only be used once & destroyed by
CRYPTO
sender and receiver
• There should only be 2 copies of the key (1 for sender
and 1 for receiver)
6
7. OTP Criticism
• Distribution of the key was a challenge
• Adding numbers to the plaintext manually, is a time-
July 28, 2012
consuming task. It is therefore sometimes thought that
OTPs are no longer considered practical
CRYPTO
• Counter: Improved computing power now
7
8. OTP Example
• Problem: Alice wishes to send the message "HELLO" to Bob
• ROE: Assume two pads of paper containing identical random
July 28, 2012
sequences of letters were somehow previously produced and
securely issued to both
• Additional Info:Alice chooses the appropriate unused page
CRYPTO
from the pad.
• How: The way to do this is normally arranged for in advance,
as for instance 'use the 12th sheet on 1 May', or 'use the next
available sheet for the next message'. The material on the
selected sheet is the key for this message. Each letter from the
pad will be combined in a predetermined way with one letter of
the message. It is common, but not required, to assign each
8
letter a numerical value: e.g. "A" is 0, "B" is 1, and so on.
9. OTP Example (Modulo26)
• Here, we combine the key and the message using
modular addition.
July 28, 2012
• The numerical values of corresponding message and key
CRYPTO
letters are added together, modulo 26.
• If key material begins with "XMCKL" and the message is
"HELLO", then the coding would be……..
9
11. OTP Encryption [contd.]
• If a number is larger than 25, then the remainder after
subtraction of 26 is taken in modular arithmetic fashion.
July 28, 2012
• This simply means that if your computations "go past" Z,
CRYPTO
you start again at A.
• The ciphertext to be sent to Bob is thus "EQNVZ". Bob
uses the matching key page and the same process, but
in reverse, to obtain the plaintext.
• Here the key is subtracted from the ciphertext, again
using modular arithmetic…… 11
12. OTP Decryption
July 28, 2012
CRYPTO
• NB: If a number is negative then 26 is added to make the
number positive 12
13. OTP Cryptanalysis
• Suppose Eve intercepts Alice's ciphertext: "EQNVZ".
July 28, 2012
• If Eve had infinite computing power, she would quickly
find that the key "XMCKL" would produce the plaintext
CRYPTO
"HELLO", but she would also find that the key "TQURI"
would produce the plaintext "LATER"
13
14. OTP Cryptanalysis [contd]
• It is possible to "decrypt" out of the ciphertext any
message whatsoever with the same number of
July 28, 2012
characters, simply by using a different key, and there is
no information in the ciphertext which will allow Eve to
choose among the various possible readings of the
CRYPTO
ciphertext
• Thus, OTP coined, the “Perfect Cipher”
14
15. Try This One:
• Message: COME
July 28, 2012
• Key: BABY
• References:
CRYPTO
http://www.cs.miami.edu/~burt/learning/Csc609.051/notes/02.html
http://www.cryptomuseum.com/crypto/otp.htm
http://practicalcryptography.com/ciphers/
http://en.wikipedia.org/wiki/One-time_pad 15