Expander graphs based on GRH with an application to elliptic curve cryptography
Authors:
- David JaoDJDavid Jao
- Stephen D. MillerSMStephen D. Miller
- Ramarathnam VenkatesanRVRamarathnam Venkatesan
- 1 June 2009
- journal article
- Published by Elsevier in Journal of Number Theory
- Vol. 129 (6) , 1491-1504
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (DMS-0601009)
- Alfred P. Sloan Foundation
- Natural Sciences and Engineering Research Council of Canada (341769-07)
This publication has 17 references indexed in Scilit:
- Explicit bounds for primes in residue classesMathematics of Computation, 1996
- Counting points on elliptic curves over finite fieldsJournal de Théorie des Nombres de Bordeaux, 1995
- Random Cayley graphs and expandersRandom Structures & Algorithms, 1994
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993
- Note on the girth of Ramanujan graphsJournal of Combinatorial Theory, Series B, 1990
- Explicit bounds for primality testing and related problemsMathematics of Computation, 1990
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- Endomorphisms of abelian varieties over finite fieldsInventiones Mathematicae, 1966
- Die Typen der Multiplikatorenringe elliptischer FunktionenkörperAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1941