Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (Q882779)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deterministic polynomial-time equivalence of computing the RSA secret key and factoring |
scientific article; zbMATH DE number 5156897
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic polynomial-time equivalence of computing the RSA secret key and factoring |
scientific article; zbMATH DE number 5156897 |
Statements
Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (English)
0 references
24 May 2007
0 references
Coppersmith's technique
0 references
