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 at the University of Paris VI, with the dissertation "Résolution des systemes d’équations algébriques" (Solving systems of algebraic equations), under the supervision of Daniel Lazard.[1]
He works on Gröbner bases and their applications, in particular, in cryptology. With his collaborators, he has devised the FGLM algorithm for computing Gröbner bases;[2] he has also introduced the F4 and F5 algorithms for calculating Gröbner bases.[3][4] In particular, his F5 algorithm allowed him to solve various problems in cryptography such as HFE; he also introduced a new type of cryptanalysis, called algebraic cryptanalysis.
Notes
edit- ^ Jean-Charles Faugère at the Mathematics Genealogy Project
- ^ 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. Archived from the original (PDF) on 2016-09-28. Retrieved 2010-12-02.
- ^ 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. Archived from the original (PDF) on 2017-09-22. Retrieved 2010-12-02.
- ^ 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.
External links
edit | This article about a French mathematician is a stub. You can help Wikipedia by expanding it. |