Public-key cryptography
asymmetric cryptography
Cryptography using a mathematically linked key pair: a public key that can be shared, and a private key that must not be. It is the part of modern cryptography that quantum computers threaten most directly.
Related terms
A quantum algorithm that factors large integers and computes discrete logarithms in polynomial time. It is the specific reason RSA, Diffie-Hellman and elliptic-curve cryptography would fail against a sufficiently large quantum computer.
A value that proves a message was produced by the holder of a particular private key and has not been altered since. Signatures provide authenticity and integrity, not confidentiality.
Cryptography where the same secret key both encrypts and decrypts. It is far less affected by quantum computing than public-key cryptography — Grover's algorithm only halves the effective key strength.