3 ms·
It's worth pointing out that other public-key encryption algorithms don't have the same vulnerability to quantum computers. It's also unlikely (but unproven) th
by weavejester 13y ago
It's worth pointing out that other public-key encryption algorithms don't have the same vulnerability to quantum computers. It's also unlikely (but unproven) that quantum computers can solve NP-complete problems.
- jstalin 13y agoSuch as AES and PGP?
- mtp0101 13y agoAES uses a symmetric key so it is not a public key system
- damarquis 13y agoAES yes, PGP no. Anything based on the difficulty of discrete logs is done for. There are 2 types that remain secure, schemes based on the difficulty of solving problems in lattices and problems in coding theory. Lattice based cryptography is particularly interesting since all known fully homomorphic encryption schemes use it. If this remains the case, and if FHE matures faster than quantum computers (and it actually has been as far as I can tell) that everyone will switch to lattice based cryptography making quantum computers a little less useful and interesting.
- weavejester 13y agoAES is a symmetric encryption algorithm, which is to say it only has one key for both encryption and decryptions. PGP is a piece of software, and not an algorithm. I believe it uses RSA and AES by default, but I could be wrong :) AFAIK RSA, DSA, Diffie-Hellman, and ECC are all known to be vulnerable to Shor's Algorithm (which, granted, do make up a lot of the crypto in common use), but there are lesser-used algorithms like McEliece and NTRU that are not vulnerable. That said, quantum computers are still very far from breaking modern cryptography. We're playing around with a handful of qubits, but to break something like a 4096 bit RSA key would take trillions of quantum gates.
- deleted 13y ago[deleted]
- deleted 13y ago[deleted]