Departamento de Computación

Texto completo de la plática           

Resumen

Isogeny-based cryptography is a candidate for quantum-safe cryptography. The security of isogeny-based cryptosystems is based on the difficulty of computing an isogeny of a certain degree between two isogenous supersingular elliptic curves over GF(p^2). (Note that security has nothing to do with hardness of the conventional elliptic curve discrete logarithm problem.) Protocols have been designed for public-key encryption, key agreement and undeniable signatures. In this tutorial, I will describe the basic isogeny-based key agreement scheme, and outline plausible arguments for security of the scheme against attacks by classical and quantum computers.

The tutorial is based on work by David Jao (University of Waterloo) and his colleagues. Attendees will be expected to have a basic background in public-key cryptography, elliptic curve cryptography, and finite fields.