The Design and Analysis of Computer Algorithms, 1974. ,
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor, Advances in Cryptology, CRYPTO'86, pp.311-326, 1986. ,
DOI : 10.1007/3-540-47721-7_24
Fast modular transforms, Journal of Computer and System Sciences, vol.8, issue.3, pp.366-386, 1974. ,
DOI : 10.1016/S0022-0000(74)80029-2
URL : https://doi.org/10.1016/s0022-0000(74)80029-2
The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.3-4, 1993. ,
DOI : 10.1006/jsco.1996.0125
Fast Algorithms for Manipulating Formal Power Series, Journal of the ACM, vol.25, issue.4, pp.581-595, 1978. ,
DOI : 10.1145/322092.322099
URL : http://wwwmaths.anu.edu.au/~brent/pd/rpb045.pdf
Modern Computer Arithmetic, 2010. ,
DOI : 10.1017/CBO9780511921698
URL : https://hal.archives-ouvertes.fr/cel-01500109
A new algorithm for factoring polynomials over finite fields, Mathematics of Computation, vol.36, issue.154, pp.587-592, 1981. ,
DOI : 10.1090/S0025-5718-1981-0606517-5
URL : http://www.ams.org/mcom/1981-36-154/S0025-5718-1981-0606517-5/S0025-5718-1981-0606517-5.pdf
On the minimum computation time of functions, Transactions of the American Mathematical Society, vol.142, 1966. ,
DOI : 10.1090/S0002-9947-1969-0249212-8
Matrix multiplication via arithmetic progressions, Journal of Symbolic Computation, vol.9, issue.3, pp.251-280, 1990. ,
DOI : 10.1016/S0747-7171(08)80013-2
URL : https://doi.org/10.1016/s0747-7171(08)80013-2
LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA, Mathematical Software, pp.40-50, 2002. ,
DOI : 10.1142/9789812777171_0005
Dense Linear Algebra over Word-Size Prime Fields, ACM Transactions on Mathematical Software, vol.35, issue.3, pp.1-42, 2008. ,
DOI : 10.1145/1391989.1391992
URL : https://hal.archives-ouvertes.fr/hal-00018223
The design and implementation of FFTW3 Special issue on " Program Generation, Optimization, and Platform Adaptation, Proc. IEEE 93, pp.216-231, 2005. ,
Faster integer multiplication, STOC'07, pp.57-66, 2007. ,
Computing Frobenius maps and factoring polynomials, computational complexity, vol.10, issue.2, pp.187-224, 1992. ,
DOI : 10.1080/02522667.1989.10698971
Parallel Modular Multiplication on Multi-core Processors, 2013 IEEE 21st Symposium on Computer Arithmetic, pp.135-142, 2013. ,
DOI : 10.1109/ARITH.2013.20
URL : https://hal.archives-ouvertes.fr/hal-00805242
High-performance implementation of the level-3 BLAS, ACM Transactions on Mathematical Software, vol.35, issue.1, 2008. ,
DOI : 10.1145/1377603.1377607
Fast Library for Number Theory: An Introduction, Mathematical Software?ICMS 2010, pp.88-91, 2010. ,
DOI : 10.1007/978-3-642-15582-6_18
URL : http://wrap.warwick.ac.uk/41629/1/WRAP_Hart_0584144-ma-270913-flint-extended-abstract.pdf
Mathemagix, ACM Communications in Computer Algebra, vol.45, issue.3/4, pp.186-188, 2012. ,
DOI : 10.1145/2110170.2110180
URL : https://hal.archives-ouvertes.fr/hal-00785549
Intel math kernel library, 2007. ,
Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.296-303, 2014. ,
DOI : 10.1145/2608628.2608664
LinBox: C++ library for exact, high-performance linear algebra, 2016. ,
Exact Linear Algebra Algorithmic, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '15, pp.17-18, 2015. ,
DOI : 10.1016/j.jsc.2011.12.009
SPIRAL: Code Generation for DSP Transforms, Proceedings of the IEEE, special issue on " Program Generation, Optimization, and Adaptation " 93, pp.232-275, 2005. ,
DOI : 10.1109/JPROC.2004.840306
Fast multiplication of large numbers, Computing, vol.150, issue.3-4, pp.281-292, 1971. ,
DOI : 10.1007/BF02242355
Fast Construction of Irreducible Polynomials over Finite Fields, Journal of Symbolic Computation, vol.17, issue.5, pp.371-391, 1994. ,
DOI : 10.1006/jsco.1994.1025
A New Polynomial Factorization Algorithm and its Implementation, Journal of Symbolic Computation, vol.20, issue.4, pp.363-397, 1995. ,
DOI : 10.1006/jsco.1995.1055
URL : https://doi.org/10.1006/jsco.1995.1055
Efficient computation of minimal polynomials in algebraic extensions of finite fields, Proceedings of the 1999 international symposium on Symbolic and algebraic computation , ISSAC '99, pp.53-58, 1999. ,
DOI : 10.1145/309831.309859
NTL: A library for doing number theory, 2015. ,
On the Complexity of Matrix Multiplication. Ph.D. Dissertation. University of Edinburgh. V. Strassen. 1969. Gaussian elimination is not optimal, Numer. Math, vol.13, issue.4, pp.354-356, 1969. ,
Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.887-898, 2012. ,
DOI : 10.1145/2213977.2214056
URL : http://www.eecs.berkeley.edu/~virgi/matrixmult-f.pdf
Automated empirical optimizations of software and the ATLAS project, Parallel Computing, vol.27, issue.1-2, pp.3-35, 2001. ,
DOI : 10.1016/S0167-8191(00)00087-9