Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516)

From MaRDI portal
Revision as of 18:35, 30 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
scientific article

    Statements

    title
    Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (English)
    0 references
    author
    Fabrice Boudot
    0 references
    Pierrick Gaudry
    0 references
    Aurore Guillevic
    0 references
    Nadia Heninger
    0 references
    Emmanuel Thomé
    0 references
    Paul Zimmermann
    0 references
    publication date
    9 November 2022
    0 references
    zbMATH Keywords
    factorization of RSA-240
    0 references
    describes a project that uses
    gmp
    0 references
    CADO-NFS
    0 references
    cites work
    Q4273681
    0 references
    Q2739444
    0 references
    Q3139838
    0 references
    Q4325965
    0 references
    Q4273680
    0 references

    Identifiers

    zbMATH DE Number
    7614563
    0 references
    OpenAlex ID
    W3034714558
    0 references
    arXiv ID
    2006.06197
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2096516&oldid=37455432"
    Powered by MediaWiki