Computational hardness of IFP and ECDLP (Q505664): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00200-016-0291-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2327995849 / rank | |||
Normal rank | |||
Revision as of 23:51, 19 March 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
