Scribd
Upload
43 views

Lecture 3 - Transposition Ciphers

Transposition ciphers encrypt plaintext by rearranging the position of its characters. Techniques discussed include rail fence cipher, simple columnar transposition, columnar transposition with multiple rounds, Vernam cipher, book cipher, and block/stream ciphers. Product ciphers combine substitution and transposition ciphers over multiple rounds for greater security. Steganography hides messages within other files like images by modifying least significant bits of pixels.

Uploaded by

26 Shrikant Bhatade
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
43 views

Lecture 3 - Transposition Ciphers

Transposition ciphers encrypt plaintext by rearranging the position of its characters. Techniques discussed include rail fence cipher, simple columnar transposition, columnar transposition with multiple rounds, Vernam cipher, book cipher, and block/stream ciphers. Product ciphers combine substitution and transposition ciphers over multiple rounds for greater security. Steganography hides messages within other files like images by modifying least significant bits of pixels.

Uploaded by

26 Shrikant Bhatade
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

Sanjivani Rural Education Society’s

Sanjivani College of Engineering, Kopargaon-423 603


(An Autonomous Institute, Affiliated to Savitribai Phule Pune University, Pune)
NACC ‘A’ Grade Accredited, ISO 9001:2015 Certified

Department of Computer Engineering


(NBA Accredited)

Lecture-03 Transposition Ciphers


Transposition Ciphers

• Transposition technique is a cryptographic technique that


converts the plain text to cipher text by performing permutations
on the plain text i.e. change the position of each character of
plain text for each round.
It includes various techniques like-
• Rail Fence technique
• Simple columnar transposition technique
• Simple columnar transposition technique with multiple rounds
• Vernam cipher
• Book Cipher

DEPARTMENT OF COMPUTER ENGINEERING, Sanjivani COE, Kopargaon 2


1.Rail Fence Technique
1. Write down the plain text message as a sequence of
diagonals(i.e: zigzag sequence).
2. Read the text row-by-row, & write it sequentially.
✓ Original plain text message: Come home tomorrow

✓ we have the cipher text as: Cmhmtmrooeoeoorw


✓ Simple too break
Simple Columnar Transposition Technique

 It simply arranges the plain text as a sequence of rows of


a rectangle that are read in columns randomly.
1. Write the plain text message row-by-row in a rectangle of
a pre-defined size.
2. Read the message column-by-column. However, it need
not be in the order of columns 1,2, 3 etc. It can be any
random order such as 2, 3, 1, etc.
3. The message thus obtained is the cipher text message.
 Trying out a few permutations and combinations of
column orders quite simple to break into.
✓ Original plain text message: Come home tomorrow
1. Let us consider a rectangle with six columns. Therefore,
when we write the message in the rectangle row-by-
row(suppressing spaces), it would look as follows

1. Now, let us decide the order of columns as some random


order, say 4, 6, 1, 2, 5, 3. Then read the text in the order
of these columns.
2. we have the cipher text as: eowoocmroerhmmto.
Simple columnar transposition technique with
multiple rounds

 To add more complexity & twist using no. of iterations.


 Only one additional step is added is given below
 Repeat step 1 to 3 as many times as desired.
Vernam Cipher
 In 1920’s was first implemented at AT&T with the help
of a device called as the Vernam Machine.
 once an input cipher text for transposition is used,
it is never used again for any other message (hence
the name one-time pad).
 Random set of non-repeating characters as the input
cipher text key.
 Same length as message
 XORed with message
 Theoretically unbreakable
 Attacker can do no better than guessing
 Ciphertext gives no information about plaintext.
Vernam Cipher Algorithm
1. Treat each plain text alphabet as a number in an increasing
sequence, i.e. A = 0, B = 1, …Z = 25.
2. Do the same for each character of the input cipher text.
3. Each number corresponding to the plain text alphabet
added to the corresponding input cipher text alphabet
number.
4. If the sum thus produced is greater than 26, subtract 26
from it.
5. Translate each number of the sum back to the
corresponding alphabet. This gives the output cipher text.
Example of Vernam Cipher
Book Cipher/Running Key Cipher
 For producing cipher text, some portion of text from a
book is used, which serves the purpose of a one-time pad.
 Thus, the characters from a book are used as one-time pad,
and they are added to the input plain text message similar
to the way a one-time pad works.
 It should be clear that since the one-time pad is discarded
after a single use.
 This technique is highly secure and suitable for small
plain text message, but is clearly impractical for large
messages.
Product ciphers
 By themselves, substitution and transposition
ciphers are relatively insecure.
 By combining these operations, we can produce a
secure cipher.
 This is how DES works.
 M -> Sub(M) -> Trans(Sub(M)).
 Might go through multiple rounds.
Block Ciphers
 The ciphers we have seen so far are known as block
ciphers.
 Plaintext is broken into blocks of size k.
 Each block is encrypted separately.
 Advantages: random access, potentially high
security
 Disadvantages: larger block size needed, patterns
retained throughout messages.
Stream Ciphers
 A stream cipher encodes a symbol based on
both the key and the encoding of previous
symbols.
 Ci = Mi XOR Ki XOR Mi-1
 Advantages:
 can work on smaller block sizes – little
memory/processing/buffering needed.
 Disadvantages:
 Random access difficult, hard to use large keys.
 Sender and receiver must be synchronized
 Inserted bits can lead to errors.
Steganography
• Hide a message in another message.

• E.g., hide your plaintext in a graphic image


• Each pixel has 3 bytes specifying the RGB color
• The least significant bits of pixels can be changed w/o greatly affecting the image
quality
• So can hide messages in these LSBs

• Advantage: hiding existence of messages

• Drawback: high overhead

14
• Take a 640x480 (=30,7200) pixel image.
• Using only 1 LSB, can hide 115,200 characters
• Using 4 LSBs, can hide 460,800 characters.

DEPARTMENT OF COMPUTER ENGINEERING , SCOE,KOPARGAON 15


THANK YOU

You might also like