Name
Abstract | ||
|---|---|---|
In this paper, we study the problem of factoring an RSA modulus N = pq in polynomial time, when p is a weak prime, that is, p can be expressed as ap = u(0) + M(1)u(1) + ... + M(k)u(k) for some k integers M-1, ... , M-k and k+2 suitably small parameters a, u(0), ... u(k). We further compute a lower bound for the set of weak moduli, that is, moduli made of at least one weak prime, in the interval [2(2n), 2(2(n+1))] and show that this number is much larger than the set of RSA prime factors satisfying Coppersmith's conditions, effectively extending the likelihood for factoring RSA moduli. We also prolong our findings to moduli composed of two weak primes. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-18681-8_29 | CODES, CRYPTOLOGY, AND INFORMATION SECURITY, C2SI 2015 |
Keywords | DocType | Volume |
RSA, Cryptanalysis, Factorization, LLL algorithm, Weak primes | Conference | 9084 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abderrahmane Nitaj | 1 | 72 | 15.00 |
| tajjeeddine rachidi | 2 | 13 | 4.70 |