The Quantum Threat
Quantum computing poses a fundamental challenge to widely deployed cryptographic schemes. Algorithms like RSA and elliptic curve cryptography (ECC), which underpin most current public-key infrastructure, are vulnerable to attacks by sufficiently powerful quantum computers. While such machines don't yet exist at scale, the threat is immediate: adversaries can harvest encrypted data today and decrypt it once quantum capabilities mature—a strategy known as "harvest now, decrypt later."
In response, standards bodies including NIST have begun certifying post-quantum cryptographic (PQC) algorithms designed to resist both classical and quantum attacks. Organizations must now assess their cryptographic dependencies, identify vulnerable algorithms, and plan migration paths toward quantum-resistant alternatives.
TrustSource Cryptography Algorithms Lake
To support your cryptographic risk assessment, TrustSource provides a searchable dictionary of cryptographic algorithms. You can query by algorithm name or filter by category tags (symmetric, asymmetric, hash, key exchange, post-quantum). Each entry includes information on current strength assessments, links to authoritative references, and clear indicators for algorithms known to be broken or deprecated, visualized as a red B in front of the name.
Use this dictionary to evaluate the cryptographic posture of your components and identify where migration to stronger or quantum-resistant alternatives may be required. Select KNOWLEDGE > ALGORITHMS
Where available we added links to provide more details on the algorithm. We will expand this list and the information contained, so that you will have a sound foundation to build your Crypto Agile solution.
Further reading:
- To understand the Cryptographic challenge, read this.
- To learn more about how to assess your portfolio for crypto algorithms, read this article.
- To learn how to set a Crypto Policy, read this.
- To see what algorithms you already have in your portfolio, go here.
- To learn how to export CBOMs, read this article.
Comments
0 comments
Article is closed for comments.