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

DOI10.1007/11593447_2zbMath1154.94401arXivmath/0411378OpenAlexW1534385083MaRDI 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\)-functionsgeneralized Riemann hypothesismodular formsexpandersisogeniesRamanujan graphsrapid mixingrandom reducibilitydiscrete log

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (15)

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

This page was built for publication: Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?