Differences
This shows you the differences between two versions of the page.
|
sasc:laboratoare:05 [2017/03/23 11:45] marios.choudary Added notes/tip to Exercises 1/2 |
sasc:laboratoare:05 [2017/03/23 19:53] (current) marios.choudary |
||
|---|---|---|---|
| Line 5: | Line 5: | ||
| http://cs.curs.pub.ro/2014/pluginfile.php/13095/mod_resource/content/2/sasc_curs4_5.pdf | http://cs.curs.pub.ro/2014/pluginfile.php/13095/mod_resource/content/2/sasc_curs4_5.pdf | ||
| - | ==== Exercise 1 ==== | + | ==== Exercise 1 (2p) ==== |
| Remember DESX defined as the operation DESX( (k1,k2,k3), m) = k1 ⊕ DES(k2, m ⊕ k3), | Remember DESX defined as the operation DESX( (k1,k2,k3), m) = k1 ⊕ DES(k2, m ⊕ k3), | ||
| where k1, k3 have 64 bits (same as input/output of DES) and k2 has 56 bits (DES key size). | where k1, k3 have 64 bits (same as input/output of DES) and k2 has 56 bits (DES key size). | ||
| - | Show an attack on DESX that runs in time $O(2^{120})$. | + | Show a brute force (exhaustive key search) attack on DESX that runs in time $O(2^{120})$. |
| <note tip> | <note tip> | ||
| Try using a couple of (message, ciphertext) pairs and see if you can get rid of k1 | Try using a couple of (message, ciphertext) pairs and see if you can get rid of k1 | ||
| - | somehow in order to speed up a brute force attack (i.e. exhaustive key search). | + | somehow in order to speed up a brute force attack. |
| </note> | </note> | ||
| - | ==== Exercise 2 ==== | + | ==== Exercise 2 (3p) ==== |
| Show why the following schemes do not bring any real advantage compared to DES: | Show why the following schemes do not bring any real advantage compared to DES: | ||
| Line 27: | Line 27: | ||
| </note> | </note> | ||
| - | ==== Exercise 3 ==== | + | ==== Exercise 3 (5p) ==== |
| The goal of this exercise is to implement the meet-in-the-middle attack on double DES. | The goal of this exercise is to implement the meet-in-the-middle attack on double DES. | ||
