, 6.2 ? Décodage des erreurs de poids 4 pour le code RQ, p.7
, 29) de type, pp.31-138
, Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases, 2002.
, Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases, Proc. IEEE International Symposium on Information Theory 2003 (ISIT, p.362, 2003.
, Using the trace operator to repair the polynomial-based reconstruction cryptosystem presented at eurocrypt, Report, vol.209, 2003.
, Algebraic Attacks on Combiners with Memory, Advances in Cryptology -CRYPTO 2003, pp.162-175, 2003.
DOI : 10.1007/978-3-540-45146-4_10
, On weights in quadratic-residue codes, Discrete Mathematics, vol.3, issue.1-3, pp.1-20, 1972.
DOI : 10.1016/0012-365X(72)90021-0
, Thin algebras of embedding dimension three, J. Algebra, vol.100, issue.1, pp.235-259, 1986.
, Handbook of mathematical functions with formulas, graphs, and mathematical tables, 1992.
, Etude algébrique des mots de poids minimum des codes cycliques, Méthodes d'algèbre linéaire sur les corps finis, 1993.
, Description of minimum weight codewords of cyclic codes by algebraic systems, Finite Fields Appl, vol.2, pp.138-152, 1996.
, Complexity issues in coding theory, Electronic Colloquium on Computational Complexity (ECCC), vol.4, issue.046, 1997.
, Complexity issues in coding theory, Handbook of coding theory, pp.649-754, 1998.
, Block ciphers and systems of quadratic equations Algebraic coding theory Gröbner bases over Galois rings with an application to decoding alternant codes Complexity of gröbner basis computation for semi-regular overdetermined sequences over GF(2) with solutions in GF, Proceedings of Fast Software Encryption Faugère, and B. Salvy. On the complexity of gröbner basis computation of semi-regular overdetermined algebraic equations, pp.291-306565, 1968.
, The shape of the Shape Lemma, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.129-133, 1994.
DOI : 10.1145/190347.190382
, 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
, Computational aspects of commutative algebra Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal [Buc83] B. Buchberger. A note on the complexity of constructing Gröbnerbases A computational approach to commutative algebra, Computer algebra cooperation with Heinz Kredel. [CFU57] C. Chester, B. Friedman, and F. Ursell. An extension of the method of steepest descents. Proc. Camb. Philos. Soc, pp.135-147, 1957.
, Ideals, varieties, and algorithms. Undergraduate Texts in Mathematics An introduction to computational algebraic geometry and commutative algebra The Chen-Reed-Helleseth-Truong decoding algorithm and the Gianni-Kalkbrenner Gröbner shape theorem Algebraic attacks on stream ciphers with linear feedback Cryptanalysis of block ciphers with overdefined systems of equations Algebraic decoding of cyclic codes : a polynomial ideal point of view, Converting bases with the gröbner walk. J. Symbolic Comput Advances in Cryptology ? EUROCRPYT '03Cop94] D. Coppersmith. Solving homogeneous linear equations over GF (2) via block Wiedemann algorithm Advances in Cryptology -ASIACRYPT 2002, number 2501 in LNCS Finite fields : theory, applications, and algorithms, pp.465-469209, 1993.
, General principles for the algebraic decoding of cyclic codes Use of Gröbner bases to decode binary cyclic codes up to the true minimum distance Decoding the (73,37,13) quadratic residue code Matrix multiplication via arithmetic progressions Asymptotic methods in analysis, IEEE Trans. Inform. Theory IEEE Trans. Inform. Theory IEE Proc. Comput. Digit. Tech. J. Symbolic Comput, vol.40, issue.150, pp.1661-16631654, 1990.
, A new efficient algorithm for computing Gröbner bases (F 4 ) Effective methods in algebraic geometry, J. Pure Appl. Algebra, vol.139, issue.1-3, pp.61-88, 1998.
, A new efficient algorithm for computing Gröbner bases without reduction to zero (f 5 ) Algebraic cryptanalysis of hfe using gröbner bases, pp.75-83, 2002.
, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344153, 1993.
DOI : 10.1006/jsco.1993.1051
, Comparison of two algorithms for decoding alternant codes Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases Advances in Cryptology -CRYPTO [Frö85] R. Fröberg. An inequality for Hilbert series of graded algebras Complexity of problems in games, graphs and algebraic equations Properties of Gröbner bases under specializations Algebraic solution of systems of polynomial equations using groebner bases, Hilbert series for ideals generated by generic forms. J. Symbolic ComputFY80] A. S. Fraenkel and Y. Yesha. Complexity of solving algebraic equations Some effectivity problems in polynomial ideal theory Applied algebra, algebraic algorithms and error-correcting codes, Proc. 5th Int. Conf., AAECC-5, pp.149-157211, 1979.
, One sugar cube, please " or selection strategies in the Buchberger algorithm, ISSAC '91. Proceedings of the 1991 international symposium on Symbolic and algebraic computation, pp.49-54, 1991.
, Decoding the ternary Golay code, IEEE Transactions on Information Theory, vol.39, issue.3, pp.1043-1046, 1993.
DOI : 10.1109/18.256511
, Algebraic decoding of the ternary) quadratic residue code, IEEE Trans. Inform. Theory, vol.13, issue.383, pp.1122-1125, 1992.
, Algebraic aspects of cryptography, volume 3 of Algorithms and Computation in Mathematics With an appendix by, 1998.
, Algebra, volume 211 of Graduate Texts in Mathematics, 2002.
, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, Computer algebra, pp.146-156, 1983.
, Solving systems of algebraic equations, ACM SIGSAM Bulletin, vol.35, issue.3, pp.11-37, 2001.
, Finite fields, 1997.
DOI : 10.1017/CBO9780511525926
, On the Decoding of Cyclic Codes Using Gr??bner Bases, Applicable Algebra in Engineering, Communication and Computing, vol.8, issue.6, pp.469-483, 1997.
DOI : 10.1007/s002000050084
, On some formula in elimination, pp.3-27, 1902.
, The Algebraic Theory of Modular Systems. Cambridge Mathematical Library, 1916.
, Commutative ring theory, volume 8 of Cambridge Studies in Advanced Mathematics, 1989.
, A public-key cryptosystem based on algebraic coding theory, pp.114-130, 1978.
, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Advances in cryptology ? EUROCRYPT '88 (Davos, 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
, The complexity of the word problems for commutative semigroups and polynomial ideals, Advances in Mathematics, vol.46, issue.3, pp.305-329, 1982.
DOI : 10.1016/0001-8708(82)90048-2
, 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
, A block Lanczos algorithm for finding dependencies over GF Advances in cryptology -EURO- CRYPT '95. International conference on the theory and application of cryptographic techniques, LNCS, vol.921, issue.2, pp.106-120, 1995.
, Essential Algebraic Structure within the AES, Advances in Cryptology ? CRYPTO 2002, pp.1-16, 2002.
DOI : 10.1007/3-540-45708-9_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.484
, The Theory of Error-Correcting Codes, 1977.
, Autour de la fonction de Hilbert-Samuel (escaliers d'idéaux polynomiaux), 1991.
, On the Gröbner bases of some symmetric systems and their application to coding theory, J. Symbolic Comput, vol.35, issue.2, pp.177-194, 2003.
, Degrevlex Gröbner bases of generic complete intersections, J. Pure Appl. Algebra, vol.180, issue.3, pp.263-283, 2003.
, Generic sequences of polynomials, 2000.
, Cryptanalysis of the Matsumoto and Imai public key scheme of Eurocrypt '88, Advances in cryptology ? CRYPTO '95, pp.248-261, 1995.
, Hfe first challenge, 1996.
, Hidden fields equations (HFE) and isomorphisms of polynomials (IP) : Two new families of asymmetric algorithms, Advances in cryptology ? EUROCRYPT '96, pp.33-48, 1996.
, Syzygies of semi-regular sequences Preprint available at : http://www.math.lsa.umich On methods of using grobner bases to decode cyclic codes up to actual minimum distance, 1999.
, Decoding the (47,24,11) quadratic residue code, IEEE Transactions on Information Theory, vol.47, issue.3, pp.471181-1186, 2001.
DOI : 10.1109/18.915677
, The algebraic decoding of the (41, 21, 9) quadratic residue code, IEEE Transactions on Information Theory, vol.38, issue.3, pp.974-986, 1992.
DOI : 10.1109/18.135639
, Algebraic decoding of the (32, 16, 8) quadratic residue code, IEEE Transactions on Information Theory, vol.36, issue.4, pp.876-880, 1990.
DOI : 10.1109/18.53750
, Strong bi-homogeneous bezout theorem and its use in effective real algebraic geometry Preprint Available at : http://www-calfor. lip6.fr/~safey/publi.html [Sza01] A. Szanto. Multivariate subresultants using Jouanoulou's resultant matrices. accepted to Journal of Pure and Applied Algebra . Preprint Available at : http://www.mathpreprints.com/math/ Preprint, Submitted to Journal of Complexity, vol.86, issue.2, 1999.
, On the complexity of the Gröbner-bases algorithm over K[x, y, z], In EUROSAM Lecture Notes in Comput. Sci, vol.84, issue.174, pp.184-194, 1984.
, Asymptotic approximations of integrals. Computer Science and Scientific Computing, 1989.