Documents Related by Co-Citation

41 Some integer factorization algorithms using elliptic curves – Richard P. Brent - 1986
39 An Improved Monte Carlo Factorization Algorithm – Richard P Brent - 1980
47 The factorization of the ninth Fermat number – A K Lenstra, H W Lenstra, M S Manasse, J Pollard - 1994
29 A pipeline architecture for factoring large integers with the quadratic sieve algorithm – C Pomerance, J W Smith, R Tuler - 1988
2057 Handbook of Applied Cryptography – Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest - 1997
108 The development of the number field sieve – A K Lenstra, H W Lenstra - 1993
51 Factoring by electronic mail – Arjen K. Lenstra, Mark S. Manasse - 1990
69 The multiple polynomial quadratic sieve – R D Silverman - 1987
37 Speeding Up Pollard's Rho Method For Computing Discrete Logarithms – Edlyn Teske - 1998
124 Parallel Collision Search with Cryptanalytic Applications – Paul C. Van Oorschot, Michael J. Wiener - 1996
193 Monte Carlo methods for index computation (mod p – J M Pollard - 1978
61 Theorems of factorization and primality testing – John M Pollard - 1974
20 Parallel implementation of the quadratic sieve – T R Caron, R D Silverman - 1988
8 An implementation of the elliptic curve integer factorization method, chapter 9 – W Bosma, A K Lenstra - 1995
34 Factorization of the eighth Fermat number – Richard P Brent, John M Pollard
144 Solving sparse linear equations over finite fields – Douglas H Wiedemann - 1986
46 A block Lanczos algorithm for finding dependencies over GF(2 – P L MONTGOMERY - 1995
19 Factorisation of the eleventh Fermat number (preliminary report – R P Brent - 1989
27 Discrete weighted transforms and large-integer arithmetic – Richard Crandall, Barry Fagin - 1994