, Intel architecture instruction set extensions programming reference, 2018.

, MQsoft: a fast multivariate cryptography library, 2018.

D. F. Aranha, J. López, and D. Hankerson, Efficient software implementation of binary field arithmetic using vector instruction sets, Progress in Cryptology -LATINCRYPT 2010, First International Conference on Cryptology and Information Security in Latin America, vol.6212, pp.144-161, 2010.

D. F. Aranha, J. López, and D. Hankerson, High-speed parallel software implementation of the ?t pairing, Topics in Cryptology -CT-RSA 2010, The Cryptographers' Track at the RSA Conference 2010, vol.5985, pp.89-105, 2010.

M. Bardet, J. Faugère, and B. Salvy, On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations, International Conference on Polynomial System Solving -ICPSS, pp.71-75, 2004.

M. Bardet, J. Faugère, B. Salvy, and B. Yang, Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems, The Effective Methods in Algebraic Geometry Conference -MEGA 2005, pp.1-14, 2005.

C. Berbain, O. Billet, and H. Gilbert, Efficient implementations of multivariate quadratic systems, Selected Areas in Cryptography, 13th International Workshop, pp.174-187, 2006.

D. J. Bernstein, T. Chou, and P. Schwabe, Mcbits: Fast constant-time code-based cryptography, Cryptographic Hardware and Embedded Systems -CHES 2013 -15th International Workshop, vol.8086, pp.250-272, 2013.

L. Bettale, J. Faugère, and L. Perret, Cryptanalysis of hfe, multi-hfe and variants for odd and even characteristic, Des. Codes Cryptography, vol.69, issue.1, pp.1-52, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00776072

J. Bi, Q. Cheng, and J. M. Rojas, Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields, International Symposium on Symbolic and Algebraic Computation, ISSAC'13, pp.61-68, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00922224

M. Bluhm and S. Gueron, Fast software implementation of binary elliptic curve cryptography, IACR Cryptology ePrint Archive, p.741, 2013.

W. Bosma, J. J. Cannon, and G. Matthews, Programming with algebraic structures: Design of the MAGMA language, Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC '94, pp.52-57, 1994.

A. Bostan, F. Chyzak, M. Giusti, R. Lebreton, G. Lecerf et al., Algorithmes efficaces en calcul formel, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01431717

R. P. Brent, P. Gaudry, E. Thomé, and P. Zimmermann, Faster multiplication in gf
URL : https://hal.archives-ouvertes.fr/inria-00188261

, Algorithmic Number Theory, 8th International Symposium, ANTS-VIII, pp.153-166, 2008.

A. Casanova, J. Faugère, G. Macario-rat, J. Patarin, L. Perret et al., GeMSS: A great multivariate short signature. Submission to NIST Post-Quantum Cryptography Standardization Process, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01662158

A. Chen, M. Chen, T. Chen, C. Cheng, J. Ding et al., SSE implementation of multivariate pkcs on modern x86 cpus, Cryptographic Hardware and Embedded Systems -CHES 2009, 11th International Workshop, pp.33-48, 2009.

M. Chen, J. Ding, A. Petzoldt, D. Schmidt, B. Yang et al., Submission to NIST Post-Quantum Cryptography Standardization Process, 2017.

M. Chen, C. Cheng, P. Kuo, W. Li, and B. Yang, Faster multiplication for long binary polynomials, 2017.

M. Chen, A. Hülsing, J. Rijneveld, S. Samardjiska, and P. Schwabe, From 5-pass MQ -based identification to MQ -based signatures, Advances in Cryptology -ASIACRYPT 2016 -22nd International Conference on the Theory and Application of Cryptology and Information Security, pp.135-165, 2016.

M. Chen, W. Li, B. Peng, B. Yang, and C. Cheng, Implementing 128-bit secure MPKC signatures, IEICE Transactions, issue.3, pp.553-569, 2018.

N. Courtois, Generic attacks and the security of quartz, Public Key Cryptography, vol.2567, pp.351-364, 2003.

J. H. Davenport, C. Petit, and B. Pring, A generalised successive resultants algorithm, Arithmetic of Finite Fields -6th International Workshop, WAIFI 2016, vol.10064, pp.105-124, 2016.

N. Drucker and S. Gueron, A toolbox for software optimization of QC-MDPC code-based cryptosystems, IACR Cryptology ePrint Archive, p.1251, 2017.

J. , C. Faugère, and A. Joux, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using gröbner bases, Advances in Cryptology -CRYPTO 2003, 23rd Annual International Cryptology Conference, vol.2729, pp.44-60, 2003.

J. Faugère, L. Perret, and J. Ryckeghem, DualModeMS: A dual mode for multivariate-based signature. Submission to NIST Post-Quantum Cryptography Standardization Process, 2017.

M. Peeters, G. Bertoni, J. Daemen, and G. Van-assche, A software interface for keccak, 2013.

S. Gao and T. D. Mateer, Additive fast fourier transforms over finite fields, IEEE Trans. Information Theory, vol.56, issue.12, pp.6265-6272, 2010.

T. Granlund and . Gnu, Multiple Precision Arithmetic Library 6.1.2, December, 2002.

B. Grenet, J. Van-der-hoeven, and G. Lecerf, Randomized root finding over finite fft-fields using tangent graeffe transforms, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, pp.197-204, 2015.
URL : https://hal.archives-ouvertes.fr/lirmm-01327996

J. Großschädl and G. Kamendje, Instruction set extension for fast elliptic curve cryptography over binary finite fields gf(2m), 14th IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP 2003), p.455, 2003.

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

W. B. Hart, Fast library for number theory: An introduction, Mathematical Software -ICMS 2010, Third International Congress on Mathematical Software, pp.88-91, 2010.

T. Itoh and S. Tsujii, A fast algorithm for computing multiplicative inverses in gf(2 m ) using normal bases, Inf. Comput, vol.78, issue.3, pp.171-177, 1988.

A. Kipnis, J. Patarin, and L. Goubin, Unbalanced oil and vinegar signature schemes, Advances in Cryptology -EUROCRYPT '99, International Conference on the Theory and Application of Cryptographic Techniques, vol.1592, pp.206-222, 1999.

R. Lidl and H. Niederreiter, Finite Fields. Encyclopedia of Mathematics and its Applications, 1996.

J. Maitin and -. Shepard, Optimal software-implemented itoh-tsujii inversion for gf(2 m ). IACR Cryptology ePrint Archive, p.28, 2015.

A. Maximov and H. Sjoberg, On fast multiplication in binary finite fields and optimal primitive polynomials over GF(2). IACR Cryptology ePrint Archive, p.889, 2017.

L. Peter and . Montgomery, Five, six, and seven-term karatsuba-like formulae, IEEE Trans. Computers, vol.54, issue.3, pp.362-369, 2005.

, Round 1 submissionspost-quantum cryptography | csrc, 2017.

J. Patarin, Advances in Cryptology -EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, vol.1070, pp.33-48, 1996.

C. Petit, Finding roots in gf(p n ) with the successive resultant algorithm, IACR Cryptology ePrint Archive, p.506, 2014.

A. Petzoldt, M. Chen, B. Yang, C. Tao, and J. Ding, Design principles for hfev-based multivariate signature schemes, Advances in Cryptology -ASIACRYPT 2015 -21st International Conference on the Theory and Application of Cryptology and Information Security, vol.9452, pp.311-334, 2015.

V. Shoup, Ntl: A library for doing number theory, vol.01, 2003.

R. G. Swan, Factorization of polynomials over finite fields, Pacific J. Math, vol.12, issue.3, pp.1099-1106, 1962.

J. Taverne, A. Faz-hernández, D. F. Aranha, F. Rodríguez-henríquez, D. Hankerson et al., Software implementation of binary elliptic curves: impact of the carry-less multiplier on scalar multiplication, IACR Cryptology ePrint Archive, p.170, 2011.

J. Von-zur-gathen and J. Gerhard, Modern Computer Algebra (3. ed), 2013.