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 …

In this paper we study non-trivial self-pairings with cyclic domains that are compatible with
isogenies between elliptic curves oriented by an imaginary quadratic order O. We prove that …

In this paper, we construct the first provably-secure isogeny-based (partially) blind signature
scheme. While at a high level the scheme resembles the Schnorr blind signature, our work …

Abstract The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and
most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a …

Cryptographic group actions are a relaxation of standard cryptographic groups that have
less structure. This lack of structure allows them to be plausibly quantum resistant despite …

We present SCALLOP-HD, a novel group action that builds upon the recent SCALLOP
group action introduced by De Feo, Fouotsa, Kutas, Leroux, Merz, Panny and Wesolowski in …

Abstract Non-Interactive Verifiable Secret Sharing (NI-VSS) is a technique for distributing a
secret among a group of individuals in a verifiable manner, such that shareholders can verify …

Oblivious Pseudorandom Functions (OPRFs) are an elementary building block in
cryptographic and privacy-preserving applications. While there are numerous pre-quantum …

Given two elliptic curves and the degree of an isogeny between them, finding the isogeny is
believed to be a difficult problem—upon which rests the security of nearly any isogeny …

In this short note, we present a simplified (but slower) version Clapoti of Clapotis, whose full
description will appear later. Let 𝐸/𝔽_𝑞 be an elliptic curve with an effective primitive …