A Study on Parallel RSA Factorization

The RSA cryptosystem is one of the widely used public key systems. The security of it is based on the intractability of factoring a large composite integer into two component primes, which is referred to as the RSA assumption. So far, the Quadratic Sieve (QS) is the fastest and general-purpose method for factoring composite numbers having less than about 110 digits. In this paper, we present our study on a variant of the QS, i.e., the Multiple Polynomial Quadratic Sieve (MPQS) for simulating the parallel RSA factorization. The parameters of our enhanced methods (such as the size of the factor base and the length of the sieving interval) are benefit to reduce the overall running time and the computation complexity is actually lower. The experimental result shows that it only takes 6.6 days for factoring larger numbers of 100 digits using the enhanced MPQS by 32 workstations.

[1]  Jim Hefferon,et al.  Linear Algebra , 2012 .

[2]  Jeffrey C. Lagarias,et al.  Cryptology and Computational Number Theory , 1997 .

[3]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[4]  J. M. Pollard,et al.  Theorems on factorization and primality testing , 1974, Mathematical Proceedings of the Cambridge Philosophical Society.

[5]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[6]  Ramanujachary Kumanduri,et al.  Number theory with computer applications , 1997 .

[7]  Stephen H. Friedberg,et al.  Linear Algebra , 2018, Computational Mathematics with SageMath.

[8]  Robert D. Silverman.  The multiple polynomial quadratic sieve , 1987 .

[9]  Carl Pomerance,et al.  The Development of the Number Field Sieve , 1994 .

[10]  J. Dixon.  Asymptotically fast factorization of integers , 1981 .

[11]  H. Riesel.  Prime numbers and computer methods for factorization , 1985 .

[12]  Carl Pomerance,et al.  The Quadratic Sieve Factoring Algorithm , 1985, EUROCRYPT.

[13]  O. Bretscher.  Linear Algebra with Applications , 1996 .

[14]  A. K. Lenstra,et al.  The Development of the Number Field Sieve , 1993 .

[15]  William M. Springer.  Review of Cryptography: theory and practice, second edition by Douglas R. Stinson. CRC Press. , 2003, SIGA.

[16]  Peter L. Montgomery,et al.  A Block Lanczos Algorithm for Finding Dependencies Over GF(2) , 1995, EUROCRYPT.

[17]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[18]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[19]  H. Riesel.  Prime numbers and computer methods for factorization (2nd ed.) , 1994 .