2004
- Franke, J., Kleinjung, T., Morain, F., and Wirth, T.
Proving the primality of very large numbers with fastecpp.
In Algorithmic Number Theory (2004), D. Buell, Ed., vol. 3076
of Lecture Notes in Comput. Sci., Springer-Verlag, pp. 194-207.
6th International Symposium, ANTS-VI, Burlington, VT, USA, June 2004,
Proceedings.
[ bib |
Springer | pdf]
- Morain, F.
La primalité en temps polynomial [d'après Adleman, Huang ;
Agrawal, Kayal, Saxena].
Astérisque (2004), Exp. No. 917, ix, 205-230.
Séminaire Bourbaki. Vol. 2002/2003.
[ bib |
.pdf |
.ps.gz ]