An Introduction to Gröbner Bases, Graduate Studies in Mahematics, vol.3, 1994. ,
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. ,
Asymptotic behaviour of the degree of regularity of semiregular polynomial systems, Proc. of MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, 2005. ,
Hybrid approach for solving multivariate systems over finite fields, Journal of Mathematical Cryptology, pp.177-197, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-01148127
Cryptanalysis of multivariate and odd-characteristic hfe variants, Public Key Cryptography ? PKC 2011, pp.441-458, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-01287981
Analysis of Intermediate Field Systems, 2008. ,
Time-area optimized public-key engines: MQcryptosystems as replacement for elliptic curves?, Cryptographic Hardware and Embedded Systems ? CHES '08, pp.45-61, 2008. ,
The Magma algebra system I: The user language, Journal of Symbolic Computation, vol.24, pp.3-4235, 1997. ,
Bruno buchberger's phd thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, J Symb Comput, vol.41, pp.3-4475, 2006. ,
Comments on the translation of my phd thesis, J Symb Comput, vol.41, pp.3-4471, 2006. ,
The computational complexity of some problems of linear algebra, Journal of Computer and System Sciences, 1999. ,
SSE implementation of multivariate PKCs on modern x86 CPUs, Cryptographic Hardware and Embedded Systems ? CHES 2009, pp.33-48, 2009. ,
Odd-char multivariate Hidden Field Equations, Cryptology ePrint Archive, p.543, 2008. ,
Cryptanalysis of the TTM cryptosystem Advances in Cryptology ? ASI- ACRYPT '00, Lecture Notes in Computer Science, pp.44-57, 1976. ,
Efficient zero-knowledge authentication based on a linear algebra problem MinRank, Advances in Cryptology ? ASIACRYPT 2001, pp.402-421, 2001. ,
) Ideals, Varieties and Algorithms, 2005. ,
A probabilistic remark on algebraic program testing, Information Processing Letters, vol.7, issue.4, pp.192-194, 1978. ,
Inverting hfe systems is quasi-polynomial for all fields, Lecture Notes in Computer Science, vol.6841, pp.724-742, 2011. ,
Algebraic attack on HFE revisited, In: Information Security LNCS, vol.5222, pp.215-227, 2008. ,
The degree of regularity of HFE systems, Advances in Cryptology ? ASI- ACRYPT 2011, pp.557-576, 2011. ,
A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, vol.139, pp.61-88, 1999. ,
A new efficient algorithm for computing Gröbner bases without reduction to zero (F5), Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation ISSAC, pp.75-83, 2002. ,
Algebraic cryptanalysis of HFE using Gröbner bases, 2003. ,
FGb: A Library for Computing Gröbner Bases, Lecture Notes in Computer Science, vol.632787, 2010. ,
Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases, Advances in Cryptology ? CRYPTO 2003, pp.44-60, 2003. ,
Cryptanalysis of MinRank, Advances in Cryptology ? CRYPTO 2008, pp.280-296, 2008. ,
Computing loci of rank defects of linear matrices using gröbner bases and applications to cryptology, pp.257-264, 2010. ,
Gröbner Bases of Bihomogeneous Ideals Generated by Polynomials of Bidegree (1,1): Algorithms and Complexity, Journal of Symbolic Computation, pp.1-39, 2010. ,
On the complexity of the generalized minrank problem, 2011. ,
An inequality for Hilbert series of graded algebras, Mathematica Scandinavica, vol.56, pp.117-144, 1985. ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,
Inverting HFE is quasipolynomial, Advances in Cryptology ? CRYPTO 2006, pp.345-356, 2006. ,
Kipnis-Shamir attack on HFE revisited, In: Information Security and Cryptology LNCS, vol.4990, pp.399-411, 2007. ,
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, Advances in Cryptology ? CRYPTO '99, pp.19-30, 1999. ,
Unbalanced oil and vinegar signature schemes, Advances in Cryptology ? EUROCRYPT '99, 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
Public quadratic polynomial-tuples for efficient signature-verification and message-encryption, Advances in Cryptology ? EUROCRYPT '88, pp.419-453, 1988. ,
A public key system with signature and master key functions, Communications in Algebra, vol.27, issue.5, pp.2207-2222, 1999. ,
New trends in cryptology, european project " stork: Strategic roadmap for advances in cryptology -crypto, 2003. ,
Cryptoanalysis of the Matsumoto and Imai public key scheme of Eurocrypt '88, Advances in Cryptology ? CRYPTO '95, pp.248-261, 1995. ,
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of asymmetric algorithms, Advances in Cryptology ? EUROCRYPT '96, pp.33-48, 1996. ,
Fast probabilistic algorithms for verification of polynomial identities, Journal of the ACM, vol.27, issue.4, pp.701-717, 1980. ,
Orthogonal Polynomials, 1939. ,
Tractable rational map signature, Public Key Cryptography ? PKC '05, pp.244-257, 2005. ,
Equivalent keys in HFE, C * , and variations, Progress in Cryptology ? Mycrypt 2005, pp.33-49, 2005. ,
Large superfluous keys in multivariate quadratic asymmetric systems, Public Key Cryptography ? PKC 2005, pp.275-287, 2005. ,