APEX INSTITUTE OF TECHNOLOGY

COMPUTER SCIENCE & ENGINEERING

Bachelor of Engineering (Information Security)
Security and Cryptography
Abhishek Ankur(E12833)

DISCOVER . LEARN . EMPOWER

Security and Cryptography: Course Objective

• Recognize and predict attacks in a network.

• Review cryptographic algorithms, use of this algorithm to provide security.
• Design and evaluate algorithms for encryption and decryption techniques.
• Incorporate practical usage for the development of security algorithms and
protocols.
Chapter Course Objectives

● Exhibit knowledge to secure systems, protect personal data, and

1.
secure computer networks in an organization through cryptography.

Chapter Course Outcomes

Analyze and design classical encryption techniques and block ciphers.

1.

3
Security and Cryptography: Course Objective

CO1 Analyze and design classical encryption techniques and block ciphers.
CO2 Understand and analyze symmetric key algorithm.
CO3 Analyze and design Hash and MAC algorithms and digital signatures.

CO4 Understand and analyze public-key cryptography, RSA and other public-key
cryptosystems.
CO5 Design network security schemes such as PGP, SSL, TLS. Understand and analyze
steganography and cryptanalysis.
Contents

• Vigenère Cipher,

• Playfair Cipher

• ADFGVX Cipher

5
 VIGNERE CIPHER
Treat letters as numbers: [A=0, B=1, C=2, …, Z=25]
Number Theory Notation: Zn= {0, 1, …, n-1}
Definition:
Given m, a positive integer, P = C = (Z26)n, and K = (k1, k2, … , km) a key, we define:
Encryption:
ek(p1, p2… pm) = (p1+k1, p2+k2…pm+km) (mod 26)
Decryption:
dk(c1, c2… cm) = (c1-k1, c2-k2 … cm- km) (mod 26)
Example:
Plaintext: C RYPTO GRAPHY
Key: LUCKLUC KLUCK
Ciphertext: N L A Z E I I B L J J I

6
SECURITY OF VIGENERE CIPHER
• Vigenere masks the frequency with which a character appears in a language: one letter in the
ciphertext corresponds to multiple letters in the plaintext. Makes the use of frequency analysis
more difficult.
• Any message encrypted
by a Vigenere cipher is a
collection of as many shift ciphers as there
are letters in the key.
PLAYFAIR CIPHER
The Playfair cipher was the first practical digraph substitution cipher. The scheme was invented
in 1854 by Charles Wheatstone but was named after Lord Playfair who promoted the use of the
cipher. In playfair cipher unlike traditional cipher we encrypt a pair of alphabets(digraphs) instead of
a single alphabet.
It was used for tactical purposes by British forces in the Second Boer War and in World War I and for
the same purpose by the Australians during World War II. This was because Playfair is reasonably
fast to use and requires no special equipment.

8
PLAYFAIR CIPHER
• The Playfair Cipher Encryption Algorithm: 
The Algorithm consists of 2 steps: 
• Generate the key Square(5×5): 
• The key square is a 5×5 grid of alphabets that acts as the key for encrypting the plaintext. Each
of the 25 alphabets must be unique and one letter of the alphabet (usually J) is omitted from the
table (as the table can hold only 25 alphabets). If the plaintext contains J, then it is replaced by
I. 
 
• The initial alphabets in the key square are the unique alphabets of the key in the order in which
they appear followed by the remaining letters of the alphabet in order. 
 
• Algorithm to encrypt the plain text: The plaintext is split into pairs of two letters (digraphs). If
there is an odd number of letters, a Z is added to the last letter. 
1. Pair cannot be made with same letter. Break the letter in single and add a bogus letter to the
previous letter.

9
PLAYFAIR CIPHER
• 2. If the letter is standing alone in the process of pairing, then add an extra bogus letter with the
alone letter

• If both the letters are in the same column: Take the letter below each one (going back to the top
if at the bottom).

• If both the letters are in the same row: Take the letter to the right of each one (going back to the
leftmost if at the rightmost position).

• If neither of the above rules is true: Form a rectangle with the two letters and take the letters on
the horizontal opposite corner of the rectangle.

10
References
 TEXT BOOKS:
• T1: William Stallings, “Cryptography and Network Security ", Pearson Education, 2014.
• T2: Behrouz A. Ferouzan, “Cryptography & Network Security”, Tata McGraw Hill,2015.

 REFERENCE BOOKS:
• R1: Alfred J. Menenzes, Paul C. van Oorschot, Scott A, “Handbook of Applied Cryptography", CRC Press, 1997.
• R2: Jonathan Katz and Yehuda Lindell, “Introduction to Modern Cryptography”, CRC Press, 2007.

 COURSE LINKS:
• https://www.coursera.org/specializations/applied-crypto

 VIDEO LINKS:
• Lecture:- Introduction to Applied Cryptography
• https://crypto.stanford.edu/~dabo/courses/OnlineCrypto/
 WEB LINKS:
• Handbook of Applied Cryptography
• https://cacr.uwaterloo.ca › hac

11
THANK YOU

For Queries, Write at :

Abhishek.e12833@cumail.in