3 ms·
> A group of Chinese researchers have just published a paper claiming that they can—although they have not yet done so—break 2048-bit RSA. If a quantum compute
by TacticalCoder 4y ago
> A group of Chinese researchers have just published a paper claiming that they can—although they have not yet done so—break 2048-bit RSA.
If a quantum computer can break 2048-bit RSA, what about elliptic curves?
- TillE 4y agoElliptic curves are also vulnerable to Shor's algorithm. However, there are several new algorithms for asymmetric cryptography, such as Google's NewHope: https://en.wikipedia.org/wiki/Post-quantum_cryptography https://en.wikipedia.org/wiki/Post-quantum_cryptography https://en.wikipedia.org/wiki/NIST_Post-Quantum_Cryptography_Standardization https://en.wikipedia.org/wiki/NIST_Post-Quantum_Cryptography...
- vlovich123 4y agoI had the same question as OP and you seem to have misinterpreted the question. Specifically this article is about showing a meaningful reduction in the Quantum bits required for Shor's algorithm by pairing it with lattice reduction (whatever that means). Does this approach of combining classical lattice reduction technique + quantum Shor's hold for elliptic curves? Are there any other problems beside cracking crypto algorithms that this technique could be applied to that might actually be useful vs just a more complicated attack vector?