Failing to Hash into Supersingular Isogeny Graphs
Prof. Jeremy Booher, University of Florida
Abstract: A fundamental cryptographic problem is for two people to agree on a shared secret. Supersingular elliptic curves over finite fields have provided one potential way to do so, and have the advantage that quantum algorithms do not seem to have any advantages over classical algorithms at breaking the resulting cryptographic system. I'll discuss some of the underlying mathematics, and how a bunch of mathematicians failing to find a way to produce random supersingular elliptic curves still produces interesting results.
Tea and refreshments available at 3:00 p.m. in the Assmus Conference Room (CU 212).
