Computational hardness of IFP and ECDLP (Q505664)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational hardness of IFP and ECDLP |
scientific article; zbMATH DE number 6678274
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational hardness of IFP and ECDLP |
scientific article; zbMATH DE number 6678274 |
Statements
Computational hardness of IFP and ECDLP (English)
0 references
26 January 2017
0 references
IFP
0 references
number field sieve
0 references
elliptic curve discrete logarithm problem (ECDLP)
0 references
Pollard's rho method
0 references
0 references
0 references
0 references
0.9212946891784668
0 references
0.7611948251724243
0 references
0.7571886777877808
0 references
