Deterministic polynomial-time equivalence of computing the RSA secret key and factoring (Q882779): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Jean-Sébastien Coron / rank | |||
| Property / author | |||
| Property / author: Jean-Sébastien Coron / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NTL / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
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
24 May 2007
0 references
Coppersmith's technique
0 references
