R. Agarwal and C. Burrus, Fast Convolution using fermat number transforms with applications to digital filtering, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.22, issue.2, pp.87-97, 1974.
DOI : 10.1109/TASSP.1974.1162555

E. A. Arnold, Modular algorithms for computing Gr??bner bases, Journal of Symbolic Computation, vol.35, issue.4, pp.403-419, 2003.
DOI : 10.1016/S0747-7171(02)00140-2
URL : http://doi.org/10.1016/s0747-7171(02)00140-2

C. Chen, S. Covanov, F. Mansouri, M. Moreno-maza, N. Xie et al., The basic polynomial algebra subprograms, Hong and Yap [15], pp.669-676
DOI : 10.1145/3015306.3015312
URL : https://hal.archives-ouvertes.fr/hal-01404718

C. Chen, S. Covanov, F. Mansouri, M. Moreno-maza, N. Xie et al., Parallel Integer Polynomial Multiplication, 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp.72-80, 2016.
DOI : 10.1109/SYNASC.2016.024
URL : https://hal.archives-ouvertes.fr/hal-01520021

J. Cooley and J. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of Computation, vol.19, issue.90, pp.297-301, 1965.
DOI : 10.1090/S0025-5718-1965-0178586-1

S. Covanov and E. Thomé, Fast arithmetic for faster integer multiplication. CoRR, abs, 1502.

X. Dahan, M. Moreno-maza, ´. E. Schost, W. Wu, and Y. Xie, Lifting techniques for triangular decompositions, Proceedings of the 2005 international symposium on Symbolic and algebraic computation , ISSAC '05, pp.108-115
DOI : 10.1145/1073884.1073901
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.1677

V. S. Dimitrov, T. V. Cooklev, and B. D. Donevsky, Generalized Fermat-Mersenne number theoretic transform, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, pp.133-139, 1994.
DOI : 10.1109/82.281844

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

M. Fürer, Faster integer multiplication, Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp.57-66, 2007.

M. Fürer, Faster Integer Multiplication, SIAM Journal on Computing, vol.39, issue.3, pp.979-1005, 2009.
DOI : 10.1137/070711761

D. Hankerson, A. J. Menezes, and S. Vanstone, Guide to Elliptic Curve Cryptography, 2004.

S. A. Haque, X. Li, F. Mansouri, M. Moreno-maza, W. Pan et al., Dense arithmetic over finite fields with the CU- MODP library, Hong and Yap [15], pp.725-732
DOI : 10.1007/978-3-662-44199-2_108
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.431.4907

X. Li, M. Moreno-maza, R. Rasheed, and . Schost, The modpn library, ACM SIGSAM Bulletin, vol.42, issue.3, pp.841-858, 2011.
DOI : 10.1145/1504347.1504374

D. Mohajerani, Fast fourier transforms over prime fields of large characteristic and their implementation on graphics processing units. Master's thesis, The University of Western Ontario, 2016.

M. , M. Maza, and W. Pan, Fast polynomial arithmetic on a GPU, J. of Physics: Conference Series, vol.256, 2010.

M. , M. Maza, and W. Pan, Solving bivariate polynomial systems on a GPU, J. of Physics: Conference Series, p.341, 2011.
DOI : 10.1145/2016567.2016589
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.2126

M. Püschel, J. M. Moura, J. Johnson, D. Padua, M. Veloso et al., SPIRAL: Code Generation for DSP Transforms, Proceedings of the IEEE, special issue on " Program Generation, Optimization , and Adaptation, pp.93232-275, 2005.
DOI : 10.1109/JPROC.2004.840306

A. Schönhage and V. Strassen, Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971.
DOI : 10.1007/BF02242355

V. Shoup, Number theory library (ntl) for c++. Available at Shoup's homepage http, 2016.

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065