Factoring multi-power RSA moduli with primes sharing least or most significant bits (Q285897)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6582780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factoring multi-power RSA moduli with primes sharing least or most significant bits |
scientific article; zbMATH DE number 6582780 |
Statements
Factoring multi-power RSA moduli with primes sharing least or most significant bits (English)
0 references
19 May 2016
0 references
integer factorization problem
0 references
multi-power RSA
0 references
Coppersmith's theorem
0 references
public key cryptography
0 references
0.8898090720176697
0 references
0.8568570017814636
0 references
0.8511387705802917
0 references
0.8376538753509521
0 references
0.8304859399795532
0 references
