A generalized attack on RSA type cryptosystems - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2017

A generalized attack on RSA type cryptosystems


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 (p^2 − 1)(q^2 − 1) = 1. In this paper, we consider the general equation ex − (p^2 − 1)(q^2 − 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.
Fichier principal
Vignette du fichier
Generalized_attack_on_RSA_schemesfinal.pdf (355.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02320917 , version 1 (19-10-2019)



Martin Bunder, Abderrahmane Nitaj, Willy Susilo, Joseph Tonien. A generalized attack on RSA type cryptosystems. Theoretical Computer Science, 2017, ⟨10.1016/j.tcs.2017.09.009⟩. ⟨hal-02320917⟩
13 View
273 Download



Gmail Facebook Twitter LinkedIn More