Cryptanalysis of RSA with more than one decryption exponent

Authors:
Santanu Sarkar;Subhamoy Maitra
Affiliations:
Applied Statistics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700 108, India;Applied Statistics Unit, Indian Statistical Institute, 203 B.T. Road, Kolkata 700 108, India
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 1

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
A strategy for finding roots of multivariate polynomials with new applications in attacking RSA variants

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Cryptanalysis of RSA with private key d less than N0.292

IEEE Transactions on Information Theory
Cryptanalysis of short RSA secret exponents

IEEE Transactions on Information Theory

Partial key exposure: generalized framework to attack RSA

INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we analyze the security of the RSA public key cryptosystem where multiple encryption and decryption exponents are considered with the same RSA modulus N. We consider N=pq, where p, q are of the same bit size, i.e., q=2. Our result improves the bound of Howgrave-Graham and Seifert (CQRE 1999) for n=