News for hackers. Stuff that matters.
Re:Handbook of Applied Cryptography (2001) by sillysaurus on Sunday July 07, 2013 @08:38PM (#6004340)
Elliptic curve cryptography isn't vulnerable to quantum computing. EDIT: This is mistaken. I was thinking of lattice-based cryptography, which isn't currently vulnerable to quantum computing.

In the video game Final Fantasy, there's a spell called "Doom" which places a countdown over your head. When it reaches 0, you die.

RSA is Doomed in exactly that sense: it's just a matter of time before RSA offers zero security, whereas elliptic curve cryptography remains (for now) unbroken.

Re:Handbook of Applied Cryptography (2001) by pbsd on Sunday July 07, 2013 @08:45PM (#6004372)
It is [1]. Quantum computers, using Shor's algorithm, polynomially break any specialization of the abelian hidden subgroup problem; see [2] for a fairly complete list.

Whatever reason to prefer elliptic curves over integer factorization or discrete log-based schemes must be classical.

[1] http://arxiv.org/abs/quantph/0301141

[2] http://pqcrypto.org/quantum.html

Re:Handbook of Applied Cryptography (2001) by sillysaurus on Sunday July 07, 2013 @08:50PM (#6004392)
Oh.

Then which (if any) algorithm is currently believed to be safe from quantum computing?

I think I was thinking of lattice-based cryptography.

Re:Handbook of Applied Cryptography (2001) by tptacek on Sunday July 07, 2013 @08:56PM (#6004409)
There's a bunch of them. There's no known quantum algorithm for quickly decoding binary linear codes, so McEliece is one. The Clostest Vector Problem in linear algebra is another trapdoor that may be QC-resistent.

You didn't ask, but it's worth saying: block ciphers, stream ciphers and hash functions aren't thought to be fundamentally threatened by QC the way IFP and DLP number theoretic cryptosystems are.

Re:Handbook of Applied Cryptography (2001) by tptacek on Monday July 08, 2013 @02:18PM (#6008215)
It's easy-ish to move from RSA to ECC schemes, because they have significantly smaller key sizes and gain efficiency. The same isn't true of lattice schemes, which have significantly larger keys.

A switch to lattice or code-based crypto seems unlikely in the near future.

Re:Handbook of Applied Cryptography (2001) by damarquis on Monday July 08, 2013 @12:08AM (#6005135)
"it's just a matter of time before RSA offers zero security"

This is not the only possible outcome. Scalable quantum computing could turn out to be impractical due to cost. Or new physics could be found that rules out scalable quantum computing. Personally, I find both of these outcomes unlikely, the second more than the first, but they do exist.