These foundational algorithms form a set of cryptographic primitives from which more complex cryptographic protocols are built — for example, protocols for comprehensive data protection in transit (TLS, IPSec), distributed ledger systems, remote access, and many other applications.
A fundamental characteristic of the computational complexity paradigm of cryptographic security is that recovering the private key of an asymmetric cryptographic scheme is theoretically always possible — but in practice would require a prohibitive amount of computational resources.
Advances in computing theory have led to the emergence of
quantum computers. The computational power of quantum computers is growing rapidly, dramatically accelerating the solution of certain problems. According to projections from the research community, by around 2028–2030 adversaries could use quantum computers to break the most widely deployed public-key cryptosystems — making
the quantum threat an increasingly real and present danger. In response, quantum cryptography and
post-quantum cryptography have been developed as countermeasures.