
Computing endomorphisms of superspecial principally polarized abelian surfaces in time and memory \(p^{4/5+o(1)}\)
Computing endomorphisms of superspecial principally polarized abelian surfaces is a cryptanalysis preprint by Marc Houben and Lam L. Pham, posted to IACR ePrint in October 2026. It gives an algorithm that, under a standard heuristic, finds a non-scalar polarized endomorphism in expected time and memory p^(4/5+o(1)). The abstract is the only text available, so the method and its effect on specific schemes are not described.
TL;DR Presents an algorithm that finds non-scalar polarized endomorphisms of superspecial abelian surfaces in time and memory p^(4/5+o(1)).
Organisations named here
- Lam L. Pham
- Marc Houben
Technologies named here
- Isogeny-based cryptography
Related in other

Rerandomizable Garbling for Arithmetic Circuits

