4 ms·
https://en.wikipedia.org/wiki/Shor%27s_algorithm https://en.wikipedia.org/wiki/Shor%27s_algorithm As soon as quantum computers have enough qbits prime factoris
by temporary_name 2y ago
https://en.wikipedia.org/wiki/Shor%27s_algorithm https://en.wikipedia.org/wiki/Shor%27s_algorithm
As soon as quantum computers have enough qbits prime factorisation can be done very quickly. Not sure the timeline on that as there are a lot of challenges in the technology and it is hideously expensive, but a lot of the move away from RSA to elliptic curves is driven by readiness for quantum computing.
https://en.wikipedia.org/wiki/Post-quantum_cryptography https://en.wikipedia.org/wiki/Post-quantum_cryptography
- kamov 2y agoElliptic curve cryptography can be broken by Shor's algorithm as well https://arxiv.org/pdf/1706.06752 https://arxiv.org/pdf/1706.06752
- upofadown 2y ago... and easier than with RSA. Not that it would make a significant difference.
- fragmede 2y agosgt101 posted a good comment about this a couple months back: https://news.ycombinator.com/item?id=40187560 https://news.ycombinator.com/item?id=40187560 tl;dr: not in our lifetime.
- deleted 2y ago[deleted]