Session 8
Session 8
• A 64-bit key is used as input to the algorithm. The bits of the key are
numbered from 1 through 64; every eighth bit is ignored, 56 bits are
left out. The key is first subjected to a permutation governed by a table
labeled Permuted Choice One.
• The resulting 56-bit key is then treated as two 28-bit quantities,
subjected to a circular left shift or (rotation) of 1 or 2 bits.
• These shifted values serve as input to the next round.
• They also serve as input to the part labeled Permuted Choice 2, which
produces a 48-bit output that serves as input to the function F(Ri -1, Ki).
Linear Cryptanalysis:
• Selecting a candidate for a linear approximation using a known plaintext-
ciphertext pair.
• Building a linear expression using input and output bits that are known.
• Calculating the linear expression's bias or correlation with the key bits.
• Repeating the procedure with numerous plaintext-ciphertext pairs will
increase the attack's dependability.
• C[a1,a2,……an] XOR K[b1,b2,…..bn] = P[p1,p2,…..pn]
Differential Cryptanalysis:
• A substantial number of plaintext-ciphertext pairings with known
variations are gathered in order to execute differential cryptanalysis on
the DES algorithm. These pairs were carefully selected in order to
investigate how discrepancies spread through DES rounds.
• The investigation of the differences in the intermediate steps, especially
focusing on the function of the S-boxes, is a component of the differential
cryptanalysis of DES. Due to their 6-bit input and 4-bit output, S-boxes
are excellent candidates for differential cryptanalysis.
Dr Gandharba Swain