Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5120678
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implementing the asymptotically fast version of the elliptic curve primality proving algorithm |
scientific article; zbMATH DE number 5120678 |
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
0.9077725410461426
0 references
0.8658487796783447
0 references
0.8421396017074585
0 references
0.8336269855499268
0 references
0.8322464823722839
0 references
