Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?

DOI10.1007/11593447_2zbMath1154.94401arXivmath/0411378MaRDI QIDQ5451062

David D. W. Yao, Stephen D. Miller, Ramarathnam Venkatesan

Publication date: 18 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0411378

zbMATH Keywords

elliptic curves; \(L\)-functions; generalized Riemann hypothesis; modular forms; expanders; isogenies; Ramanujan graphs; rapid mixing; random reducibility; discrete log

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

Related Items

A Subexponential Algorithm for Evaluating Large Degree Isogenies, Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\), Identification protocols and signature schemes based on supersingular isogeny problems, Improved algorithm for the isogeny problem for ordinary elliptic curves, Isogeny graphs of ordinary abelian varieties, Recent progress on the elliptic curve discrete logarithm problem, Expander graphs based on GRH with an application to elliptic curve cryptography, Avoiding side-channel attacks by computing isogenous and isomorphic elliptic curves, Isolated elliptic curves and the MOV attack, Isogenies on twisted Hessian curves, Elliptic curve cryptography: the serpentine course of a paradigm shift, Computing the endomorphism ring of an ordinary elliptic curve over a finite field, Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves, Ramanujan Graphs in Cryptography, Fast algorithms for computing isogenies between elliptic curves