A New Method of Constructing a Lattice Basis and Its Applications to Cryptanalyse Short Exponent RSA.pdfVIP

Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2010, Article ID 421348, 11 pages doi:10.1155/2010/421348 Research Article A New Method of Constructing a Lattice Basis and Its Applications to Cryptanalyse Short Exponent RSA Mingqiang Wang and Haifeng Zhang School of Mathemtics, Shandong University, 250100 Jinan, China Correspondence should be addressed to Mingqiang Wang, mqwang71@ Received 10 December 2009; Accepted 22 February 2010 Academic Editor: J. Jiang Copyright q 2010 M. Wang and H. Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. We provide a new method of constructing an optimal lattice. Applying our method to the cryptanalysis of the short exponent RSA, we obtain our results which extend Boneh and Durfee’s work. Our attack methods are based on a generalization to multivariate modular polynomial equation. The results illustrate the fact that one should be careful when using RSA key generation process with special parameters. 1. Introduction The RSA 1 cryptosystem is the most widely used public-key cryptosystem. The modulo N of RSA cryptosystem is the product of two large prime numbers p and q, without loss of generality, we assume that p q. The public exponent e and the secret exponent d satisfy the equation ed ≡ 1 modφ N , 1.1 where φN p − 1q − 1 is Euler’s totient function. In a typical RSA cryptosystem, p and q have approximately the same number of bits and e N . The most basic secu