Affiliation:
1. Zhengzhou Information Science and Technology Institute
2. Chinese Academy of Sciences
Abstract
Currently, the best known algorithm for factoring RSA modulus is the General Number Field Sieve. Through the software optimized implementation of GNFS with RSA-768, we extracted nine main calculation components from the lattice sieve. Detail descriptions and comprehensive analysis of the properties about calculation, memory and communication to the nine components were given in this paper, which makes it possible to use of a variety of computing platforms, such as CPU, FPGA, CELL, and GPU etc, to accelerate the realization of GNFS.
Publisher
Trans Tech Publications, Ltd.
Reference11 articles.
1. J.P. Buhler, H.W. Lenstra, Jr.,C. Pomerance. Factoring integers with the number field sieve. LNCS 1554 in Lecture Notes in Mathematics, pp.50-94. Springer-Verlag, (1993).
2. A.K. Lenstra, H.W. Lenstra, Jr. M. S. Manasse, J. M. Pollard. The Factorization of ninth Fermat Number, Math. Comp. 61, (1993).
3. J. M. Pollard. The Lattice Sieve. In Arjen K. Lenstra and Hendrik W. Lenstra, Jr., editors, The development of the number field sieve, number 1554 in Lecture Notes in Mathematics, pp.43-49. Springer-Verlag, (1993).
4. Brian Antony Murphy. Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm. A Thesis submitted for the degree of doctor of philosophy of the Australian National university, July, (1999).
5. S. Cavalla. Strategies filtering in the number field sieve. MAS-R0012 MAY 31, (2000).