S. Boldo, M. Daumas, and P. Giorgi, Formal proof for delayed finite field arithmetic using floating point operators, 8th Conference on Real Numbers and Computers, p.10, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00135090

D. Coppersmith, Solving linear equations over GF(2): block Lanczos algorithm, Linear Algebra and its Applications, vol.192, pp.33-60, 1993.
DOI : 10.1016/0024-3795(93)90235-G
URL : http://doi.org/10.1016/0024-3795(93)90235-g

J. Dumas, V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, Efficient dot product over finite fields, Proceedings of the seventh International Workshop on Computer Algebra in Scientific Computing, pp.139-154, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00001380

J. Dumas, Q-adic transform revisited, Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, ISSAC '08, pp.63-69, 2008.
DOI : 10.1145/1390768.1390780
URL : https://hal.archives-ouvertes.fr/hal-00173894

J. Dumas, L. Fousse, and B. Salvy, Compressed modular matrix multiplication, In: Milestones in Computer Algebra, p.8, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00259950

J. Dumas, T. Gautier, P. Giorgi, C. Pernet, J. Roch et al., Givaro 3.2.9: C++ library for arithmetic and algebraic computations, 2007.

J. Dumas, T. Gautier, and C. Pernet, Finite field linear algebra subroutines, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.63-74, 2002.
DOI : 10.1145/780506.780515

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 wordsize prime fields: the FFLAS and FFPACK packages, ACM Transactions on Mathematical Software, vol.35, issue.3, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00018223

J. V. Gathen and J. Gerhard, Modern Computer Algebra, 1999.

K. Goto and R. Van-de-geijn, On reducing TLB misses in matrix multiplication, 2002.

D. Harvey, Faster polynomial multiplication via multipoint Kronecker substitution, Journal of Symbolic Computation, vol.44, issue.10, 2007.
DOI : 10.1016/j.jsc.2009.05.004
URL : http://doi.org/10.1016/j.jsc.2009.05.004

E. Kaltofen and A. Lobo, Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields, Algorithmica, vol.24, issue.3-4, pp.3-4, 1999.
DOI : 10.1007/PL00008266

V. Lefèvre, The Euclidean division implemented with a floating-point division and a floor, 2005.

V. Lefèvre, The Euclidean division implemented with a floatingpoint multiplication and a floor, 2005.

J. P. May, D. Saunders, and Z. Wan, Efficient matrix rank computation with application to the study of strongly regular graphs, Proceedings of the 2007 international symposium on Symbolic and algebraic computation , ISSAC '07, pp.277-284, 2007.
DOI : 10.1145/1277548.1277586

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

V. Shoup, A computational introduction to number theory and algebra, 2005.

V. Shoup, NTL 5.4.1: A library for doing number theory, 2007.

A. Weimerskirch, D. Stebila, and S. C. Shantz, Generic GF(2m) Arithmetic in Software and Its Application to ECC, Information Security and Privacy, 8th Australasian Conference of Lecture Notes in Computer Science, pp.79-92, 2003.
DOI : 10.1007/3-540-45067-X_8

G. Weng, W. Qiu, Z. Wang, and Q. Xiang, Pseudo-Paley graphs and skew Hadamard difference sets from presemifields, Designs, Codes and Cryptography, vol.11, issue.228, pp.1-3, 2007.
DOI : 10.1007/s10623-007-9057-6