Supersingular Isogeny Graphs in Cryptography (Kristin Lauter)

Ciencias TVMar, diciembre 19, 2017 1:12amURL:
Embed:

Supersingular Isogeny Graphs in Cryptography

Plática dada por Kristin Lauter (Microsoft Research, USA) en la Conferencia Internacional “75 años de matemáticas en México” el miércoles 6 de diciembre de 2017 en el Auditorio Alberto Barajas Celís de la Facultad de Ciencias de la UNAM

Abstract:
Supersingular Isogeny Graphs were proposed for use in Cryptography in 2006 by CharlesGoren-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 surprisin connection to quantum arithmetic.

Video de la plática
https://youtu.be/9kMHJcoMN2Q

Foto de miniatura del video
https://photos.app.goo.gl/1YBPeOB9uTWYRzSu1

Cartel de la Conferencia Internacional “75 años de matemáticas en México”
https://photos.app.goo.gl/W7JGXmTuBjWcAHro1

Página de la Conferencia Internacional “75 años de matemáticas en México”
https://www.75years-im.matem.unam.mx/

Programa de la Conferencia Internacional “75 años de matemáticas en México”
https://www.75years-im.matem.unam.mx/program

Presentaciones de las pláticas
https://www.75years-im.matem.unam.mx/book.pdf

Kristin Lauter en

Wikipedia
https://en.wikipedia.org/wiki/Kristin_Lauter

Microsoft Research
https://www.microsoft.com/en-us/research/people/klauter/

University of Washington
https://math.washington.edu/people/kristin-lauter

ResearchGate
https://www.researchgate.net/profile/Kristin_Lauter

Mathematics Genealogy Project
https://www.genealogy.math.ndsu.nodak.edu/id.php?id=77976