Supersingular Isogeny Graphs in Cryptography

Instituto de Matemáticas, Universidad Nacional Autónoma de México (UNAM), 2017
Desarrollado por Informática Académica
×
Kristin Lauter (Microsoft Research, USA)
Supersingular Isogeny Graphs in Cryptography

Abstract: 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.