Lecture

Isogeny Graphs: Eigenvalues and Cryptography

Description

This lecture explores isogeny graphs of supersingular elliptic curves with level structure, studying the relationship between the adjacency matrix eigenvalues and a Frobenius on a cohomology group. The lecture shows that the graph is Ramanujan, leading to optimal mixing times for random walks. Applications to cryptography are also presented, based on joint work with Guido Maria Lido.

Official source

https://mediaspace.epfl.ch/media/0_zrgk685p

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Algebra: Linear algebra, Abstract algebra

Discrete mathematics: Graph theory

Number theory: Topics in number theory

Related lectures (55)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.