Cryptanalysis of common prime RSA with two decryption exponents: Jochemsz and May approach
by Santosh Kumar Ravva; Sureddi R.M. Krishna
International Journal of Information and Computer Security (IJICS), Vol. 22, No. 3/4, 2023

Abstract: RSA is a well-known public key cryptosystem in modern-day cryptography. Common prime RSA (CP-RSA) is a variant of RSA which is introduced by Wiener to avoid the small secret exponent attack on RSA. Lattice-based reduction algorithms were successfully used for cryptanalysis for RSA and its variants. In this paper, we mount an attack on CP-RSA by following the Jochemsz and May approach. Jochemsz and May approach is the standard way to construct the lattices for the attacks on RSA and its variants. Our attack improves the bounds of attacks on standard RSA and CP-RSA.

Online publication date: Tue, 09-Jan-2024

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Computer Security (IJICS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com