On reducing factorization to the discrete logarithm problem modulo a composite (Q445245)
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 reducing factorization to the discrete logarithm problem modulo a composite |
scientific article; zbMATH DE number 6072039
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On reducing factorization to the discrete logarithm problem modulo a composite |
scientific article; zbMATH DE number 6072039 |
Statements
On reducing factorization to the discrete logarithm problem modulo a composite (English)
0 references
24 August 2012
0 references
Integer factorization
0 references
discrete logarithm problem modulo a composite
0 references
deterministic subexponential time reduction
0 references
0 references
0.7720372080802917
0 references
0.7681667804718018
0 references
0.7631711959838867
0 references
0.7322055101394653
0 references
