Skip to Main content Skip to Navigation
Journal articles

A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem

Abstract : Let N = pq be an RSA modulus and e be a public exponent. Numerous attacks on RSA exploit the arithmetical properties of the key equation ed − k(p − 1)(q − 1) = 1. In this paper, we study the more general equation eu − (p − s)(q − r)v = w. We show that when the unknown integers u, v, w, r and s are suitably small and p − s or q − r is factorable using the Elliptic Curve Method for factorization ECM, then one can break the RSA system. As an application, we propose an attack on Demytko's elliptic curve cryptosystem. Our method is based on Coppersmith's technique for solving multivariate polynomial modular equations.
Document type :
Journal articles
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Abderrahmane Nitaj Connect in order to contact the contributor
Submitted on : Sunday, October 20, 2019 - 10:30:20 AM
Last modification on : Wednesday, November 3, 2021 - 6:18:45 AM
Long-term archiving on: : Tuesday, January 21, 2020 - 12:59:23 PM


Files produced by the author(s)




Abderrahmane Nitaj, Emmanuel Fouotsa. A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem. Journal of Discrete Mathematical Sciences and Cryptography, non, 2019, ⟨10.1080/09720529.2019.1587827⟩. ⟨hal-02321003⟩



Record views


Files downloads