Factoring multi-power RSA moduli with primes sharing least or most significant bits (Q285897): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 11Y05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 94A60 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6582780 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
integer factorization problem | |||
| Property / zbMATH Keywords: integer factorization problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
multi-power RSA | |||
| Property / zbMATH Keywords: multi-power RSA / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Coppersmith's theorem | |||
| Property / zbMATH Keywords: Coppersmith's theorem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
public key cryptography | |||
| Property / zbMATH Keywords: public key cryptography / rank | |||
Normal rank | |||
Revision as of 18:38, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Factoring multi-power RSA moduli with primes sharing least or most significant bits |
scientific article |
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
