Integer factorization by a parallel GNFS algorithm for public key cryptosystems

Authors:
Laurence Tianruo Yang;Li Xu;Man Lin
Affiliations:
Department of Computer Science, St. Francis Xavier University, Antigonish, NS, Canada;Department of Computer Science, St. Francis Xavier University, Antigonish, NS, Canada;Department of Computer Science, St. Francis Xavier University, Antigonish, NS, Canada
Venue:
ICESS'05 Proceedings of the Second international conference on Embedded Software and Systems
Year:
2005

Citing 4
Cited 5

The quadratic sieve factoring algorithm

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Integer Factoring

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
The State of Elliptic Curve Cryptography

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography

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

Computers & Mathematics with Applications
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
Integrating the enriched feature with machine learning algorithms for human movement and fall detection

The Journal of Supercomputing
Parallel Training of An Improved Neural Network for Text Categorization

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

RSA is a very popular public key cryptosystem for encryption and authentication. The security of RSA mainly relies on the difficulty of factoring large integers. Recent advancement in factoring algorithms have made it possible to factor integers with 150-digits or more. The General Number Field Sieve algorithm (GNFS) is currently the best known method for factoring large numbers over 110 digits. Although the GNFS algorithm is efficient, it still takes a long time to factor a large integer such as an integer with 150-digits or larger. In this paper, we present a parallel GNFS implementation on a SUN-cluster. It can successfully factor integers up to 116 digits very quickly. The experimental results have demonstrated that the algorithm achieves good speedup and can be used for further larger integer factorization.