On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms (Q5459082)
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: On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms |
scientific article; zbMATH DE number 5267551
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8516427278518677
0 references
0.8000972270965576
0 references
0.7870627045631409
0 references
0.7865807414054871
0 references
0.7750943303108215
0 references
