Jean-Charles Faugère

Jean-Charles Faugère is the head of the POLSYS project-team (Solvers for ALgebraic Systems and Applications) of the Laboratoire d'Informatique de Paris 6 (LIP6) and Paris–Rocquencourt center of INRIA, in Paris. The team was formerly known as SPIRAL and SALSA.

Faugère obtained his Ph.D. in mathematics in 1994 from the Pierre and Marie Curie University in Paris, for a thesis on Résolution des systemes d’équations algébriques, written under the direction of Daniel Lazard.[1]

He works on Gröbner bases and their applications, in particular, in cryptology. He is, among others, one of the designers of the FGLM algorithm[2] and the designer of F4 and F5 algorithms for computing Gröbner bases.[3][4] In particular, his F5 algorithm allowed him to solve several challenges in cryptography like HFE and introduced a new type of cryptanalysis, the algebraic cryptanalysis.

Notes
  1. Jean-Charles Faugère at the Mathematics Genealogy Project
  2. Faugère, Jean-Charles; Gianni, Patrizia; Lazard, Daniel; Mora, Teo (1993). "Efficient computation of zero-dimensional Gröbner bases by change of ordering" (PDF). Journal of Symbolic Computation. 16 (4): 329–344. doi:10.1006/jsco.1993.1051. MR 1263871.
  3. Faugère, Jean-Charles (1999). "A new efficient algorithm for computing Gröbner bases (F4)" (PDF). Journal of Pure and Applied Algebra. 139 (1–3): 61–88. doi:10.1016/S0022-4049(99)00005-5.
  4. Faugère, Jean-Charles (2002). "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 2002) (PDF). New York, NY, USA: ACM. pp. 75–83. doi:10.1145/780506.780516.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.