I think you might be referring to Shor’s algorithm, which allows quantum computers (not yet, although maybe in one or two decades) to factor numbers in polynomial time, and thus break RSA no matter how large your keys are, but even elliptic curves IIRC. Anyway, there exists a whole field of research for this, called Post Quantum Cryptography. NIST is in the process of standardizing this, but you probably probably won’t find a mature implementation for e.g. TLS or PGP just yet. Fun fact though: you can get openssh to use sntrup4591761x25519-sha512@tinyssh.org as key-exchange, which should be quantum-resistant (run ssh -Q KexAlgorithms to see if’s there).
I think you might be referring to Shor’s algorithm, which allows quantum computers (not yet, although maybe in one or two decades) to factor numbers in polynomial time, and thus break RSA no matter how large your keys are, but even elliptic curves IIRC. Anyway, there exists a whole field of research for this, called Post Quantum Cryptography. NIST is in the process of standardizing this, but you probably probably won’t find a mature implementation for e.g. TLS or PGP just yet. Fun fact though: you can get openssh to use
sntrup4591761x25519-sha512@tinyssh.orgas key-exchange, which should be quantum-resistant (runssh -Q KexAlgorithmsto see if’s there).