Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log? (Q5451062): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1534385083 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0411378 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:20, 20 April 2024
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
