Main Publications - Jean-Charles Faugère

Preprint :

[FSS10] Faugère J.C and Safey El Din M. and Spaenlehauer P.J, Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity, arXiv:1001.4004v2 [cs.SC], 2010.

Thèses ou HDR :

[Fau94b] Faugère J.C. Résolution des systèmes d'équations algébriques. PhD thesis, Université Paris 6, Feb. 1994. [Fau07a] Faugère J.C. Calcul efficace des bases de Gröbner et Applications. HDR, Université Paris 6, 2007.

Articles de revues ou Principales conferences:

[FOPT10] Jean-Charles Faugère and Ayoub Otmani and Ludovic Perret and Jean-Pierre Tillich. Algebraic Cryptanalysis of McEliece Variants with Compact Keys. In Henri Gilbert, editor, EuroCrypt 2010 Advances in Cryptology, volume .... of Lecture Notes in Computer Science. Springer-Verlag, 2010. [FL10] Jean-Charles Faugère and Liang Ye. Artificial Discontinuity. Journal of Symbolic Computation, Laureano Gonzalez-Vega Guest Editor, Accepted for publication, 2010. [ABF09] Daniel. Augot, Magali Bardet, and Jean-Charles Faugère. On the decoding of cyclic codes with the newton's identities. Journal of Symbolic Computation, Volume 44, Issue 12, December 2009, Pages 1608-1625, 2009. [FP09b] Jean-Charles Faugère and Ludovic Perret. An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography. Journal of Symbolic Computation, Volume 44, Issue 12, December 2009, Pages 1676-1689, 2009. [BFP09] Luk Bettale and Jean-Charles Faugère and Ludovic Perret. Hybrid approach for solving multivariate systems over finite fields, Journal of Mathematical Cryptology. Volume 3, Issue 3, Pages 177–197, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: 10.1515/JMC.2009.009, /September/2009 [BF09] Gerald Bourgeois and Jean-Charles Faugère. Algebraic Attack on NTRU using Witt Vectors and Gröbner bases, Journal of Mathematical Cryptology. Volume 3, Issue 3, Pages 205–214, ISSN (Online) 1862-2984, ISSN (Print) 1862-2976, DOI: 10.1515/JMC.2009.011, /September/2009 [FP09a] Jean-Charles Faugère, and Ludovic Perret. High Order Derivatives and Decomposition of Multivariate Polynomials. In E.Kaltofen, editor, ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, Seoul Korea, ACM, 2009. [FR09] Jean-Charles Faugère, and Sajjad Rahmany. Solving Systems of Polynomial Equations with Symmetries Using SAGBI-Gröbner Bases. In E.Kaltofen, editor, ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, Seoul Korea, ACM, 2009. [FPL08] Jean-Charles Faugère and Ludovic Perret and Levy dit Vehel, Françoise. Cryptanalysis of Minrank. In Cynthia Dwork, editor, Advances in Cryptology CRYPTO 2008, Santa Barbara USA, Davic Wagner editor , volume 5157 of Lecture Notes in Computer Science, pages 280-296 Springer-Verlag, 2008. [FMRS08]J ean-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 2008 international symposium on Symbolic and algebraic computation. ACM, 2008. [CFRS07] Jean-Charles Faugère, Fabrice Rouillier, Fabien Seyfert, and R.j. Cameron. An exhaustive approach to the coupling matrix synthesis problem application to the design of high degree asymmetric filters. International Journal of RF and Microwave Computer-Aided Engineering Special Issue on RF and Microwave Filters, 17(1):4--12, January 2007. [FP06a] 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-Verlag, 2006. [FP06b] Jean-Charles Faugère and Ludovic Perret. Polynomial equivalence problems: Algorithmic and theoretical aspects. In Serge Vaudenay, editor, EuroCrypt 2006 Advances in Cryptology, volume 4004 of Lecture Notes in Computer Science. Springer-Verlag, 6 2006. [CFPR06a] Fabrice Rouillier, Jean-Charles Faugère, Marc Pouget, and Frederic Cazals. The implicit structure of ridges of a smooth parametric surface. Computer Aided Geometric Design, 23(7):582--598, 10 2006. [CFPR06b] Frederic Cazals, Jean-Charles Faugère, Marc Pouget, and Fabrice Rouillier. Ridges and umbilics of polynomial parametric surfaces. Computational Methods for Algebraic Spline Surfaces II, 2006. [AFIK04] G. Ars, and J.-C. Faugère, and M. Sugita. Comparison between XL and Gröbner Basis Algorithms. In Pil Joong LEE, editor, AsiaCrypt 2004, Lectures Notes in Computer Science. Springer, 2004. Jeju Island, KOREA. [BEFG04a] A. Basiri, A. Enge, J.C. Faugère, and N. Gürel. The arithmetic of jacobian groups of superelliptic cubics. Mathematics of Computation, 74:389--410, July 2004. [BF03] Abdolali Basiri and Jean-Charles Faugère. Changing the ordering of gröbner bases with LLL. In Proceedings of the 2003 international Symposium on Symbolic and algebraic computation, ISSAC, pages 23--29. Philadelphia, PA, USA, ACM Press, 2003 . [FJ03] J.-C. Faugère and A. Joux. Algebraic cryptanalysis of Hidden Field Equation (HFE) cryptosystems using Gröbner bases. In Dan Boneh, editor, Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 44--60. Springer, 2003. [FHP03] J.-C. Faugère, M. Hering, and J. Phan. The membrane inclusions curvature equations. Advances in Applied Mathematics, 31(4):643--658, June 2003. [F02a] Faugère J.C. A new efficient algorithm for computing Gröbner bases without reduction to zero F5. In T. Mora, editor, Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation ISSAC, pages 75--83. ACM Press, July 2002. isbn: 1-58113-484-3 . [F99a] Faugère J.C. A new efficient algorithm for computing Gröbner bases (F4). Journal of Pure and Applied Algebra, 139(1--3):61--88, June 1999. [FMR98] Faugère J.C. and Moreau de Saint-Martin F. and Rouillier F. Design of nonseparable bidimensional wavelets and filter banks using Gröbner bases techniques. IEEE SP Transactions on Signal Processing, 46(4), 1998. Special Issue on Theory and Applications of Filter Banks and Wavelets. [FL94] Faugère J.C. and Lazard D. The Combinatorial Classes of Parallel Manipulators. Mechanism and Machine Theory, 30(6):765--776, 1995. [FGLM] Faugère, J.C., Gianni, P., Lazard, D. and Mora T. Efficient Computation of Zero-Dimensional Gröbner Basis by Change of Ordering. Journal of Symbolic Computation, 16(4):329--344, October 1993.

Articles dans les conférences internationales avec comité:

[FS10] Jean-Charles Faugère, and Pierre-Jean Spaenlehauer. Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem, in 13th International Conference on Practice and Theory in Public Key Cryptography -- PKC 2010 , Phong Nguyen and David Pointcheval editors, volume ... of Lecture Notes in Computer Science. Springer-Verlag 2010. [FMR10] Jean-Charles Faugère, and Raphaël Marinier and Guenaël Renault. Implicit Factoring with Shared Most Significant and Middle Bitsl, in 13th International Conference on Practice and Theory in Public Key Cryptography -- PKC 2010 , Phong Nguyen and David Pointcheval editors, volume ... of Lecture Notes in Computer Science. Springer-Verlag 2010. [FP09] Jean-Charles Faugère, and Ludovic Perret. Security Analysis of Multivariate Polynomials for Hashing, in Information Security and Cryptology -- Inscrypt 2009, Moti Yung and Beng Fao editors, volume ... of Lecture Notes in Computer Science. Springer-Verlag 2010. [BFP08b]Luk Bettale, Jean-Charles Faugère, and Ludovic Perret. Security Analysis of Multivariate Polynomials for Hashing, in Information Security and Cryptology -- Inscrypt 2008, Moti Yung and Dongai Lin and Peng Liu editors, volume 5487,pages 115--124 of Lecture Notes in Computer Science. Springer-Verlag 2009. [BFP08]Luk Bettale, Jean-Charles Faugère, and Ludovic Perret.Cryptanalysis of the TRMS cryptosystem of PKC 2005. In AfricaCrypt 2008, volume 5023 of Lecture Notes in Computer Science. Springer, 2008. [FP08b]Jean-Charles Faugère and Ludovic Perret. On the security of UOV. In First International Conference on Symbolic Computation and Cryptography, SCC 08, pages 103--109. LMIB, Beijing, China, April 2008. [SFP08]Ilaria Simonetti, Jean-Charles Faugère, and Ludovic Perret. Algebraic attack against trivium. In First International Conference on Symbolic Computation and Cryptography, SCC 08, pages 95--102.LMIB, Beijing, China, April 2008. [ABF07] Augot D., Bardet M., and Faugère J.C. On formulas for decoding binary cyclic codes. In Goldsmith, Medard, Shokrollahi, Zamir (eds), IEEE International Symposium on Information Theory (Nice), 2007. ISIT 2007. [FHP00] J.-C. Faugère, M. Hering, and J. Phan. The membrane inclusions curvature equations. In M. Singer, editor, Mega 2000 Bath (UK), 2000. [BFS05] Bardet, M. and Faugère, J.C and Salvy B. Asymptotic expansion of the degree of regularity for semi-regular systems of equations. In P. Gianni, editor, Mega 2005 Sardinia (Italy), 2005. [BEFG04b] Implementing the arithmetic of C3,4 curves. A. Basiri and A. Enge and H.C. Faugère and N. Gürel. In Duncan Buell, editor, Sixth Algorithmic Number Theory Symposium, ANTS VI proceedings (Vermont, USA, June 13--18, 2004), volume 3076 of Lectures Notes in Computer Science, pages 57--71. Springer-Verlag, 2004. [BFS04] M. Bardet, J.C Faugère, and Salvy B. On the complexity of gröbner basis computation of semi-regular overdetermined algebraic equations. In ICPSS Paris, pages 71--75, Nov. 2004. CFPR05] Frédéric Cazals and Jean-Charles Faugère and Marc Pouget and Fabrice Rouillier. Ridges and umbilics of polynomial parametric surfaces. In Computational Methods for Algebraic Spline Surfaces II, Centre of Mathematics for Applications at the University of Oslo, Norway, 2005. [FK99] Jean-Charles Faugère and Ilias Kotsireas. Symmetry theorems for the newtonian 4- and 5-body problems with equal masses. In V. G. Ganzha, E. W. Mayr, and E. V. Vorozhtsov, editors, Computer algebra in scientific computing, CASC'99 Proceedings, pages 81--92. TUM Munich, Springer Verlag, 1999. AF05] Ars, G. and Faugère, J.-C. Algebraic immunities of functions over finite fields. In Presses Universitaires PURH, editor, Boolean Function : Cryptography and Applications, pages 21--38, 2005. [ABF03] Augot D., Bardet M., and Faugère J.C. Efficient decoding of (binary) cyclic codes beyond the correction capacity of the code using gröbner bases. In IEEE International Symposium on Information Theory (Japan), 7 2003. ISIT 2003. [F94] Jean-Charles Faugère. Parallelization of gröbner bases. In Hoon Hong, editor, Parallel and Symbolic Computation, volume 5 of Lecture Notes in Computing, pages 124--132. World Scientific, 1994. [F01a] Faugère J.C. Finding all the solutions of Cyclic 9 using Gröbner basis techniques. In K. Shirayanagi and K. Yokoyama, editors, Computer Mathematics - Proceedings of the 5th Asian Symposium (ASCM 2001), volume 9 of Lecture Notes Series on Computing, pages 1--12. World Scientific, Sep 2001 ISBN: 981-02-4763-X. [FP06c] 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, 2006. [FFS99] Bertil Folliot, Céline Boutros Saab, and Faugère J.C. Execution platform for high consuming parallel applications: a case study for gröbner basis. In International Workshop on Parallel and Distributed Computing for Symbolic and Irregular Applications (PDSIA 99), July 1999, Sendai, Japan.

Articles dans les conférences à large audience:

[FPS09] Jean-Charles FAUGERE, Ludovic PERRET, and Pierre-Jean SPAENLEHAUER "Algebraic-Differential Cryptanalysis of DES". In WEWoRC 2009 - Western European Workshop on Research in Cryptology July 7-9 Graz, Austria [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. [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. [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.

Editions de livres:

[FR08]Jean-Charles Faugère, Fabrice Rouillier. "Polynomial System Solving in honor of Daniel Lazard" Journal of Symbolic Computation, ISSN 0747-7171 Vol 44 Number 3 March 2009. [AFP08] Daniel Augot, Jean-Charles Faugère, Ludovic Perret. Journal of Symbolic Computation : special issue Crypto, ECC and Groebner Bases, 2009 to appear.

Chapitre de livre:

[FS09] Jean-Charles Faugère and Mohab Safey El Din . In Pearson Education, 2009.

Articles dans les conférences nationales:

[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. [F02b] Jean-Charles Faugère. Gröbner bases and application to hfe. In YACC - Conference on Cryptography, Porquerolles, France, 6 2002.

Principales conférences internationales invité:

[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. [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. [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.

Autres conférences internationales:

[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. [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.