Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (Q882779): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NTL / rank | |||
Normal rank | |||
Revision as of 23:31, 29 February 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
24 May 2007
0 references
Coppersmith's technique
0 references
