#### [[Basis of PKI cryptography feasibility]] --- RSA and ElGamal rely on the **discrete logarithm problem** for security. This may be breakable in the future using Schor's algorithm for quantum computers. Approximately 2040 logical qubits needed to break 1024 key size. --- Tags: Reference: [[@petersonComputerNetworksSystems]] [[@ShorAlgorithm2021]] Related: