Re:NIST Post-Quantum Cryptography Round 1 Submissions
by yalogin on Wednesday December 27, 2017 @03:56PM
(#16017964)
Interesting. But an ec 512 bit key has a theoretically same strength as an aes 256 bit key. How is aes able to withstand it when ec and rsa can’t?
[ Parent
| on HN ]
Re:NIST Post-Quantum Cryptography Round 1 Submissions
by CiPHPerCoder on Wednesday December 27, 2017 @04:10PM
(#16018065)
AES's security reduction in the quantum scenario comes from a sqrt(n) reduction in search time. It's an optimized brute force against the key.
ECC gets broken because there is a quantum algorithm that solves the Elliptic Curve Discrete Logarithm Problem much faster than sqrt(n).
Re:NIST Post-Quantum Cryptography Round 1 Submissions
by yalogin on Wednesday December 27, 2017 @08:12PM
(#16019532)
Thanks. Looks like I have a wrong understanding of quantum computing. I thought QC increases the computing power by a lot there by making it easier or practical to compute the discrete log. So are you saying that the QC paradigm lends itself to a different class of algorithms?
Re:NIST Post-Quantum Cryptography Round 1 Submissions
by CiPHPerCoder on Wednesday December 27, 2017 @08:51PM
(#16019711)
Yes, look up Shor's Algorithm and Grover's Algorithm.