Timeline for AES with weak keys
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 16, 2014 at 14:21 | vote | accept | Idonknow | ||
| Nov 13, 2014 at 9:07 | comment | added | fgrieu♦ | Yes. An easy statistical calculation shows that if for $j$ increasing from $0$ to $13$ we try the $128!/(128-j)!/j!$ keys with $j$ zero bits and $128-j$ one bits (using encryption of some known plaintext), we'll find a key with odds about $59.6\%$, and less than $2^{57.8}$ AES encryptions. With $j$ up to $8$, our chances to find a key are still a fair $9.7\%$, with effort less than $2^{40.5}$ encryptions. With $j$ up to $5$, $0.93\%$, with effort less than $2^{28.1}$. | |
| Nov 13, 2014 at 8:30 | history | answered | Guut Boy | CC BY-SA 3.0 |