Categories
Uncategorized

In this question you will see a weakened version of DES, we will mark the i bit of the main key k of DES as k[i] (when 0 <=i<=55)

In this question you will see a weakened version of DES, we will mark the i bit of the main key k of DES as k[i] (when 0 <=i<=55), and the bits m,m+1,m+2,n as k[m,n] for m < n.

We will change the key derivation algorithm of the DES, so in the 1,2,3,4,5,6,7,9,10,11,12,13,14,15,16 rounds the key will be round the key will be k[0,47]. th k[8,55] and only

In the 8 Describe a known plaintext algorithm which given (m,c) a message and its cypher, the algorithm should find the main key k (56 bits) with time complexity of 2^48 DES operations.

In this question you will see a weakened version of DES, we will mark the i bit of the main key k of DES as k[i] (when 0 <=i<=55)

Leave a Reply

Your email address will not be published. Required fields are marked *