TRADITIONAL ELLIPTIC CURVE CRYPTOGRAPHY VERSUS ISOGENIES
5
WHY SUPERSINGULAR ISOGENY CRYPTO?
6
HARDNESS ASSUMPTIONS IN PUBLIC-KEY CRYPTOGRAPHY
7
ISOGENY-BASED SYSTEMS
8
STATUS OF SECURITY OF ISOGENY-BASED CRYPTO
9
COMPUTATIONAL CHALLENGES
10
PATH FINDING IN ISOGENY GRAPHS
11
COMPUTING WITH ISOGENIES
12
REDUCTIONS TO OTHER PROBLEMS
13
COMMUTATIVE ISOGENY SCHEMES
14
REDUCTIONS-COMMUTATIVE CASE
15
COMMUTATIVE VERSUS NON- COMMUTATIVE ISOGENY CRYPTO
16
REDUCTIONS TO ENDOMORPHISM RING PROBLEM
17
CONCLUSION
18
SUMMARY
Description:
Explore classical and quantum algorithms for isogeny problems in this conference talk by Kirsten Eisentraeger at IPAM's Quantum Numerical Linear Algebra Workshop. Delve into the world of isogeny-based cryptography, a promising candidate for post-quantum security. Examine computational challenges in isogeny-based systems, including path finding in isogeny graphs and computing with isogenies. Discover how these problems can be reformulated in terms of quaternion algebras and group actions. Compare traditional elliptic curve cryptography with isogeny-based approaches, and learn about the current security status of isogeny-based crypto. Investigate potential quantum algorithm speedups and their implications for cryptographic security. Gain insights into commutative and non-commutative isogeny crypto, reductions to endomorphism ring problems, and the overall landscape of isogeny-based cryptographic systems.
Classical and Quantum Algorithms for Isogeny Problems