2 ms·
> Quantum computer, however, is good at integer factorization. Using Shor’s algorithm, quantum computer does integer factorization in polynomial time, which mak
by arberavdullahu 7y ago
> Quantum computer, however, is good at integer factorization. Using Shor’s algorithm, quantum computer does integer factorization in polynomial time, which makes cracking the RSA cryptosystem possible.
Does increasing the size of the key get around this problem, if not is there any solution to this?
- LocalRSAExpert 7y agoYes, between 100 GB and 1 TB of private key does it.
- cipherboy 7y agoCitation, for those curious: https://cr.yp.to/papers/pqrsa-20170419.pdf https://cr.yp.to/papers/pqrsa-20170419.pdf
- selfup 7y agoThe end game is to switch to a post-quantum algorithm. Essentially something that both quantum and classical computers cannot crack/brute force. I would look into lattice-based crypto. It is one of the strongest candidates under review by NIST for post-quantum public/private key mechanisms.