3 ms·
Why can’t we just keep on using RSA with a huge key?
by sscarduzio 9y ago
Why can’t we just keep on using RSA with a huge key?
- UncleMeat 9y agoClassical computers take a polynomial amount of time (in key size) to perform RSA but exponential amount of time (in key size) to break RSA. Quantum computers can break RSA in polynomial time. For classical systems, the cost to break RSA grows much faster than the cost to perform it, so we can always outpace more powerful adversaries with a less powerful computer. This is not true for quantum machines. I cannot produce a key size that will be small enough that I can work with it but large enough that it is secure against attack.
- acqq 9y agodjb wrote a paper: https://cr.yp.to/papers/pqrsa-20170419.pdf https://cr.yp.to/papers/pqrsa-20170419.pdf
- prophesi 9y agoThis is when I wish people would read the article before commenting... It goes over what quantum would be good at solving, why it's good at solving it, and what can stump it. All in just a handful of paragraphs.