A. Akavia, S. Goldwasser, and V. Vaikuntanathan, Simultaneous Hardcore Bits and Cryptography against Memory Attacks, LNCS, vol.5444, pp.474-495, 2009.
DOI : 10.1007/978-3-642-00457-5_28

M. R. Albrecht, C. Cid, J. Faugère, R. Fitzpatrick, and L. Perret, Algebraic algorithms for LWE problems, ACM Communications in Computer Algebra, vol.49, issue.2, p.1018, 1018.
DOI : 10.1145/2815111.2815158
URL : https://hal.archives-ouvertes.fr/hal-01072721

M. Albrecht, C. Cid, T. Dulien, J. Faugère, and L. Perret, Algebraic Precomputations in Differential and Integral Cryptanalysis, ): Ecrypt II, pp.1-14, 2010.
DOI : 10.1007/978-3-642-21518-6_27

M. Albrecht, C. Cid, J. Faugère, R. Fitzpatrick, and L. Perret, On the complexity of the Arora-Ge algorithm against LWE, SCC '12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, Castro-Urdiales (Spain), pp.93-99, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776434

M. Albrecht, C. Cid, J. Faugère, R. Fitzpatrick, and L. Perret, On the complexity of BKW algorithm against LWE, SCC'12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, Castro-Urdiales (Spain), pp.100-107, 2012.

M. Albrecht, J. Faugère, P. Farshim, and L. Perret, Polly Cracker, Revisited, Advances in Cryptology Asiacrypt 2011, pp.179-196, 2011.
DOI : 10.1007/978-3-642-25385-0_10
URL : https://hal.archives-ouvertes.fr/hal-01112976

M. Albrecht, J. Faugère, R. Fitzpatrick, and L. Perret, Lazy Modulus Switching for the BKW Algorithm on LWE, ser. Lecture Notes in Computer Science Buenos Aires, vol.8383, pp.429-445, 2014.
DOI : 10.1007/978-3-642-54631-0_25
URL : https://hal.archives-ouvertes.fr/hal-00925187

M. Albrecht, J. Faugère, R. Fitzpatrick, L. Perret, Y. Todo et al., Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions, Public-Key Cryptography PKC 2014, pp.446-464, 2014.
DOI : 10.1007/978-3-642-54631-0_26
URL : https://hal.archives-ouvertes.fr/hal-00932382

M. R. Albrecht, J. Faugère, P. Farshim, G. Herold, and L. Perret, Polly Cracker, revisited, Designs, Codes and Cryptography, vol.79, issue.2, pp.261-302, 2016.
DOI : 10.1007/s10623-015-0048-8
URL : https://hal.archives-ouvertes.fr/hal-01112976

M. R. Albrecht, R. Player, and S. Scott, Abstract, Journal of Mathematical Cryptology, vol.9, issue.3, pp.169-203, 2015.
DOI : 10.1515/jmc-2015-0016

D. J. Anick, Thin algebras of embedding dimension three, Journal of Algebra, vol.100, issue.1, pp.235-259, 1986.
DOI : 10.1016/0021-8693(86)90076-1

F. Armknecht, D. Augot, L. Perret, and A. Sadeghi, On Constructing Homomorphic Encryption Schemes from Coding Theory, Cryptography and Coding -13th IMA International Conference, pp.23-40978, 2011.
DOI : 10.1007/978-3-642-13190-5_2
URL : https://hal.archives-ouvertes.fr/hal-00643774

S. Arora and R. Ge, New Algorithms for Learning in Presence of Errors, ser. LNCS, pp.403-415, 2011.
DOI : 10.1007/978-3-540-85174-5_31

G. Ars, J. Faugère, H. Imai, M. Kawazoe, and M. Sugita, Comparison between XL and Gröbner basis algorithms, ser. LNCS, pp.338-353, 2004.
DOI : 10.1007/978-3-540-30539-2_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4696

N. Schwabe, F. Sendrier, B. Vercauteren, M. Augot, N. Finiasz et al., Initial recommendations of long-term secure post-quantum systems A family of fast syndrome based cryptographic hash functions, Progress in Cryptology -Mycrypt 2005, First International Conference on Cryptology in Malaysia, pp.64-83, 2005.

M. B. Monagan, K. O. Geddes, K. M. Heal, G. Labahn, S. M. Vorkoetter et al., Maple 10 Programming Guide, 2005.
DOI : 10.1007/978-1-4684-0241-4
URL : http://dx.doi.org/10.1016/s0898-1221(96)90201-1

G. V. Bard, N. Courtois, and C. Jefferson, Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over GF(2) via satsolvers, IACR Cryptology ePrint Archive, vol.2007, p.24024, 2007.

M. Bardet, Étude des systèmes algébriques surdéterminés. applications aux codes correcteurs et à la cryptographie, 2004.

M. Bardet, J. Faugère, and B. Salvy, Complexity study of Gröbner basis computation, INRIA, Tech. Rep, 2002.

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.

M. Bardet, J. Faugre, B. Salvy, and P. Spaenlehauer, On the complexity of solving quadratic Boolean systems, Journal of Complexity, vol.29, issue.1, pp.53-75, 2013.
DOI : 10.1016/j.jco.2012.07.001
URL : https://hal.archives-ouvertes.fr/hal-00655745

B. Barkee, D. C. Can, J. Ecks, T. Moriarty, and R. F. Ree, Why You Cannot Even Hope to use Gr??bner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed, Journal of Symbolic Computation, vol.18, issue.6, pp.497-501, 1994.
DOI : 10.1006/jsco.1994.1061

P. S. Barreto, P. Cayrel, R. Misoczki, and R. Niebuhr, Quasi-Dyadic CFS Signatures, Inscrypt, pp.336-349, 2010.
DOI : 10.1007/978-3-642-21518-6_23
URL : https://hal.archives-ouvertes.fr/hal-00870939

P. S. Barreto, R. Lindner, and R. Misoczki, Monoidic Codes in Cryptography, ser. Lecture Notes in Computer Science, vol.21, issue.4, pp.179-199, 2011.
DOI : 10.1109/TIT.1975.1055449
URL : https://hal.archives-ouvertes.fr/hal-00870943

P. S. Barreto, R. Misoczki, and M. A. Jr, One-time signature scheme from syndrome decoding over generic error-correcting codes, Journal of Systems and Software, vol.84, issue.2, pp.198-204, 2011.
DOI : 10.1016/j.jss.2010.09.016

C. H. Bennett, E. Bernstein, G. Brassard, and U. V. Vazirani, Strengths and Weaknesses of Quantum Computing, SIAM Journal on Computing, vol.26, issue.5, pp.1510-1523, 1997.
DOI : 10.1137/S0097539796300933

C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, Theoretical Computer Science, vol.560, pp.7-11, 2014.
DOI : 10.1016/j.tcs.2014.05.025

C. Berbain, H. Gilbert, and J. Patarin, QUAD: A Practical Stream Cipher with Provable Security, EUROCRYPT 2006, S. Vaudenay, Ed., ser. LNCS, pp.109-128, 2006.
DOI : 10.1007/11761679_8

T. P. Berger, P. Cayrel, P. Gaborit, and A. Otmani, Reducing Key Length of the McEliece Cryptosystem, Progress in Cryptology -Second International Conference on Cryptology in Africa, pp.77-97, 2009.
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-01081727

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978.
DOI : 10.1109/TIT.1978.1055873

D. J. Bernstein, T. Lange, and C. Peters, Attacking and Defending the McEliece Cryptosystem, PQCrypto, ser. LNCS, pp.31-46, 2008.
DOI : 10.1007/0-387-34799-2_10

D. J. Bernstein, Grover vs.??McEliece, Proceedings, N. Sendrier, Ed., ser. Lecture Notes in Computer Science, vol.6061, pp.73-80978, 2010.
DOI : 10.1007/978-3-642-12929-2_6

D. J. Bernstein, J. Buchmann, and E. Dahmen, Post-quantum cryptography, ser Mathematics and Statistics Springer-11649; ZDB-2-SMA, 2009.

D. J. Bernstein, T. Lange, C. Peters, and P. Schwabe, Really Fast Syndrome-Based Hashing, Progress in Cryptology -AFRICACRYPT 2011 -4th International Conference on Cryptology in Africa, pp.134-152978, 2011.
DOI : 10.1007/3-540-45708-9_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.5092

J. Berthomieu, J. Faugère, and L. Perret, Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case, Journal of Complexity, vol.31, issue.4
DOI : 10.1016/j.jco.2015.04.001
URL : https://hal.archives-ouvertes.fr/hal-00846041

L. Bettale, J. Faugère, L. Perret, L. Bettale, J. Faugère et al., Cryptanalysis of the TRMS Signature Scheme of PKC???05, Information Security and Cryptology: 4th International Conference, pp.143-155, 2008.
DOI : 10.1007/978-3-540-68164-9_10

L. Bettale, J. Faugère, and L. Perret, Solving polynomial systems over finite fields, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.67-74, 2012.
DOI : 10.1145/2442829.2442843
URL : https://hal.archives-ouvertes.fr/hal-00776070

O. Billet and H. Gilbert, A Traceable Block Cipher, pp.331-346, 2003.
DOI : 10.1007/978-3-540-40061-5_21

O. Billet, J. Patarin, and Y. Seurin, Analysis of Intermediate Field Systems, 2008.

O. Billet, M. J. Robshaw, and T. Peyrin, On Building Hash Functions from Multivariate Quadratic Equations, ACISP 07, ser. LNCS, pp.82-95, 2007.
DOI : 10.1007/978-3-540-73458-1_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.7766

A. Blum, A. Kalai, and H. Wasserman, Noise-tolerant learning, the parity problem, and the statistical query model, 32nd ACM STOC, pp.435-440, 2000.
DOI : 10.1145/792538.792543

J. W. Bos, C. Costello, L. Ducas, I. Mironov, M. Naehrig et al., Frodo, Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security , CCS'16, pp.1006-1018, 2016.
DOI : 10.1145/2976749.2978425

W. Bosma, J. J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.3-4, 1997.
DOI : 10.1006/jsco.1996.0125

C. Bouillaguet, J. Faugère, P. Fouque, L. Perret, and D. C. , Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem, Public Key Cryptography -PKC 2011, pp.1-12, 2011.
DOI : 10.1007/978-3-642-19379-8_29
URL : https://hal.archives-ouvertes.fr/inria-00556671

C. Bouillaguet, P. Fouque, A. Joux, and J. Treger, A family of weak keys in HFE and the corresponding practical key-recovery, Journal of Mathematical Cryptology, vol.5, issue.3-4, pp.247-275, 2012.
DOI : 10.1515/jmc.2011.012

B. Boyer, C. Eder, J. Faugère, S. Lachartre, F. Martani et al., GBLA, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC '16, 2016.
DOI : 10.1145/2930889.2930914
URL : https://hal.archives-ouvertes.fr/hal-01276346

A. Braeken, C. Wolf, and B. Preneel, A Study of the Security of Unbalanced Oil and Vinegar Signature Schemes, CT-RSA 2005, A. Menezes, Ed., ser. LNCS, pp.29-43, 2005.
DOI : 10.1007/978-3-540-30574-3_4

Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.575-584, 2013.
DOI : 10.1145/2488608.2488680
URL : https://hal.archives-ouvertes.fr/hal-00922194

Z. Brakerski and V. Vaikuntanathan, Efficient Fully Homomorphic Encryption from (Standard) LWE, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.97-106, 2011.
DOI : 10.1109/FOCS.2011.12

M. Brickenstein and A. Dreyer, PolyBoRi: A framework for Gr??bner-basis computations with Boolean polynomials, Journal of Symbolic Computation, vol.44, issue.9, pp.1326-1345, 2009.
DOI : 10.1016/j.jsc.2008.02.017

B. Buchberger, Bruno Buchberger???s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, Journal of Symbolic Computation, vol.41, issue.3-4, pp.3-4, 2006.
DOI : 10.1016/j.jsc.2005.09.007

B. Buchberger, G. E. Collins, R. G. Loos, and R. Albrecht, Computer algebra symbolic and algebraic computation, ACM SIGSAM Bulletin, vol.16, issue.4, pp.5-5, 1982.
DOI : 10.1145/1089310.1089312

J. A. Buchmann, F. Göpfert, R. Player, and T. Wunderer, On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack, Progress in Cryptology -AFRICACRYPT 2016 -8th International Conference on Cryptology in Africa Proceedings, D. Pointcheval, A. Nitaj, and T, 2016.
DOI : 10.1007/978-3-319-31517-1_2

J. Buchmann, E. Dahmen, and M. Szydlo, Hash-based Digital Signature Schemes, pp.35-93978, 2009.
DOI : 10.1007/978-3-540-88702-7_3

]. S. Bulygin, A. Petzoldt, and J. Buchmann, Towards Provable Security of the Unbalanced Oil and Vinegar Signature Scheme under Direct Attacks, ser. LNCS, pp.17-32, 2010.
DOI : 10.1007/978-3-642-17401-8_3

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

D. Butin, A. Huelsing, A. Mohaisen, and S. Gazdag, Xmss: extended hash-based signatures " , Internet Engineering Task Force, Internet-Draft draft-irtf-cfrg-xmss-hash- based-signatures-07, Progress, 66 pp. [Online]. Available, 2016.

A. Canteaut and F. Chabaud, A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511, IEEE Transactions on Information Theory, vol.44, issue.1, pp.367-378, 1998.
DOI : 10.1109/18.651067

I. Cascudo, R. Cramer, D. Mirandola, and G. Zémor, Squares of Random Linear Codes, IEEE Transactions on Information Theory, vol.61, issue.3, pp.1159-1173, 2015.
DOI : 10.1109/TIT.2015.2393251
URL : https://hal.archives-ouvertes.fr/hal-01261390

C. O. Chen, M. Chen, J. Ding, F. Werner, and B. Yang, Odd-char multivariate Hidden Field Equations, Cryptology ePrint Archive, vol.543, 2008.

L. Chen, S. Jordan, Y. Liu, D. Moody, R. Peralta et al., Report on post-quantum cryptography, NIST, Reasearch report NISTIR 8105, 2003.
DOI : 10.6028/NIST.IR.8105

M. C. Pena, J. Faugère, and L. Perret, Algebraic cryptanalysis of a quantum money scheme the noise-free case Available: https, IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, 2015.

I. M. Corbella and R. Pellikaan, Error-correcting pairs for a public-key cryptosystem, CoRR, vol.3647, 1205.

N. Courtois, Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank, ser. LNCS, pp.402-421, 2001.
DOI : 10.1007/3-540-45682-1_24

N. T. Courtois, L. Goubin, and J. Patarin, SFLASHv3, a fast asymmetric signature scheme, Cryptology ePrint Archive, Report, vol.211, issue.211, 2003.

N. Courtois, G. V. Bard, S. D. Galbraith, and E. , Algebraic Cryptanalysis of the Data Encryption Standard, Cryptography and Coding, 11th IMA International Conference Proceedings, pp.152-169, 2007.
DOI : 10.1007/978-3-540-77272-9_10

N. Courtois, M. Daum, and P. Felke, On the Security of HFE, HFEv- and Quartz, PKC 2003, Y. Desmedt, Ed., ser. LNCS, pp.337-350, 2003.
DOI : 10.1007/3-540-36288-6_25

N. Courtois, M. Finiasz, and N. Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme, pp.157-174, 2001.
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511

N. Courtois, A. Klimov, J. Patarin, and A. Shamir, Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations, EUROCRYPT 2000, B. Preneel, Ed., ser. LNCS, pp.392-407, 2000.
DOI : 10.1007/3-540-45539-6_27

A. Couvreur, P. Gaborit, V. Gauthier-umaña, A. Otmani, and J. Tillich, Distinguisher-based attacks on public-key cryptosystems using Reed???Solomon codes, Designs, Codes and Cryptography, vol.73, issue.2, pp.641-666, 2014.
DOI : 10.1007/s10623-014-9967-z
URL : https://hal.archives-ouvertes.fr/hal-01096172

A. Couvreur, I. Márquez-corbella, and R. Pellikaan, A polynomial time attack against algebraic geometry code based public key cryptosystems, Cryptology ePrint Archive, 2014.
DOI : 10.1109/isit.2014.6875072

A. Couvreur, A. Otmani, and J. Tillich, Polynomial time attack on wild McEliece over quadratic extensions, ser. LNCS, pp.17-39, 2014.
DOI : 10.1109/tit.2016.2574841
URL : https://hal.archives-ouvertes.fr/hal-00931774

A. Couvreur, A. Otmani, J. Tillich, and V. Gauthier-umaña, A Polynomial-Time Attack on the BBCRS Scheme, PKC 2015, ser. LNCS, pp.175-193, 2015.
DOI : 10.1007/978-3-662-46447-2_8
URL : https://hal.archives-ouvertes.fr/hal-01104078

D. A. Cox, J. B. Little, and D. Shea, Ideals, Varieties and Algorithms, 2005.

P. Czypek, S. Heyse, and E. Thomae, Efficient Implementations of MQPKS on Constrained Devices, CHES 2012, ser. LNCS, pp.374-389, 2012.
DOI : 10.1007/978-3-642-33027-8_22

L. Dallot, Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme, Research in Cryptology, Second Western European Workshop, pp.65-77978, 2007.
DOI : 10.1007/978-3-540-88353-1_6

T. Daniels and D. Smith-tone, Differential Properties of the HFE Cryptosystem, Post-Quantum Cryptography -6th International Workshop, pp.59-75978, 2014.
DOI : 10.1007/978-3-319-11659-4_4

P. Dembowski and T. Ostrom, Planes of ordern with collineation groups of ordern 2, Mathematische Zeitschrift, vol.7, issue.3, pp.239-258, 1968.
DOI : 10.1007/BF01111042

R. Demillo and R. Lipton, A probabilistic remark on algebraic program testing, Information Processing Letters, vol.7, issue.4, pp.192-194, 1978.
DOI : 10.1016/0020-0190(78)90067-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.391.4508

C. Diem, The XL-Algorithm and a Conjecture from Commutative Algebra, ser. LNCS, pp.323-337, 2004.
DOI : 10.1007/978-3-540-30539-2_23

M. S. Din and P. Trebuchet, Strong bi-homogeneous bézout theorem and its use in effective real algebraic geometry, CoRR, vol.abs, 2006.

J. Ding and T. J. Hodges, Inverting HFE Systems Is Quasi-Polynomial for All Fields, CRYPTO 2011, P. Rogaway, Ed., ser. LNCS, pp.724-742, 2011.
DOI : 10.1007/978-3-642-22792-9_41

J. Ding and D. Schmidt, Rainbow, a New Multivariable Polynomial Signature Scheme, ACNS 05, ser. LNCS, pp.164-175, 2005.
DOI : 10.1007/11496137_12

J. Ding, D. Schmidt, and F. Werner, Algebraic Attack on HFE Revisited, Information Security, 11th International Conference, pp.215-227978, 2008.
DOI : 10.1007/978-3-540-85886-7_15

J. Ding and B. Yang, Multivariate Public Key Cryptography, pp.193-241, 2009.
DOI : 10.1007/978-3-540-88702-7_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.9878

H. Dinh, C. Moore, and A. Russell, McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks, CRYPTO 2011, P. Rogaway, Ed., ser. LNCS, pp.761-779, 2011.
DOI : 10.1007/978-3-642-22792-9_43

N. Döttling and J. Müller-quade, Lossy codes and a new variant of the learning-witherrors problem, EUROCRYPT 2013, ser. LNCS, pp.18-34, 2013.

R. Dowsley, J. Müller-quade, and A. C. Nascimento, A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model, CT- RSA, pp.240-251, 2009.
DOI : 10.1109/18.850662

V. Dubois, P. Fouque, A. Shamir, and J. Stern, Practical Cryptanalysis of SFLASH, CRYPTO 2007, A. Menezes, Ed., ser. LNCS, pp.1-12, 2007.
DOI : 10.1007/978-3-540-74143-5_1
URL : https://hal.archives-ouvertes.fr/inria-00556691

V. Dubois and N. Gama, The Degree of Regularity of HFE Systems, ASIACRYPT 2010, M. Abe, Ed., ser. LNCS, pp.557-576, 2010.
DOI : 10.1007/978-3-642-17373-8_32

V. Dubois, L. Granboulan, and J. Stern, An Efficient Provable Distinguisher for HFE, ser. LNCS, pp.156-167, 2006.
DOI : 10.1007/11787006_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.2984

L. Ducas, A. Durmus, T. Lepoint, and V. Lyubashevsky, Lattice Signatures and Bimodal Gaussians, CRYPTO 2013, ser. LNCS, pp.40-56, 2013.
DOI : 10.1007/978-3-642-40041-4_3
URL : https://hal.archives-ouvertes.fr/hal-00864298

C. Eder and J. Faugère, A survey on signature-based algorithms for computing gröbner bases, Journal of Symbolic Computation, 2016.

N. Eén and N. Sörensson, An extensible sat-solver, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy ser. Lecture Notes in Computer Science, pp.502-518, 2003.

J. Faugère, A new efficient algorithm for computing Gr??bner bases (F4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-88, 1999.
DOI : 10.1016/S0022-4049(99)00005-5

J. Faugère, V. Gauthier-umana, A. Otmani, L. Perret, and J. Tillich, A Distinguisher for High-Rate McEliece Cryptosystems, IEEE Transactions on Information Theory, vol.59, issue.10, pp.6830-6844, 2013.
DOI : 10.1109/TIT.2013.2272036

J. Faugère, V. Gauthier-umana, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate mceliece cryptosystems, Information Theory Workshop (ITW), pp.282-286, 2011.

J. Faugère, D. Gligoroski, L. Perret, S. Samardjiska, and E. Thomae, A polynomialtime key-recovery attack on MQQ cryptosystems Available: https, IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, 2015.

J. Faugère, A. Joux, L. Perret, and J. Treger, Cryptanalysis of the Hidden Matrix Cryptosystem, Progress in Cryptology, pp.241-254, 2010.
DOI : 10.1007/978-3-642-14712-8_15

J. Faugère, F. Levy-dit-vehel, and L. Perret, Cryptanalysis of MinRank, ser. Lecture Notes in Computer Science, vol.5157, pp.280-296, 2008.
DOI : 10.1007/978-3-540-85174-5_16

J. Faugère, D. Lin, L. Perret, and T. Wang, On enumeration of polynomial equivalence classes and their application to mpkc, Finite Fields and Their Applications, vol.18, issue.2, pp.283-302, 2012.

J. Faugère, R. Odegard, L. Perret, and D. Gligoroski, Analysis of the MQQ Public Key Cryptosystem, SCC'10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pp.101-116, 2010.
DOI : 10.1007/978-3-642-17619-7_13

E. Goi and C. Security, Kuala Lumpur (Malaysia), pp.1-14, 2010.

J. Faugère, A. Otmani, L. Perret, F. D. Portzamparc, and J. Tillich, Structural cryptanalysis of Mceliece schemes with compact keys Available: https, Designs, Codes and Cryptography, pp.87-112, 2016.

J. Faugère, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate mceliece cryptosystem ? extended abstract, Yet Another Conference on Cryptography, pp.1-4, 2010.

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic Cryptanalysis of McEliece Variants with Compact Keys, Proceedings of Eurocrypt 2010, pp.279-298, 2010.
DOI : 10.1007/978-3-642-13190-5_14

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic Cryptanalysis of McEliece variants with compact keys ? toward a complexity analysis, Yet Another Conference on Cryptography, pp.1-4, 2010.

J. Faugère and L. Perret, Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects, Advances in Cryptology -EUROCRYPT 2006, pp.30-47, 2006.
DOI : 10.1007/11761679_3

J. Faugère, L. Perret, and F. Portzamparc, Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form, Advances in Cryptology Asiacrypt 2014, 2014.
DOI : 10.1007/978-3-662-45611-8_2

J. Faugère, L. Perret, F. De-portzamparc, A. Otmani, and J. Tillich, Structural weakness of compact variants of the Mceliece cryptosystem Available: https, IEEE International Symposium on Information Theory -ISIT 2014, pp.1717-1721, 2014.

J. Faugère, L. Perret, C. Petit, and G. Renault, Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields, Advances in Cryptology EU- ROCRYPT 2012, pp.27-44
DOI : 10.1007/978-3-642-29011-4_4

J. Faugère, L. Perret, and P. Spaenlehauer, Algebraic-differential cryptanalysis of DES, pp.1-5, 2009.

J. Faugère, J. Zur-gathen, and L. Perret, Decomposition of generic multivariate polynomials, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.131-137, 2010.
DOI : 10.1145/1837934.1837963

J. Faugère, Algebraic cryptanalysis of HFE using Gröbner bases " , INRIA, Reasearch report RR-4738, 2003.

K. Fukuda, J. Hoeven, M. Joswig, and N. , FGb: a library for computing gröbner bases, Mathematical Software -ICMS 2010, pp.84-87, 2010.

J. Faugère, M. S. Din, and P. Spaenlehauer, Computing loci of rank defects of linear matrices using gröbner bases and applications to cryptology, Symbolic and Algebraic Computation, International Symposium Proceedings, W. Koepf, pp.257-264, 2010.

J. Faugère, M. S. Din, and T. Verron, On the complexity of computing Gr??bner bases for weighted homogeneous systems, Journal of Symbolic Computation, vol.76, pp.107-141, 2016.
DOI : 10.1016/j.jsc.2015.12.001

J. Faugère, M. S. Din, and P. Spaenlehauer, Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology, ISSAC 2010: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, pp.257-264, 2010.

J. Faugère, P. Gaudry, L. Huot, and G. Renault, Sub-cubic change of ordering for gröbner basis: A probabilistic approach, International Symposium on Symbolic and Algebraic Computation, pp.170-177, 2014.

J. Faugère, P. M. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

J. Faugère, D. Gligoroski, L. Perret, S. Samardjiska, and E. Thomae, A polynomialtime key-recovery attack on MQQ cryptosystems, PKC 2015 ser. LNCS, pp.150-174, 2015.

J. Faugère and A. Joux, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using gröbner bases, CRYPTO 2003, D. Boneh, Ed., ser. LNCS, pp.44-60, 2003.

J. Faugère, F. Levy-dit-vehel, and L. Perret, Cryptanalysis of MinRank, pp.280-296, 2008.
DOI : 10.1007/978-3-540-85174-5_16

J. Faugère and C. Mou, Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices, ISSAC 2011: Proceedings of the 2011 International Symposium on Symbolic and Algebraic Computation, pp.115-122, 2011.

J. Faugère, A. Otmani, L. Perret, F. De-portzamparc, and J. Tillich, Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups, IEEE Transactions on Information Theory, vol.62, issue.1, pp.184-198, 2016.
DOI : 10.1109/TIT.2015.2493539

J. Faugère and L. Perret, Cryptanalysis of 2R??? Schemes, Lecture Notes in Computer Science, vol.4117, pp.357-372, 2006.
DOI : 10.1007/11818175_21

J. Faugère, M. Safey-el-din, and P. 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

J. Faugère, P. Spaenlehauer, and J. Svartz, Sparse Gröbner bases: The unmixed case, International Symposium on Symbolic and Algebraic Computation, pp.178-185, 2014.

S. A. Abramov, E. V. Zima, and X. Gao, Computing small certificates of inconsistency of quadratic fewnomial systems, Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, pp.223-230, 2016.

J. Faugère and J. Svartz, Gröbner bases of ideals invariant under a commutative group: The non-modular case, International Symposium on Symbolic and Algebraic Computation, pp.347-354, 2013.

M. Fellows and N. Koblitz, Combinatorial cryptosystems galore! " , in Finite Fields: Theory , Applications, and Algorithms, ser. Contemporary
DOI : 10.1090/conm/168/01688

L. D. Feo, D. Jao, and J. Plût, Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies, J. Mathematical Cryptology, vol.8, issue.3, pp.209-247, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00652846

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, CRYPTO'86, A. M. Odlyzko, Ed., ser. LNCS, pp.186-194, 1987.
DOI : 10.1007/3-540-47721-7_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.8796

M. Finiasz and N. Sendrier, Security Bounds for the Design of Code-Based Cryptosystems, ASIACRYPT 2009, M. Matsui, Ed., ser. LNCS, pp.88-105, 2009.
DOI : 10.1007/978-3-642-10366-7_6

R. Fröberg, An inequality for Hilbert series of graded algebras., MATHEMATICA SCANDINAVICA, vol.56, pp.117-144, 1985.
DOI : 10.7146/math.scand.a-12092

R. Fröberg and J. Hollman, Hilbert Series for Ideals Generated by Generic Forms, Journal of Symbolic Computation, vol.17, issue.2, pp.149-157, 1994.
DOI : 10.1006/jsco.1994.1008

P. Gaborit, Shorter keys for code based cryptography, Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), pp.81-91, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00078726

S. D. Galbraith, Space-efficient variants of cryptosystems based on learning with errors, https

F. L. Gall, 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

S. Gao, Y. Guan, F. Volny, and I. , A new incremental algorithm for computing Groebner bases, Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC '10, pp.13-19, 2010.
DOI : 10.1145/1837934.1837944

S. Gao, F. V. Iv, and M. Wang, A new framework for computing gröbner bases, Math. Comput, vol.85, issue.297, 2016.

X. Gao and Z. Huang, Characteristic set algorithms for equation solving in finite fields, Journal of Symbolic Computation, vol.47, issue.6, pp.655-679, 2012.
DOI : 10.1016/j.jsc.2011.12.025
URL : http://dx.doi.org/10.1016/j.jsc.2011.12.025

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, 1979.

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

C. Gentry, A fully homomorphic encryption scheme, 2009.

C. Gentry, S. Halevi, and N. P. Smart, Homomorphic Evaluation of the AES Circuit, CRYPTO 2012, ser. LNCS, pp.850-867, 2012.
DOI : 10.1007/978-3-642-32009-5_49

O. Goldreich and L. A. Levin, A hard-core predicate for all one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing , STOC '89, pp.25-32, 1989.
DOI : 10.1145/73007.73010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.2079

L. Goubin and N. Courtois, Cryptanalysis of the TTM Cryptosystem, ser. LNCS, pp.44-57, 2000.
DOI : 10.1007/3-540-44448-3_4

A. Gouget and J. Patarin, Probabilistic Multivariate Cryptography, Progress in Cryptology -VIETCRYPT 06, ser. LNCS, pp.1-18, 2006.
DOI : 10.1007/11958239_1

L. Granboulan, A. Joux, and J. Stern, Inverting HFE Is Quasipolynomial, LNCS, vol.4117, pp.345-356, 2006.
DOI : 10.1007/11818175_20
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.844

L. K. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.212-219, 1996.
DOI : 10.1145/237814.237866
URL : http://arxiv.org/abs/quant-ph/9605043

G. Herold, E. Kirshanova, and A. May, On the asymptotic complexity of solving LWE, Cryptology ePrint Archive, 1222.

A. Hülsing, Practical forward secure signatures using minimal security assumptions, 2013.

A. Hülsing, J. Rijneveld, S. Samardjiska, and P. Schwabe, From 5-pass MQ-based identification to MQ-based signatures, IACR Cryptology ePrint Archive, vol.2016708, p.708, 2016.

D. Jao and L. D. Feo, Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies, Post-Quantum Cryptography -4th International Workshop, pp.19-34, 2011.
DOI : 10.1007/11533719_44
URL : https://hal.archives-ouvertes.fr/hal-00652846

G. Kabatianskii, E. Krouk, and B. Smeets, A digital signature scheme based on random error-correcting codes, Crytography and Coding: 6th IMA International Conference Proceedings, M. Darnell, pp.161-167, 1997.
DOI : 10.1007/BFb0024461

K. Kalach and R. Safavi-naini, An Efficient Post-Quantum One-Time Signature Scheme, Selected Areas in Cryptography -SAC 2015 -22nd International Conference, pp.331-351, 2015.
DOI : 10.3934/amc.2011.5.473

M. Kaplan, G. Leurent, A. Leverrier, and M. Naya-plasencia, Breaking Symmetric Cryptosystems Using??Quantum??Period Finding, CRYPTO 2016, ser. LNCS, pp.207-237, 2016.
DOI : 10.1007/978-3-662-53008-5_8
URL : https://hal.archives-ouvertes.fr/hal-01404196

A. Kipnis, J. Patarin, and L. Goubin, Unbalanced Oil and Vinegar Signature Schemes, EUROCRYPT'99, J. Stern, Ed., ser. LNCS, 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

A. Kipnis and A. Shamir, Cryptanalysis of the oil and vinegar signature scheme, CRYPTO'98, H. Krawczyk, Ed., ser. LNCS, pp.257-266, 1998.
DOI : 10.1007/BFb0055733

P. Kirchner and P. Fouque, An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices, CRYPTO 2015, ser. LNCS, pp.43-62, 2015.
DOI : 10.1007/978-3-662-47989-6_3

L. Lamport, Constructing digital signatures from a one-way function, 1979.

D. Lazard, Gröbner-bases, Gaussian elimination and resolution of systems of algebraic equations, Proceedings of the European Computer Algebra Conference on Computer Algebra , ser, 1983.

P. J. Lee and E. F. Brickell, An Observation on the Security of McEliece???s Public-Key Cryptosystem, EUROCRYPT'88, C. G. Günther, Ed., ser. LNCS, pp.275-280, 1988.
DOI : 10.1007/3-540-45961-8_25

J. S. Leon, A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Transactions on Information Theory, vol.34, issue.5, pp.1354-1359, 1988.
DOI : 10.1109/18.21270

T. Li, Z. Lin, and F. Bai, Heuristic methods for computing the minimal multi-homogeneous B??zout number, Applied Mathematics and Computation, vol.146, issue.1, pp.237-256, 2003.
DOI : 10.1016/S0096-3003(02)00540-4

S. Ling, D. H. Phan, D. Stehlé, and R. Steinfeld, Hardness of k-LWE and applications in traitor tracing, CRYPTO 2014, ser. LNCS, pp.315-334, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01091300

F. Liu, C. Lu, and B. Yang, Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$, Post-Quantum Cryptography, Second International Workshop Proceedings, pp.181-202, 2008.
DOI : 10.1007/978-3-540-27800-9_24

P. Loidreau and N. Sendrier, Weak keys in the McEliece public-key cryptosystem, IEEE Transactions on Information Theory, vol.47, issue.3, pp.1207-1211, 2001.
DOI : 10.1109/18.915687

D. Lokshtanov, R. Paturi, S. Tamaki, R. Williams, and H. Yu, Beating brute force for systems of polynomial equations over finite fields, to appear, 27th ACM-SIAM Symposium on Discrete Algorithms, 2017.

V. Lyubashevsky and D. Micciancio, Asymptotically Efficient Lattice-Based Digital Signatures, Theory of Cryptography, Fifth Theory of Cryptography Conference, pp.37-54978, 2008.
DOI : 10.1007/978-3-540-78524-8_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.1767

V. Lyubashevsky, D. Micciancio, C. Peikert, and A. Rosen, SWIFFT: A Modest Proposal for FFT Hashing, pp.54-72, 2008.
DOI : 10.1007/978-3-540-71039-4_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.4697

V. Lyubashevsky, C. Peikert, and O. Regev, On ideal lattices and learning with errors over rings, EUROCRYPT 2010, H. Gilbert, Ed., ser. LNCS, pp.1-23, 2010.
DOI : 10.1007/978-3-642-13190-5_1
URL : https://hal.archives-ouvertes.fr/hal-00921792

F. S. Macaulay, On some formula in elimination, pp.3-27, 1902.

F. Macaulay, The Algebraic Theory of Modular Systems, 1916.

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes, Fifth, 1986.

G. Malajovich and K. Meer, Computing Minimal Multi-homogeneous B??zout Numbers Is Hard, STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, pp.244-255, 2005.
DOI : 10.1007/978-3-540-31856-9_20

T. Matsumoto and H. Imai, Public quadratic polynominal-tuples for efficient signatureverification and message-encryption, pp.419-453, 1988.
DOI : 10.1007/3-540-45961-8_39
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.2397

A. May and I. Ozerov, On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes, EUROCRYPT 2015, ser. LNCS, pp.203-228, 2015.
DOI : 10.1007/978-3-662-46800-5_9

R. J. Mceliece, A public-key system based on algebraic coding theory, pp.114-116, 1978.

D. D. Mcgrew, M. Curcio, and S. Fluhrer, Hash-based signatures " , Internet Engineering Task Force, Internet-Draft draft-mcgrew-hash-sigs-05, Progress, 37 pp. [Online]. Available, 2016.

R. C. Merkle, A Certified Digital Signature, ser. LNCS, pp.218-238, 1990.
DOI : 10.1007/0-387-34805-0_21

D. Micciancio and P. Mol, Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions, CRYPTO 2011, P. Rogaway, Ed., ser. LNCS, pp.465-484, 2011.
DOI : 10.1007/978-3-642-22792-9_26

D. Micciancio and C. Peikert, Hardness of SIS and LWE with Small Parameters, CRYPTO 2013, ser. LNCS, pp.21-39, 2013.
DOI : 10.1007/978-3-642-40041-4_2

D. Micciancio and O. Regev, Lattice-based cryptography, pp.147-191978, 2009.
DOI : 10.1007/978-3-540-88702-7_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.6557

R. Misoczki and P. S. Barreto, Compact McEliece Keys from Goppa Codes, Selected Areas in Cryptography, 2009.
DOI : 10.1007/978-3-642-05445-7_24
URL : https://hal.archives-ouvertes.fr/hal-00870932

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

V. Nachef, J. Patarin, and E. Volte, Zero-knowledge for multivariate polynomials, Cryptology ePrint Archive, 2012.
DOI : 10.1007/978-3-642-33481-8_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.5138

L. Nicklasson, On the Hilbert series of ideals generated by generic forms, Communications in Algebra, vol.56, issue.8, 2015.
DOI : 10.1006/jabr.1997.7361

R. Nojima, H. Imai, K. Kobara, and K. Morozov, Semantic security for the McEliece cryptosystem without random oracles, Designs, Codes and Cryptography, vol.46, issue.4, pp.289-305, 2008.
DOI : 10.1007/s10623-008-9175-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.8200

Y. Oren, M. Renauld, F. Standaert, and A. Wool, Algebraic Side-Channel Attacks Beyond the Hamming Weight Leakage Model, CHES 2012, E. Prouff and P. Schaumont, Eds., ser. LNCS, pp.140-154, 2012.
DOI : 10.1007/978-3-642-33027-8_9

R. Overbeck and N. Sendrier, Code-based cryptography, pp.95-145, 2009.
DOI : 10.1007/978-3-540-88702-7_4

J. Patarin, Cryptoanalysis of the Matsumoto and Imai public key scheme of euro- crypt'88, CRYPTO'95, D. Coppersmith, Ed., ser. LNCS, pp.248-261, 1995.

J. Patarin, N. Courtois, and L. Goubin, QUARTZ, 128-Bit Long Digital Signatures, CT-RSA 2001, D. Naccache, Ed., ser. LNCS, pp.282-297, 2001.
DOI : 10.1007/3-540-45353-9_21

?. Quartz, 128-bit long digital signatures The Cryptographer's Track at RSA Conference, Topics in Cryptology -CT-RSA 2001, pp.282-297, 2001.

C. Peikert, Public-key cryptosystems from the worst-case shortest vector problem, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.333-342, 2009.
DOI : 10.1145/1536414.1536461

C. Peikert, V. Vaikuntanathan, and B. Waters, A Framework for Efficient and Composable Oblivious Transfer, ser. LNCS, pp.554-571, 2008.
DOI : 10.1007/978-3-540-85174-5_31

L. Perret, Algebraic and combinatorial tools for public key cryptography Available: https, 2005.

E. Persichetti, Compact McEliece keys based on quasi-dyadic Srivastava codes, Journal of Mathematical Cryptology, vol.6, issue.2, pp.149-169, 2012.
DOI : 10.1515/jmc-2011-0099

A. Petzoldt, S. Bulygin, and J. A. Buchmann, A multivariate based threshold ring signature scheme, Applicable Algebra in Engineering, Communication and Computing, vol.26, issue.5, pp.255-275, 2013.
DOI : 10.1007/s00200-013-0190-3

E. Prange, The use of information sets in decoding cyclic codes, IEEE Transactions on Information Theory, vol.8, issue.5, pp.5-9, 1962.
DOI : 10.1109/TIT.1962.1057777

E. I. Qsc, Quantum-safe cryptography (QSC); quantum-safe algorithmic framework

H. Raddum and I. A. Semaev, New technique for solving sparse equation systems, IACR Cryptology ePrint Archive, p.475475, 2006.

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, pp.84-93, 2005.
DOI : 10.1145/1060590.1060603
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5202

M. Renauld, F. Standaert, and N. Veyrat-charvillon, Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA, CHES 2009, ser. LNCS, pp.97-111, 2009.
DOI : 10.1007/978-3-642-04138-9_8

K. Sakumoto, Public-Key Identification Schemes Based on Multivariate Cubic Polynomials, PKC 2012, ser. LNCS, pp.172-189, 2012.
DOI : 10.1007/978-3-642-30057-8_11

K. Sakumoto, T. Shirai, and H. Hiwatari, On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack, Post-Quantum Cryptography -4th International Workshop, pp.68-82978, 2011.
DOI : 10.1007/978-3-642-22792-9_40

P. Schwabe and B. Westerbaan, Solving binary MQ with grover's algorithm, SPACES'16, 2016.
DOI : 10.1007/978-3-319-49445-6_17

J. T. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM, vol.27, issue.4, pp.701-717, 1980.
DOI : 10.1145/322217.322225

I. A. Semaev, On solving sparse algebraic equations over finite fields, Des. Codes Cryptography, pp.47-60, 2008.
DOI : 10.1007/s10623-008-9182-x

N. Sendrier, Cryptosystèmes à clé publique basés sur les codes correcteurs d'erreurs " , Mémoire d'habilitation à diriger des recherches, 2002.

P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1997.
DOI : 10.1137/S0097539795293172

I. Simonetti, J. Faugère, and L. Perret, Algebraic attack against trivium, First International Conference on Symbolic Computation and Cryptography, SCC 08, pp.95-102, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01305667

M. Soos, K. Nohl, and C. Castelluccia, Extending SAT Solvers to Cryptographic Problems, Theory and Applications of Satisfiability Testing -SAT 2009, 12th International Conference, pp.244-257, 2009.
DOI : 10.1007/s10817-007-9074-1

P. Spaenlehauer, Solving multi-homogeneous and determinantal systems. algorithms -complexity -applications
URL : https://hal.archives-ouvertes.fr/tel-01110756

D. Stehlé, R. Steinfeld, K. Tanaka, and K. Xagawa, Efficient Public Key Encryption Based on Ideal Lattices, ASIACRYPT 2009, M. Matsui, Ed., ser. LNCS, pp.617-635, 2009.
DOI : 10.1007/978-3-642-10366-7_36

J. Stern, A method for finding codewords of small weight, Coding Theory and, pp.106-113, 1988.
DOI : 10.1007/BFb0019850

M. Sugita, M. Kawazoe, L. Perret, and H. Imai, Algebraic Cryptanalysis of 58-Round SHA-1, ser. Lecture Notes in Computer Science, vol.4593, pp.349-365, 2007.
DOI : 10.1007/978-3-540-74619-5_22
URL : https://hal.archives-ouvertes.fr/hal-01336553

J. Svartz-theses, U. Pierre, M. Curie-paris, and V. , Solving zero-dimensional structured polynomial systems Available: https, 2014.

A. Szanto, Multivariate subresultants using Jouanolou matrices, Journal of Pure and Applied Algebra, vol.214, issue.8, pp.1347-1369, 2010.
DOI : 10.1016/j.jpaa.2009.11.002
URL : http://doi.org/10.1016/j.jpaa.2009.11.002

S. D. Hodges and J. Schalter, On the existence of semi-regular sequences, Arxiv, 2014.

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

R. C. Torres, N. Sendrier, T. Takagi, and E. , Analysis of Information Set Decoding for a Sub-linear Error Weight, Post-Quantum Cryptography -7th International Workshop Proceedings, pp.144-161, 2016.
DOI : 10.1007/978-3-319-29360-8_10
URL : https://hal.archives-ouvertes.fr/hal-01244886

B. Yang, Post-Quantum Cryptography -4th International Workshop, Proceedings ser. Lecture Notes in Computer Science, vol.7071, pp.978-981, 2011.

G. Yang, S. Tang, and L. Yang, A Novel Group Signature Scheme Based on MPKC, Information Security Practice and Experience -7th International Conference, pp.181-195978, 2011.
DOI : 10.1007/978-3-642-21031-0_14

B. Yang, J. Chen, and Y. Chen, TTS: High-Speed Signatures on a Low-Cost Smart Card, CHES 2004, ser. LNCS, pp.371-385, 2004.
DOI : 10.1007/978-3-540-28632-5_27

B. Yang, J. Chen, and N. Courtois, On Asymptotic Security Estimates in XL and Gr??bner Bases-Related Algebraic Cryptanalysis, ICICS 2004, pp.401-413, 2004.
DOI : 10.1007/978-3-540-30191-2_31