Jean-Charles Faugère
Jean-Charles Faugère is the head of the POLSYS team (Solvers for ALgebraic Systems and Applications) of the Laboratoire d'Informatique de Paris 6 (Lip6) and INRIA Paris/Rocquencourt. The team was formerly known as SPIRAL and SALSA.
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[1] and the designer of F4 and F5 algorithms for computing Gröbner bases.[2][3] 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
- ^ J.C. Faugère; P. Gianni; D. Lazard; T. Mora (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.
- ^ J.-C. Faugère (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.
- ^ J.-C. Faugère (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.
External links
- POLSYS web site
- The old SPIRAL web site
- The old SALSA web site
- Jean-Charles Faugère's page (about Gröbner bases)
 | This article about a French mathematician is a stub. You can help Wikipedia by expanding it. |