A Parallel GNFS Algorithm Based on a Reliable Look-Ahead Block Lanczos Method for Integer Factorization

  • Laurence T. Yang
  • Li Xu
  • Man Lin
  • John Quinn
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4096)


The Rivest-Shamir-Adleman (RSA) algorithm is a very popular and secure public key cryptosystem, but its security relies on the difficulty of factoring large integers. The General Number Field Sieve (GNFS) algorithm is currently the best known method for factoring large integers over 110 digits. Our previous work on the parallel GNFS algorithm, which integrated the Montgomery’s block Lanczos method to solve large and sparse linear systems over GF(2), is less reliable. In this paper, we have successfully implemented and integrated the parallel General Number Field Sieve (GNFS) algorithm with the new look-ahead block Lanczos method for solving large and sparse linear systems generated by the GNFS algorithm. This new look-ahead block Lanczos method is based on the look-ahead technique, which is more reliable, avoiding the break-down of the algorithm due to the domain of GF(2). The algorithm can find more dependencies than Montgomery’s block Lanczos method with less iterations. The detailed experimental results on a SUN cluster will be presented in this paper as well.


Total Execution Time Lanczos Method Sparse Linear System Integer Factorization Slave Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Briggs, M.E.: An introduction to the general number field sieve. Master’s thesis, Virginia Polytechnic Institute and State University (1998)Google Scholar
  2. 2.
    Case, M.: A beginner’s guide to the general number field sieve. Oregon State University, ECE575 Data Security and Cryptography Project (2003)Google Scholar
  3. 3.
    Dreibellbis, J.: Implementing the general number field sieve, 5–14 (June 2003)Google Scholar
  4. 4.
    Granlund, T.: The GNU Multiple Precision Arithmetic Library. TMG Datakonsult, Boston, MA, USA, 2.0.2 edition (June 1996)Google Scholar
  5. 5.
    Gropp, W., Lusk, E., Skjellum, A.: Using MPI: Portable Parallel Programming with the Message-Passing Interface. MIT Press, Cambridge (1994)Google Scholar
  6. 6.
    Gutknecht, M.H.: Block krylov space methods for linear systems with multiple right-hand sides. In: The Joint Workshop on Computational Chemistry and Numerical Analysis (CCNA 2005), Tokyo (December 2005)Google Scholar
  7. 7.
    Gutknecht, M.H., Schmelzer, T.: A QR-decomposition of block tridiagonal matrices generated by the block lanczos process. In: Proceedings IMACS World Congress, Paris (July 2005)Google Scholar
  8. 8.
    Hovinen, B.: Blocked lanczos-style algorithms over small finite fields. Master Thesis of Mathematics, University of Waterloo, Canada (2004)Google Scholar
  9. 9.
    Lambert, R.: Computational Aspects of Discrete Logarithms. PhD thesis, University of Waterloo (1996)Google Scholar
  10. 10.
    Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. Journal of Research of the National Bureau of Standards 45, 255–282 (1950)MathSciNetGoogle Scholar
  11. 11.
    Lanczos, C.: Solutions of linread equations by minimized iterations. Journal of Research of the National Bureau of Standards 49, 33–53 (1952)MathSciNetGoogle Scholar
  12. 12.
    Lenstra, A.K.: Integer factoring. Designs, Codes and Cryptography 19(2-3), 101–128 (2000)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Lenstra, H.W.: Factoring integers with elliptic curves. Annals of Mathematics (2) 126, 649–673 (1987)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Lenstra, H.W., Pomerance, C., Buhler, J.P.: Factoring integers with the number field sieve. In: The Development of the Number Field Sieve, New York. Lecture Notes in Mathematics, vol. 1554, pp. 50–94. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  15. 15.
    Monico, C.: General number field sieve documentation. GGNFS Documentation (November 2004)Google Scholar
  16. 16.
    Montgomery, P.L.: A block lanczos algorithm for finding dependencies over gf(2). In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 106–120. Springer, Heidelberg (1995)Google Scholar
  17. 17.
  18. 18.
    Parlett, B.N., Taylor, D.R., Liu, Z.A.: A look-ahead lanczos algorithm for unsymetric matrics. Mathematics of Computation 44, 105–124 (1985)MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Pollard, J.M.: Theorems on factorization and primality testing. In: Proceedings of the Cambridge Philosophical Society, pp. 521–528 (1974)Google Scholar
  20. 20.
    Pomerance, C.: The quadratic sieve factoring algorithm. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 169–182. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  21. 21.
    Rivest, R.L., Shamir, A., Adelman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Technical Report MIT/LCS/TM-82 (1977)Google Scholar
  22. 22.
    Wunderlich, M.C., Selfridge, J.L.: A design for a number theory package with an optimized trial division routine. Communications of ACM 17(5), 272–276 (1974)MATHCrossRefGoogle Scholar
  23. 23.
    Xu, L., Yang, L.T., Lin, M.: Parallel general number field sieve method for integer factorization. In: Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2005), Las Vegas, USA, June 2005, pp. 1017–1023 (2005)Google Scholar
  24. 24.
    Yang, L.T., Xu, L., Lin, M.: Integer factorization by a parallel gnfs algorithm for public key cryptosystem. In: Yang, L.T., Zhou, X.-s., Zhao, W., Wu, Z., Zhu, Y., Lin, M. (eds.) ICESS 2005. LNCS, vol. 3820, pp. 683–695. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Laurence T. Yang
    • 1
    • 2
  • Li Xu
    • 2
  • Man Lin
    • 2
  • John Quinn
    • 2
  1. 1.Department of Computer Science and EngineeringJiangsu Polytechnic UniversityChangzhouP.R. China
  2. 2.Department of Computer ScienceSt. Francis Xavier UniversityAntigonishCanada

Personalised recommendations