1998-2024 Publications

• 2024
  • H. Huang, Y. Jaouën, N. Fabre, R. Alléaume, J.‑S. Pegon, Th. Camus, M. Zuber, J.‑Ch. Faugère, P.‑E. Verdier, B. Lacour, M. Gautier, Th. Rivera, Y. Piétri, M. Schiavon, A. Rhouni, E. Diamanti : “Post-Quantum Cryptographically-Secured Trusted Node for Quantum Key Distribution in a Deployed Network”, QCRYPT 2024 - 14^th International Conference on Quantum Cryptography, Vigo, Spain (2024)
• 2023
  • J.‑Ch. Faugère, G. Labahn, M. Safey El Din, E. Schost, Th. Vu : “Computing critical points for invariant algebraic systems”, Journal of Symbolic Computation, vol. 116, pp. 365-399, (Elsevier) (2023)
• 2022
  • J.‑Ch. Faugère, J. Patarin, L. Perret, G. Macario‑Rat : “A New Perturbation for Multivariate Public Key Schemes such as HFE and UOV”, (2022)
  • J. Berthomieu, J.‑Ch. Faugère : “Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations”, Journal of Symbolic Computation, vol. 109, pp. 1-30, (Elsevier) (2022)
• 2021
  • M. Bender, J.‑Ch. Faugère, A. Mantzaflaris, E. Tsigaridas : “Koszul-type determinantal formulas for families of mixed multilinear systems”, SIAM Journal on Applied Algebra and Geometry, vol. 5 (4), pp. 589-619, (Society for Industrial and Applied Mathematics) (2021)
  • M. Bender, J.‑Ch. Faugère, L. Perret, E. Tsigaridas : “A nearly optimal algorithm to decompose binary forms”, Journal of Symbolic Computation, vol. 105, pp. 71-96, (Elsevier) (2021)
  • O. Chakraborty, J.‑Ch. Faugère, L. Perret : “Cryptanalysis of the extension field cancellation cryptosystem”, Designs, Codes and Cryptography, vol. 89 (6), pp. 1335-1364, (Springer Verlag) (2021)
• 2020
  • J. Berthomieu, J.‑Ch. Faugère : “In-depth comparison of the Berlekamp–Massey–Sakata and the Scalar-FGLM algorithms: the adaptive variants”, Journal of Symbolic Computation, vol. 101, pp. 270-303, (Elsevier) (2020)
• 2019
  • W. Beullens, J.‑Ch. Faugère, E. Koussa, G. Macario‑Rat, J. Patarin, L. Perret : “PKP-Based Signature Scheme”, Progress in Cryptology -- INDOCRYPT 2019, vol. 11898, Lecture Notes in Computer Science, Hyderabad, India, pp. 3-22, (Springer International Publishing), (ISBN: 978-3-030-35423-7) (2019)
  • J.‑Ch. Faugère, K. Horan, D. Kahrobaei, M. Kaplan, E. Kashefi, L. Perret : “Fast Quantum Algorithm for Solving Multivariate Quadratic Equations”, (2019)
  • M. Conde Pena, R. Durán Díaz, J.‑Ch. Faugère, L. Hernández Encinas, L. Perret : “Non-quantum cryptanalysis of the noisy version of Aaronson–Christiano’s quantum money scheme”, IET Information Security, vol. 13 (4), pp. 362-366, (Institution of Engineering and Technology) (2019)
  • M. Bender, J.‑Ch. Faugère, E. Tsigaridas : “Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems”, ISSAC 2019 - 44^th International Symposium on Symbolic and Algebraic Computation, Beijing, China, pp. 42-49, (ACM) (2019)
  • J.‑Ch. Faugère, L. Perret, J. Ryckeghem : “Software Toolkit for HFE-based Multivariate Schemes”, CHES 2019 : International Conference on Cryptographic Hardware and Embedded Systems, vol. 2019 (3), IACR Transactions on Cryptographic Hardware and Embedded Systems, Atlanta, United States, pp. 257-304 (2019)
• 2018
  • J. Berthomieu, J.‑Ch. Faugère : “A polynomial-division-based algorithm for computing linear recurrence relations”, ISSAC '18: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation, New York, United States, pp. 79-86 (2018)
  • M. Bender, J.‑Ch. Faugère, A. Mantzaflaris, E. Tsigaridas : “Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors”, ISSAC 2018 - 43^rd International Symposium on Symbolic and Algebraic Computation, New York, United States (2018)
  • J.‑Ch. Faugère, A. Wallet : “The Point Decomposition Problem over Hyperelliptic Curves: toward efficient computations of Discrete Logarithms in even characteristic”, Designs, Codes and Cryptography, vol. 86, pp. 2279–2314, (Springer Verlag) (2018)
  • M. Bender, J.‑Ch. Faugère, E. Tsigaridas : “Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case”, ISSAC 2018 - 43^rd International Symposium on Symbolic and Algebraic Computation, New York, United States (2018)
• 2017
  • O. Chakraborty, J.‑Ch. Faugère, L. Perret : “CFPKM : A Key Encapsulation Mechanism based on Solving System of non-linear multivariate Polynomials”, (2017)
  • J.‑Ch. Faugère, L. Perret, J. Ryckeghem : “DualModeMS: A Dual Mode for Multivariate-based Signature”, (2017)
  • A. Casanova, J.‑Ch. Faugère, G. Macario‑Rat, J. Patarin, L. Perret, J. Ryckeghem : “GeMSS: A Great Multivariate Short Signature”, 1-4 pages (2017)
  • J. Berthomieu, B. Boyer, J.‑Ch. Faugère : “Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences”, Journal of Symbolic Computation, vol. 83 (Supplement C), pp. 36-67, (Elsevier) (2017)
  • J. Berthomieu, J.‑Ch. Faugère : “In-depth comparison of the Berlekamp – Massey – Sakata and the Scalar-FGLM algorithms: the non adaptive variants”, (2017)
  • J.‑Ch. Faugère, Ch. Mou : “Sparse FGLM algorithms”, Journal of Symbolic Computation, vol. 80 (3), pp. 538-569, (Elsevier) (2017)
  • B. Bonnard, O. Cots, J.‑Ch. Faugère, A. Jacquemard, J. Rouot, M. Safey El Din, Th. Verron : “Algebraic-geometric techniques for the feedback classification and robustness of the optimal control of a pair of Bloch equations with application to Magnetic Resonance Imaging”, (2017)
• 2016
  • B. Boyer, Ch. Eder, J.‑Ch. Faugère, S. Lachartre, F. Martani : “GBLA – Gröbner Basis Linear Algebra Package”, 41^st International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, pp. 135-142 (2016)
  • J. Berthomieu, J.‑Ch. Faugère : “Guessing Linear Recurrence Relations of Sequence Tuples and P-recursive Sequences with Linear Algebra”, ISSAC '16: Proceedings of the 2016 on International Symposium on Symbolic and Algebraic Computation, Waterloo, ON, Canada, pp. 95-102 (2016)
  • J.‑Ch. Faugère, P.‑J. Spaenlehauer, J. Svartz : “Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems”, Proceedings of ISSAC 2016, Waterloo, Canada, pp. 223-230, (ACM) (2016)
  • C. Amendola, J.‑Ch. Faugère, B. Sturmfels : “Moment Varieties of Gaussian Mixtures”, Journal of Algebraic Statistics, vol. 7 (1), (Mathematical Sciences Publishers) (2016)
  • J.‑Ch. Faugère, A. Otmani, L. Perret, F. De Portzamparc, J.‑P. Tillich : “Structural Cryptanalysis of McEliece Schemes with Compact Keys”, Designs, Codes and Cryptography, vol. 79 (1), pp. 87-112, (Springer Verlag) (2016)
  • J.‑S. Coron, J.‑Ch. Faugère, G. Renault, R. Zeitoun : “Factoring $N=p^r q^s$ for Large $r$ and $s$”, RSA Conference Cryptographers' Track, Topics in Cryptology – CT-RSA 2016, San Francisco, United States (2016)
  • Ch. Eder, J.‑Ch. Faugère : “A survey on signature-based algorithms for computing Gröbner basis computations”, Journal of Symbolic Computation, pp. 1-75, (Elsevier) (2016)
  • J.‑Ch. Faugère, M. Safey El Din, Th. Verron : “On the complexity of computing Gröbner bases for weighted homogeneous systems”, Journal of Symbolic Computation, vol. 76, pp. 107-141, (Elsevier) (2016)
  • B. Bonnard, J.‑Ch. Faugère, A. Jacquemard, M. Safey El Din, Th. Verron : “Determinantal sets, singularities and application to optimal control in medical imagery”, International symposium on symbolic and algebraic computations, Waterloo, Canada, pp. 103-110, (ACM) (2016)
  • M. Bender, J.‑Ch. Faugère, L. Perret, E. Tsigaridas : “A Superfast Randomized Algorithm to Decompose Binary Forms”, ISSAC '16 - 41^st International Symposium on Symbolic and Algebraic Computation, Waterloo, Canada, pp. 79-86, (ACM) (2016)
  • J.‑Ch. Faugère, A. Otmani, L. Perret, F. De Portzamparc, J.‑P. Tillich : “Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups”, IEEE Transactions on Information Theory, vol. 62 (1), pp. 184-198, (Institute of Electrical and Electronics Engineers) (2016)
• 2015
  • M. Bardet, J.‑Ch. Faugère, B. Salvy : “On the complexity of the F5 Gröbner basis algorithm”, Journal of Symbolic Computation, vol. 70, pp. 49-70, (Elsevier) (2015)
  • J. Berthomieu, J.‑Ch. Faugère, L. Perret : “Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case”, Journal of Complexity, vol. 31 (4), pp. 590-616, (Elsevier) (2015)
  • J. Berthomieu, B. Boyer, J.‑Ch. Faugère : “Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences”, ISSAC '15: Proceedings of the 2015 on International Symposium on Symbolic and Algebraic Computation, Bath, United Kingdom, pp. 61-68 (2015)
  • J.‑Ch. Faugère, D. Gligoroski, L. Perret, S. Simona, E. Thomae : “A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems”, IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States (2015)
  • M. Conde Pena, J.‑Ch. Faugère, L. Perret : “Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case”, IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC'15), Maryland, United States (2015)
  • M. Albrecht, C. Cid, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret : “On the complexity of the BKW algorithm on LWE”, Designs, Codes and Cryptography, vol. 74 (2), pp. 26, (Springer Verlag) (2015)
• 2014
  • M. Albrecht, C. Cid, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret : “Algebraic Algorithms for LWE Problems”, (2014)
  • J.‑Ch. Faugère, L. Perret, F. De Portzamparc : “Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form”, Advances in Cryptology Asiacrypt 2014, vol. 8873, Lecture Notes in Computer Science, Kaohsiung, Taiwan, Province of China, pp. 21-41, (Springer) (2014)
  • J.‑Ch. Faugère, D. Gómez‑Pérez, J. Gutierrez, L. Perret : “Mathematical and computer algebra techniques in cryptology”, Journal of Symbolic Computation, vol. 64, pp. 1-88, (Elsevier) (2014)
  • J.‑Ch. Faugère, P. Gaudry, L. Huot, G. Renault : “Sub-cubic Change of Ordering for Gröner Basis: A Probabilistic Approach”, ISSAC '14 - Proceedings of the 39^th International Symposium on Symbolic and Algebraic Computation, Kobe, Japan, pp. 170-177, (ACM) (2014)
  • J.‑Ch. Faugère, P.‑J. Spaenlehauer, J. Svartz : “Sparse Gröbner Bases: the Unmixed Case”, ISSAC 2014, Kobe, Japan (2014)
  • M. Albrecht, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret, Y. Todo, K. Xagawa : “Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions”, PKC 2014 - 17^th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, (Springer) (2014)
  • M. Albrecht, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret : “Lazy Modulus Switching for the BKW Algorithm on LWE”, Public-Key Cryptography - PKC 2014 - 17^th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, (Springer) (2014)
  • J.‑Ch. Faugère, L. Perret, F. De Portzamparc, A. Otmani, J.‑P. Tillich : “Structural weakness of compact variants of the McEliece cryptosystem”, IEEE International Symposium on Information Theory - ISIT 2014, Honolulu, United States, pp. 1717-1721 (2014)
  • J.‑Ch. Faugère, L. Huot, A. Joux, G. Renault, V. Vitse : “Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus”, EUROCRYPT 2014 - 33^rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 8441, Lecture Notes in Computer Science, Copenhagen, Denmark, pp. 40-57, (Springer) (2014)
  • J. Bi, J.‑S. Coron, J.‑Ch. Faugère, Phong Q. Nguyen, G. Renault, R. Zeitoun : “Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences”, PKC 2014 - 17^th IACR International Conference on Practice and Theory of Public-Key Cryptography, vol. 8383, Lecture Notes in Computer Science, Buenos Aires, Argentina, pp. 185-202, (Springer) (2014)
• 2013
  • J.‑Ch. Faugère, V. Gauthier‑Umana, A. Otmani, L. Perret, J.‑P. Tillich : “A Distinguisher for High Rate McEliece Cryptosystems”, IEEE Transactions on Information Theory, vol. 59 (10), pp. 6830-6844, (Institute of Electrical and Electronics Engineers) (2013)
  • J.‑Ch. Faugère, P. Gaudry, L. Huot, G. Renault : “Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm”, Journal of Cryptology, pp. 1-40, (Springer Verlag) (2013)
  • J.‑Ch. Faugère, P. Gaudry, L. Huot, G. Renault : “Polynomial Systems Solving by Fast Linear Algebra”, (2013)
  • J.‑Ch. Faugère, M. Safey El Din, P.‑J. Spaenlehauer : “On the Complexity of the Generalized MinRank Problem”, Journal of Symbolic Computation, vol. 55, pp. 30-58, (Elsevier) (2013)
  • M. Bardet, J.‑Ch. Faugère, B. Salvy, P.‑J. Spaenlehauer : “On the Complexity of Solving Quadratic Boolean Systems”, Journal of Complexity, vol. 29 (1), pp. 53-75, (Elsevier) (2013)
  • J.‑Ch. Faugère, J. Svartz : “Gröbner Bases of Ideals Invariant under a Commutative Group: the Non-Modular Case”, Proceedings of the 38^th International Symposium on Symbolic and Algebraic Computation, ISSAC '13, Boston, United States, pp. 347-354, (ACM) (2013)
  • J.‑Ch. Faugère, M. Safey El Din, Th. Verron : “On the Complexity of Computing Gröbner Bases for Quasi-homogeneous Systems”, ISSAC '13 : Proceedings of the 38^th International Symposium on Symbolic and Algebraic Computation, Boston, Maine, United States, pp. 189-196, (ACM) (2013)
  • L. Bettale, J.‑Ch. Faugère, L. Perret : “Cryptanalysis of HFE, Multi-HFE and Variants for Odd and Even Characteristic”, Designs, Codes and Cryptography, vol. 69 (1), pp. 1-52, (Springer Verlag) (2013)
• 2012
  • Martin R. Albrecht, C. Cid, J.‑Ch. Faugère, L. Perret : “On the relation between the MXL family of algorithms and Gröbner basis algorithms”, Journal of Symbolic Computation, vol. 47 (8), pp. 926-941, (Elsevier) (2012)
  • L. Bettale, J.‑Ch. Faugère, L. Perret : “Solving Polynomial Systems over Finite Fields: Improved Analysis of the Hybrid Approach”, ISSAC 2012 - 37^th International Symposium on Symbolic and Algebraic Computation, Grenoble, France, pp. 67-74, (ACM) (2012)
  • J.‑Ch. Faugère, M. Safey El Din, P.‑J. Spaenlehauer : “Critical Points and Gröbner Bases: the Unmixed Case”, ISSAC 2012 - International Symposium on Symbolic and Algebraic Computation - 2012, Grenoble, France, pp. 162-169, (ACM) (2012)
  • M. Albrecht, C. Cid, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret : “On the Complexity of the BKW Algorithm on LWE”, SCC 2012 -- Third international conference on Symbolic Computation and Cryptography, Castro Urdiales, Spain, pp. 100-107 (2012)
  • J.‑Ch. Faugère, J. Svartz : “Solving Polynomial Systems Globally Invariant Under an Action of the Symmetric Group and Application to the Equilibria of N vortices in the Plane”, ISSAC '12 - International Symposium on Symbolic and Algebraic Computation, Grenoble, France, pp. 170-178, (ACM) (2012)
  • M. Albrecht, C. Cid, J.‑Ch. Faugère, R. Fitzpatrick, L. Perret : “On the complexity of the Arora-Ge Algorithm against LWE”, SCC 2012 -- Third international conference on Symbolic Computation and Cryptography, Castro Urdiales, Spain, pp. 93-99 (2012)
  • C. Carlet, J.‑Ch. Faugère, Ch. Goyet, G. Renault : “Analysis of the algebraic side channel attack”, Journal of Cryptographic Engineering, vol. 2 (1), pp. 45-62, (Springer) (2012)
  • J.‑Ch. Faugère, L. Perret, Ch. Petit, G. Renault : “Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields”, Eurocrypt 2012 - 31^st Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 7237, Lecture Notes in Computer Science, Cambridge, United Kingdom, pp. 27-44, (Springer) (2012)
  • D. Lin, J.‑Ch. Faugère, L. Perret, T. Wang : “On enumeration of polynomial equivalence classes and their application to MPKC”, Finite Fields and Their Applications, vol. 18 (2), pp. 283-302, (Elsevier) (2012)
  • D. Gligoroski, R. Ødegard, R. Jensen, L. Perret, J.‑Ch. Faugère, S. Knapskog, S. Markovski : “MQQ-SIG - An Ultra-Fast and Provably CMA Resistant Digital Signature Scheme”, Trusted Systems - The Third International Conference on Trusted Systems - INTRUST 2011, vol. 7222, Lecture Notes in Computer Science, Beijing, China, pp. 184-203, (Springer Verlag) (2012)
  • J.‑Ch. Faugère, Ch. Goyet, G. Renault : “Attacking (EC)DSA Given Only an Implicit Hint”, Selected Areas in Cryptography, vol. 7707, Lecture Notes in Computer Science, Windsor, Canada, pp. 252-274, (Springer) (2012)
  • J.‑Ch. Faugère, P. Gaudry, L. Huot, G. Renault : “Using Symmetries and Fast Change of Ordering in the Index Calculus for Elliptic Curves Discrete Logarithm”, SCC 2012 - Third international conference on Symbolic Computation and Cryptography, Castro Urdiales, Spain, pp. 113-118 (2012)
• 2011
  • M. Albrecht, J.‑Ch. Faugère, P. Farshim, L. Perret : “Polly Cracker, Revisited”, ASIACRYPT 2011 - 17^th International Conference on the Theory and Application of Cryptology and Information Security, vol. 7073, Lecture Notes in Computer Science, Seoul, Korea, Republic of, pp. 179-196, (Springer) (2011)
  • J.‑Ch. Faugère, V. Gauthier‑Umana, A. Otmani, L. Perret, J.‑P. Tillich : “A distinguisher for high rate McEliece cryptosystems”, ITW 2011- IEEE Information Theory Workshop, Paraty, Brazil, pp. 282-286, (IEEE) (2011)
  • M. Albrecht, C. Cid, Th. Dulien, J.‑Ch. Faugère, L. Perret : “Algebraic Precomputations in Differential Cryptanalysis”, Information Security and Cryptology: 6^th International Conference, Inscrypt 2010, Revised Selected Papers, vol. 6584, Lecture Notes in Computer Science, Shanghai, China, pp. 387-403, (Springer Berlin / Heidelberg) (2011)
  • J.‑Ch. Faugère, D. Lubicz, D. Robert : “Computing modular correspondences for abelian varieties”, Journal of Algebra, vol. 343 (1), pp. 248-277, (Elsevier) (2011)
  • J.‑Ch. Faugère : “Solving efficiently structured polynomial systems and Applications in Cryptology”, The 15^th workshop on Elliptic Curve Cryptography ECC 2011, Nancy, France (2011)
  • J.‑Ch. Faugère, Ch. Mou : “Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices”, Proceedings of the 36^th international symposium on Symbolic and algebraic computation, San Jose, United States, pp. 115-122, (ACM) (2011)
  • J.‑Ch. Faugère, Y. Liang : “Artificial discontinuities of single-parametric Gröbner bases”, Journal of Symbolic Computation, vol. 46 (4), pp. 459-466, (Elsevier) (2011)
  • J.‑Ch. Faugère, M. Safey El Din, P.‑J. Spaenlehauer : “Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity”, Journal of Symbolic Computation, vol. 46 (4), pp. 406-437, (Elsevier) (2011)
  • L. Bettale, J.‑Ch. Faugère, L. Perret : “Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants”, Public Key Cryptography - PKC 2011, vol. 6571, Lecture Notes in Computer Science, Taormina, Italy, pp. 441-458, (Springer Berlin / Heidelberg) (2011)
  • J.‑Ch. Faugère, Ch. Goyet, G. Renault : “Algebraic Side Channel Analysis”, COSADE'11: The 2^nd International Workshop on Constructive Side-Channel Analysis and Secure Design, Darmstadt, Germany, pp. 1-6 (2011)
  • Ch. Bouillaguet, J.‑Ch. Faugère, P.‑A. Fouque, L. Perret : “Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial With One Secret Problem”, 14^th IACR International Conference on Practice and Theory of Public Key Cryptography - PKC 2011, vol. 6571, Lecture Notes in Computer Science, Taormina, Italy, pp. 473-493, (Springer) (2011)
• 2010
  • J.‑Ch. Faugère, R. Ødegard, L. Perret, D. Gligoroski : “Analysis of the MQQ Public Key Cryptosystem”, Cryptology and Network Security, vol. 6467, Lecture Notes in Computer Science, Kuala Lumpur, Malaysia, pp. 169-183, (Springer Berlin / Heidelberg) (2010)
  • J.‑Ch. Faugère, A. Otmani, L. Perret, J.‑P. Tillich : “A Distinguisher for High Rate McEliece Cryptosystem -- Extended Abstract”, Yet Another Conference on Cryptography, YACC 2010, Porquerolles, France, pp. 1-4 (2010)
  • J.‑Ch. Faugère, A. Otmani, L. Perret, J.‑P. Tillich : “Algebraic Cryptanalysis of McEliece Variants with Compact Keys -- Toward a Complexity Analysis”, Yet Another Conference on Cryptography, YACC 2010, Porquerolles, France, pp. 1-4 (2010)
  • J.‑Ch. Faugère : “FGb: A Library for Computing Gröbner Bases”, Mathematical Software - ICMS 2010, vol. 6327, Lecture Notes in Computer Science, Kobe, Japan, pp. 84-87, (Springer Berlin / Heidelberg) (2010)
  • J.‑Ch. Faugère, A. Joux, L. Perret, J. Treger : “Cryptanalysis of the Hidden Matrix Cryptosystem”, Progress in Cryptology - LATINCRYPT 2010, vol. 6212, Lecture Notes in Computer Science, Puebla, Mexico, pp. 241-254, (Springer Berlin / Heidelberg) (2010)
  • J.‑Ch. Faugère, J. Gathen, L. Perret : “Decomposition of Generic Multivariate Polynomials”, ISSAC '10: Proceedings of the 2010 international symposium on Symbolic and algebraic computation, Munich, Germany, pp. 131-137, (ACM) (2010)
  • J.‑Ch. Faugère, S. Lachartre : “Parallel Gaussian Elimination for Gröbner bases computations in finite fields”, Proceedings of the 4^th International Workshop on Parallel and Symbolic Computation, PASCO '10, Grenoble, France, pp. 89-97, (ACM) (2010)
  • J.‑Ch. Faugère, A. Otmani, L. Perret, J.‑P. Tillich : “Algebraic Cryptanalysis of McEliece Variants with Compact Keys -- Toward a Complexity Analysis”, SCC '10: Proceedings of the 2^nd International Conference on Symbolic Computation and Cryptography, London, United Kingdom, pp. 45-55 (2010)
  • M. Albrecht, C. Cid, Th. Dulien, J.‑Ch. Faugère, L. Perret : “Algebraic Precomputations in Differential Cryptanalysis”, Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, London, United Kingdom, pp. 37-50, (Ecrypt II) (2010)
  • J.‑Ch. Faugère, R. Ødegard, L. Perret, D. Gligoroski : “Analysis of the MQQ Public Key Cryptosystem”, SCC'10: Proceedings of the 2^nd International Conference on Symbolic Computation and Cryptography, Londres, United Kingdom, pp. 101-116 (2010)
  • L. Bettale, J.‑Ch. Faugère, L. Perret : “Hybrid Approach : a Tool for Multivariate Cryptography”, Tools'10: Proceedings of the Workshop on Tools for Cryptanalysis 2010, London, United Kingdom, pp. 15-23, (Ecrypt II) (2010)
  • J.‑Ch. Faugère, R. Marinier, G. Renault : “Implicit Factoring with Shared Most Significant and Middle Bits”, SCC '10: Proceedings of the 2^nd International Conference on Symbolic Computation and Cryptography, London, United Kingdom, pp. 197-201 (2010)
  • J.‑Ch. Faugère, R. Marinier, G. Renault : “Implicit Factoring with Shared Most Significant and Middle Bits”, in 13^th International Conference on Practice and Theory in Public Key Cryptography -- PKC 2010, vol. 6056, Lecture Notes in Computer Science, Paris, France, pp. 70-87, (Springer-Verlag) (2010)
  • G. Bourgeois, J.‑Ch. Faugère : “Algebraic Attack on NTRU using Witt Vectors and Gröbner bases”, Journal of Mathematical Cryptology, vol. 3 (3), pp. 205-214, (De Gruyter) (2010)
  • L. Bettale, J.‑Ch. Faugère, L. Perret : “Hybrid approach for solving multivariate systems over finite fields”, Journal of Mathematical Cryptology, vol. 3 (3), pp. 177-197, (De Gruyter) (2010)
  • J.‑Ch. Faugère, M. Safey El Din, P.‑J. Spaenlehauer : “Computing Loci of Rank Defects of Linear Matrices using Gröbner Bases and Applications to Cryptology”, ISSAC 2010 - 35^th International Symposium on Symbolic and Algebraic Computation, Munich, Germany, pp. 257-264, (ACM) (2010)
  • J.‑Ch. Faugère, A. Otmani, L. Perret, J.‑P. Tillich : “Algebraic Cryptanalysis of McEliece Variants with Compact Keys”, Eurocrypt 2010 - 29^th International Conference on Cryptology, vol. 6110, Lecture Notes in Computer Science, Monaco, Monaco, pp. 279-298, (Springer Verlag) (2010)
  • J.‑Ch. Faugère, P.‑J. Spaenlehauer : “Algebraic Cryptanalysis of the PKC’09 Algebraic Surface Cryptosystem”, PKC 2010 - 13^th International Conference on Practice and Theory in Public Key Cryptography, vol. 6056, Lecture Notes in Computer Science, Paris, France, pp. 35-52, (Springer) (2010)
  • J.‑Ch. Faugère, C. Cid : “Proceedings of the 2^nd International Conference on Symbolic Computation and Cryptography (SCC 2010), Royal Holloway, University of London, Egham, June, 2010”, pp. 1-253, (Royal Holloway, University of London) (2010)
  • J.‑Ch. Faugère, L. Perret : “Symbolic Computation and Cryptography”, vol. 3 (2), Mathematics in Computer Science, 127-224 pages, (Birkhäuser and Springer) (2010)
• 2009
  • D. Augot, J.‑Ch. Faugère, L. Perret : “Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics”, Journal of Symbolic Computation, vol. 44, pp. 1605-1724, (Elsevier) (2009)
  • D. Augot, M. Bardet, J.‑Ch. Faugère : “On the decoding of binary cyclic codes with the Newton’s identities”, Journal of Symbolic Computation, vol. 44 (12), Gröbner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics, pp. 1608-1625, (Elsevier) (2009)
  • J.‑Ch. Faugère, L. Perret : “Algebraic Cryptanalysis of Curry and Flurry using Correlated Messages”, Information Security and Cryptology: 5^th International Conference, Inscrypt 2009, Beijing, China, December, 2009, Revised Selected Papers, vol. 6151, Lecture Notes in Computer Science, Beijing, China, pp. 266-277, (Springer-Verlag) (2009)
  • L. Bettale, J.‑Ch. Faugère, L. Perret : “Security Analysis of Multivariate Polynomials for Hashing”, Information Security and Cryptology: 4^th International Conference, Inscrypt 2008, Revised Selected Papers, vol. 5487, Lecture Notes in Computer Science, Beijing, China, pp. 115-124, (Springer-Verlag) (2009)
  • J.‑Ch. Faugère, L. Perret : “An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography”, Journal of Symbolic Computation, vol. 44 (12), pp. 1676-1689, (Elsevier) (2009)
  • J.‑Ch. Faugère : “Solving Structured Polynomial Systems and Applications to Cryptology”, Computer Algebra in Scientific Computing - CASC'09, vol. 5743, Lecture Notes in Computer Science, Kobe, Japan, pp. 79-80, (Springer Berlin / Heidelberg) (2009)
  • J.‑Ch. Faugère, L. Perret, P.‑J. Spaenlehauer : “Algebraic-Differential Cryptanalysis of DES”, Western European Workshop on Research in Cryptology - WEWoRC 2009, Graz, Austria, pp. 1-5 (2009)
  • J.‑Ch. Faugère, L. Perret : “High order derivatives and decomposition of multivariate polynomials”, ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, Seoul, Korea, Republic of, pp. 207-214, (ACM) (2009)
  • J.‑Ch. Faugère : “Interactions between computer algebra (Gröbner bases) and cryptology”, ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, Seoul, Korea, Republic of, pp. 383-384, (ACM) (2009)
  • J.‑Ch. Faugère, S. Rahmany : “Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases”, ISSAC '09: Proceedings of the 2009 international symposium on Symbolic and algebraic computation, Seoul, Korea, Republic of, pp. 151-158, (ACM) (2009)
  • J.‑Ch. Faugère : “Efficient algorithms to compute Groebner Bases and applications in Cryptology”, Polynomial Computer Algebra'09, Euler Institute, St Petersburg, Russian Federation (2009)
  • J.‑Ch. Faugère, M. Safey El Din : “De l’algèbre linéaire à la résolution des systèmes polynomiaux”, chapitre de Mathématiques Appliquées (L3), pp. 331-388, (Pearson), (ISBN: 978-2-7440-7352-6) (2009)
  • J.‑Ch. Faugère, F. Rouillier : “Polynomial system solving”, vol. 44 (3), 1-221 pages, (Academic Press, Inc.), (ISBN: 0747-7171) (2009)
• 2008
  • J.‑Ch. Faugère, L. Perret : “High order derivatives and decomposition of multivariate polynomials”, Second Workshop on Mathematical Cryptology, Santander, Spain, pp. 15-19 (2008)
  • J.‑Ch. Faugère : “On the complexity of the Minrank problem”, Second Workshop on Mathematical Cryptology, Santander, Spain, pp. 2-3 (2008)
  • J.‑Ch. Faugère, F. Levy‑dit‑Vehel, L. Perret : “Cryptanalysis of MinRank”, Advances in Cryptology – CRYPTO 2008, vol. 5157, Lecture Notes in Computer Science, Santa Barbara, CA, United States, pp. 280-296, (Springer) (2008)
  • J.‑Ch. Faugère, G. Moroz, F. Rouillier, M. Safey El Din : “Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities”, ISSAC 2008 - 21^st International Symposium on Symbolic and Algebraic Computation, Hagenberg, Austria, pp. 79-86, (ACM) (2008)
  • F. Cazals, J.‑Ch. Faugère, M. Pouget, F. Rouillier : “Ridges and Umbilics of Polynomial Parametric Surfaces”, chapter in Geometric Modeling and Algebraic Geometry, pp. 141-159, (Springer), (ISBN: 978-3-540-72184-0) (2008)
• 2007
  • J.‑Ch. Faugère : “Calcul efficace des bases de Gröbner et applications”, habilitation, phd defence 07/18/2007 (2007)
  • J.‑Ch. Faugère, Y. Liang : “Numerical Computation of Grobner Bases for Zero-dimensional Polynomial Ideals”, Mathematical Aspects of Computer and Information Sciences 2007, Paris, France, Paris, France (2007)
  • R. Cameron, J.‑Ch. Faugère, F. Rouillier, F. Seyfert : “Exhaustive approach to the coupling matrix synthesis problem and application to the design of high degree asymmetric filters”, International Journal of RF and Microwave Computer-Aided Engineering, vol. 17 (1), pp. 4-12, (Wiley) (2007)
  • D. Augot, M. Bardet, J.‑Ch. Faugère : “On formulas for decoding binary cyclic codes”, IEEE International Symposium on Information Theory, 2007 (ISIT 2007), Nice, France, pp. 2646-2650, (IEEE) (2007)
• 2006
  • J.‑Ch. Faugère, L. Perret : “Cryptanalysis of 2R-- schemes”, Advances in Cryptology CRYPTO 2006, vol. 4117, Lecture Notes in Computer Science, Santa Barbara, California, United States, pp. 357-372, (Springer-Verlag) (2006)
  • J.‑Ch. Faugère : “Grobner Bases and Cryptology: application to 2R-”, Workshop on Mathematical Cryptology, Santander, Spain, pp. 13-13 (2006)
  • J.‑Ch. Faugère : “Solving Polynomial Systems with Grobner bases: application in Cryptology”, Computational Algebraic Geometry and Applications, Nice, France (2006)
  • J.‑Ch. Faugère : “An efficient algorithm for computing Gröbner bases without reduction to zero. Applications in Cryptology.”, Special Semester on Groebner Bases D1, Linz, Austria (2006)
  • J.‑Ch. Faugère : “Computation of Gb by change of ordering: comparing the efficiency of several algorithms”, Special Semester on Groebner Bases D1, Linz, Austria (2006)
  • J.‑Ch. Faugère, L. Perret : “Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects”, International Workshop on Post-Quantum Cryptography 2006, Louvain, Belgium, pp. 67-84 (2006)
  • J.‑Ch. Faugère, L. Perret : “Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects”, EuroCrypt 2006 Advances in Cryptology, vol. 4004, Lecture Notes in Computer Science, Saint Petersburg, Russian Federation, pp. 30-47, (Springer-Verlag) (2006)
  • F. Cazals, J.‑Ch. Faugère, M. Pouget, F. Rouillier : “The implicit structure of ridges of a smooth parametric surface”, Computer Aided Geometric Design, vol. 23 (7), pp. 582-598, (Elsevier) (2006)
• 2005
  • F. Rouillier, J.‑Ch. Faugère : “Polynomial System Solving for Industrial Problems”, SIAM Conference on Mathematics for Industry, Detroit, MI, United States, pp. 1-5 (2005)
  • M. Bardet, J.‑Ch. Faugère, B. Salvy : “Asymptotic Behaviour of the Index of Regularity of Semi-Regular Quadratic Polynomial Systems”, MEGA 2005 - 8^th International Symposium on Effective Methods in Algebraic Geometry, Porto Conte, Alghero, Sardinia, Italy, pp. 1-17 (2005)
  • G. Ars, J.‑Ch. Faugère : “Algebraic Immunities of Functions over Finite Fields”, BFCA 2005 - 1^st International Workshop on Boolean Function: Cryptography and Applications, Rouen, France, pp. 21-38, (Presses Universitaires de Rouen) (2005)
  • J.‑Ch. Faugère, F. Rouillier : “Outils de calcul formel performants pour la résolution de certains problèmes en robotique”, Journées Nationales de Recherche en Robotique, Lorient, France, pp. 89-99 (2005)
  • F. Cazals, J.‑Ch. Faugère, M. Pouget, F. Rouillier : “Ridges and umbilics of polynomial parametric surfaces”, Computational Methods for Algebraic Spline Surfaces II - COMPASS II, Oslo, Norway (2005)
  • Richard J. Cameron, J.‑Ch. Faugère, F. Seyfert : “Coupling matrix synthesis for a new class of microwave filter configuration”, 2005 IEEE MTT-S International Microwave Symposium, vol. 1, Long Beach, United States, pp. 119-124 (2005)
  • A. Basiri, A. Enge, J.‑Ch. Faugère, N. Gürel : “The arithmetic of Jacobian groups of superelliptic cubics”, Mathematics of Computation, vol. 74 (249), pp. 389-410, (American Mathematical Society) (2005)
• 2004
  • G. Ars, J.‑Ch. Faugère, H. Imai, M. Kawazoe, M. Sugita : “Comparison Between XL and Gröbner Basis Algorithms”, ASIACRYPT 2004 - 10^th International Conference on the Theory and Application of Cryptology and Information Security, vol. 3329, Lecture Notes in Computer Science, Jeju Island, Korea, Republic of, pp. 338-353, (Springer) (2004)
  • J.‑Ch. Faugère, M. Bardet, B. Salvy : “On the complexity of Grbner basis computation of semi-regular overdetermined algebraic equations”, International Conference on Polynomial System Solving, Paris, France, pp. 71-75 (2004)
  • A. Basiri, A. Enge, J.‑Ch. Faugère, N. Gürel : “Implementing the Arithmetic of C3,4 Curves”, ANTS-VI - 6^th International Symposium on Algorithmic Number Theory, vol. 3076, Lecture Notes in Computer Science, Burlington, VT, United States, pp. 87-101, (Springer) (2004)
  • J.‑Ch. Faugère, G. Ars : “Comparison of XL and Gröbner basis algorithms over Finite Fields”, 26 pages (2004)
• 2003
  • J.‑Ch. Faugère, M. Hering, J. Phan : “The Membrane Inclusions Curvature Equations”, Advances in Applied Mathematics, vol. 31 (4), pp. 643-658, (Elsevier) (2003)
  • A. Joux, J.‑Ch. Faugère : “Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Grobner Bases”, CRYPTO 2003 - 23^rd Annual International Cryptology Conference, vol. 2729, Lecture Notes in Computer Science, Santa Barbara, California, United States, pp. 44-60, (Springer) (2003)
  • A. Basiri, J.‑Ch. Faugère : “Changing the ordering of Gröbner bases with LLL: case of two variables”, ISSAC 2003 - International Symposium on Symbolic and Algebraic Computation, Philadelphia, PA, United States, pp. 23-29, (ACM Press) (2003)
  • D. Augot, M. Bardet, J.‑Ch. Faugère : “Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Grobner bases”, IEEE International Symposium on Information Theory - ISIT'2003, Yokohama, Japan, pp. 362-362, (IEEE Computer Society) (2003)
  • J.‑Ch. Faugère, G. Ars : “An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner bases”, (2003)
  • A. Basiri, J.‑Ch. Faugère : “Changing the ordering of Gröbner Bases with LLL: Case of Two Variables”, (2003)
  • M. Bardet, J.‑Ch. Faugère, B. Salvy : “Complexity of Gröbner basis computation for Semi-regular Overdetermined sequences over F_2 with solutions in F_2”, (2003)
• 2002
  • J.‑Ch. Faugère : “A new efficient algorithm for computing Gröbner bases without reduction to zero F5”, International Symposium on Symbolic and Algebraic Computation Symposium - ISSAC 2002, Villeneuve d'Ascq, France, pp. 75-83, (ACM) (2002)
  • J.‑Ch. Faugère : “A new efficient algorithm for computing Gröbner bases without reduction to zero”, Workshop on application of Groebner Bases 2002, Catania, Spain (2002)
  • J.‑Ch. Faugère : “Classification of all planar central configurations of N bodies with equal masses in the case of the logarithmic potential and N < 8”, 8^th International Conference on Applications of Computer Algebra - ACA 2002, Volos, Greece (2002)
  • J.‑Ch. Faugère : “Gröbner bases and application to HFE”, YACC 2002 - Conference on Cryptography, Porquerolles, France (2002)
• 2001
  • J.‑Ch. Faugère : “About a new generation of algorithms for solving polynomial systems and some applications”, Computer Algebra in Applications to Integrable Systems, Cambridge, United Kingdom (2001)
  • J.‑Ch. Faugère : “Finding all the Solutions of Cyclic 9 using Gröbner Basis Techniques”, Fifth Asian Symposium on Computer Mathematics - ASCM'2001, vol. 9, Lecture Notes on Computing, Matsuyama, Japan, pp. 1-12, (World Scientific) (2001)
• 2000
  • J.‑Ch. Faugère : “How my computer find all the solutions of Cyclic 9”, (2000)
  • J.‑Ch. Faugère, H. Milena, Ph. Jeff : “The Membrane Inclusions Curvature Equations”, (2000)
• 1999
  • J.‑Ch. Faugère : “A new efficient algorithm for computing Gröbner bases (F4)”, Journal of Pure and Applied Algebra, vol. 139 (1-3), pp. 61-88, (Elsevier) (1999)
  • J.‑Ch. Faugère, I. Kotsireas : “Symmetry theorems for the Newtonian 4- and 5-body problems with equal masses”, 2^nd Workshop on Computer algebra in scientific computing, Munich, Germany, pp. 81-92, (Springer-Verlag) (1999)
  • M. Kern, A. Oloui, J.‑Ch. Faugère, F. Rouillier : “Using Groebner bases to compute higher order finite elements for mass lumping”, Fourth International Congress on Industrial & Applied Mathematics - ICIAM'99, Edinburgh, United Kingdom (1999)
  • J.‑Ch. Faugère, F. Rouillier : “Design of filter and filter banks using dedicated Computer Algebra Tools”, International Conference on Applications of Computer Algebra (ACA'99), Madrid, Spain (1999)
  • J.‑Ch. Faugère, L. Rolland, F. Rouillier : “Using Computer algebra tools for off-line studies of parallel manipulators”, International Conference on Applications of Computer Algebra (ACA'99), Madrid, Spain (1999)
  • J.‑Ch. Faugère, F. Rouillier : “Dispositif d’échanges de données entre matériels informatiques”, (1999)
• 1998
  • J.‑Ch. Faugère, F. Moreau De Saint Martin, F. Rouillier : “Design of regular nonseparable bidimensional wavelets using Grobner basis techniques”, IEEE Transactions on Signal Processing, vol. 46 (4), pp. 845-856, (Institute of Electrical and Electronics Engineers) (1998)