Expander Properties of Superspecial Isogeny Digraphs with Level Structure
Thomas Decru, Krijn Reijnders
Abstract
Charles, Goren and Lauter proved that the supersingular -isogeny graph is a Ramanujan graph, which is an optimal expander. Jordan and Zaytman argued that this is no longer true in dimension two, but Florit and Smith showed that those graphs exhibit good expansion properties nonetheless. Castryck, Decru and Smith however have pointed out that the higher-dimensional analogue setting should only consider a subset of all edges, namely the paths corresponding to -isogenies, so-called good extensions, instead of all -isogenies in general, which contain bad extensions too. Such bad extensions lead to many small cycles in the graph, which are a cryptographic problem due to collisions and a graph-theoretic nuisance as these superfluous edges counteract part of the expansion properties. Restricting to good extensions makes the resulting graph directed, as outgoing edges now depend on the incoming edge.
We study abelian surfaces with -level structure and -isogeny digraphs restricted to good extensions for concrete small dimensions and degrees . These graphs exhibit excellent expander properties: by our heuristic evidence, they converge to weakly Ramanujan graphs for all primes in dimension 1, and for in dimension 2. Our main conjecture implies that this would still be the case for in dimension 2, but not for any larger in dimension 2, or any in dimension 3 and up. Furthermore, we generalize the work of Florit and Smith from to general primes , by classifying all abelian surfaces with nontrivial automorphism groups and their actions on their maximal isotropic -subgroups.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Related papers
- Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expandersAmitay Kamber, Tali KaufmanSTOC 2022 · 5 citations
- KLPT2: Algebraic Pathfinding in Dimension Two and ApplicationsWouter Castryck, Thomas Decru, Péter Kutas, Abel Laval et al.CRYPTO 2025 · 5 citations
- More Efficient Isogeny Proofs of Knowledge via Canonical Modular PolynomialsThomas den Hollander, Sören Kleine, Marzio Mula, Daniel Slamanig et al.CRYPTO 2025 · 1 citation
- The Supersingular Endomorphism Ring and One Endomorphism Problems are EquivalentAurel Page, Benjamin WesolowskiEUROCRYPT 2024 · 28 citations
- The supersingular isogeny path and endomorphism ring problems are equivalentBenjamin WesolowskiFOCS 2021 · 61 citations
