6 ms·
The point being made is that public-key encryption techniques assume that it is difficult to factor large numbers. Even with modern computers, this takes a very
by fuzionmonkey 15y ago
The point being made is that public-key encryption techniques assume that it is difficult to factor large numbers. Even with modern computers, this takes a very long time. But this wouldn't be true with quantum computers.
- Zaak 15y agoThe most popular and well-studied public-key encryption systems use factoring, but there are lots of other proposed schemes. The ability to quickly factor products of large primes would cause a temporary upset while alternative systems are brought in as replacements.
- dmarquis 15y agoIts not quite as easy as just swapping out schemes. As I understand it a practical quantum computer would break all proposed public key encryption methods except those based on lattice problems. Lattice based cryptography is still in the preliminary stages of research and is at the moment extremely slow compared to the currently popular encryption methods.