Scribd
Upload
69 views22 pages

Chapter3 PDF

This document provides an overview of cryptography concepts including: 1. It describes different encryption techniques like substitution ciphers, transposition ciphers, hashing, symmetric and asymmetric cryptography. 2. It explains concepts like plaintext, ciphertext, enciphering, encryption algorithms, deciphering, and decryption algorithms. 3. It provides examples of specific techniques like the Rail Fence cipher, one-time pads, hashing using MD5, and an introduction to the DES algorithm.

Uploaded by

Jayesh Deshmukh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
69 views22 pages

Chapter3 PDF

This document provides an overview of cryptography concepts including: 1. It describes different encryption techniques like substitution ciphers, transposition ciphers, hashing, symmetric and asymmetric cryptography. 2. It explains concepts like plaintext, ciphertext, enciphering, encryption algorithms, deciphering, and decryption algorithms. 3. It provides examples of specific techniques like the Rail Fence cipher, one-time pads, hashing using MD5, and an introduction to the DES algorithm.

Uploaded by

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

Chapter : 03

Cryptography
Marks = 16
3.1 Introduction : Cryptography, Cryptanalysis, Cryptology,
Substitution techniques: Caesar’s cipher, monoalphabetic and polyalphabetic,
one-time pad.
3.2 Transposition techniques – Rail fence technique, simple columnar, steganography.
3.3 Hashing – concept
3.4 Symmetric and asymmetric cryptography: Introduction to Symmetric encryption,
DES ( Data encryption Standard ) algorithm,
Asymmetric key cryptography : Digital Signature.
Plain Text :
Plain text is nothing but a original text which is in readable form and to which we want to
convert into unreadable form before transmission.

CipherText :
Unreadable text OR Ununderstandable text.

Enciphering or encryption:
The process by which plaintext is converted into ciphertext.

Encryption algorithm:
The sequence of data processing steps that go into transforming plaintext into ciphertext.
Various parameters used by an encryption algorithm are derived from a secret key. In
cryptography for commercial and other civilian applications, the encryption and decryption
algorithms are made public.
Deciphering or Decryption:
Recovering plaintext from ciphertext.

Decryption algorithm:
The sequence of data processing steps that go into transforming ciphertext back into
plaintext. In classical cryptography, the various parameters used by a decryption algorithm
are derived from the same secret key that was used in the encryption algorithm.
Cryptography
Area of study in which we study the different encryption schemes.

Characteristics

• The type of operations(encryption or decryption algorithm) used for transforming


plaintext to cipher text.

o Substitution
o Transposition

• The number of keys used.


o Symmetric, single-key, secret-key encryption
o Asymmetric, two-key, public-key encryption

• Mode of Cipher
o Block Cipher
o Stream Cipher
ONE TIME PAD
Rail-fence Cipher (transposition techniques)
• It is a transposition cipher that follows a simple rule (that we can understand using
following example) for mixing up the characters in the plain-text to form the ciphertext.
• It is a weak cipher that can be broken easily and doesn't provide any communication
security alone , but we can use it with other ciphers.
• Many security professionals claim that the rail-fence cipher is a simpler "write down the
columns, read along the rows" cipher.
Example

The key for the Railfence cipher is just the number of rails. To encrypt a piece of text, e.g.

Plain text : “defend the east wall of the castle”

We write it out in a special way on a number of rails (the key here is 3)

D N E T L H S

E E D H E S W L O T E A T E

F T A A F C L

The ciphertext is read off along the rows:

cipher text : “dnetlhseedheswloteateftaafcl”


HASHING
• Hashing play a role in security systems where they're used to ensure that transmitted
messages have not been tampered.
• Hash values generated by a formula in such a way that it is extremely unlikely that some
other text will produce the same hash value.
• The sender generates a hash of the message, encrypts it, and sends it with the message
itself.
• The recipient then decrypts both the message and the hash, produces another hash from
the received message, and compares the two hashes. If they're the same, there is a very
high probability that the message was transmitted exact.
• We can say that hashing is a concept used to verify integrity of the message.
MD5 (Message Digest 5)

Fig. One operation for MD5

( 4 Rounds each round


consist of such 16 operations
it means 4X16=64 operations
in one MD5 for each 512bit
block )

Function for Round 1: F(B,C,D)=(B∧C)∨(¬B∧D)


Function for Round 2: G(B,C,D)=(B∧D)∨(C∧¬D)
Function for Round 3: H(B,C,D)=B⊕C⊕D
Function for Round 4: I(B,C,D)=C⊕(B∨¬D)

⊕ , ∧ , ∨ , ¬ denote the XOR, AND, OR and NOT operations respectively.


Figure 1. One MD5 operation. MD5 consists of 64 of these
operations, grouped in four rounds of 16 operations. F is a
nonlinear function; one function is used in each round. Mi denotes
a 32-bit block of the message input, and Ki denotes a 32-bit
constant, different for each operation. left shifts denotes a left bit
rotation by s places; s varies for each operation. Addition denotes
addition modulo 232.
The main MD5 algorithm operates on a 128-bit state, divided into
four 32-bit words, denoted A, B, C, and D. These are initialized to certain
fixed constants. The main algorithm then uses each 512-bit message block
in turn to modify the state. The processing of a message block consists of
four similar stages, termed rounds; each round is composed of 16 similar
operations based on a non-linear function F, modular addition, and left
rotation. Figure 1 illustrates one operation within a round. There are four
possible functions F; a different one is used in each round:

Function for Round 1: F(B,C,D)=(B∧C)∨(¬B∧D)


Function for Round 2: G(B,C,D)=(B∧D)∨(C∧¬D)
Function for Round 3: H(B,C,D)=B⊕C⊕D
Function for Round 4: I(B,C,D)=C⊕(B∨¬D)

⊕ , ∧ , ∨ , ¬ denote the XOR, AND, OR and NOT operations respectively.


SHA-1 Algorithm
• SHA 1 consist of 80 iterations.
• A, B, C, D and E are 32-bit words of the
state;
• F is a nonlinear function that varies;
• <<< n denotes a left bit rotation by n
places;
• n varies for each operation;
• Wt is the expanded message word of
round t;
• Kt is the round constant of round t;

• denotes addition modulo 232.

Fig. One iteration within the SHA-1


compression function:
DES (Data Encryption Standard)
Li = Ri-1
Ri = Li-1 XOR F ( Ri-1 , Ki )

You might also like