Paper 2025/1361
Exploring Kaneko’s bound: On multi-edges, loops and the diameter of the supersingular $\ell$-isogeny graph
Abstract
We strengthen Kaneko's bound to prove that, away from the $j$-invariant $0$, edges of multiplicity at least three can occur in the supersingular $\ell$-isogeny graph $\mathcal{G}_\ell(p)$ only if the base field's characteristic satisfies $p < 4\ell^3$. Further we prove a diameter bound for $\mathcal{G}_\ell(p)$, while also showing that most vertex pairs have a substantially smaller distance, in the directed case; this bound is then used in conjunction with Kaneko's bound to deduce that the distance of $0$ and $1728$ in $\mathcal{G}_\ell(p)$ is at least one fourth of the graph's diameter if $p \equiv 11 \mathrel{\operatorname{mod}} 12$. We also study other phenomena in $\mathcal{G}_\ell(p)$ with Kaneko's bound and provide data to demonstrate that the resulting bounds are optimal; for one of these bounds we investigate the connection between loop multiplicities in isogeny graphs and the factorization of the `diagonal' classical modular polynomial $\Phi_\ell(X,X)$ in positive characteristic.
Note: Reworked structure of paper to give improvement of Kaneko's bound as separate statement + minor updates (2025-08-24)
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- IsogeniesIsogeny-based cryptographyRamanujan graphs
- Contact author(s)
-
s boscardin @ tue nl
s spindler @ unibw de - History
- 2025-08-24: revised
- 2025-07-25: received
- See all versions
- Short URL
- https://ia.cr/2025/1361
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1361,
author = {Sebastiano Boscardin and Sebastian A. Spindler},
title = {Exploring Kaneko’s bound: On multi-edges, loops and the diameter of the supersingular $\ell$-isogeny graph},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1361},
year = {2025},
url = {https://eprint.iacr.org/2025/1361}
}