Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0502097 / rank | |||
Normal rank | |||
Revision as of 16:29, 19 April 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
