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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00145-006-0433-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101059923 / rank
 
Normal rank

Latest revision as of 02:08, 20 March 2024

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
    0 references
    24 May 2007
    0 references
    Coppersmith's technique
    0 references

    Identifiers