Quantum computing (QC) is an emerging paradigm with the potential to offer significant
computational advantage over conventional classical computing by exploiting quantum …

We present two new Verifiable Delay Functions (VDF) based on assumptions from elliptic
curve cryptography. We discuss both the advantages and drawbacks of our constructions …

We prove that the path-finding problem in isogeny graphs and the endomorphism ring
problem for supersingular elliptic curves are equivalent under reductions of polynomial …

In this paper, we study several related computational problems for supersingular elliptic
curves, their isogeny graphs, and their endomorphism rings. We prove reductions between …

These lectures notes were written for a summer school on Mathematics for post-quantum
cryptography in Thi\es, Senegal. They try to provide a guide for Masters' students to get …

SIDH is a post-quantum key exchange algorithm based on the presumed difficulty of finding
isogenies between supersingular elliptic curves. However, SIDH and related cryptosystems …

We introduce a special class of supersingular curves over 𝔽 p 2, characterized by the
existence of noninteger endomorphisms of small degree. We prove a number of properties …

The SIDH key exchange is the main building block of SIKE, the only isogeny based scheme
involved in the NIST standardization process. In 2016, Galbraith et al. presented an adaptive …

We present signature schemes whose security relies on computational assumptions relating
to isogeny graphs of supersingular elliptic curves. We give two schemes, both of them based …

An oblivious pseudorandom function, or OPRF, is an important primitive that is used to build
many advanced cryptographic protocols. Despite its relevance, very few post-quantum …