Scribd
Upload
7 views

cryptography

Uploaded by

mohan kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
7 views

cryptography

Uploaded by

mohan kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

Course : ECS51531 – Cryptocurrency and Cyber Security

Module : Symmetric Ciphers


Faculty : Dr. P. Mohan Kumar, Professor / CSE
Topics : Cryptography – Private key Cryptography -
Classical Encryption Techniques - Substitution
Techniques -Transposition Techniques
Symmetric Encryption
• conventional encryption or single-key encryption - 1970s.
• An original message is known as the plaintext, while the coded
message is called the ciphertext.
• The process of converting from plaintext to ciphertext is known as
enciphering or encryption.
• Restoring the plaintext from the ciphertext is deciphering or
decryption.
• The schemes used for encryption constitute the area of study known
as cryptography.
• cryptographic system or a cipher.
• Cryptanalysis - Techniques used for deciphering a message without
any knowledge of the enciphering details.
• Cryptology – Cryptography + Cryptanalysis.
SYMMETRIC CIPHER MODEL
Requirements of Conventional
Encryption
• A strong encryption algorithm.
• Sender and receiver must have obtained copies of the secret key in a
secure fashion and must keep the key secure.
Symmetric Cryptosystem
Cryptography

• Characterization
• The type of operations used for transforming plaintext to
ciphertext.
• Substitutions / Transpositions
• The number of keys used.
• Symmetric, single-key, secret-key, or conventional encryption.
• Asymmetric, two-key, or public-key encryption.
• The way in which the plaintext is processed.
• Block Cipher / Stream Cipher
Cryptanalysis and Brute-Force
Attack
• Attacking a Cryptosystem
• Cryptanalysis - nature of the algorithm, some knowledge of the
general characteristics of the plaintext or even some sample
plaintext–ciphertext pairs.
• Brute-force attack - The attacker tries every possible key.
Security of an Encryption scheme
• Unconditionally secure
• If the ciphertext generated by the scheme does not contain
enough information to determine uniquely the corresponding
plaintext, no matter how much ciphertext is available.
• The cost of breaking the cipher exceeds the value of the
encrypted information.
• The time required to break the cipher exceeds the useful
lifetime of the information.
• Computationally secure if either of the above two criteria are
met.
SUBSTITUTION TECHNIQUES
• The letters of plaintext are replaced by other letters or
by numbers or symbols.
• If the plaintext is viewed as a sequence of bits,
• replacing plaintext bit patterns with ciphertext bit
patterns.
Caesar Cipher
• Julius Caesar.
• Replacing each letter of the alphabet with the letter standing three
places further down.
C = E(3, p) = (p + 3) mod 26
C = E(k, p) = (p + k) mod 26
Monoalphabetic Ciphers

• A permutation of a finite set of elements S is an ordered sequence of


all the elements of S, with each element appearing exactly once.
• if S = {a, b, c}, there are six permutations of S:
abc, acb, bac, bca, cab, cba
• n! permutations of a set of n elements

• the “cipher” line can be any permutation of the 26 alphabetic


characters, then there are 26!
• Cryptanalysis – Relative Frequency
Playfair Cipher

• The Playfair algorithm is based on the use of a 5 * 5 matrix of letters


constructed using a keyword.
• The keyword is monarchy.
• Digrams in plain text are considered as single unit.
Playfair Cipher – Encryption Rules
• Repeating plaintext letters that are in the same pair are separated
with a filler letter balloon - ba lx lo on
• Two plaintext letters that fall in the same row of the matrix are each
replaced by the letter to the right, with the first element of the row
circularly following the last. – ar – RM
• Two plaintext letters that fall in the same column are each replaced by
the letter beneath. mu – CM
• Otherwise, each plaintext letter in a pair is replaced by the letter that
lies in its own row and the column occupied by the other plaintext
letter. hs - BP
Hill Cipher
• Takes m successive plaintext letters and substitutes for them m
ciphertext letters.
• The substitution is determined by m linear equations in which each
character is assigned a numerical value.
• (a = 0, b = 1, ... z = 25)
• c1 = (k11p1 + k21p2 + k31p3) mod 26
• c2 = (k12p1 + k22p2 + k32p3) mod 26
• c3 = (k13p1 + k23p2 + k33p3) mod 26
• C = PK mod 26
• P = D(K, C) = CK-1 mod 26
Polyalphabetic Ciphers
• 1. A set of related monoalphabetic substitution rules is used.
• 2. A key determines which particular rule is chosen for a given
transformation.
Eg: VIGENÈRE CIPHER
• plaintext letters P = p0, p1, p2, … , pn - 1
• a key consisting of the sequence of letters K = k0, k1, k2, … , km – 1. m<n
• ciphertext letters C = C0, C1, C2, … , Cn - 1 is calculated as follows:
VIGENÈRE CIPHER

• Auto key system


VERNAM CIPHER

• choose a keyword that is as long as the plaintext and has no statistical


relationship to it.
One-Time Pad
• Random key that is as long as the message, so that the key need not
be repeated.
• Each new message requires a new key of the same length as the new
message.
• Problems?
Transposition techniques
• Rail fence technique
• plaintext is written down as a sequence of diagonals and then read off as a
sequence of rows.

You might also like