Implementing the asymptotically fast version of the elliptic curve primality proving algorithm (Q3420443): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56059199, #quickstatements; #temporary_batch_1721940658196 |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060377935 / rank | |||
Normal rank | |||
Latest revision as of 08:30, 30 July 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
