A parallel GNFS algorithm based on a reliable look-ahead block lanczos method for integer factorization

Authors:
Laurence T. Yang;Li Xu;Man Lin;John Quinn
Affiliations:
Department of Computer Science and Engineering, Jiangsu Polytechnic University, Changzhou, Jiangsu Province, P.R. China;Department of Computer Science, St. Francis Xavier University, Antigonish, Nova Scotia, Canada;Department of Computer Science, St. Francis Xavier University, Antigonish, Nova Scotia, Canada;Department of Computer Science, St. Francis Xavier University, Antigonish, Nova Scotia, Canada
Venue:
EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
Year:
2006

Citing 7
Cited 1

The quadratic sieve factoring algorithm

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Using MPI: portable parallel programming with the message-passing interface

Using MPI: portable parallel programming with the message-passing interface
Integer Factoring

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
A design for a number theory package with an optimized trial division routine

Communications of the ACM
Computational aspects of discrete logarithms

Computational aspects of discrete logarithms
A block Lanczos algorithm for finding dependencies over GF(2)

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Integer factorization by a parallel GNFS algorithm for public key cryptosystems

ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems

An integrated parallel GNFS algorithm for integer factorization based on Linbox Montgomery block Lanczos method over GF(2)

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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