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

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

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},
note = {\url{https://eprint.iacr.org/2010/657}},
url = {https://eprint.iacr.org/2010/657}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.