Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? (Q5451062)
From MaRDI portal
scientific article; zbMATH DE number 5250405
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? |
scientific article; zbMATH DE number 5250405 |
Statements
Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? (English)
0 references
18 March 2008
0 references
random reducibility
0 references
discrete log
0 references
elliptic curves
0 references
isogenies
0 references
modular forms
0 references
\(L\)-functions
0 references
generalized Riemann hypothesis
0 references
Ramanujan graphs
0 references
expanders
0 references
rapid mixing
0 references
