Timeline for 1 Billion Bit Encryption?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2018 at 8:31 | comment | added | CodesInChaos | @forest Note that this assumes a single sequential grover circuit running for time $2^{n/2}$. The advantage of grover drops as you limit the number of sequential steps. | |
| Feb 25, 2018 at 3:56 | comment | added | forest | Actually a dyson sphere running grover's algorithm could brute force a $2^{256}$ keyspace because the algorithm cuts the effective keyspace of any cryptosystem to $2^{n/2}$. | |
| Jul 7, 2015 at 22:03 | history | edited | Gerald Davis | CC BY-SA 3.0 |
deleted 45 characters in body
|
| Jul 5, 2015 at 13:50 | history | edited | Gerald Davis | CC BY-SA 3.0 |
added 1130 characters in body
|
| Jul 5, 2015 at 2:40 | history | answered | Gerald Davis | CC BY-SA 3.0 |