Name
Abstract | ||
|---|---|---|
Let N=pq be an RSA modulus with unknown factorization. Some variants of the RSA cryptosystem, such as LUC, RSA with Gaussian primes and RSA type schemes based on singular elliptic curves use a public key e and a private key d satisfying an equation of the form ed−k(p2−1)(q2−1)=1. In this paper, we consider the general equation ex−(p2−1)(q2−1)y=z and present a new attack that finds the prime factors p and q in the case that x, y and z satisfy a specific condition. The attack combines the continued fraction algorithm and Coppersmith's technique and can be seen as a generalization of the attacks of Wiener and Blömer–May on RSA. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2017.09.009 | Theoretical Computer Science |
Keywords | DocType | Volume |
RSA,Elliptic curves,Continued fractions,Coppersmith's technique | Journal | 704 |
Issue | ISSN | Citations |
C | 0304-3975 | 2 |
PageRank | References | Authors |
0.47 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin W. Bunder | 1 | 64 | 16.78 |
| Abderrahmane Nitaj | 2 | 72 | 15.00 |
| Willy Susilo | 3 | 4823 | 353.18 |
| Dongvu Tonien | 4 | 84 | 9.91 |