published on October 18, 2024
The NIST Effort on Migration to Post-Quantum Cryptography
By Bill Newhouse
Appears in collection : 2023 - T3 - WS1 - Fundamental algorithms and algorithmic complexity
In 2011, Jao and De Feo proposed a key exchange based on the presumed hardness of the following problem: given two elliptic curves, and the images of a few points through a secret isogeny, compute this isogeny.
In 2022, a polynomial-time algorithm was discovered. This powerful new tool has broken many cryptosystems, but has also lead to new constructions, and other applications in algorithmic number theory. We will present this algorithm and some of its applications.