Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves

ePrint Report: Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves

Benjamin Benčina, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Miha Stopar, Charlotte Weitkämper

Finding isogenies between supersingular elliptic curves is a natural algorithmic problem which is known to be equivalent to computing the curves' endomorphism rings.
When the isogeny is additionally required to have a specific degree $d$, the problem appears to be somewhat different in nature, yet it is also considered a hard problem in isogeny-based cryptography.
Let …

algorithms computing elliptic eprint report natural problem report rings