| bio | website | cuebit.wordpress.com |
|---|---|---|
| location | Stanford, CA | |
| age | 22 | |
| visits | member for | 1 year, 10 months |
| seen | May 6 at 5:59 | |
| stats | profile views | 7 |
|
Dec 5 |
awarded | Nice Question |
|
Sep 25 |
awarded | Yearling |
|
Sep 15 |
awarded | Nice Question |
|
Sep 2 |
awarded | Notable Question |
|
Mar 24 |
awarded | Popular Question |
|
Jul 14 |
comment |
What are the practical difference between 256-bit, 192-bit, and 128-bit AES encryption? You would use AES 256 to protect against quantum brute force attacks; Grover's algorithm speeds up a brute force attack by the square root of n (see en.wikipedia.org/wiki/Grover's_algorithm) |
|
Jul 14 |
comment |
Taking advantage of one-time pad key reuse? This picture illustrates things beautifully. I guess the spirit of my question was "how would you actually do the statistical analysis once you have $m_1 \oplus m_2$"; a respectable cryptographer would probably say something like "that's trivial". |
|
Jul 14 |
awarded | Supporter |
|
Jul 14 |
asked | RSA with small exponents? |
|
Jul 13 |
awarded | Quorum |
|
Jul 13 |
awarded | Student |
|
Jul 13 |
asked | Taking advantage of one-time pad key reuse? |