Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:36, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Implementing the asymptotically fast version of the elliptic curve primality proving algorithm |
scientific article |
Statements
Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (English)
0 references
2 February 2007
0 references
primality proving
0 references
ECPP algorithm
0 references
complex multiplication
0 references
computational complexity
0 references
