Name
Abstract | ||
|---|---|---|
Let (N=pq) be an RSA modulus with unknown factorization. The RSA cryptosystem can be attacked by using the key equation (ed-k(p-1)(q-1)=1). Similarly, some variants of RSA, such as RSA combined with singular elliptic curves, LUC and RSA with Gaussian primes can be attacked by using the key equation (ed- kleft( p^2-1right) left( q^2-1right) =1). In this paper, we consider the more general equation (eu-left( p^2-1right) left( q^2-1right) v=w) and present a new attack that finds the prime factors p and q in the case that u, v and w satisfy some specific conditions. The attack is based on Coppersmith’s technique and improves the former attacks. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-10970-7_19 | SAC |
Field | DocType | Citations |
Gaussian integer,Combinatorics,Cryptosystem,Factorization,Prime factor,Mathematics,Elliptic curve,Lattice reduction | Conference | 0 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abderrahmane Nitaj | 1 | 72 | 15.00 |
| Yanbin Pan | 2 | 35 | 13.29 |
| Joseph Tonien | 3 | 8 | 2.68 |