Computational hardness of IFP and ECDLP (Q505664): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: gmp / rank | |||
Normal rank | |||
Revision as of 23:17, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational hardness of IFP and ECDLP |
scientific article |
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
