Jean-Charles Faugère

According to our database1, Jean-Charles Faugère authored at least 131 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Computing critical points for invariant algebraic systems.
J. Symb. Comput., 2023

Rectangular Attack on VOX.
IACR Cryptol. ePrint Arch., 2023

2022
Polynomial-division-based algorithms for computing linear recurrence relations.
J. Symb. Comput., 2022

A New Perturbation for Multivariate Public Key Schemes such as HFE and UOV.
IACR Cryptol. ePrint Arch., 2022

2021
Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems.
SIAM J. Appl. Algebra Geom., 2021

A nearly optimal algorithm to decompose binary forms.
J. Symb. Comput., 2021

Cryptanalysis of the extension field cancellation cryptosystem.
Des. Codes Cryptogr., 2021

2020
In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: The adaptive variants.
J. Symb. Comput., 2020

2019
Software Toolkit for HFE-based Multivariate Schemes.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019

Non-quantum cryptanalysis of the noisy version of Aaronson-Christiano's quantum money scheme.
IET Inf. Secur., 2019

Gr{ö}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems.
CoRR, 2019

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

PKP-Based Signature Scheme.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

2018
PKP-Based Signature Scheme.
IACR Cryptol. ePrint Arch., 2018

The point decomposition problem over hyperelliptic curves - Toward efficient computation of discrete logarithms in even characteristic.
Des. Codes Cryptogr., 2018

Towards Mixed Gr{ö}bner Basis Algorithms: the Multihomogeneous and Sparse Case.
CoRR, 2018

A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Combinatorial Digital Signature Scheme.
Proceedings of the 1st International Conference on Big Data and Cyber-Security Intelligence, 2018

2017
Sparse FGLM algorithms.
J. Symb. Comput., 2017

A survey on signature-based algorithms for computing Gröbner bases.
J. Symb. Comput., 2017

Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences.
J. Symb. Comput., 2017

Fast Quantum Algorithm for Solving Multivariate Quadratic Equations.
IACR Cryptol. ePrint Arch., 2017

In-depth comparison of the Berlekamp - Massey - Sakata and the Scalar-FGLM algorithms: the non adaptive variants.
CoRR, 2017

2016
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups.
IEEE Trans. Inf. Theory, 2016

On the complexity of computing Gröbner bases for weighted homogeneous systems.
J. Symb. Comput., 2016

Structural cryptanalysis of McEliece schemes with compact keys.
Des. Codes Cryptogr., 2016

Polly Cracker, revisited.
Des. Codes Cryptogr., 2016

The Quantum-Safe Revolution.
Proceedings of the Information Security Applications - 17th International Workshop, 2016

Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

GBLA: Gröbner Basis Linear Algebra Package.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

A Superfast Randomized Algorithm to Decompose Binary Forms.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

Factoring N=p^rq^s for Large r and s.
Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

2015
On the complexity of the F5 Gröbner basis algorithm.
J. Symb. Comput., 2015

Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case.
J. Complex., 2015

Factoring N=p<sup>r</sup> q<sup>s</sup> for Large r and s.
IACR Cryptol. ePrint Arch., 2015

On the complexity of the BKW algorithm on LWE.
Des. Codes Cryptogr., 2015

Sparse Gröbner bases: algorithms and complexity.
ACM Commun. Comput. Algebra, 2015

A survey on signature-based Gröbner basis computations.
ACM Commun. Comput. Algebra, 2015

Algebraic algorithms for LWE problems.
ACM Commun. Comput. Algebra, 2015

Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case.
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

2014
Mathematical and computer algebra techniques in cryptology.
J. Symb. Comput., 2014

Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm.
J. Cryptol., 2014

A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems.
IACR Cryptol. ePrint Arch., 2014

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
IACR Cryptol. ePrint Arch., 2014

Lazy Modulus Switching for the BKW Algorithm on LWE.
IACR Cryptol. ePrint Arch., 2014

On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems.
CoRR, 2014

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Sparse Gröbner bases: the unmixed case.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Sub-cubic change of ordering for Gröbner basis: a probabilistic approach.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Structural weakness of compact variants of the McEliece cryptosystem.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
A Distinguisher for High-Rate McEliece Cryptosystems.
IEEE Trans. Inf. Theory, 2013

On the complexity of the generalized MinRank problem.
J. Symb. Comput., 2013

On the complexity of solving quadratic Boolean systems.
J. Complex., 2013

A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search.
IACR Cryptol. ePrint Arch., 2013

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions.
IACR Cryptol. ePrint Arch., 2013

Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic.
Des. Codes Cryptogr., 2013

Polynomial Systems Solving by Fast Linear Algebra
CoRR, 2013

Computing Gröbner bases for quasi-homogeneous systems
CoRR, 2013

Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials.
CoRR, 2013

Gröbner bases of ideals invariant under a commutative group: the non-modular case.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

On the complexity of computing gröbner bases for quasi-homogeneous systems.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
On the relation between the MXL family of algorithms and Gröbner basis algorithms.
J. Symb. Comput., 2012

Analysis of the algebraic side channel attack.
J. Cryptogr. Eng., 2012

On enumeration of polynomial equivalence classes and their application to MPKC.
Finite Fields Their Appl., 2012

Fast change of ordering with exponent ω.
ACM Commun. Comput. Algebra, 2012

Attacking (EC)DSA Given Only an Implicit Hint.
Proceedings of the Selected Areas in Cryptography, 19th International Conference, 2012

Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Critical points and Gröbner bases: the unmixed case.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Solving polynomial systems over finite fields: improved analysis of the hybrid approach.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

2011
Pivoting in Extended Rings for Computing Approximate Gröbner Bases.
Math. Comput. Sci., 2011

Artificial discontinuities of single-parametric Gröbner bases.
J. Symb. Comput., 2011

Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity.
J. Symb. Comput., 2011

New Subexponential Algorithms for Factoring in SL(2, fq).
IACR Cryptol. ePrint Arch., 2011

Polly Cracker, Revisited.
IACR Cryptol. ePrint Arch., 2011

On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms.
IACR Cryptol. ePrint Arch., 2011

Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

MQQ-SIG - An Ultra-Fast and Provably CMA Resistant Digital Signature Scheme.
Proceedings of the Trusted Systems - Third International Conference, 2011

2010
Foreword.
Math. Comput. Sci., 2010

The Digital Signature Scheme MQQ-SIG.
IACR Cryptol. ePrint Arch., 2010

Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem.
IACR Cryptol. ePrint Arch., 2010

Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity
CoRR, 2010

Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem.
Proceedings of the Public Key Cryptography, 2010

Implicit Factoring with Shared Most Significant and Middle Bits.
Proceedings of the Public Key Cryptography, 2010

Cryptanalysis of the Hidden Matrix Cryptosystem.
Proceedings of the Progress in Cryptology, 2010

Decomposition of generic multivariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

FGb: A Library for Computing Gröbner Bases.
Proceedings of the Mathematical Software, 2010

Algebraic Cryptanalysis of McEliece Variants with Compact Keys.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

Algebraic Precomputations in Differential and Integral Cryptanalysis.
Proceedings of the Information Security and Cryptology - 6th International Conference, 2010

Parallel Gaussian elimination for Gröbner bases computations in finite fields.
Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

Analysis of the MQQ Public Key Cryptosystem.
Proceedings of the Cryptology and Network Security - 9th International Conference, 2010

2009
Foreword.
J. Symb. Comput., 2009

An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography.
J. Symb. Comput., 2009

Foreword.
J. Symb. Comput., 2009

On the decoding of binary cyclic codes with the Newton identities.
J. Symb. Comput., 2009

Algebraic attack on NTRU using Witt vectors and Gröbner bases.
J. Math. Cryptol., 2009

Hybrid approach for solving multivariate systems over finite fields.
J. Math. Cryptol., 2009

On the Security of UOV.
IACR Cryptol. ePrint Arch., 2009

Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem.
IACR Cryptol. ePrint Arch., 2009

Computing modular correspondences for abelian varieties
CoRR, 2009

Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

High order derivatives and decomposition of multivariate polynomials.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Interactions between computer algebra (Gröbner bases) and cryptology.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

Solving Structured Polynomial Systems and Applications to Cryptology.
Proceedings of the Computer Algebra in Scientific Computing, 11th International Workshop, 2009

2008
Algebraic Cryptanalysis of Curry and Flurry using Correlated Messages.
IACR Cryptol. ePrint Arch., 2008

Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Cryptanalysis of MinRank.
Proceedings of the Advances in Cryptology, 2008

Security Analysis of Multivariate Polynomials for Hashing.
Proceedings of the Information Security and Cryptology, 4th International Conference, 2008

Cryptanalysis of the TRMS Signature Scheme of PKC'05.
Proceedings of the Progress in Cryptology, 2008

2007
On formulas for decoding binary cyclic codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
The implicit structure of ridges of a smooth parametric surface.
Comput. Aided Geom. Des., 2006

Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Cryptanalysis of 2R<sup>-</sup> Schemes.
Proceedings of the Advances in Cryptology, 2006

2005
The arithmetic of Jacobian groups of superelliptic cubics.
Math. Comput., 2005

2004
Comparison Between XL and Gröbner Basis Algorithms.
Proceedings of the Advances in Cryptology, 2004

Implementing the Arithmetic of C<sub>3, 4</sub>Curves.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
The membrane inclusions curvature equations.
Adv. Appl. Math., 2003

Changing the ordering of Gröbner bases with LLL: case of two variables.
Proceedings of the Symbolic and Algebraic Computation, 2003

Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases.
Proceedings of the Advances in Cryptology, 2003

1999
Symmetry Theorems for the Newtonian 4- and 5-body Problems with Equal Masses.
Proceedings of the Second Workshop on Computer Algebra in Scientific Computing, 1999

1998
Design of regular nonseparable bidimensional wavelets using Grobner basis techniques.
IEEE Trans. Signal Process., 1998

1994
Parallelization of Gröbner Basis.
Proceedings of the First International Symposium on Parallel Symbolic Computation, 1994

1993
Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering.
J. Symb. Comput., 1993


  Loading...