Automorphisms and isogeny graphs of abelian varieties, with applications to the superspecial Richelot isogeny graph
Enric Florit (UB), Benjamin Smith (GRACE)

TL;DR
This paper explores the structure and properties of isogeny graphs of abelian varieties, focusing on superspecial abelian surfaces, to enhance understanding of cryptographic security and graph connectivity.
Contribution
It provides theoretical and experimental insights into the spectral, statistical, and connectivity properties of (2, 2)-isogeny graphs of superspecial abelian surfaces, including automorphism effects.
Findings
Stationary distributions for random walks are characterized.
Bounds on eigenvalues and diameters of the graphs are established.
Connectivity of the Jacobian subgraph is proven.
Abstract
We investigate special structures due to automorphisms in isogeny graphs of principally polarized abelian varieties, and abelian surfaces in particular. We give theoretical and experimental results on the spectral and statistical properties of (2, 2)-isogeny graphs of superspecial abelian surfaces, including stationary distributions for random walks, bounds on eigenvalues and diameters, and a proof of the connectivity of the Jacobian subgraph of the (2, 2)-isogeny graph. Our results improve our understanding of the performance and security of some recently-proposed cryptosystems, and are also a concrete step towards a better understanding of general superspecial isogeny graphs in arbitrary dimension.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Cryptographic Implementations and Security · Coding theory and cryptography
