Description
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept implementation of an algorithm to compute endomorphisms of elliptic curves by solving the splitting problem. This is joint work with Sabrina Kunzweiler.
Practical infos
Next sessions
-
TBA
Speaker : Anmoal Porwal - Technical University of Munich
-
Cryptography
-
Asymmetric primitive
-