H. Imai and T. Matsumoto, Algebraic methods for constructing asymmetric cryptosystems, Lecture Notes in Computer Science, vol.229, pp.108-119, 1985.
DOI : 10.1007/3-540-16776-5_713

J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms, Advances in Cryptology ? EUROCRYPT '96, pp.33-48, 1996.
DOI : 10.1007/3-540-68339-9_4

N. Courtois, L. Goubin, and J. Patarin, Sflash, a fast asymmetric signature scheme for low-cost smartcards -primitive specification and supporting documentation

A. Kipnis, J. Patarin, and L. Goubin, Unbalanced Oil and Vinegar Signature Schemes, ADVANCES IN CRYPTOLOGY EUROCRYPT 1999, pp.206-222, 1999.
DOI : 10.1007/3-540-48910-X_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.970

T. T. Moh, A public key system with signature and master key functions, Communications in Algebra, vol.168, issue.4, pp.2207-2222, 1999.
DOI : 10.1145/359340.359342

B. Y. Yang, J. M. Chen, and Y. H. Chen, TTS: High-Speed Signatures on a Low-Cost Smart Card, Lecture Notes in Computer Science, vol.3156, pp.371-385, 2004.
DOI : 10.1007/978-3-540-28632-5_27

V. Dubois, P. A. Fouque, A. Shamir, and J. Stern, Practical Cryptanalysis of SFLASH, Proceedings of the 27th annual international cryptology conference on Advances in cryptology. CRYPTO'07, pp.1-12, 2007.
DOI : 10.1007/978-3-540-74143-5_1
URL : https://hal.archives-ouvertes.fr/inria-00556691

R. Barbulescu, P. Gaudry, A. Joux, and E. Thomé, A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic, Advances in Cryptology -EUROCRYPT 2014 -33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.1-16, 2014.
DOI : 10.1007/978-3-642-55220-5_1
URL : https://hal.archives-ouvertes.fr/hal-00835446

N. Courtois and L. Goubin, Cryptanalysis of the TTM cryptosystem, Advances in Cryptology ? ASIACRYPT '00, pp.44-57, 1976.

C. Wolf, A. Braeken, and B. Preneel, On the security of stepwise triangular systems, Designs, Codes and Cryptography, vol.27, issue.5, pp.285-302, 2006.
DOI : 10.1007/s10623-006-0015-5

E. Thomae and C. Wolf, Cryptanalysis of Enhanced TTS, STS and All Its Variants, or: Why Cross-Terms Are Important, Progress in Cryptology ? AFRICACRYPT 2012, pp.188-202, 2012.
DOI : 10.1007/978-3-642-31410-0_12

O. Billet and H. Gilbert, Cryptanalysis of Rainbow, In: SCN. Lecture Notes in Computer Science, vol.4116, pp.336-347, 2006.
DOI : 10.1007/11832072_23

A. Kipnis and A. Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, In: CRYPTO. Lecture Notes in Computer Science, vol.1666, pp.19-30, 1999.
DOI : 10.1007/3-540-48405-1_2

X. Jiang, J. Ding, and L. Hu, Kipnis-Shamir Attack on HFE Revisited, LNCS, vol.4990, pp.399-411, 2007.
DOI : 10.1007/978-3-540-79499-8_31

L. Bettale, J. C. Faugère, and L. Perret, Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants, Public Key Cryptography ? PKC 2011, pp.441-458, 2011.
DOI : 10.1007/978-3-642-19379-8_27
URL : https://hal.archives-ouvertes.fr/hal-01287981

L. Bettale, J. C. Faugre, and L. Perret, Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic, Designs, Codes and Cryptography, vol.4, issue.4, pp.1-52, 2013.
DOI : 10.1007/s10623-012-9617-2
URL : https://hal.archives-ouvertes.fr/hal-00776072

W. Buss, G. Frandsen, and J. Shallit, The computational complexity of some problems of linear algebra, Journal of Computer and System Sciences, 1999.

N. T. Courtois, Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank, Advances in Cryptology ? ASIACRYPT 2001, pp.402-421, 2001.
DOI : 10.1007/3-540-45682-1_24

D. Gligoroski, S. Markovski, and S. J. Knapskog, Multivariate Quadratic Trapdoor Functions based on Multivariate Quadratic Quasigroups, Proceedings of the American Conference on Applied Mathematics. MATH, World Scientific and Engineering Academy and Society (WSEAS), pp.44-49, 2008.

M. S. Mohamed, J. Ding, J. Buchmann, and F. Werner, Algebraic Attack on the MQQ Public Key Cryptosystem, In: CANS. Lecture Notes in Computer Science, vol.5888, pp.392-401, 2009.
DOI : 10.1007/978-3-642-10433-6_26

J. C. Faugère, R. S. Ødegård, L. Perret, and D. Gligoroski, Analysis of the MQQ Public Key Cryptosystem, In: CANS. Lecture Notes in Computer Science, vol.6467, pp.169-183, 2010.
DOI : 10.1007/978-3-642-17619-7_13

D. Gligoroski, R. S. Ødegård, R. E. Jensen, L. Perret, J. C. Faugère et al., MQQ-SIG, In: INTRUST. Lecture Notes in Computer Science, vol.7222, pp.184-203, 2011.
DOI : 10.1007/978-3-642-32298-3_13
URL : https://hal.archives-ouvertes.fr/hal-00778083

D. Gligoroski and S. Samardjiska, The Multivariate Probabilistic Encryption Scheme MQQ-ENC, In: SCC, 2012.

D. J. Bernstein, ebacs: Ecrypt benchmarking of cryptographic systems, 2014.

J. C. Faugère, M. S. Din, and P. J. Spaenlehauer, Gr??bner bases of bihomogeneous ideals generated by polynomials of bidegree <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>: Algorithms and complexity, Journal of Symbolic Computation, vol.46, issue.4, pp.406-437, 2011.
DOI : 10.1016/j.jsc.2010.10.014

W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Computational algebra and number theory, pp.235-265, 1993.
DOI : 10.1006/jsco.1996.0125

L. Perret, A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem, In: EUROCRYPT. Lecture Notes in Computer Science, vol.3494, pp.354-370, 2005.
DOI : 10.1007/11426639_21

C. Wolf and B. Preneel, Large Superfluous Keys in $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic Asymmetric Systems, Lecture Notes in Computer Science, vol.3386, pp.275-287, 2005.
DOI : 10.1007/978-3-540-30580-4_19

C. Wolf and B. Preneel, Equivalent Keys in Multivariate Quadratic Public Key Systems, Journal of Mathematical Cryptology, vol.4, pp.375-415, 2011.

C. Wolf and B. Preneel, Equivalent Keys in HFE, C*, and Variations, Progress in Cryptology ? Mycrypt 2005, pp.33-49, 2005.
DOI : 10.1007/11554868_4

E. Thomae, About the Security of Multivariate Quadratic Public Key Schemes, 2013.

S. Samardjiska, Y. Chen, and D. Gligoroski, Algorithms for Construction of Multivariate Quadratic Quasigroups (MQQs) and Their Parastrophe Operations in Arbitrary Galois Fields, J. Inf. Assurance and Security, vol.7, issue.3, pp.146-172, 2012.

F. Gantmacher, The Theory of Matrices, Chelsea, vol.1, 1959.

J. Macwilliams, Orthogonal Matrices Over Finite Fields, The American Mathematical Monthly, vol.76, issue.2, pp.152-164, 1969.
DOI : 10.2307/2317262

E. Thomae, Etudes d?hypoth'eses algorithmiques et attaques de primitives cryptographiques, 2011.

A. Kipnis and A. Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, Advances in Cryptology ? CRYPTO '99, pp.19-30, 1999.
DOI : 10.1007/3-540-48405-1_2

J. C. Faugère, F. Levy-dit-vehel, and L. Perret, Cryptanalysis of MinRank Advances in Cryptology ? CRYPTO, LNCS, vol.5157, pp.280-296, 2008.

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

M. Bardet, J. C. Faugère, B. Salvy, and B. Y. Yang, Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems, Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, 2005.