A Generalized Attack on Some Variants of the RSA Cryptosystem - Archive ouverte HAL Access content directly
Conference Papers Year :

A Generalized Attack on Some Variants of the RSA Cryptosystem

(1) , , (2)
1
2
Yanbin Pan
  • Function : Author
Joseph Tonien
  • Function : Author
  • PersonId : 1056333

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

Dates and versions

hal-02321006 , version 1 (20-10-2019)

Identifiers

Cite

Abderrahmane Nitaj, Yanbin Pan, Joseph Tonien. A Generalized Attack on Some Variants of the RSA Cryptosystem. 25th International Conference on Selected Areas in Cryptography SAC 2018, 2018, Calgary, Canada. ⟨10.1007/978-3-030-10970-7_19⟩. ⟨hal-02321006⟩
22 View
609 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More