Computational hardness of IFP and ECDLP (Q505664): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00200-016-0291-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00200-016-0291-X / rank | |||
Normal rank | |||
Revision as of 03:03, 9 December 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
0 references
0 references
0 references
