Scribd
Upload
191 views22 pages

One Time Pad/ Vernam Cipher: Attacks Impossible For Sufficiently Long PT Msgs

The document discusses various cipher techniques including the one-time pad, rotor cipher, transposition ciphers, stream ciphers, and block ciphers. The one-time pad provides perfect secrecy if the key is truly random and as long as the plaintext. Transposition ciphers rearrange symbols but do not change frequency analysis vulnerabilities. Stream ciphers encrypt symbols individually while block ciphers operate on blocks of symbols. Combining stream and block ciphers uses a key stream to encrypt individual blocks.

Uploaded by

Sujal Bhatt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
191 views22 pages

One Time Pad/ Vernam Cipher: Attacks Impossible For Sufficiently Long PT Msgs

The document discusses various cipher techniques including the one-time pad, rotor cipher, transposition ciphers, stream ciphers, and block ciphers. The one-time pad provides perfect secrecy if the key is truly random and as long as the plaintext. Transposition ciphers rearrange symbols but do not change frequency analysis vulnerabilities. Stream ciphers encrypt symbols individually while block ciphers operate on blocks of symbols. Combining stream and block ciphers uses a key stream to encrypt individual blocks.

Uploaded by

Sujal Bhatt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

ONE TIME PAD/ VERNAM CIPHER

Is perfect secrecy possible? If each PT symbol encrypted with a randomly chosen key (Shannon) This idea used by Vernam to create One time pad Key has same length as the PT and key chosen randomly Known as Perfect Cipher

Attacks impossible for sufficiently long PT msgs

ONE TIME PAD/ VERNAM CIPHER

Generally not usable in practice

Key is random & as long as the PT msg

Can be used to store some secret data in a public computer Scenario: President of a country needs to send a secret msg to president of another country

Send a trusted envoy with the random key b4 sending the msg

ROTOR CIPHER

Basic idea: mono aphabetic substitution, but each time the (PT char to CT char) mapping is changed

ROTOR CIPHER

Initial position = Secret Key The first PT char is encrypted with the initial setting, the second with the setting after first rotation, and so on.. If the rotor is stationary then ?? Encrypt bee with the given key

TRANSPOSITION CIPHERS

Change location of the symbols in PT to get CT

An a at the first position of the PT may appear at the tenth position in CT

Does permutation of characters

Keyless transposition ciphers

RAIL FENCE CIPHER

Consider the PT msg Meet me at the park

CT msg = MEMATEAKETETHPR Cryptanalysis very easy => 2 rows only & no key

Keyless transposition ciphers

Another method

PT = row by row CT = col by col Easy if attacker

Cryptanalysis

knows number of cols.

Keyed transposition ciphers

Idea : divide PT chars into groups of predetermined size called 'blocks' and use a permutation key Eg:- Consider enemy attacks tonight Group chars into blocks of size 5 (an agreed-upon value by both Alice and Bob) Use a bogus char (say z) to fill the last block Result: z enemy attac kston ight

Keyed transposition ciphers

Permutation key
Encryption

3 1

1 2

4 3

5 4

2 5
Decryption

Cipher text

EEMYN TAACT TKONS HITZG

Combining keyed & keyless


Better scrambling Encryption & Decryption done in 3 steps


PT msg written into a table row by row Permutation done by reordering cols (based on key) The new table read col by col ( ==> CT msg )

Combining keyed & keyless

Combining keyed & keyless

Keys

Table is not necessary Eg: enc key : 3 1 4 5 2 & dec key: 2 5 1 3 4 Write index below Swap values with indices Sort values in ascending order of index Try for: 2 6 3 1 4 7 5

Finding Enc/Dec key from the other


Combining keyed & keyless

Key as a matrix

Combining keyed & keyless

Cryptanalysis

Trans. Ciphers don't change the frequency of chars But frequency of digrams & trigrams hidden Brute force attack extremely difficult

Double transposition cipher

Double transposition cipher

STREAM & BLOCK CIPHERS

Literature divides symmetric ciphers into two broad categories stream ciphers and block ciphers Stream cipher encryption and decryption done one symbol at a time Block ciphers enc and dec done on a bolck of symbos at a time

Stream Cipher

There is a plain text stream

P = P1P2P3. . . C = C1C2C3. . . K = (k1, k2, k3, . . . )

There is a cipher text stream

There is a key stream

Stream Cipher

Stream cipher

Examples

Additive cipher

K = (k, k, k, . . . ) K = mapping of the current PT char to CT char, . . . K = (k1, k2, . . . , km, k1, k2, . . .)

Monoalphabetic substitution cipher

Vigenere cipher

Block cipher

Block cipher

Examples

Play fair cipher (block size = 2) Hill cipher

Stream & Block Combined

Idea:

Blocks of PT encrypted individually Use a stream of keys to encrypt blocks (separate key for each block)

Cipher is a block cipher when looking at the individual blocks Cipher is a stream cipher when looking at the whole msg considering each block as a single unit

You might also like