Explore >> Select a destination
|
You are here 
|
sethmlarson.dev | ||
| | | | |
dadrian.io
|
|
| | | | | Large-scale quantum computers are capable of breaking all of the common forms of asymmetric cryptography used on the Internet today. Luckily, they don't exist yet. The Internet-wide transition to post-quantum cryptography began in 2022 when NIST announced their final candidates for key exchange and signatures in the NIST PQC competition. There is plenty written about the various algorithms and standardization processes that are underway. The conventional wisdom is that it will take a long time to transit... | |
| | | | |
scottarc.blog
|
|
| | | | | A very high-level view of [hybrid] post-quantum cryptography. | |
| | | | |
securityinaction.wordpress.com
|
|
| | | | | ==================== TL; DR With the recent publication of post quantum cryptography (PQC) algorithms from NIST, organisations of all size should begin the transition to PQC. Please refer to this PQC readiness publication from CISA as a starting point. ==================== To assist with the transition to PQC, I have provided advice below for government agencies and... | |
| | | | |
www.jeremykun.com
|
|
| | | So far in this series we've seen elliptic curves from many perspectives, including the elementary, algebraic, and programmatic ones. We implemented finite field arithmetic and connected it to our elliptic curve code. So we're in a perfect position to feast on the main course: how do we use elliptic curves to actually do cryptography? History As the reader has heard countless times in this series, an elliptic curve is a geometric object whose points have a surprising and well-defined notion of addition. | ||
