how use a meet in the middle attack to break 2DES using a known-plaintext attack. Now...

 

Transcribed Image Text:

how use a meet in the middle attack to break 2DES using a known-plaintext attack. Now we want to adapt it to break 3DES. We use the following diagram. Here, we are attempting to break DESK₁(DESK (DESK₁(m))) by attempting to find K₁ and K2. Show that you can find K₁ and K2 with a chosen plaintext using attack 256 chosen plaintexts and two tables of 256 entries of DES inverse operations. (Hint: start by constructing a table with all 256 possible values for K₁ and corresponding DES(0) (that is, assume A = 0). Then, using A = 0, meet in the middle.) how use a meet in the middle attack to break 2DES using a known-plaintext attack. Now we want to adapt it to break 3DES. We use the following diagram. Here, we are attempting to break DESK₁(DESK (DESK₁(m))) by attempting to find K₁ and K2. Show that you can find K₁ and K2 with a chosen plaintext using attack 256 chosen plaintexts and two tables of 256 entries of DES inverse operations. (Hint: start by constructing a table with all 256 possible values for K₁ and corresponding DES(0) (that is, assume A = 0). Then, using A = 0, meet in the middle.)