Computer Science and Information Engineering, World Congress on (2009)

Los Angeles, California USA

Mar. 31, 2009 to Apr. 2, 2009

ISBN: 978-0-7695-3507-4

pp: 125-129

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.890

ABSTRACT

Lattice basis reduction algorithms have contributed a lot to cryptanalysis of RSA systems. A typical application is Boneh-Durfee's seminal work for breaking low private key RSA (and its successors in other applications). Although it's well known that this technique is not guaranteed to succeed, there is no thorough proof yet when it fails. In this paper, we summarize the Boneh-Durfee-like algorithms using generalized terminology. We also show that when the number of solutions in given bounded range is larger than $8(w/3)^7$, where $w$ is the dimension of the lattice involved in the reduction procedure, then the algorithm always fails. As a result, it is proven that MSB (Most Significant Bits)partial key exposure attacks on low public key RSA using this technique is difficult, if we have not sufficient private key exposed.

INDEX TERMS

RSA, cryptanalysis, lattice basis reduction, MSB partial key exposure attacks

CITATION

Daoshun Wang,
Yiqi Dai,
Haijian Zhou,
Ping Luo,
"Remarks on Cryptanalysis of RSA Using Lattice Basis Reduction",

*Computer Science and Information Engineering, World Congress on*, vol. 01, no. , pp. 125-129, 2009, doi:10.1109/CSIE.2009.890