Computational hardness of IFP and ECDLP (Q505664): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94A60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 14G50 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 11Y11 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6678274 / rank
 
Normal rank
Property / zbMATH Keywords
 
IFP
Property / zbMATH Keywords: IFP / rank
 
Normal rank
Property / zbMATH Keywords
 
number field sieve
Property / zbMATH Keywords: number field sieve / rank
 
Normal rank
Property / zbMATH Keywords
 
elliptic curve discrete logarithm problem (ECDLP)
Property / zbMATH Keywords: elliptic curve discrete logarithm problem (ECDLP) / rank
 
Normal rank
Property / zbMATH Keywords
 
Pollard's rho method
Property / zbMATH Keywords: Pollard's rho method / rank
 
Normal rank

Revision as of 02:29, 1 July 2023

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
    0 references
    0 references
    0 references
    0 references
    26 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    IFP
    0 references
    number field sieve
    0 references
    elliptic curve discrete logarithm problem (ECDLP)
    0 references
    Pollard's rho method
    0 references