Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (Q882779)

From MaRDI portal
Revision as of 09:03, 12 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q271579)
scientific article
Language Label Description Also known as
English
Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
scientific article

    Statements

    Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (English)
    0 references
    0 references
    24 May 2007
    0 references
    Coppersmith's technique
    0 references

    Identifiers