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

Authors:
Laurence T. Yang;Li Xu;Sang-Soo Yeo;Sajid Hussain
Affiliations:
Department of Computer Science, St. Francis Xavier University, Canada and Division of Computer Engineering, Mokwon University, Republic of Korea and Jodrey School of Computer Science, Acadia Unive ...;Department of Computer Science, St. Francis Xavier University, Canada and Division of Computer Engineering, Mokwon University, Republic of Korea and Jodrey School of Computer Science, Acadia Unive ...;Department of Computer Science, St. Francis Xavier University, Canada and Division of Computer Engineering, Mokwon University, Republic of Korea and Jodrey School of Computer Science, Acadia Unive ...;Department of Computer Science, St. Francis Xavier University, Canada and Division of Computer Engineering, Mokwon University, Republic of Korea and Jodrey School of Computer Science, Acadia Unive ...
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 8
Cited 0

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
A design for a number theory package with an optimized trial division routine

Communications of the ACM
Cryptography and Network Security: Principles and Practice

Cryptography and Network Security: Principles and Practice
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
A parallel GNFS algorithm based on a reliable look-ahead block lanczos method for integer factorization

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
A parallel GNFS algorithm with the biorthogonal block lanczos method for integer factorization

ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Integer factorization by a parallel GNFS algorithm for public key cryptosystems

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

Quantified Score

Hi-index	0.09

Visualization

Abstract

Integer factorization is known to be one of the most important and useful methods in number theory and arithmetic. It also has a very close relationship to some algorithms in cryptography such as RSA algorithm. The RSA cryptosystem is one of the most popular and attractive public-key cryptosystems in the world today. Its security is based on the difficulty of integer factorization. Solving a large and sparse linear system over GF(2) is one of the most time consuming steps in most modern integer factorization algorithms including the fastest one, GNFS algorithm. The Montgomery block Lanczos method from Linbox [13] is for solving large and sparse linear systems over finite fields and it can be integrated into the general number field sieve (GNFS) algorithm which is the best known algorithm for factoring large integers over 110 digits. This paper will present an improved Montgomery block Lanczos method integrated with parallel GNFS algorithm. The experimental results show that the improved Montgomery block Lanczos method has a better performance compared with the original method. It can find more solutions or dependencies than the original method with less time complexities. Implementation details and experimental results are provided in this paper as well.