Unbreakable Cipher
Unbreakable Cipher
Unbreakable Cipher
1
Introduction
Unbreakable cipher are claims made
by cryptographers of cryptographic
algorithms they have designed.
Most algorithms that have been created
are breakable cipher.
2
Does an unbreakable cipher really exist?
Answer: yes
4
One-time pad (pad = a notebook paper)
contains a row of randomly generated key
characters.
5
6
The message recipient has the same (copy)
of the pad.
7
OTP key length = plaintext length, so there is no
need to repeat the use of keys during the
encryption process.
8
Example 1:
plaintext: ONETIMEPAD
key: TBFRGFARFM
Suppose A = 0, B = 1, …, Z = 25.
ciphertext: HOJKOREGHP
9
This OTP system cannot be solved
because:
1. A row of random keys + no random
plaintext = all random ciphertext.
10
Example: Suppose a cryptanalyst tries a key:
LMCCAWAAZD
Cryptanalyst: ???????
11
Weakness of OTP
Although OTP is a perfectly safe algorithm, it is
not widely used in practice.
Motivos:
1. Inefficient, because the key length =
message length.
Problems that arise: - key storage
- key distribution
12
2. Because the key is generated randomly,
it makes 'impossible' that the sender
and the receiver generate that same
key simultaneously.
13
OTP can only be used if a second
communication channel is available that is
safe enough to send the key.
14
As a practical person, I've observed that
one-time pads are theoretically
unbreakable, but practically very weak.
By contrast, conventional ciphers are
theoretically breakable, but practically
strong." - Steve Bellovin
15