Timeline for How can AES-like block cipher without non-linear component be broken?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 27, 2017 at 2:07 | vote | accept | JoaoAlby | ||
| Aug 27, 2017 at 1:56 | comment | added | yberman | When you're done each step of the cipher will be a matrix which you can generate. | |
| Aug 27, 2017 at 1:55 | comment | added | yberman | I will show you, but first I want you to do some work. Make a bulleted describing list each step of a round of AES in english, and how it can be expressed as a linear equation. Install PariGP (or some other program capable of doing linear algebra) and try to write the step in the syntax of your chosen language. | |
| Aug 27, 2017 at 1:33 | comment | added | JoaoAlby | Thank you very much, that would be extremely helpful for me! As you can see I am new to the cryptanalysis so could I also ask you to show how I should use this affine transformation to recover the key bits? | |
| Aug 27, 2017 at 1:05 | history | edited | yberman | CC BY-SA 3.0 |
fixed transposed matrix
|
| Aug 27, 2017 at 0:57 | history | answered | yberman | CC BY-SA 3.0 |