English

Expander graphs based on GRH with an application to elliptic curve cryptography

Number Theory 2014-02-12 v2 Combinatorics

Abstract

We present a construction of expander graphs obtained from Cayley graphs of narrow ray class groups, whose eigenvalue bounds follow from the Generalized Riemann Hypothesis. Our result implies that the Cayley graph of (Z/qZ)* with respect to small prime generators is an expander. As another application, we show that the graph of small prime degree isogenies between ordinary elliptic curves achieves non-negligible eigenvalue separation, and explain the relationship between the expansion properties of these graphs and the security of the elliptic curve discrete logarithm problem.

Keywords

Cite

@article{arxiv.0811.0647,
  title  = {Expander graphs based on GRH with an application to elliptic curve cryptography},
  author = {David Jao and Stephen D. Miller and Ramarathnam Venkatesan},
  journal= {arXiv preprint arXiv:0811.0647},
  year   = {2014}
}

Comments

24 pages, to appear in the Journal of Number Theory

R2 v1 2026-06-21T11:38:18.199Z