Reference Database
(references for the Prime Pages)
The Prime Pages

Search Site

How Many?


Prime Curios!
e-mail list

Prime Lists

Submit primes
This is the Prime Pages' interface to our BibTeX database.  Rather than being an exhaustive database, it just lists the references we cite on these pages.  Please let me know of any errors you notice.
References: [ Home | Author index | Key index | Search ]

All items with author Morain (sorted by date)

F. Morain, Atkin's test: news from the front.  In "Advances in Cryptology--EUROCRYPT '89 Proceedings," J. J. Quisquater and J. Vandewalle editors, Springer-Verlag, 1990.  pp. 626-635, MR 91m:11111
F. Morain, Distributed primality proving and the primality of (23539+1)/3.  In "Advances in cryptology---EUROCRYPT '90 (Aarhus, 1990)," Lecture Notes in Comput. Sci. Vol, 473, Springer, 1991.  Berlin, pp. 110--123, MR1102475
A. O. L. Atkin and F. Morain, "Elliptic curves and primality proving," Math. Comp., 61:203 (July 1993) 29--68.  MR 93m:11136
F. Morain, Primality proving using elliptic curves: an update.  In "Algorithmic Number Theory, Third International Symposium, ANTS-III," J. P. Buhler editor, Lecture Notes in Comput. Sci. Vol, 1423, Springer-Verlag, June 1998.  pp. 111--127, MR 2000i:11190
Franke, J., Kleinjung, T., Morain, F. and Wirth, T., Proving the primality of very large numbers with fastECPP.  In "Algorithmic number theory," Lecture Notes in Comput. Sci. Vol, 3076, Springer, Berlin, 2004.  pp. 194--207, ( MR 2137354
J. Franke, T. Kleinjung, F. Morain and T. Wirth, Proving the primality of very large numbers with fastecpp.  In "Algorithmic Number Theory," D. Buell editor, Lecture Notes in Comput. Sci. Vol, 3076, Springer-Verlag, 2004.  pp. 194--207, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 2004, Proceedings.  (
F. Morain, "La primalité en temps polynomial [d'apr\`es Adleman, Huang~; Agrawal, Kayal, Saxena]," Ast\'erisque, 294 (2004) Exp. No. 917, ix, 205--230.  S\'eminaire Bourbaki. Vol. 2002/2003.  (
Prime Pages' Home
Another prime page by Chris K. Caldwell