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.
[1]
Arjen K. Lenstra,et al.
Integer Factoring
,
2000,
Encyclopedia of Cryptography and Security.
[2]
Adi Shamir,et al.
A method for obtaining digital signatures and public-key cryptosystems
,
1978,
CACM.
[3]
H. Lenstra,et al.
Factoring integers with the number field sieve
,
1993
.
[4]
Alfred Menezes,et al.
The State of Elliptic Curve Cryptography
,
2000,
Des. Codes Cryptogr..
[5]
Carl Pomerance,et al.
The Quadratic Sieve Factoring Algorithm
,
1985,
EUROCRYPT.
[6]
M. Briggs.
An Introduction to the General Number Field Sieve
,
1998
.
[7]
Arjen K. Lenstra,et al.
The number field sieve
,
1990,
STOC '90.