Some integer factorization algorithms using elliptic curves (1986)

by Richard P. Brent
Venue:Australian Computer Science Communications
Citations:41 - 13 self

Documents Related by Co-Citation

199 Factoring integers with elliptic curves – H W Lenstra - 1987
89 Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv – D V Chudnovsky, G V Chudnovsky
14 Massively parallel elliptic curve factoring – Brandon Dixon, Arjen K Lenstra - 1993
51 Factoring by electronic mail – Arjen K. Lenstra, Mark S. Manasse - 1990
149 Speeding the Pollard and elliptic curve methods of factorization – P L Montgomery - 1987
47 The factorization of the ninth Fermat number – A K Lenstra, H W Lenstra, M S Manasse, J Pollard - 1994
27 Discrete weighted transforms and large-integer arithmetic – Richard Crandall, Barry Fagin - 1994
19 Factorisation of the eleventh Fermat number (preliminary report – R P Brent - 1989
34 Factorization of the eighth Fermat number – Richard P Brent, John M Pollard
2506 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
18 Factorizations of b n \Sigma 1 for b – J Brillhart, D H Lehmer, J L Selfridge, B Tuckerman, S S Wagstaff - 1983
39 An Improved Monte Carlo Factorization Algorithm – Richard P Brent - 1980
19 Factorization Of The Tenth Fermat Number – Richard P. Brent - 1999
39 Parallel Algorithms for Integer Factorisation – Richard P. Brent
10 Projects in scientific computation – R E Crandall - 1994
7 The twenty-second Fermat number is composite – Richard E. Crandall, Ernst W. Mayer, Jason, S. Papadopoulos - 1995
4 New factors of Fermat numbers – G B Gostin - 1995
4 Two new factors of Fermat numbers – J C Hallyburton, H Brillhart - 1975
6 Factors of Fermat Numbers and Large Primes of the Form k2 n + 1 – Wilfrid Keller - 1983