Abstract

Abstract. The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presumed difficulty of solving these problems. This paper considers primarily the integer factorisation problem. In recent years the limits of the best integer factorisation algorithms have been extended greatly, due in part to Moore’s law and in part to algorithmic improvements. It is now routine to factor 100-decimal digit numbers, and feasible to factor numbers of 155 decimal digits (512 bits). We outline several integer factorisation algorithms, consider their suitability for implementation on parallel machines, and give examples of their current capabilities. In particular, we consider the problem of parallel solution of the large, sparse linear systems which arise with the MPQS and NFS methods. 1

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
1813	The Art of Computer Programming - Knuth - 1968
759	A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics - Cohen - 1993
712	Algorithms for Quantum Computation: Discrete Logrithms and Factoring - Shor - 1994
583	Quantum theory, the Church–Turing principle and the universal quantum computer - Deutsch - 1985
432	A classical introduction to modern number theory. 2nd ed - Ireland, Rosen - 1990
226	Quantum computational networks - Deutsch - 1989
199	Factoring integers with elliptic curves - Lenstra - 1987
159	Solution of systems of linear equations by minimized iterations - Lanczos - 1952
143	Solving sparse linear equations over finite fields - Wiedemann - 1986
108	The development of the number field sieve - Lenstra, Lenstra - 1993
89	Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv - Chudnovsky, Chudnovsky
73	Discrete logarithms in finite fields and their cryptographic significance - ODLYZKO - 1985
69	The multiple polynomial quadratic sieve - Silverman - 1987
59	The number field sieve - Lenstra, Lenstra, et al. - 1990
51	Factoring by electronic mail - Lenstra, Manasse - 1989
50	Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer - Shor
49	The quadratic sieve factoring algorithm - Pomerance - 1985
47	The factorization of the ninth Fermat number - Lenstra, Lenstra, et al. - 1994
46	A block Lanczos algorithm for finding dependencies over GF(2 - MONTGOMERY - 1995
45	Lecture notes for physics 229: Quantum information and computation - Preskill
41	Factoring With Two Large Primes - Lenstra, Manasse - 1994
39	Parallel algorithms for integer factorisation", in Number Theory and Cryptography (edited by - Brent - 1990
38	Elliptic curves: Diophantine analysis - Lang
35	Moore's law: Past, present, and future - Schaller - 1997
34	The Future of Integer Factorization - ODLYZKO - 1995
32	The magic words are SQUEAMISH OSSIFRAGE - Atkins, Graff, et al. - 1995
32	A tale of two sieves - Pomerance - 1996
29	A pipeline architecture for factoring large integers with the quadratic sieve algorithm - Pomerance, Smith, et al. - 1988
29	A world wide number field sieve factoring record: On to 512 bits - Cowie, Dodson, et al. - 1996
27	Discrete weighted transforms and large-integer arithmetic - Crandall, Fagin - 1994
22	Discrete logarithms and their cryptographic significance - Odlyzko - 1985
20	Parallel implementation of the quadratic sieve - Caron, Silverman - 1988
18	Square roots of products of algebraic numbers - Montgomery - 1993
18	Prime Numbers and Computer Methods for Factorization (2nd - Riesel - 1994
18	Solving sparse linear equations over - Wiedemann - 1986
15	Large factors found by ECM - Brent - 1995
13	Discrete logarithms in GF(p), Algorithmica 1 - Coppersmith, Odlyzko, et al. - 1986
13	A survey of modern integer factorization algorithms, CWI Quarterly 7 - Montgomery - 1994
12	Vector and parallel algorithms for integer factorisation - Brent - 1990
12	Factoring large integers - Lehman - 1974
12	Factoring with the quadratic sieve on large vector computers,’’ report NM-R8805 - Riele, Lioen, et al. - 1988
11	te Riele, Factoring integers with large prime variations of the quadratic sieve - Boender, J - 1996
11	Parallel algorithms in linear algebra - Brent - 1991
11	Factoring integers with elliptic curves’, Annals of Math., 126 - Lenstra - 1987
10	The Number Field Sieve - Pomerance - 1994
9	editors. The development of the number sieve - Lenstra, Lenstra - 1993
9	Faktorisieren mit dem Number Field Sieve - Zayer - 1995
8	Polynomial selection for the number field sieve integer factorisation algorithm - Murphy - 1999
6	Odlyzko, Solving large sparse systems over finite fields - LaMacchia, M - 1991