Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA (Q5756549): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_27 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1488844414 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:37, 19 March 2024
scientific article; zbMATH DE number 5187204
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA |
scientific article; zbMATH DE number 5187204 |
Statements
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA (English)
0 references
4 September 2007
0 references
RSA
0 references
factoring
0 references
LLL algorithm
0 references
