Hacker News Reader

Comment by trotsky | Hacker News Reader

While the other answer about factorization hit the nail on the head, let me say it again in more direct terms. There is a strong belief among those who pay serious attention to encryption (NSA, etc.) that quantum computing would/will render all traditional encryption (minus things like one time pads) obsolete. An actor with a sufficiently advanced quantum computer would be able to break everyone else's comms.

View on HN

I understand how quantum computers can break RSA; by factoring numbers quickly. That's exploiting a known "weakness" in RSA.

I'm curious as to how quantum computers would break other encryption algorithms like AES or ElGamal. Do you have any details?

There's much more concern with asymmetric algorithms like RSA or elliptic curve crypto. I don't know the details on symmetric ciphers like AES, but nobody really seems to be worried about them.

However, it's also not necessarily true that all asymmetric cryptosystems would be broken by quantum computing. For example, the McEliece cryptosystem is gaining attention lately because it's not known to be vulnerable to any quantum attacks. If you're interested in finding out more, google for post-quantum cryptography; there's lots of interesting info out there.

Quantum algorithms halve the "strength in bits" of symmetric encryption algorithms by using the Grover's search algorithm (AFAIK):

http://en.wikipedia.org/wiki/Quantum_computer#Potential

I was repeating it as explained to me by someone whose opinion I trust, however it seems likely now that I misunderstood or perhaps it was being simplified for me. I should know better than to comment on issues like that that I don't fully understand. Thanks for correcting me.

Hehe, well, don't think of it as "correcting". I didn't (and still don't) understand it fully myself, so you should thank me for clearing things up or something instead :)

Reply on news.ycombinator.com