Some integer factorization algorithms using elliptic curves (1986)

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

Active Bibliography

41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
17 Factorization of the tenth and eleventh Fermat numbers – Richard P. Brent - 1996
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
20 Recent progress and prospects for integer factorisation algorithms – Richard P. Brent - 2000
9 Order computations in generic groups – Andrew V. Sutherland - 2007
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
22 Factorization Of The Tenth Fermat Number – Richard P. Brent - 1999
2 Integer Factoring – Arjen K. Lenstra - 2000
100 Speeding Up The Computations On An Elliptic Curve Using Addition-Subtraction Chains – François Morain, Jorge Olivos - 1990
4 A parallel extended GCD algorithm – Sidi Mohamed Sedjelmaci - 2008
1 MpNT: A Multi-Precision Number Theory Package. Number-Theoretic . . . – F. L. Tiplea, S. Iftene, I. Goriac, R. M. Gordân, E. Erbiceanu, et al. - 2003
1 Solving Discrete Logarithms in Smooth-Order Groups with CUDA 1 – Ryan Henry, Ian Goldberg
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
1 A GENERIC APPROACH TO SEARCHING FOR JACOBIANS – Andrew V. Sutherland - 2009
Computational Number Theory at CWI in 1970-1994 – H.J.J. te Riele, J. Van De Lune - 1994
19 On the security of RSA padding – Jean-Sebastien Coron, David Naccache, Julien P. Stern - 1999
Codes -- The Guide to Secrecy . . . – Richard A. Mollin
4 Cryptography in Subgroups of Z*_n – Jens Groth - 2005
A New Factorization Method to Factorize RSA Public Key Encryption – B R Ambedkar, S S Bedi