Timeline for How much would it cost in U.S. dollars to brute-force a 256-bit key in a year?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 23, 2012 at 18:49 | comment | added | Polynomial | This is post number 1337 :) | |
| Dec 20, 2011 at 20:23 | comment | added | zwol | You've confused P with PSPACE there at the end. PSPACE = calculations possible in polynomial space (that is, memory). PSPACE is (probably) even bigger than NP. We don't know that IQC or BQP or any of the other quantum complexity classes are bigger than P, but it's a safe bet on the same order as betting P != NP. | |
| Dec 2, 2011 at 22:34 | comment | added | Paŭlo Ebermann | Factoring 256-bit numbers is not really a big problem nowadays, and is much faster than brute-forcing a similar-size key. The RSA key sizes where factoring needs a quantum computer are much larger. (Welcome to Cryptography Stack Exchange, by the way.) | |
| Nov 28, 2011 at 5:17 | history | answered | John Sellers | CC BY-SA 3.0 |