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.
|
2091
|
A method for obtaining digital signatures and public-key cryptosystems
– Rivest, Shamir, et al.
- 1997
|
|
1516
|
The Art of Computer Programming
– Knuth
- 1968
|
|
540
|
A course in computational algebraic number theory
– Cohen
- 1995
|
|
434
|
Algorithms for quantum computation: discrete log and factoring
– Shor
- 1994
|
|
360
|
Quantum theory, the Church-Turing principle and the universal quantum computer
– Deutsch
- 1985
|
|
169
|
A classical introduction to modern number theory
– Ireland, Rosen
- 1990
|
|
157
|
Factoring integers with elliptic curves
– LENSTRA
- 1957
|
|
139
|
Solution of systems of linear equations by minimized iterations
– Lanczos
- 1952
|
|
134
|
Quantum Computational Networks
– Deutsch
- 1989
|
|
109
|
Solving sparse linear equations over finite fields
– Wiedemann
- 1997
|
|
92
|
eds.), The development of the number field sieve
– Lenstra, Lenstra
- 1993
|
|
70
|
The multiple polynomial quadratic sieve
– Silverman
- 1987
|
|
66
|
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
– Chudnovsky, Chudnovsky
|
|
65
|
Discrete logarithms in finite fields and their cryptographic significance
– ODLYZKO
- 1985
|
|
53
|
The number field sieve
– Lenstra, Lenstra, et al.
- 1990
|
|
46
|
Factoring by electronic mail
– LENSTRA, MANASSE
|
|
43
|
The quadratic sieve factoring algorithm
– Pomerance
- 1984
|
|
42
|
The factorization of the ninth Fermat number
– Lenstra, Lenstra, et al.
- 1993
|
|
41
|
A block Lanczos algorithm for finding dependencies over GF(2),Advances in Cryptology - EUROCRYPT'95
– Montgomery
- 1995
|
|
39
|
Some parallel algorithms for integer factorisation
– Brent
- 1990
|
|
39
|
Factoring with two large primes
– Lenstra, Manasse
- 1994
|
|
33
|
A pipeline architecture for factoring large integers with the quadratic sieve algorithm
– Pomerance, Smith, et al.
- 1988
|
|
31
|
The magic words are squeamish ossifrage
– Atkins, Graff, et al.
- 1995
|
|
30
|
The future of integer factorization
– Odlyzko
- 1995
|
|
30
|
Polynomial Time Algorithms for Prime-Factorisation and Discrete Logarithms on a Quantum Computer
– Shor
|
|
29
|
Moore’s law: Past, present, and future
– Schaller
- 1997
|
|
25
|
Discrete weighted transforms and largeinteger arithmetic
– Crandall, Fagin
- 1994
|
|
24
|
Parallel implementation of the quadratic sieve
– SILVERMAN
|
|
23
|
Discrete logarithms and their cryptographic significance
– Odlyzko
- 1985
|
|
23
|
A tale of two sieves
– Pomerance
- 1996
|
|
22
|
A world wide number field sieve factoring record: on to 512 bits
– Cowie, Dodson, et al.
- 1996
|
|
21
|
Elliptic Curves: Diophantine Analysis
– Lang
- 1978
|
|
20
|
Lecture Notes for Physics 229: Quantum Information and Computation
– Preskill
- 1998
|
|
18
|
Square roots of products of algebraic numbers
– Montgomery
- 1993
|
|
18
|
Solving sparse linear equations over
– Wiedemann
- 1986
|
|
15
|
Vector and parallel algorithms for integer factorisation
– Brent
- 1990
|
|
15
|
Large factors found by ECM
– Brent
- 1995
|
|
14
|
Discrete logarithms in GF(p), Algorithmica 1
– Coppersmith, Odlyzko, et al.
- 1986
|
|
13
|
Parallel algorithms in linear algebra
– Brent
- 1991
|
|
13
|
A survey of modern integer factorization algorithms, CWI Quarterly 7
– Montgomery
- 1994
|
|
12
|
Factoring with the quadratic sieve on large vector computers
– Riele, Lioen, et al.
- 1989
|
|
12
|
Prime Numbers and Computer Methods for Factorization, 2nd edition
– Riesel
- 1994
|
|
11
|
te Riele, Factoring integers with large prime variations of the quadratic sieve
– Boender, J
- 1996
|
|
11
|
Factoring large integers
– Lehman
- 1974
|
|
9
|
editors. The development of the number sieve
– Lenstra, Lenstra
- 1993
|
|
8
|
Faktorisieren mit dem Number Field Sieve
– Zayer
- 1995
|
|
8
|
The number field sieve
– Pomerance
- 1994
|
|
7
|
Polynomial selection for the number field sieve integer factorisation algorithm
– Murphy
- 1999
|
|
6
|
Odlyzko, Solving large sparse systems over finite fields
– LaMacchia, M
- 1991
|
|
6
|
A multiple polynomial general number field sieve Algorithmic Number Theory
– Elkenbracht-Huizing
- 1998
|
|
