D. Abrahams and A. Gurtovoy, C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond, 2004.

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms. Addison-Wesley series in computer science and information processing, 1974.

R. Alverson, Integer division using reciprocals, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic, pp.186-190, 1991.
DOI : 10.1109/ARITH.1991.145558
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1710

H. G. Baker, Computing A*B (mod N) efficiently in ANSI C, ACM SIGPLAN Notices, vol.27, issue.1, pp.95-98, 1992.
DOI : 10.1145/130722.130735

B. Bank, M. Giusti, J. Heintz, G. Lecerf, G. Matera et al., Degeneracy loci and polynomial equation solving. Accepted for publication to Foundations of Computational Mathematics, 2013.

N. Bardis, A. Drigas, A. Markovskyy, and J. Vrettaros, Accelerated modular multiplication algorithm of large word length numbers with a fixed module, Organizational, Business, and Technological Aspects of the Know ledge Society of Communications in Computer and Information Science, pp.497-505, 2010.

P. Barrett, Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor, Advances in Cryptology ? CRYPTO' 86, pp.311-323, 1987.
DOI : 10.1007/3-540-47721-7_24

D. J. Bernstein, H. Chen, M. Chen, C. Cheng, C. Hsiao et al., The billion-mulmod-per-second PC, SHARCS'09 Special-purpose Hardware for Attacking Cryptographic Systems: 131, 2009.

D. J. Bernstein, T. Chen, C. Cheng, T. Lange, and B. Yang, ECM on Graphics Cards, Advances in Cryptology -EUROCRYPT 2009, pp.483-501, 2009.
DOI : 10.1049/ip-ifs:20055018

J. Berthomieu, G. Lecerf, and G. Quintin, Polynomial root finding over local rings and application to error correcting codes, Applicable Algebra in Engineering, Communication and Computing, vol.69, issue.231, pp.413-443, 2013.
DOI : 10.1007/s00200-013-0200-5
URL : https://hal.archives-ouvertes.fr/hal-00642075

J. Berthomieu, J. Van-der-hoeven, and G. Lecerf, Relaxed algorithms for p-adic numbers, Journal de Th??orie des Nombres de Bordeaux, vol.23, issue.3, pp.541-577, 2011.
DOI : 10.5802/jtnb.777
URL : https://hal.archives-ouvertes.fr/hal-00486680

D. Bini and V. Y. Pan, Polynomial and Matrix Computations: Fundamental Algorithms. Progress in Theoretical Computer Science, 2012.
DOI : 10.1007/978-1-4612-0265-3

W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.3-4235, 1997.
DOI : 10.1006/jsco.1996.0125

A. Bosselaers, R. Govaerts, and J. Vandewalle, Comparison of three modular reduction functions, Advances in Cryptology ? CRYPTO' 93, pp.175-186, 1994.
DOI : 10.1007/3-540-48329-2_16

J. Dumas, T. Gautier, C. Pernet, and B. D. Saunders, LinBox Founding Scope Allocation, Parallel Building Blocks, and Separate Compilation, Mathematical Software ? ICMS 2010, pp.77-83, 2010.
DOI : 10.1007/978-3-642-15582-6_16
URL : https://hal.archives-ouvertes.fr/hal-00506599

J. Dumas, P. Giorgi, and C. Pernet, FFPACK, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.119-126, 2004.
DOI : 10.1145/1005285.1005304
URL : https://hal.archives-ouvertes.fr/hal-00018223

J. Dumas, P. Giorgi, and C. Pernet, Dense Linear Algebra over Word-Size Prime Fields, ACM Transactions on Mathematical Software, vol.35, issue.3, pp.1-1942, 2008.
DOI : 10.1145/1391989.1391992
URL : https://hal.archives-ouvertes.fr/hal-00018223

A. Fog, Instruction tables. Lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD and VIA CPUs, 2012.

A. Fog, Optimizing software in C++. An optimization guide for Windows, Linux and Mac platforms, 2012.

A. Fog, Optimizing subroutines in assembly language. An optimization guide for x86 platforms, 2012.

L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, and P. Zimmermann, MPFR, ACM Transactions on Mathematical Software, vol.33, issue.2, 2007.
DOI : 10.1145/1236463.1236468
URL : https://hal.archives-ouvertes.fr/inria-00103655

M. Frigo and S. G. Johnson, The Design and Implementation of FFTW3, Proc. IEEE, pp.216-231, 2005.
DOI : 10.1109/JPROC.2004.840301

J. Zur-gathen and J. Gerhard, Modern computer algebra, 2003.
DOI : 10.1017/CBO9781139856065

G. and T. Gnu-compiler-collection, Software available at http://gcc.gnu.org, from, 1987.

K. Geddes, G. Gonnet, and M. , Maple (TM), 1980.

P. Giorgi, . Th, A. Izard, B. Tisserand, F. Chapman et al., Comparison of modular arithmetic algorithms on GPUs, Parallel Computing: From Multicores and GPU's to Petascale of Advances in Parallel Computing, pp.315-322, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00424288

P. Giorgi and R. Lebreton, Online order basis algorithm and its impact on the block Wiedemann algorithm, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, 2014.
DOI : 10.1145/2608628.2608647
URL : https://hal.archives-ouvertes.fr/lirmm-01232873

T. Granlund, GMP, the GNU multiple precision arithmetic library, from 1991. Software available at http://gmplib

T. Granlund and P. L. Montgomery, Division by invariant integers using multiplication, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation , PLDI '94, pp.61-72, 1994.

S. Anisul-haque and M. M. Maza, Plain Polynomial Arithmetic on GPU, Journal of Physics: Conference Series, vol.385, issue.1, p.12014, 2012.
DOI : 10.1088/1742-6596/385/1/012014

W. Hart, F. The, and . Team, FLINT: Fast Library for Number Theory, from, 2008.

W. Hart and . Team, MPIR, Multiple Precision Integers and Rationals, from 2010

D. Harvey, A cache-friendly truncated FFT, Theoretical Computer Science, vol.410, issue.27-29, pp.27-292649, 2009.
DOI : 10.1016/j.tcs.2009.03.014

D. Harvey and D. S. Roche, An in-place truncated fourier transform and applications to polynomial multiplication, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.325-329, 2010.
DOI : 10.1145/1837934.1837996

D. Harvey and A. V. Sutherland, Computing Hasse?Witt matrices of hyperelliptic curves in average polynomial time, Algorithmic Number Theory 11th International Symposium (ANTS XI), 2014.

W. Hasenplaugh, G. Gaubatz, and V. Gopal, Fast Modular Reduction, 18th IEEE Symposium on Computer Arithmetic (ARITH '07)
DOI : 10.1109/ARITH.2007.18

J. Van-der-hoeven, The truncated fourier transform and applications, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, pp.290-296, 2004.
DOI : 10.1145/1005285.1005327

J. Van-der-hoeven and G. Lecerf, Interfacing mathemagix with C++, Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pp.363-370, 2013.
DOI : 10.1145/2465506.2465511
URL : https://hal.archives-ouvertes.fr/hal-00771214

J. Van-der-hoeven and G. Lecerf, Mathemagix User Guide, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00785549

J. Van-der-hoeven and G. Lecerf, On the bit-complexity of sparse polynomial and series multiplication, Journal of Symbolic Computation, vol.50, pp.227-254, 2013.
DOI : 10.1016/j.jsc.2012.06.004
URL : https://hal.archives-ouvertes.fr/hal-00476223

J. Van-der-ho-even, G. Lecerf, B. Mourain, . Ph, J. Trébuchet et al., Mathemagix, the quest of modularity and efficiency for symbolic and certified numeric computation, Section "ISSAC 2011 Software Demonstrations, pp.166-188, 2011.

Ç. and K. Koç, Montgomery reduction with even modulus, IEE Proceedings -Computers and Digital Techniques, pp.314-316, 1994.
DOI : 10.1049/ip-cdt:19941291

Ç. Kaya-koç, T. Acar, J. Kaliski, and B. S. , Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro, vol.16, issue.3, pp.26-33, 1996.
DOI : 10.1109/40.502403

D. E. Knuth, The Art of Computer Programming, 1997.

G. Lecerf, Mathemagix: Towards Large Scale Programming for Symbolic and Certified Numeric Computations, Mathematical Software -ICMS 2010, Third International Congress on Mathematical Software, pp.329-332, 2010.
DOI : 10.1007/978-3-642-15582-6_52

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

M. , M. Maza, and Y. Xie, FFT-Based Dense Polynomial Arithmetic on Multi-cores, High Performance Computing Systems and Applications, pp.378-399, 2010.

N. Nedjah and L. De-macedo-mourelle, A review of modular multiplication methods and respective hardware implementations, Informatica, vol.30, issue.1, pp.111-129, 2006.

J. M. Pollard, The fast Fourier transform in a finite field, Mathematics of Computation, vol.25, issue.114, pp.365-374, 1971.
DOI : 10.1090/S0025-5718-1971-0301966-0

G. Van-rossum and J. De-boer, Interactively testing remote servers using the Python programming language, CWI Quarterly, vol.4, issue.4, pp.283-303, 1991.

M. J. Schulte, J. Omar, E. E. Jr, and . Swartzlander, Optimale Anfangsn??herungen f??r den Newton-Raphson Divisionsalgorithmus, Computing, vol.10, issue.3-4, pp.3-4233, 1994.
DOI : 10.1007/BF02307376

V. Shoup, NTL: A Library for doing Number Theory , 2014. Software, version 6

W. A. Stein, The Sage Development Team, from, Sage Mathematics Software, 2004.

E. Thomé, Théorie algorithmique des nombres et applications à la cryptanalyse de primitives cryptographiques