Scribd
Upload
26 views13 pages

Block Cipher

Block ciphers operate on fixed-length groups of bits, called blocks, with an unvarying transformation that is dependent on a secret key. The Data Encryption Standard (DES) is a block cipher with a 64-bit block size and 56-bit key. DES uses a Feistel network, which applies multiple rounds of substitution and permutation using subkeys derived from the original key. Double DES and Triple DES apply the DES cipher twice or thrice to increase security by lengthening the effective key size.

Uploaded by

Rocky Mdee
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
26 views13 pages

Block Cipher

Block ciphers operate on fixed-length groups of bits, called blocks, with an unvarying transformation that is dependent on a secret key. The Data Encryption Standard (DES) is a block cipher with a 64-bit block size and 56-bit key. DES uses a Feistel network, which applies multiple rounds of substitution and permutation using subkeys derived from the original key. Double DES and Triple DES apply the DES cipher twice or thrice to increase security by lengthening the effective key size.

Uploaded by

Rocky Mdee
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/ 13

Block Cipher and Data

Encryption Standard
CSS 325
Block Cipher
• Is an encryption/decryption scheme in which a block of plaintext
is treated as a whole and used to produce a ciphertext block of
equal length.
• Many block ciphers have a Feistel structure. Such a structure
consists of a number of identical rounds of processing. In each
round, a substitution is performed on one half of the data being
processed, followed by a permutation that interchanges the two
halves.
• The original key is expanded so that a different key is used for each
round.
Feistel Cipher Structure
• Cipher that alternates substitutions and permutations,
• Substitution: Each plaintext element or group of elements is
uniquely replaced by a corresponding ciphertext element or group
of elements.
• Permutation: plaintext elements is replaced by a permutation of that
sequence. no elements are added or deleted or replaced in the
sequence, rather the order in which the elements appear in the
sequence is changed.
Block cipher principles (Feistel Cipher Structure)
• Virtually all conventional block encryption algorithms, including
DES have a structure first described by Horst Feistel of IBM in
1973
• Such structure consists of a number of identical rounds of
processing. In each round a substitution is performed on one half
of the data being processed, followed by permutation that
interchanges the two halves.
• The original key is expanded so that different key is used in each
round.
Encryption Process in Each Round
• Plaintext P is split into left and right halves
P = (L0 , R0)
• For each round
i = 1,2,3,4,…..n
Li = Ri-1 ……..........(1)
Ri = Li-1  F (Ri-1 , Ki)….(2)
• Ciphertext C is the output of final round n
C = (Ln , Rn)
Decryption Process in Each Round
• Ciphertext C is the output of final round n
C = (Ln , Rn)
• For each round
i = 1,2,3,4,…..n
Ri-1 = Li ……..........(3)
Li-1 = Ri  F (Ri-1 , Ki)….(4)
• Final result is Plaintext P
P = (L0 , R0)
XOR Properties

(A  B)  C = A  (B  C)
A  A=0
A0=A
Example
• Consider a Feistel Cipher with four rounds where
P=(L0,R0) and the corresponding C=(L4,R4). What is the
ciphertext C interms of L0, R0 and the subkey for the
given function
F(Ri-1, Ki) = 0
Example 2
• Consider a Feistel Cipher with four rounds where P=(L0,R0) and the
corresponding C=(L4,R4). What is the ciphertext C interms of L0, R0
and the subkey for the given function
F(Ri-1,Ki) = Ri-1  Ki
Feistel Network Parameters
• Block Size: Large block size means greater security {64bits, AES use 128
bits}
• Key Size: Larger key size means greater security but may decrease
encryption/decryption speed
• Number of Rounds: multiple rounds offers increasing security
• Subkey generation algorithm: greater complexity in this algorithm lead
to greater difficulty of cryptanalysis
• Round function F: Greater complexity generally means greater
resistance
Individual Assignment
• Explain the Structure of Data Encryption Standard (DES) and
explain the difference between DES, double DES and Triple
DES

You might also like