On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms (Q5459082): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/11935230_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1543878229 / rank | |||
Normal rank | |||
Latest revision as of 18:12, 19 March 2024
scientific article; zbMATH DE number 5267551
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms |
scientific article; zbMATH DE number 5267551 |
Statements
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms (English)
0 references
24 April 2008
0 references
Computational Equivalence
0 references
RSA Problem
0 references
Factorization Problem
0 references
Generic Algorithms
0 references
