A. Ali, L. Johnsson, and J. Subhlok, Scheduling FFT Computation on SMP and Multicore Systems, Proceedings of the 21st Annual International Conference on Supercomputing (ICS '07), pp.293-301, 2007.

E. A. Arnold, Modular Algorithms for Computing Gröbner Bases, Journal of Symbolic Computation, vol.35, pp.403-419, 2003.

M. Asadi, A. Brandt, C. Chen, S. Covanov, F. Mansouri et al., Basic Polynomial Algebra Subprograms (BPAS, 2019.

P. Barrett, Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor, Conference on the Theory and Application of Cryptographic Techniques, pp.311-323, 1986.

L. Chen, S. Covanov, D. Mohajerani, and M. Maza, Big Prime Field FFT on the GPU, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, pp.85-92, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01518830

S. Covanov, Putting Fürer Algorithm into practice, 2014.

S. Covanov and E. Thomé, Fast integer multiplication using generalized Fermat primes, Mathematics of Computation, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01108166

X. Dahan, M. Moreno-maza, É. Schost, W. Wu, and Y. Xie, Lifting techniques for triangular decompositions, ISSAC 2005, Proceedings, M. Kauers, pp.108-115, 2005.

A. De, P. Piyush, C. Kurur, R. Saha, and . Saptharishi, Fast integer multiplication using modular arithmetic, STOC, pp.499-506, 2008.

A. De, P. Piyush, C. Kurur, R. Saha, and . Saptharishi, Fast Integer Multiplication Using Modular Arithmetic, SIAM J. Comput, vol.42, pp.685-699, 2013.

F. Franchetti and M. Püschel, FFT (Fast Fourier Transform), Encyclopedia of Parallel Computing, pp.658-671, 2011.

F. Franchetti, Y. Voronenko, and M. Püschel, Tools and techniques for performance -FFT program generation for shared memory: SMP and multicore, Proceedings of the ACM/IEEE SC2006 Conference on High Performance Networking and Computing, p.115, 2006.

M. Fürer, Faster Integer Multiplication, SIAM J. Comput, vol.39, pp.979-1005, 2009.

, GNU MP: The GNU Multiple Precision Arithmetic Library, 2012.

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Faster Polynomial Multiplication over Finite Fields, J. ACM, vol.63, p.52, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01022757

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Even faster integer multiplication, Journal of Complexity, vol.36, pp.1-30, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01022749

D. Harvey, J. Van-der-hoeven, and G. Lecerf, Fast Polynomial Multiplication over F260, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (ISSAC '16), pp.255-262, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01265278

M. Moreno-maza and Y. Xie, FFT-Based Dense Polynomial Arithmetic on Multi-cores, HPCS, vol.5976, pp.378-399, 2009.

L. Meng, Y. Voronenko, J. R. Johnson, M. M. Maza, F. Franchetti et al., Spiral-generated modular FFT algorithms, pp.169-170, 2010.

L. Peter and . Montgomery, Modular multiplication without trial division, Mathematics of computation, vol.44, pp.519-521, 1985.

A. Schönhage and . Volker-strassen, Schnelle Multiplikation großer Zahlen. Computing, vol.7, pp.281-292, 1971.

J. Von-zur-gathen and J. Gerhard, Modern Computer Algebra, 2013.