POLSYS   LIP6 Calcul Scientifique UMPC
Home
Publications
 
*Ph.D. Thesis
*Journal Papers
* Conferences A
* Conferences B
* Guest Editors
* Preprints
* Invited Talks
Software
Teaching

Main Publications - Jean-Charles Faugère

New Preprints (other Preprints here)

[1] Christian Eder and Jean-Charles Faugère. A survey on signature-based Gröbner basis computations, April 2014. [ bib | http | Download PDF ]
[2] Jean-Charles Faugère and Chenqi Mou. Sparse FGLM algorithms. preprint, 2013. [ bib | http | Download PDF ]
[3] Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, and Guénaël Renault. Polynomial Systems Solving by Fast Linear Algebra. preprint, 2013. 23 pages. [ bib | http | Download PDF ]

Journal Papers

[1] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric De Portzamparc, and Jean-Pierre Tillich. Structural Cryptanalysis of McEliece Schemes with Compact Keys. Designs, Codes and Cryptography, page 26, January 2015. [ bib | http | http ]
[2] Jérémy Berthomieu, Jean-Charles Faugère, and Ludovic Perret. Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case. Journal of Complexity, (1-39):39, 2015. [ bib | http | Download PDF ]
[3] Magali Bardet, Jean-Charles Faugère, and Bruno Salvy. On the complexity of the F5 Gröbner basis algorithm. Journal of Symbolic Computation, pages 1-24, September 2014. [ bib | Digital Object Identifier | http | http ]
[4] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. On the complexity of the bkw algorithm on lwe. Designs, Codes and Cryptography, July 2013. [ bib | Digital Object Identifier | http | Download PDF ]
[5] Jean-Charles Faugère, Ayoub Gauthier-Umaña, Valérie Otmani, Ludovic Perret, and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystems. IEEE Transactions on Information Theory, pages 1-22, June 2013. [ bib | Digital Object Identifier | http | Download PDF ]
[6] Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, and Guénaël Renault. Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. Journal of Cryptology, pages 1-40, May 2013. [ bib | Digital Object Identifier | http | Download PDF ]
[7] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. On the Complexity of the Generalized MinRank Problem. Journal of Symbolic Computation, 55(0):30-58, March 2013. [ bib | Digital Object Identifier | http | Download PDF ]
[8] Magali Bardet, Jean-Charles Faugère, Bruno Salvy, and Pierre-Jean Spaenlehauer. On the complexity of solving quadratic boolean systems. Journal of Complexity, 29(1):53-75, February 2013. [ bib | Digital Object Identifier | http ]
[9] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Cryptanalysis of hfe, multi-hfe and variants for odd and even characteristic. Designs, Codes and Cryptography, 69(1):1 - 52, 2013. [ bib | Digital Object Identifier | http | Download PDF ]
[10] Claude Carlet, Jean-Charles Faugère, Christopher Goyet, and Guénaël Renault. Analysis of the Algebraic Side Channel Attack. Journal of Cryptographic Engineering, 2:45-62, May 2012. [ bib | Digital Object Identifier | http | Download PDF ]
[11] Jean-Charles Faugère, Dongdai Lin, Ludovic Perret, and Tianze Wang. On enumeration of polynomial equivalence classes and their application to MPKC. Finite Fields and Their Applications, 18(2):283 - 302, 2012. [ bib | Digital Object Identifier | http | Download PDF ]
[12] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, and Ludovic Perret. On the relation between the MXL family of algorithms and Gröbner basis algorithms. Journal of Symbolic Computation, 47:926-941, 2012. in press. [ bib | Digital Object Identifier | Download PDF ]
[13] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. Gröbner Bases of Bihomogeneous Ideals Generated by Polynomials of Bidegree (1,1): Algorithms and Complexity. Journal of Symbolic Computation, 46(4):406-437, 2011. Available online 4 November 2010. [ bib | Digital Object Identifier | Download PDF ]
[14] Jean-Charles Faugère and Ye Liang. Artificial discontinuities of single-parametric Gröbner bases. Journal of Symbolic Computation, 46(4):459-466, 2011. [ bib | Digital Object Identifier | Download PDF ]
[15] Jean-Charles Faugère, David Lubicz, and Damien Robert. Computing modular correspondences for abelian varieties. Journal Of Algebra, 343(1):248-277, 2011. [ bib | Digital Object Identifier | Download PDF ]
[16] Jean-Charles Faugère and Ye Liang. Pivoting in Extended Rings for Computing Approximate Gröbner Bases. Mathematics in Computer Science, 5:179-194, 2011. [ bib | Digital Object Identifier | Download PDF ]
[17] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Hybrid approach for solving multivariate systems over finite fields. Journal of Mathematical Cryptology, 3(3):177-197, 2010. [ bib | Digital Object Identifier | Download PDF ]
[18] Gérald Bourgeois and Jean-Charles Faugère. Algebraic Attack on NTRU using Witt Vectors and Gröbner bases. Journal of Mathematical Cryptology, 3(3):205-214, 2010. [ bib | Digital Object Identifier | Download PDF ]
[19] Daniel Augot, Magali Bardet, and Jean-Charles Faugère. On the decoding of binary cyclic codes with the Newton identities. Journal of Symbolic Computation, 44(12):1608-1625, 2009. [ bib | Digital Object Identifier | Download PDF ]
[20] Jean-Charles Faugère and Ludovic Perret. An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography. Journal of Symbolic Computation, 44(12):1676-1689, 2009. [ bib | Digital Object Identifier | Download PDF ]
[21] Frédéric Cazals, Jean-Charles Faugère, Marc Pouget, and Fabrice Rouillier. Ridges and Umbilics of Polynomial Parametric Surfaces. Geometric Modeling and Algebraic Geometry, pages 141-159, 2008. [ bib | Digital Object Identifier | Download PDF ]
[22] Richard Cameron, Jean-Charles Faugère, Fabrice Rouillier, and Fabien Seyfert. Exhaustive approach to the coupling matrix synthesis problem and application to the design of high degree asymmetric filters. Int J RF and Microwave Comp Aid Eng, 17(1):4-12, January 2007. [ bib | Digital Object Identifier | Download PDF ]
[23] Frédéric Cazals, Jean-Charles Faugère, Marc Pouget, and Fabrice Rouillier. The implicit structure of ridges of a smooth parametric surface. Comput. Aided Geom. Des., 23(7):582-598, October 2006. [ bib | Digital Object Identifier | Download PDF ]
[24] Ali Basiri, Andreas Enge, Jean-Charles Faugère, and Nicolas Gürel. The arithmetic of jacobian groups of superelliptic cubics. Mathematics of Computation, 74(249):389-410, 2005. [ bib | Digital Object Identifier | Download PDF ]
[25] Jean-Charles Faugère, Milena Hering, and Jeffrey Phan. The membrane inclusions curvature equations. Advances in Applied Mathematics, 31(4):643-658, June 2003. [ bib | Digital Object Identifier | Download PDF ]
[26] Jean-Charles Faugère. A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra, 139(1-3):61-88, June 1999. [ bib | Digital Object Identifier | Download PDF ]
[27] Jean-Charles. Faugère, François Moreau de Saint-Martin, and Fabrice Rouillier. Design of regular nonseparable bidimensional wavelets using Grobner basis techniques. Signal Processing, IEEE Transactions on, 46(4):845 -856, April 1998. Special Issue on Theory and Applications of Filter Banks and Wavelets. [ bib | Digital Object Identifier | Download PDF ]
[28] Jean-Charles. Faugère and Daniel Lazard. Combinatorial classes of parallel manipulators. Mechanism and Machine Theory, 30(6):765-776, 1995. [ bib | Digital Object Identifier | Download PDF ]
[29] Jean-Charles. Faugère, Patrizia Gianni, Daniel Lazard, and Teo Mora. Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering. Journal of Symbolic Computation, 16(4):329-344, 1993. [ bib | Digital Object Identifier | Download PDF ]

Fully Refereed International Conferences Papers: : Rank A+ or A

[1] Marta Conde Pena, Jean-Charles Faugère, and Ludovic Perret. Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case. In IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, March 2015. [ bib | http | http ]
[2] Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Samardjiska Simona, and Enrico Thomae. A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems. In IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States, March 2015. [ bib | http | http ]
[3] Jean-Charles Faugère, Ludovic Perret, and Frédéric De Portzamparc. Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form. In Advances in Cryptology Asiacrypt 2014, Kaohsiung, Taïwan, September 2014. [ bib | http | Download PDF ]
[4] Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, and Guénaël Renault. Sub-cubic Change of Ordering for Gröbner Basis: A Probabilistic Approach. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pages 170-177, Kobe, Japon, July 2014. ACM. [ bib | Digital Object Identifier | http | Download PDF ]
[5] Jean-Charles Faugère, Pierre-Jean Spaenlehauer, and Jules Svartz. Sparse Gröbner Bases: the Unmixed Case. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC 2014), pages 178-185, Kobe, Japon, May 2014. [ bib | Digital Object Identifier | http | Download PDF ]
[6] Martin Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. Lazy modulus switching for the bkw algorithm on lwe. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 429-445, Buenos Aires, Argentina, March 2014. Springer Berlin Heidelberg. [ bib | Digital Object Identifier | http | Download PDF ]
[7] Martin Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret, Yosuke Todo, and Keita Xagawa. Practical cryptanalysis of a public-key encryption scheme based on new multivariate quadratic assumptions. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 446-464, Buenos Aires, Argentina, March 2014. Springer Berlin Heidelberg. [ bib | Digital Object Identifier | http | Download PDF ]
[8] Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, and Rina Zeitoun. Rounding and chaining lll: Finding faster small roots of univariate polynomial congruences. In Hugo Krawczyk, editor, Public-Key Cryptography PKC 2014, volume 8383 of Lecture Notes in Computer Science, pages 185-202, Buenos Aires, Argentina, 2014. Springer Berlin Heidelberg. [ bib | Digital Object Identifier | http | Download PDF ]
[9] Jean-Charles Faugère, Louise Huot, Antoine Joux, Guénaël Renault, and Vanessa Vitse. Symmetrized summation polynomials: Using small order torsion points to speed up elliptic curve index calculus. In Advances in Cryptology EUROCRYPT 2014, volume 8441 of Lecture Notes in Computer Science, pages 40-57, Copenhagen, Denmark, 2014. Springer Berlin Heidelberg. [ bib | Digital Object Identifier | http ]
[10] Jean-Charles Faugère and Jules Svartz. Gröbner Bases of ideals invariant under a Commutative group : the Non-modular Case. In Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pages 347-354, New York, NY, USA, 2013. ACM. [ bib | Digital Object Identifier | http | Download PDF ]
[11] Jean-Charles Faugère, Mohab Safey El Din, and Thibaut Verron. On the complexity of Computing Gröbner Bases for Quasi-homogeneous Systems. In Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation, ISSAC '13, pages 189-196, New York, NY, USA, 2013. ACM. [ bib | Digital Object Identifier | http | Download PDF ]
[12] Jean-Charles Faugère, Ludovic Perret, Christophe Petit, and Guénaël Renault. Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields. In David Pointcheval and Thomas Johansson, editors, Advances in Cryptology EUROCRYPT 2012, volume 7237 of Lecture Notes in Computer Science, pages 27-44. Springer Berlin / Heidelberg, 2012. [ bib | Digital Object Identifier | Download PDF ]
[13] Jean-Charles Faugère and Jules Svartz. Solving Polynomial Systems Globally Invariant Under an Action of the Symmetric Group and Application to the Equilibria of N vortices in the Plane. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 170-178, New York, NY, USA, 2012. ACM. [ bib | Digital Object Identifier | Download PDF ]
[14] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Solving Polynomial Systems over Finite Fields: Improved Analysis of the Hybrid Approach. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 67-74, New York, NY, USA, 2012. ACM. [ bib | Digital Object Identifier | Download PDF ]
[15] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. Critical Points and Gröbner Bases: the Unmixed Case. In Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pages 162-169, New York, NY, USA, 2012. ACM. [ bib | Digital Object Identifier | Download PDF ]
[16] Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, and Ludovic Perret. Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem. In D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, editors, Public Key Cryptography - PKC 2011, volume 6571 of Lecture Notes in Computer Science, pages 473-493. Springer Berlin / Heidelberg, 2011. [ bib | Digital Object Identifier | Download PDF ]
[17] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants. In D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, editors, Public Key Cryptography - PKC 2011, volume 6571 of Lecture Notes in Computer Science, pages 441-458. Springer Berlin / Heidelberg, 2011. [ bib | Digital Object Identifier | Download PDF ]
[18] Jean-Charles Faugère and Chenqi Mou. Fast Algorithm for Change of Ordering of Zero-dimensional Gröbner Bases with Sparse Multiplication Matrices. In Proceedings of the 36th international symposium on Symbolic and algebraic computation, ISSAC '11, pages 115-122, New York, NY, USA, 2011. ACM. [ bib | Digital Object Identifier | Download PDF ]
[19] Martin Albrecht, Jean-Charles Faugère, Pooya Farshim, and Ludovic Perret. Polly cracker, revisited. In D.H. Lee and X. Wang, editors, Advances in Cryptology Asiacrypt 2011, volume 7073 of Lecture Notes in Computer Science, pages 179-196. Springer Berlin / Heidelberg, 2011. [ bib | Digital Object Identifier | Download PDF ]
[20] Jean-Charles Faugère, Joachim von zur Gathen, and Ludovic Perret. Decomposition of Generic Multivariate Polynomials. In ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, ISSAC '10, pages 131-137, New York, NY, USA, 2010. ACM. isbn: 0747-7171 (updated version). [ bib | Digital Object Identifier | Download PDF ]
[21] Jean-Charles Faugère, Mohab Safey El Din, and Pierre-Jean Spaenlehauer. Computing Loci of Rank Defects of Linear Matrices using Grobner Bases and Applications to Cryptology. In ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, ISSAC '10, pages 257-264, New York, NY, USA, 2010. ACM. Best Student Paper Award. [ bib | Digital Object Identifier | Download PDF ]
[22] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. Algebraic Cryptanalysis of McEliece variants with compact keys. In Proceedings of Eurocrypt 2010, volume 6110 of Lecture Notes in Computer Science, pages 279-298. Springer Verlag, 2010. [ bib | Digital Object Identifier | Download PDF ]
[23] Jean-Charles Faugère and Pierre-Jean Spaenlehauer. Algebraic Cryptanalysis of the PKC'09 Algebraic Surface Cryptosystem. In P.Q. Nguyen and D. Poincheval, editors, Public Key Cryptography PKC 2010, volume 6056 of Lecture Notes in Computer Science, pages 35-52. Springer-Verlag, 2010. [ bib | Digital Object Identifier | Download PDF ]
[24] Jean-Charles Faugère, Raphaël Marinier, and Guénaël Renault. Implicit Factoring with Shared Most Significant and Middle Bits. In P.Q. Nguyen and D. Poincheval, editors, in 13th International Conference on Practice and Theory in Public Key Cryptography - PKC 2010, volume 6056 of Lecture Notes in Computer Science, pages 70-87. Springer-Verlag, 2010. [ bib | Digital Object Identifier | Download PDF ]
[25] Jean-Charles Faugère. Interactions between computer algebra (Gröbner bases) and cryptology. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pages 383-384, New York, NY, USA, 2009. ACM. [ bib | Digital Object Identifier | Download PDF ]
[26] Jean-Charles Faugère and Ludovic Perret. High order derivatives and decomposition of multivariate polynomials. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pages 207-214, New York, NY, USA, 2009. ACM. [ bib | Digital Object Identifier | Download PDF ]
[27] Jean-Charles Faugère and Sajjad Rahmany. Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. In ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, ISSAC '09, pages 151-158, New York, NY, USA, 2009. ACM. [ bib | Digital Object Identifier | Download PDF ]
[28] Jean-Charles Faugère, Françoise Levy-dit Vehel, and Ludovic Perret. Cryptanalysis of minrank. In David Wagner, editor, Advances in Cryptology CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pages 280-296, Berlin, Heidelberg, August 2008. Springer-Verlag. [ bib | Digital Object Identifier | Download PDF ]
[29] Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, and Mohab Safey El Din. Classification of the Perspective-Three-Point problem, discriminant variety and real solving polynomial systems of inequalities. In D. Jeffrey, editor, ISSAC '08: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation, pages 79-86, New York, NY, USA, 2008. ACM. [ bib | Digital Object Identifier | Download PDF ]
[30] Jean-Charles Faugère and Ludovic Perret. Cryptanalysis of 2R- Schemes. In Cynthia Dwork, editor, Advances in Cryptology - CRYPTO 2006, volume 4117 of Lecture Notes in Computer Science, pages 357-372. Springer Berlin / Heidelberg, August 2006. 10.1007/11818175_21. [ bib | Digital Object Identifier | Download PDF ]
[31] Jean-Charles Faugère and Ludovic Perret. Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. In Serge Vaudenay, editor, Advances in Cryptology - EUROCRYPT 2006, volume 4004 of Lecture Notes in Computer Science, pages 30-47. Springer Berlin / Heidelberg, 2006. 10.1007/11761679_3. [ bib | Digital Object Identifier | Download PDF ]
[32] Ali Basiri, Andreas Enge, Jean-Charles Faugère, and Nicolas Gürel. Implementing the Arithmetic of C_3,4 Curves. In Duncan Buell, editor, Algorithmic Number Theory, volume 3076 of Lecture Notes in Computer Science, pages 87-101. Springer Berlin / Heidelberg, June 2004. 10.1007/978-3-540-24847-7_6. [ bib | Digital Object Identifier | Download PDF ]
[33] Gwenolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, and Makoto Sugita. Comparison Between XL and Gröbner Basis Algorithms. In Pil Joong Lee, editor, Advances in Cryptology - ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, pages 157-167. Springer Berlin / Heidelberg, 2004. 10.1007/978-3-540-30539-2_24. [ bib | Digital Object Identifier | Download PDF ]
[34] Jean-Charles Faugère and Antoine Joux. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases. In Boneh Dan, editor, Advances in Cryptology - CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 44-60. Springer Berlin / Heidelberg, 2003. 10.1007/978-3-540-45146-4_3. [ bib | Digital Object Identifier | Download PDF ]
[35] Ali Basiri and Jean-Charles Faugère. Changing the ordering of Gröbner bases with LLL: case of two variables. In Proceedings of the 2003 international symposium on Symbolic and algebraic computation, ISSAC '03, pages 23-29, New York, NY, USA, 2003. ACM. [ bib | Digital Object Identifier | Download PDF ]
[36] Jean-Charles Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In Proceedings of the 2002 international symposium on Symbolic and algebraic computation, ISSAC '02, pages 75-83, New York, NY, USA, 2002. ACM. [ bib | Digital Object Identifier | Download PDF ]

Fully Refereed International Conferences Papers: : Rank B or C

[1] Jean-Charles Faugère, Ludovic Perret, Frédéric De Portzamparc, Ayoub Otmani, and Jean-Pierre Tillich. Structural weakness of compact variants of the McEliece cryptosystem. In IEEE International Symposium on Information Theory - ISIT 2014, pages 1717-1721, Honolulu, United States, June 2014. [ bib | http ]
[2] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. On the complexity of the arora-ge algorithm against lwe. In SCC '12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 93-99, Castro-Urdiales, July 2012. [ bib ]
[3] Martin Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, and Ludovic Perret. On the complexity of bkw algorithm against lwe. In SCC'12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 100-107, Castro-Urdiales, July 2012. [ bib ]
[4] Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, and Guénaël Renault. Using symmetries and fast change of ordering in the index calculus for elliptic curves discrete logarithm. In SCC'12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pages 113-118, Castro-Urdiales, July 2012. [ bib ]
[5] Jean-Charles Faugère, Danilo Gligoroski, Erlend Jensen, Rune Odegard, Ludovic Perret, Svein Johan Knapskog, and Smile Markovski. MQQ-SIG. In Liqun Chen, Moti Yung, and Liehuang Zhu, editors, Trusted Systems - The Third International Conference on Trusted Systems - INTRUST 2011, volume 7222 of Lecture Notes in Computer Science, pages 184-203. Springer Verlag, 2012. [ bib | Digital Object Identifier ]
[6] Jean-Charles Faugère, Christopher Goyet, and Guénaël Renault. Attacking (ec)dsa given only an implicit hint. In LarsR. Knudsen and Huapeng Wu, editors, Selected Areas in Cryptography - SAC 2012, volume 7707 of Lecture Notes in Computer Science, pages 252-274, Ontario, 2012. Springer Berlin Heidelberg. [ bib | Digital Object Identifier | http | Download PDF ]
[7] Martin Albrecht, Carlos Cid, Thomas Dulien, Jean-Charles Faugère, and Ludovic Perret. Algebraic Precomputations in Differential Cryptanalysis. In Xuejia Lai, Moti Yung, and Dongdai Lin, editors, Information Security and Cryptology: 6th International Conference, Inscrypt 2010, Revised Selected Papers, volume 6584, pages 387-403. Springer Berlin / Heidelberg, October 2011. [ bib | Digital Object Identifier | Download PDF ]
[8] Jean-Charles Faugère, Ayoub Gauthier-Umaña, Valérie Otmani, Ludovic Perret, and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystems. In Information Theory Workshop (ITW), 2011 IEEE, pages 282-286, October 2011. [ bib | Digital Object Identifier | Download PDF ]
[9] Jean-Charles Faugère, Valérie Gauthier-Umana, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. A distinguisher for high rate McEliece cryptosystems. In ITW 2011- IEEE Information Theory Workshop, pages 282-286, Paraty, Brazil, October 2011. IEEE. [ bib | Digital Object Identifier | http ]
[10] Jean-Charles Faugère, Christopher Goyet, and Guénaël Renault. Algebraic side channel analysis. In COSADE'11: The 2nd International Workshop on Constructive Side-Channel Analysis and Secure Design, pages 1-6, Fraunhofer SIT, 2011. [ bib ]
[11] Jean-Charles Faugère. Solving efficiently structured polynomial systems and applications in cryptology. In The 15th workshop on Elliptic Curve Cryptography ECC 2011, pages 1-1, 2011. [ bib ]
[12] Jean-Charles Faugère, Rune Odegard, Ludovic Perret, and Danilo Gligoroski. Analysis of the MQQ Public Key Cryptosystem. In Swee-Huay Heng, Rebecca Wright, and Bok-Min Goi, editors, Cryptology and Network Security, volume 6467 of Lecture Notes in Computer Science, pages 169-183. Springer Berlin / Heidelberg, December 2010. [ bib | Digital Object Identifier | Download PDF ]
[13] Jean-Charles Faugère. FGb: A Library for Computing Gröbner Bases. In Komei Fukuda, Joris Hoeven, Michael Joswig, and Nobuki Takayama, editors, Mathematical Software - ICMS 2010, volume 6327 of Lecture Notes in Computer Science, pages 84-87, Berlin, Heidelberg, September 2010. Springer Berlin / Heidelberg. [ bib | Digital Object Identifier | Download PDF ]
[14] Jean-Charles Faugère and Sylvain Lachartre. Parallel Gaussian Elimination for Gröbner bases computations in finite fields. In M. Moreno-Maza and J.L. Roch, editors, Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO '10, pages 89-97, New York, NY, USA, July 2010. ACM. [ bib | Digital Object Identifier | Download PDF ]
[15] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. Algebraic Cryptanalysis of McEliece variants with compact keys - toward a complexity analysis. In SCC '10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 45-55, RHUL, June 2010. [ bib | Download PDF ]
[16] Jean-Charles Faugère, Rune Odegard, Ludovic Perret, and Danilo Gligoroski. Analysis of the MQQ Public Key Cryptosystem. In SCC'10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 101-116, RHUL, June 2010. [ bib | Download PDF ]
[17] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Hybrid Approach : a Tool for Multivariate Cryptography. In Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, pages 1-2, RHUL, June 2010. Ecrypt II. [ bib | Download PDF ]
[18] Martin Albrecht, Carlos Cid, Thomas Dulien, Jean-Charles Faugère, and Ludovic Perret. Algebraic Precomputations in Differential Cryptanalysis. In Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, pages 1-14, RHUL, June 2010. Ecrypt II. [ bib | Download PDF ]
[19] Jean-Charles Faugère and Ludovic Perret. Algebraic Cryptanalysis of Curry and Flurry using Correlated Messages. In M. Yung and F. Bao, editors, Information Security and Cryptology: 5th International Conference, Inscrypt 2009, Beijing, China, December, 2009, Revised Selected Papers, volume 6151, pages 266-277, Berlin, Heidelberg, 2010. Springer-Verlag. [ bib | Digital Object Identifier | Download PDF ]
[20] Jean-Charles Faugère, Antoine Joux, Ludovic Perret, and Joana Treger. Cryptanalysis of the Hidden Matrix Cryptosystem. In Michel Abdalla and Paulo Barreto, editors, Progress in Cryptology - LATINCRYPT 2010, volume 6212 of Lecture Notes in Computer Science, pages 241-254. Springer Berlin / Heidelberg, 2010. [ bib | Digital Object Identifier | Download PDF ]
[21] Jean-Charles Faugère, Raphaël Marinier, and Guénaël Renault. Implicit Factoring with Shared Most Significant and Middle Bits. In SCC '10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pages 197-201, RHUL, 2010. [ bib | Download PDF ]
[22] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystem - Extended Abstract. In P. Véron, editor, Yet Another Conference on Cryptography, YACC 2010, pages 1-4, Toulon, 2010. [ bib | Download PDF ]
[23] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. Algebraic Cryptanalysis of McEliece variants with compact keys - toward a complexity analysis. In P. Véron, editor, Yet Another Conference on Cryptography, YACC 2010, pages 1-4, Toulon, 2010. [ bib | Download PDF ]
[24] Jean-Charles Faugère. Structured Polynomial Systems and Algebraic Cryptanalysis of McEliece Variants with Compact Keys. In DSO National Labs, pages 1-1, January 2010. [ bib ]
[25] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Security Analysis of Multivariate Polynomials for Hashing. In Moti Yung, Dongdai Lin, and Peng Liu, editors, Information Security and Cryptology: 4th International Conference, Inscrypt 2008, Revised Selected Papers, volume 5487, pages 115-124, Berlin, Heidelberg, December 2009. Springer-Verlag. [ bib | Digital Object Identifier | Download PDF ]
[26] Jean-Charles Faugère, Ludovic Perret, and Pierre-Jean Spaenlehauer. Algebraic-Differential Cryptanalysis of DES. In Western European Workshop on Research in Cryptology - WEWoRC 2009, pages 1-5, July 2009. [ bib | Digital Object Identifier | Download PDF ]
[27] Jean-Charles Faugère. Efficient algorithms to compute Groebner Bases and applications in Cryptology. In Polynomial Computer Algebra'09, pages 1-1, April 2009. [ bib ]
[28] Jean-Charles Faugère. Solving Structured Polynomial Systems and Applications to Cryptology. In Vladimir Gerdt, Ernst Mayr, and Evgenii Vorozhtsov, editors, Computer Algebra in Scientific Computing - CASC'09, volume 5743 of Lecture Notes in Computer Science, pages 79-80. Springer Berlin / Heidelberg, 2009. [ bib | Digital Object Identifier | Download PDF ]
[29] Jean-Charles Faugère. On the complexity of the Minrank problem. In Second Workshop on Mathematical Cryptology, pages 2-3, Santander, Spain, October 2008. [ bib ]
[30] Jean-Charles Faugère and Ludovic Perret. High order derivatives and decomposition of multivariate polynomials. In Second Workshop on Mathematical Cryptology, pages 15-19, Santander (Spain), October 2008. [ bib ]
[31] Jean-Charles Faugère and Ludovic Perret. On the Security of UOV. In First International Conference on Symbolic Computation and Cryptography, SCC 08, LMIB, pages 103-109, Beijing, China, April 2008. [ bib | Download PDF ]
[32] Ilaria Simonetti, Jean-Charles Faugère, and Ludovic Perret. Algebraic Attack Against Trivium. In First International Conference on Symbolic Computation and Cryptography, SCC 08, LMIB, pages 95-102, Beijing, China, April 2008. [ bib | Download PDF ]
[33] Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Cryptanalysis of the TRMS Cryptosystem of PKC'05. In Serge Vaudenay, editor, AfricaCrypt 2008, volume 5023 of Lecture Notes in Computer Science, pages 143-155, Casablanca, Morocco, 2008. Springer. [ bib | Digital Object Identifier | Download PDF ]
[34] Jean-Charles Faugère and Ye Liang. Numerical computation of grobner bases for zero-dimensional polynomial ideals. In Mathematical Aspects of Computer and Information Sciences 2007, Paris, France, December 2007. [ bib | .html ]
[35] Daniel Augot, Magali Bardet, and Jean-Charles Faugère. On formulas for decoding binary cyclic codes. In Goldsmith, Medard, Shokrollahi, and Zamir, editors, IEEE International Symposium on Information Theory, 2007. ISIT 2007, pages 2646 -2650, June 2007. [ bib | Digital Object Identifier | Download PDF ]
[36] Jean-Charles Faugère and Ludovic Perret. Polynomial equivalence problems: Algorithmic and theoretical aspects. In D.J. Bernstein, editor, International Workshop on Post-Quantum Cryptography 2006 - PQCRYPTO 06, pages -, April 2006. [ bib ]
[37] France Cazals, Jean-Charles Faugère, Marc Pouget, and Fabrice Rouillier. Ridges and umbilics of polynomial parametric surfaces. In Computational Methods for Algebraic Spline Surfaces II - COMPASS II, pages 1 - 1, September 2005. [ bib | Download PDF ]
[38] Bardet, Magali and Faugère, Jean-Charles and Salvy, Bruno and Yang, BY. Asymptotic expansion of the degree of regularity for semi-regular systems of equations. In P. Gianni, editor, The Effective Methods in Algebraic Geometry Conference, Mega 2005, pages 1 -14, May 2005. [ bib | Download PDF ]
[39] Ars, Gwenolé and Faugère, Jean-Charles. Algebraic immunities of functions over finite fields. In Presses Universitaires PURH, editor, Boolean Function : Cryptography and Applications - BFCA 05, pages 21-38, 2005. [ bib | Download PDF ]
[40] Bardet, Magali and Faugère, Jean-Charles and Salvy, Bruno. On the complexity of gröbner basis computation of semi-regular overdetermined algebraic equations. In International Conference on Polynomial System Solving - ICPSS, pages 71 -75, November 2004. [ bib | Download PDF ]
[41] Daniel Augot, Magali Bardet, and Jean-Charles Faugère. Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases. In IEEE International Symposium on Information Theory - ISIT 2003., pages 362-362, June 2003. [ bib | Digital Object Identifier | Download PDF ]
[42] Jean-Charles Faugère. Using computer algebra methods as a preprocessing tool for global optimization problems. In 10th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, pages 1-7, September 2002. [ bib | Download PDF ]
[43] Jean-Charles Faugère. Finding all the solutions of Cyclic 9 using Gröbner basis techniques. In K. Shirayanagi and K. Yokoyama, editors, Computer Mathematics - Proceedings of the Fifth Asian Symposium (ASCM 2001), volume 9 of Lecture Notes Series on Computing, pages 1-12. World Scientific, September 2001. [ bib | Digital Object Identifier | Download PDF ]
[44] Jean-Charles Faugère, Milena Hering, and Jeffrey Phan. The membrane inclusions curvature equations. In M. Singer, editor, The Effective Methods in Algebraic Geometry Conference, Mega 2000, pages 1 -29, June 2000. [ bib | Download PDF ]
[45] Jean-Charles Faugère and Ilias Kotsireas. Symmetry theorems for the Newtonian 4- and 5-body problems with equal masses. In Ernst W. Mayr and Evgenii V. Vorozhtsov, editors, Computer Algebra in Scientific Computing: Casc '99 : Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, pages 81-92, Secaucus, NJ, USA, July 1999. Springer-Verlag New York, Inc. [ bib | Download PDF ]
[46] Jean-Charles Faugère, Berthil Folliot, and Céline Boutros Saab. Execution platform for high consuming parallel applications: a case study for Gröbner basis. In In International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications - PDSIA 99, pages -, July 1999. [ bib | Download PDF ]
[47] Jean-Charles Faugère. Parallelization of Gröbner basis. In Hoon Hong, editor, Parallel and Symbolic Computation, volume 5 of Lect. Notes Series in Computing. Pasco'94, World Scientific, 1994. [ bib | Download PDF ]

Book Chapter

[1] Jean-Charles Faugère and Mohab Safey El Din. Mathématiques Appliquées (L3), chapter De l'algèbre linéaire à la résolution des systèmes polynomiaux, pages 331-388. Pearson, 2009. isbn: 978-2-7440-7352-6. [ bib ]
[2] Frédéric Cazals, Jean-Charles Faugère, Marc Pouget, and Fabrice Rouillier. Ridges and Umbilics of Polynomial Parametric Surfaces, pages 141-159. Springer Berlin Heidelberg, 2008. isbn: 978-3-540-72184-0. [ bib | Digital Object Identifier | Download PDF ]

Journals (Guest Editors)

[1] Jean-Charles Faugere, Jaime Gutierrez, Domingo Gómez-Pérez, and Ludovic Perret. Mathematical and computer algebra techniques in cryptology, volume 64. Elsevier, November 2013. [ bib | Digital Object Identifier | http | Download PDF ]
[2] Jean-Charles Faugère and Ludovic Perret. Symbolic Computation and Cryptography, volume 3. Birkhäuser and Springer, Mathematics in Computer Science, 2010. isbn: 1661-8270. [ bib | Digital Object Identifier | Download PDF ]
[3] Jean-Charles Faugère and Carlos Cid, editors. Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography (SCC 2010), Royal Holloway, University of London, Egham, June, 2010. Royal Holloway, University of London, 2010. isbn: 0000-0000. [ bib | Download PDF ]
[4] Jean-Charles Faugère and Fabrice Rouillier. Polynomial system solving, volume 44. Academic Press, Inc., Journal of Symbolic Computation, 2009. isbn: 0747-7171. [ bib | Digital Object Identifier | Download PDF ]
[5] Daniel Augot, Jean-Charles Faugère, and Ludovic Perret. Gröbner Bases Techniques in Coding Theory and Cryptography, volume 44. Academic Press, Inc., Journal of Symbolic Computation, 2009. isbn: 0747-7171. [ bib | Digital Object Identifier | Download PDF ]
[6] Jean-Charles Faugère and Dongming Wang, editors. Proceedings of the First International Conference on Symbolic Computation and Cryptography (SCC 2008), Beijing, China, April 2008. Beihang University, China. isbn: 0000-0000. [ bib ]

Ph.D. Thesis - Habilitation

[1] Jean-Charles Faugère. Calcul efficace des bases de Gröbner et Applications. Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2007. [ bib ]
[2] Jean-Charles Faugère. Calcul efficace des bases de Gröbner et Applications. Habilitation à diriger des recherches, HDR, Université Paris 6, 2007. [ bib ]
[3] Jean-Charles Faugère. Résolution des systèmes d'équations algébriques. PhD thesis, PhD thesis, Université Paris 6, 1994. [ bib | Download PDF ]

Preprints

[1] Christian Eder and Jean-Charles Faugère. A survey on signature-based Gröbner basis computations. April 2014. [ bib | http | Download PDF ]
[2] Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, and Jean-Pierre Tillich. A Distinguisher for High Rate McEliece Cryptosystems. eprint Report 2010/331, 2010. [ bib | Download PDF ]
[3] Jean-Charles Faugère, David Lubicz, and Damien Robert. Computing modular correspondences for abelian varieties. preprint Hal, arXiv:0910.4668v1, [cs.SC], 2010. [ bib | Download PDF ]
[4] Jean-Charles Faugère, Jean-Pierre Merlet, and Fabrice Rouillier. On solving the direct kinematics problem for parallel robots. INRIA Research Report, n 5923, 2006. [ bib | Download PDF ]
[5] Gwenolé Ars and Jean-Charles Faugère. Algebraic Immunities of functions over finite fields. INRIA Research Report, n 5532, 2005. [ bib | Download PDF ]
[6] Bardet, Magali and Faugère, Jean-Charles and Salvy, B. Complexity of Gröbner basis computation for Semi-regular Overdetermined sequences over GF(2) with solutions in GF(2). INRIA Research Report, n 5049, 2003. [ bib | Download PDF ]
[7] Faugère, Jean-Charles. Algebraic cryptanalysis of HFE using Gröbner bases. INRIA Research Report, n 4738, 2003. [ bib | Download PDF ]
[8] Ars, Gwenolé and Faugère, Jean-Charles. An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner Bases. INRIA Research Report, n 4739, 2003. [ bib | Download PDF ]

Other International Conferences

  • [F05] Faugère J.C. and Rouillier F. Polynomial system solving for industrial problem. In SIAM Conference on Mathematics for Industry, october 2005. Detroit, Michigan.
    Parallel Manipulators
  • [F02b] Jean-Charles Faugère. Gröbner bases and application to hfe. In YACC - Conference on Cryptography, Porquerolles, France, 6 2002.
    Parallel Manipulators
  • [FKR99] Jean-Charles Faugère, Michel Kern, and Fabrice Rouillier. Using groebner bases to compute higher order finite elements for maß lumping. In 4th International Congress on Industrial and Applied Mathematics (ICIAM), Edimburgh, 1999.
    Parallel Manipulators
  • [FR99] Jean-Charles Faugère and Fabrice Rouillier. Design of filter and filter banks using dedicated computer algebra tools. In J. Johnson and M. Pueschel, editors, International Conference on Applications of Computer Algebra (ACA), 1999.
    Parallel Manipulators
  • [FRR99] Jean-Charles Faugère, Luc Rolland, and Fabrice Rouillier. Using computer algebra tools for off-line studies of parallel manipulators. In P. Kovacs, editor, International Conference on Applications of Computer Algebra (ACA), 1999.
    Parallel Manipulators

National Conferences

  • [FR05] Jean-Charles Faugère and Fabrice Rouillier. Outils de calcul formel performants pour la résolution de certains problèmes en robotique. In Journées Nationales de Recherche en Robotique, pages 89--99, 2005.
    Parallel Manipulators
  • [F01d] Faugère J.C. Optimisation globale et calcul formel. In F. Rouillier, editor, Congrès National de Mathématiques Appliquées et Industrielles, mai 2001. Utilisation du calcul formel en calcul scientitfique.
    SMAI 2001

International invited talks (selection)

  • [F13] Jean-Charles Faugère , (Talk given by C Eder) GBRELA Workshop 2013 Hagenberg, Austria September 03 06, 2013. GBRELA 2013
  • [F11b] Jean-Charles Faugère. Solving efficiently structured polynomial systems and Applications in Cryptology, The 15th workshop on Elliptic Curve Cryptography ECC 2011 Nancy (Sep 19-21). ECC 2011
  • [F11a] Jean-Charles Faugère. Gröbner Bases and Linear Algebra, SIAM Conference on Applied Algebraic Geometry Raleigh - North Carolina - USA (October 6-9, 2011). SIAM 2011
  • [F11c] Jean-Charles Faugère. On the Complexity of Solving Quadratic Boolean Systems, CRC 2011 - International Workshop on Certified and Reliable Computation NanNing, GuangXi, China, July 17-20, 2011. CRC 2011
  • [F10b] Jean-Charles Faugère. FGb: a library for computing Gröbner bases, Invited Talk, The Third International Congress on Mathematical Software, Mathematical Software - ICMS 2010 Kobe Japan (Sep 13-17), K. Fukuda, J. van der Hoeven, M. Joswig and N. Takayama editors, volume 6327, pages 84--87 of Lecture Notes in Computer Science. Springer-Verlag 2010.AsiaCrypt 2004
  • [F10] Jean-Charles Faugère. Algebraic Cryptanalysis of McEliece Variants with Compact Keys. DSO Nationa Labs, Singapore 2010.
  • [F09a] Jean-Charles Faugère. Efficient algorithm for computing Groebner bases. In N.Vasiliev, editor, Euler Institute, Polynomial Computer Algebra St Petersburg, Russia 2009.
  • [F09b] Jean-Charles Faugère. Tutorial: Interactions between Computer Algebra (Groebner Bases) and Cryptology. In E. Kaltofen, editor, 2009 International Symposium on Symbolic and Algebraic Computation (ISSAC) Seoul Korea July 28–31, 2009.
    AsiaCrypt 2004
  • [F09c] Jean-Charles Faugère. Groebner bases and cryptography. In , editor, The 11th International Workshop on Computer Algebra in Scientific Computing CASC, Kobe Japan, 2009.
    AsiaCrypt 2004
  • [F08e] Jean-Charles Faugère.invited lecture during the Second Workshop on Mathematical Cryptology in Santander (Spain).
  • [F08e] Jean-Charles Faugère. give a tutorial talk at the Inscrypt 2008 : Special track on symbolic computation (Beijing, 14 December 2008)
  • [F07] Jean-Charles Faugère. Groebner bases and cryptography. In Alex Biryukov, editor, Fast Software Encryption FSE, 2007.
  • [F07b] Jean-Charles Faugère. Invited talk Indo-French Workshop in Cryptography 11-13 June 2007.
  • [F07c] Jean-Charles Faugère. Two invited talk ECRYPT Summer School Samos (Greece) June 2007.
  • [F07d] Jean-Charles Faugère. 3 Tutorials CNR Roma (Italy) June 2007.
  • [F06a] Jean-Charles Faugère. Groebner bases attack on 2r. In Jaime Gutierrez, Workshop on Mathematical Cryptology, 6 2006.
  • F06b] Jean-Charles Faugère. Solving polynomial systems with grobner bases: application in crypto. In B. Mourrain. L. Busé, M. Elkadi, editor, Computational Algebraic Geometry and Applications 06, 2006.
  • [FR06] Jean-Charles Faugère and Fabrice Rouillier. key note lecture: Polynomial system solving. In B. Buchberger, editor, Special Semester on Groebner Bases B2, 2 2006.
  • F03a] Jean-Charles Faugère. Fast gröbner algebraic cryptanalysis of hfe and filter generators. In International Workshop on Coding and Cryptography WCC 03, 2003.
  • [F03b] Jean-Charles Faugère. Recent progress in cryptanalysis using algebraic equations. In NESSIE-STORK joint workshop: Cryptographic Research in Europe, 2 2003.
  • [F02d] Jean-Charles Faugère. Classification of all planar central configurations of n bodies with equal masses in the case of the logarithmic potential and n<8. In 8th International Conference on Applications of Computer Algebra (ACA), 6 2002, Volos Greece.
  • [F02e] Jean-Charles Faugère. A new efficient algorithm for computing gröbner bases without reduction to zero. In Workshop on application of Groebner Bases, Catania, Spain, 4 2002.
  • [F02c] Jean-Charles Faugère. A new efficient algorithm for computing gröbner bases without reduction to zero. In Eighth Rhine Workshop on Computer Algebra - RWCA, 2002, Mannheim, Germany.
  • [F01b] Jean-Charles Faugère. Polynomial system solving and applications. In L. Robbiano, editor, COmputational COmmutative Algebra COCOA VII, July 2001, Queen's University Kingston, Ontario, Canada.
  • [F01c] Jean-Charles Faugère. Solving polynomial systems. algorithms and applications. In Computer Algebra in Applications to Integrable Systems, 11 2001, Isaac Newton Institute for Mathematical Sciences, Cambridge, UK.
  • [F99b] Jean-Charles Faugère. Efficient polynomial systems solving: algorithms and software. In L. Robbiano, editor, COmputational COmmutative Algebra COCOA VI, May -- July 1999, Villa Gualino, Torino, Italy.
  • [F98] J.-C. Faugère. The efficient algorithms for computing Gröbner bases. In M.F. Roy, editor, Mega 1998 Saint-Malo (France), 1998.