Publishing upper half of RSA decryption exponent

Authors:
Subhamoy Maitra;Santanu Sarkar;Sourav Sen Gupta
Affiliations:
Applied Statistics Unit, Indian Statistical Institute, Kolkata, India;Applied Statistics Unit, Indian Statistical Institute, Kolkata, India;Applied Statistics Unit, Indian Statistical Institute, Kolkata, India
Venue:
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Year:
2010

Citing 7
Cited 0

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Cryptography: Theory and Practice,Second Edition

Cryptography: Theory and Practice,Second Edition
Speeding Up Secret Computations with Insecure Auxiliary Devices

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Generating RSA Moduli with a Predetermined Portion

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
On the Insecurity of a Server-Aided RSA Protocol

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient CRT-RSA decryption for small encryption exponents

CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Cryptanalysis of RSA with private key d less than N0.292

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the perspective of RSA, given small encryption exponent e (e.g., e = 216 + 1), the top half of the decryption exponent d can be narrowed down within a small search space. This fact has been previously exploited in RSA cryptanalysis. On the contrary, here we propose certain schemes to exploit this fact towards efficient RSA decryption.