Atkin's test: news from the front (1990)

Cached

Download Links

by François Morain
Venue:IN ADVANCES IN CRYPTOLOGY
Citations:2 - 2 self

Documents Related by Co-Citation

7 Elliptic curves – Husem oller, D - 1987
4 Bignum: A portable and efficient package for arbitrary precision arithmetic. Rapport de Recherche 1016 – J-C HERVB, F MORAIN, D SALESIN, B SERPETTE, J VUILLEMIN, P ZIMMERMANN - 1981
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
4 Construction Of Hilbert Class Fields Of Imaginary Quadratic Fields And Dihedral Equations Modulo p – François Morain - 1989
6 A performance analysis of a simple prime-testing algorithm – M C Wunderlich - 1983
13 Elliptic curves and number-theoretic algorithms, in [6 – Hendrik W Lenstra - 1987
26 Implementation of a new primality test – H Cohen, A K Lenstra - 1987
7 Faster primality testing – W Bosma, M-P van der Hulst - 1990
33 Primality testing and Jacobi sums – H Cohen, H W Lenstra - 1984
32 Diophantine Equations with special reference to elliptic curves – J W S Cassels - 1966
107 On distinguishing prime numbers from composite numbers – L M Adleman, C Pomerance, R S Rumely - 1983
69 Almost All Primes Can be Quickly Certified – Shafi Goldwasser, Joe Kilian
162 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
60 The arithmetic of elliptic curves – John T Tate - 1974
170 Elliptic curves over finite fields and the computation of square roots mod p – R Schoof - 1985
233 Factoring Integers with Elliptic Curves – Hendrik W Lenstra - 1987
10 New primality criteria and factorizations of 2 m \Sigma 1 – J Brillhart, D H Lehmer, J L Selfridge - 1975
1 Fran��cois Morain y INRIA, Domaine de Voluceau – Titanic primes J Recr Math
54 Recognizing primes in random polynomial time – L M Adleman, M-D Huang - 1987