We give an algorithm for computing an inseparable endomorphism of a supersingular
elliptic curve E defined over F p 2, which, conditional on GRH, runs in expected O (p 1/2 …

Isogeny-based schemes often come with special requirements on the field of definition of the
involved elliptic curves. For instance, the efficiency of SQIsign, a promising candidate in the …

A crucial ingredient for many cryptographic primitives such as key exchange protocols and
advanced signature schemes is a commutative group action where the structure of the …

We investigate the algorithmic problem of computing isomorphisms between products of
supersingular elliptic curves, given their endomorphism rings. This computational problem …

The security of most public-key cryptosystems that are currently deployed rely on the
hardness of the discrete logarithm problem or of the integer factorisation problem. In 1994 …

I come from a generation that grew up with the smartphone. The small gadget has been in
my hand for almost 20 years, and has been my primary source of communication with the …