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

Yasufumi Hashimoto

Paper 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Presented at Short Paper Session in IWSEC2010
Contact author(s): hasimoto @ isit or jp
History: 2010-12-31: received
Short URL: https://ia.cr/2010/657
License: CC BY

BibTeX

@misc{cryptoeprint:2010/657,
      author = {Yasufumi Hashimoto},
      title = {On small secret key attack against {RSA} with high bits known prime factor},
      howpublished = {Cryptology {ePrint} Archive, Paper 2010/657},
      year = {2010},
      url = {https://eprint.iacr.org/2010/657}
}