Publications of the CADO project
- When e-th roots become easier than factoring , Antoine Joux, David Naccache and Emmanuel Thomé. Proc. ASIACRYPT 2007 , pp 13–28. LNCS 4833. © Springer-Verlag, 2007. available via HAL ;
- Improved Stage 2 to P±1 Factoring Algorithms, Peter-Lawrence Montgomery and Alexander Kruppa. To appear in ANTS 8, 2008. available via HAL ;
- Faster multiplication in GF(2)[x], Richard Brent, Pierrick Gaudry, Emmanuel Thomé and Paul Zimmermann. To appear in ANTS 8, 2008. available via HAL ;
Technical reports
- Factoring Small Integers: An Experimental Comparison, Jérôme Milan. Nov. 2007. available via HAL ;
Last modification: Thu 25 Sep 2008 09:09:02 AM CEST
© 2008– members of the project ; valid XHTML 1.0, valid CSS

