O. Arazi and H. Qi, On Calculating Multiplicative Inverses Modulo $2^{m}$, IEEE Transactions on Computers, vol.57, issue.10, pp.1435-1438, 2008.
DOI : 10.1109/TC.2008.54

R. Brent and P. Zimmermann, Modern Computer Arithmetic, 2010.
DOI : 10.1017/CBO9780511921698
URL : https://hal.archives-ouvertes.fr/cel-01500109

C. Burnikel and J. Ziegler, Fast recursive division, 1998.

P. Coussy, C. Chavet, P. Bomel, D. Heller, E. Senn et al., High-Level Synthesis: From Algorithm to Digital Circuit, chapter GAUT: A High-Level Synthesis Tool for DSP Applications, pp.147-169, 2008.
DOI : 10.1007/978-1-4020-8588-8

J. Dumas, On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers, IEEE Transactions on Computers, vol.63, issue.8, pp.2106-2109, 2014.
DOI : 10.1109/TC.2013.94

J. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen et al., LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA, Mathematical Software, pp.40-50, 2002.
DOI : 10.1142/9789812777171_0005

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-42, 2008.
DOI : 10.1145/1391989.1391992
URL : https://hal.archives-ouvertes.fr/hal-00018223

J. Dumas, B. D. Saunders, and G. Villard, On Efficient Sparse Integer Matrix Smith Normal Form Computations, Journal of Symbolic Computation, vol.32, issue.1-2, pp.71-99, 2001.
DOI : 10.1006/jsco.2001.0451

R. Freivalds, Fast probabilistic algorithms, Math. Foundations of Comp. Sc, pp.57-69, 1979.
DOI : 10.1007/3-540-09526-8_5

P. Gaudry and E. Thomé, The mpFq library and implementing curve-based key exchanges, SPEED: Software Performance Enhancement for Encryption and Decryption, pp.49-64, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00168429

T. Granlund, The GNU multiple precision arithmetic library, 2001.

E. L. Kaltofen, M. Nehring, and B. D. Saunders, Quadratic-time certificates in linear algebra, Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pp.171-176, 2011.
DOI : 10.1145/1993886.1993915

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