World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
7686
World Ranking
11495
National Ranking
285

Overview

Jean-Charles Faugère is affiliated with the French Institute for Research in Computer Science and Automation (INRIA) in France. Their research predominantly spans the field of Computer Science, with a significant focus on Artificial Intelligence, Information Systems, and Computational Theory and Mathematics.

Their scholarly work covers several subfields, including:

  • Artificial Intelligence
  • Information Systems
  • Computational Theory and Mathematics
  • Geometry and Topology
  • Computer Networks and Communications

Jean-Charles Faugère's main topics of research include cryptography and data security, cryptography and residue arithmetic, and coding theory. The topics further extend to complexity and algorithms in graphs, cryptographic implementations and security, optimization and search problems, as well as chaos-based image and signal encryption.

  • Cryptography and Data Security
  • Cryptography and Residue Arithmetic
  • Coding theory and cryptography
  • Complexity and Algorithms in Graphs
  • Cryptographic Implementations and Security
  • Optimization and Search Problems
  • Chaos-based Image/Signal Encryption

Their publication record presents papers in various prominent venues, including:

  • arXiv (Cornell University)
  • Designs Codes and Cryptography
  • Advances in Mathematics of Communications
  • OPAL (Open@LaTrobe) (La Trobe University)
  • Journal of Mathematical Cryptology

Among recent papers by Jean-Charles Faugère are:

  • "Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature," 2022, Designs Codes and Cryptography
  • "RYDE: a digital signature scheme based on rank syndrome decoding problem with MPC-in-the-Head paradigm," 2025, Designs Codes and Cryptography
  • "Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms," 2022, Advances in Mathematics of Communications
  • "Certified Lattice Reduction," 2023, OPAL (Open@LaTrobe) (La Trobe University)
  • "RYDE: A Digital Signature Scheme based on Rank-Syndrome-Decoding Problem with MPCitH Paradigm," 2023, arXiv (Cornell University)

In their research collaborations, Jean-Charles Faugère frequently coauthors with:

  • Thibauld Feneuil
  • Matthieu Rivain
  • Miklós Sántha
  • Thomas Espitau
  • Gang Tang

Jean-Charles Faugère's work, marked by 61 publications in Computer Science, reflects a strong interdisciplinary approach bridging core theoretical aspects with applied cryptography and algorithmic development.

Best Publications

  • A Distinguisher for High-Rate McEliece Cryptosystems

    Jean-Charles Faugere;Valerie Gauthier-Umana;Ayoub Otmani;Ludovic Perret

  • Algebraic cryptanalysis of mceliece variants with compact keys

    Jean-Charles Faugère;Ayoub Otmani;Ludovic Perret;Jean-Pierre Tillich

  • Hybrid approach for solving multivariate systems over finite fields

    Luk Bettale;Jean-Charles Faugère;Ludovic Perret

  • Comparison Between XL and Gröbner Basis Algorithms

    Gwénolé Ars;Jean-Charles Faugère;Hideki Imai;Mitsuru Kawazoe

  • On the complexity of the F 5 Gröbner basis algorithm

    Magali Bardet;Jean-Charles Faugère;Bruno Salvy

  • Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology

    Jean-Charles Faugère;Mohab Safey El Din;Pierre-Jean Spaenlehauer

  • Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects

    Unknown

  • Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1,1): Algorithms and complexity

    Jean-Charles Faugère;Jean-Charles Faugère;Mohab Safey El Din;Mohab Safey El Din;Pierre-Jean Spaenlehauer;Pierre-Jean Spaenlehauer

  • Complexity of Gröbner basis computation for Semi-regular Overdetermined sequences over F_2 with solutions in F_2

    Magali Bardet;Jean-Charles Faugère;Bruno Salvy

  • A survey on signature-based algorithms for computing Gröbner bases

    Christian Eder;Jean-Charles Faugère

  • An Algebraic Cryptanalysis of Nonlinear Filter Generators using Gröbner bases

    Jean-Charles Faugère;Gwénolé Ars

  • GeMSS: A Great Multivariate Short Signature

    Antoine Casanova;Jean-Charles Faugère;Gilles Macario-Rat;Jacques Patarin

  • Improving the complexity of index calculus algorithms in elliptic curves over binary fields

    Jean-Charles Faugère;Ludovic Perret;Christophe Petit;Guénaël Renault

  • Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases

    Jean-Charles Faugère;Sajjad Rahmany

  • Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices

    Jean-Charles Faugère;Chenqi Mou

  • Lazy Modulus Switching for the BKW Algorithm on LWE

    Unknown

  • Design of regular nonseparable bidimensional wavelets using Grobner basis techniques

    Unknown

  • Structural cryptanalysis of McEliece schemes with compact keys

    Jean-Charles Faugère;Ayoub Otmani;Ludovic Perret;Frédéric Portzamparc

  • Exhaustive approach to the coupling matrix synthesis problem and application to the design of high degree asymmetric filters

    Richard J. Cameron;Jean-Charles Faugere;Fabrice Rouillier;Fabien Seyfert

  • Cryptanalysis of 2r − schemes

    Jean-Charles Faugère;Ludovic Perret

  • Solving polynomial systems over finite fields: improved analysis of the hybrid approach

    Luk Bettale;Jean-Charles Faugère;Ludovic Perret

  • Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem

    Charles Bouillaguet;Jean-Charles Faugère;Pierre-Alain Fouque;Ludovic Perret

  • Sub-cubic change of ordering for Gröbner basis: a probabilistic approach

    Jean-Charles Faugère;Pierrick Gaudry;Louise Huot;Guénaël Renault

  • A Distinguisher for High Rate McEliece Cryptosystems.

    Jean-Charles Faugère;Valérie Gauthier;Ayoub Otmani;Ludovic Perret

  • Moment Varieties of Gaussian Mixtures

    Carlos Améndola;Jean-Charles Faugère;Bernd Sturmfels

Frequent Co-Authors

Pierrick Gaudry
Pierrick Gaudry University of Lorraine
Jean-Pierre Tillich
Jean-Pierre Tillich French Institute for Research in Computer Science and Automation - INRIA
Jean-Pierre Merlet
Jean-Pierre Merlet French Institute for Research in Computer Science and Automation - INRIA
Jean-Sébastien Coron
Jean-Sébastien Coron University of Luxembourg
Antoine Joux
Antoine Joux Université Paris Cité
Claude Carlet
Claude Carlet Paris 8 University
Pierre-Alain Fouque
Pierre-Alain Fouque University of Rennes
George Labahn
George Labahn University of Waterloo

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Computer science students in the USA have a wealth of online degree options and career pathways to explore. Many allied disciplines, such as engineering, data science, and physics, offer flexible online programs with accredited faculty and robust learning platforms.

For those interested in engineering, an online mechanical engineering degree provides practical skills for industries like robotics, automotive, and aerospace. Similarly, an electrical engineering online tuition costs analysis shows affordable pathways for pursuing careers in electronics, power systems, and telecommunications.

Aspiring data scientists can compare leading data science programs for online study. These programs typically cover statistics, machine learning, and programming, building a strong foundation for high-demand tech careers.

Those interested in analytical and theoretical fields may prefer a physics degree online, which provides a flexible pathway for careers in research, education, and technology. Choosing the right program can help you align your studies with your career goals and explore interdisciplinary opportunities in STEM.

Best Scientists Citing Jean-Charles Faugère

Trending Scientists