Cryptology ePrint Archive: Report 2010/657

On small secret key attack against RSA with high bits known prime factor

Yasufumi Hashimoto

Abstract: It is well known that if the higher half bits of a prime factor are known or the secret key is small enough then the RSA cryptosystem is broken (e.g. [Coppersmith, J. Cryptology, 1997] and [Boneh-Durfee, Eurocrypt'99]). Recently, Sarkar-Maitra-Sarkar [Cryptology ePrint Archiv, 2008/315] proposed attacks against RSA under the conditions that the higher bits of a prime factor is known and the secret key is small. In the present paper, we improve their attacks to be effective for larger secret keys.

Category / Keywords: public-key cryptography /

Publication Info: Presented at Short Paper Session in IWSEC2010

Date: received 26 Dec 2010

Contact author: hasimoto at isit or jp

Available formats: PDF | BibTeX Citation

Version: 20101231:142050 (All versions of this report)

Discussion forum: Show discussion | Start new discussion