2 ms·
Layman question: assuming one day RSA gets actually broken and a quantum computer or a new algorithm can factorize prime numbers fast: would there be any alter
by hutzlibu 7y ago
Layman question:
assuming one day RSA gets actually broken and a quantum computer or a new algorithm can factorize prime numbers fast: would there be any alternatives avaiable for public/private key encryption?
Or would the solution be, to use just a lot bigger prime numbers calculated also with a quantum computer? That sounds not too promising.
- dekz 7y agohttps://en.wikipedia.org/wiki/Post-quantum_cryptography https://en.wikipedia.org/wiki/Post-quantum_cryptography
- hutzlibu 7y agoOh thanks. So the answer seems: maybe.
- jessriedel 7y agoMy impression from talking to post-quantum cryptographers is that the answer is "probably" or "it would be pretty surprising, though not radically shocking, if it turns out that any public-key protocol is necessarily quantum-vulnerable".
- deleted 7y ago[deleted]
- thesz 7y agohttps://cr.yp.to/papers/pqrsa-20170419.pdf https://cr.yp.to/papers/pqrsa-20170419.pdf You may need to have 1TB of key storage (and signature) for post quantum RSA.
- rmrfstar 7y agoAn RSA break only breaks key distribution. If you can securely get someone an AES key, you are all set. That is why asset managers are experimenting with quantum communications channels [1]. [1] https://www.bloomberg.com/news/articles/2019-01-14/the-super-secure-quantum-cable-hiding-in-the-holland-tunnel https://www.bloomberg.com/news/articles/2019-01-14/the-super...