Professional Documents
Culture Documents
Module 1 (Part A)
Module 1 (Part A)
INTRODUCTION
CRYTOPOGRAPHY
1. Mod Operation
2. Matrix
Adjoint of a Matrix
Determinant Matrix
Inverse Matrix
CRYTOPOGRAPHY
1. Plain text: An Original Message Is Known As The Plaintext
2. Encryption: Process Of Converting From Plaintext To Ciphertext
3. Decryption:restoring The Plaintext From The Ciphertext
4. Key
5. Ciphertext: Coded Message
CRYTOPOGRAPHY
1. Symmetric Encryption Or Single-key Encryption
2. Asymmetric Encryption Or Two-key, Or Public-key Encryption
3. Stream Ciphers: Process Messages a Bit Or Byte At A Time
4. Block Ciphers: Process Messages In Blocks
CRYTOPOGRAPHY
CLASSICAL ENCRYPTION TECHNIQUES: MODULE – 1
1.SYMMETRIC CIPHER MODEL
• Cryptanalysis
• Brute-force attack
2.SUBSTITUTION CIPHERS`
1. Substitution
NOTE:
Plain text in lowercase
Cipher text in uppercase
CAESAR CIPHER
• Julius Caesar
• Replaces each letter of the alphabet with the letter standing 3 places further
down the alphabet.
example:
meet me after the toga party
PHHW PH DIWHU WKH WRJD SDUWB
CAESAR CIPHER
Key : 3
CAESAR CIPHER
• Problems
MONOALPHABETIC CIPHER
• Permutation
• For example, if S = {a, b, c}, there are six permutations of S:
abc, acb, bac, bca, cab, cba
• In general, there are n! permutations of a set of n elements
MONOALPHABETIC CIPHER
A B C D E F G . . Z
G T U X Q P W . . N
Encryption:
Plain text: CAD
Cipher text: UGX
Decryption:
Cipher text: UGX
Plain text: CAD
MONOALPHABETIC CIPHER
• Key : MONARCHY
• First we enter a given key
• start with alphabet A letter
• But here A is present in the key
• There fore start with alphabet B
• Combine I/J
• Note: if any one box empty after entering alphabets means wrong
PLAYFAIR CIPHER
Problems
Step1: construct matrix
Step2: broke the plain text in group of 2 alphabets
Step3: if both the alphabets are same or only letter is left
then add X after first first alphabet
Plain text: 1) JAZZ 2) OFF 3) WORLD
JA ZX ZX OF FX WO RL DX
HILL CIPHER
• Hill Algorithm
problems
POLYALPHABETIC CIPHERS
• Joseph, proposed an improvement to the Vernam cipher that yields the ultimate in security
• using a random key that is as long as the message
• key need not be repeated
• the key is to be used to encrypt and decrypt a single message, and then is discarded.
• Unbreakable
• (P+K)mod 27
• Space---26
problem
ONE-TIME PAD
1. Character marking
2. Invisible ink
3. Pin punctures
4. Typewriter correction ribbon