Computational hardness of IFP and ECDLP (Q505664)

From MaRDI portal
Revision as of 07:54, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Computational hardness of IFP and ECDLP
scientific article

    Statements

    title
    Computational hardness of IFP and ECDLP (English)
    0 references
    author
    Masaya Yasuda
    0 references
    Takeshi Shimoyama
    0 references
    Jun Kogure
    0 references
    Tetsuya Izu
    0 references
    publication date
    26 January 2017
    0 references
    zbMATH Keywords
    IFP
    0 references
    number field sieve
    0 references
    elliptic curve discrete logarithm problem (ECDLP)
    0 references
    Pollard's rho method
    0 references
    describes a project that uses
    gmp
    0 references
    CAIRN 2
    0 references
    cites work
    Q4265362
    0 references
    Q4217446
    0 references
    Q4902135
    0 references
    Q4826108
    0 references
    Q4273679
    0 references
    Q4502755
    0 references
    Q3840196
    0 references
    Q4250816
    0 references

    Identifiers

    Mathematics Subject Classification ID
    94A60
    0 references
    14G50
    0 references
    11Y11
    0 references
    zbMATH DE Number
    6678274
    0 references
    OpenAlex ID
    W2327995849
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q505664&oldid=36302533"
    Powered by MediaWiki