Thursday, November 9, 2017
Number Theory Seminar
Supersingular Isogeny Graphs in Cryptography
Kristin Lauter, Cryptography Group, Microsoft Research
Supersingular Isogeny Graphs were proposed for use in Cryptography in 2006 by Charles-Goren-Lauter, and are currently being considered as candidates for standardization in several tracks of the 2017 NIST Post-Quantum Cryptography International Competition. These are Ramanujan graphs whose nodes are supersingular elliptic curves and edges are isogenies between them. This talk will introduce the hard problems and cryptographic applications in this space, and discuss a surprising connection to quantum arithmetic.