Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. - Jean-Charles Faugère; Patrizia M. Gianni; Daniel Lazard; Teo Mora (J. Symb. Comput., 1993)

Parallelization of Gröbner Basis. - Jean-Charles Faugère (PASCO, 1994)

Design of regular nonseparable bidimensional wavelets using Grobner basis techniques. - Jean-Charles Faugère; François Moreau de Saint-Martin; Fabrice Rouillier (IEEE Trans. Signal Process., 1998)

Symmetry Theorems for the Newtonian 4- and 5-body Problems with Equal Masses. - Jean-Charles Faugère; Ilias S. Kotsireas (CASC, 1999)

Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases. - Jean-Charles Faugère; Antoine Joux (CRYPTO, 2003)

Changing the ordering of Gröbner bases with LLL: case of two variables. - Abdolali Basiri; Jean-Charles Faugère (ISSAC, 2003)

The membrane inclusions curvature equations. - Jean-Charles Faugère; Milena Hering; Jeff Phan (Adv. Appl. Math., 2003)

Implementing the Arithmetic of C3, 4Curves. - Abdolali Basiri; Andreas Enge; Jean-Charles Faugère; Nicolas Gürel (ANTS, 2004)

Comparison Between XL and Gröbner Basis Algorithms. - Gwénolé Ars; Jean-Charles Faugère; Hideki Imai; Mitsuru Kawazoe; Makoto Sugita (ASIACRYPT, 2004)

The arithmetic of Jacobian groups of superelliptic cubics. - Abdolali Basiri; Andreas Enge; Jean-Charles Faugère; Nicolas Gürel (Math. Comput., 2005)

Cryptanalysis of 2R- Schemes. - Jean-Charles Faugère; Ludovic Perret (CRYPTO, 2006)

Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. - Jean-Charles Faugère; Ludovic Perret (EUROCRYPT, 2006)

The implicit structure of ridges of a smooth parametric surface. - Frédéric Cazals; Jean-Charles Faugère; Marc Pouget; Fabrice Rouillier (Comput. Aided Geom. Des., 2006)

On formulas for decoding binary cyclic codes. - Daniel Augot; Magali Bardet; Jean-Charles Faugère (ISIT, 2007)

Cryptanalysis of the TRMS Signature Scheme of PKC'05. - Luk Bettale; Jean-Charles Faugère; Ludovic Perret (AFRICACRYPT, 2008)

Security Analysis of Multivariate Polynomials for Hashing. - Luk Bettale; Jean-Charles Faugère; Ludovic Perret (Inscrypt, 2008)

Cryptanalysis of MinRank. - Jean-Charles Faugère; Françoise Levy-dit-Vehel; Ludovic Perret (CRYPTO, 2008)

Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. - Jean-Charles Faugère; Guillaume Moroz; Fabrice Rouillier; Mohab Safey El Din (ISSAC, 2008)

Algebraic Cryptanalysis of Curry and Flurry using Correlated Messages. - Jean-Charles Faugère; Ludovic Perret (IACR Cryptol. ePrint Arch., 2008)

Solving Structured Polynomial Systems and Applications to Cryptology. - Jean-Charles Faugère (CASC, 2009)

Interactions between computer algebra (Gröbner bases) and cryptology. - Jean-Charles Faugère (ISSAC, 2009)

High order derivatives and decomposition of multivariate polynomials. - Jean-Charles Faugère; Ludovic Perret (ISSAC, 2009)

Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. - Jean-Charles Faugère; Sajjad Rahmany (ISSAC, 2009)

Computing modular correspondences for abelian varieties - Jean-Charles Faugère; David Lubicz; Damien Robert 001 (CoRR, 2009)

Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem. - Charles Bouillaguet; Jean-Charles Faugère; Pierre-Alain Fouque; Ludovic Perret (IACR Cryptol. ePrint Arch., 2009)

On the Security of UOV. - Jean-Charles Faugère; Ludovic Perret (IACR Cryptol. ePrint Arch., 2009)

Hybrid approach for solving multivariate systems over finite fields. - Luk Bettale; Jean-Charles Faugère; Ludovic Perret (J. Math. Cryptol., 2009)

Algebraic attack on NTRU using Witt vectors and Gröbner bases. - Gerald Bourgeois; Jean-Charles Faugère (J. Math. Cryptol., 2009)

On the decoding of binary cyclic codes with the Newton identities. - Daniel Augot; Magali Bardet; Jean-Charles Faugère (J. Symb. Comput., 2009)

Foreword. - Daniel Augot; Jean-Charles Faugère; Ludovic Perret (J. Symb. Comput., 2009)

An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography. - Jean-Charles Faugère; Ludovic Perret (J. Symb. Comput., 2009)

Foreword. - Jean-Charles Faugère; Fabrice Rouillier (J. Symb. Comput., 2009)

Analysis of the MQQ Public Key Cryptosystem. - Jean-Charles Faugère; Rune Steinsmo Ødegård; Ludovic Perret; Danilo Gligoroski (CANS, 2010)

Parallel Gaussian elimination for Gröbner bases computations in finite fields. - Jean-Charles Faugère; Sylvain Lachartre (PASCO, 2010)

Algebraic Precomputations in Differential and Integral Cryptanalysis. - Martin R. Albrecht; Carlos Cid; Thomas Dullien; Jean-Charles Faugère; Ludovic Perret (Inscrypt, 2010)

Algebraic Cryptanalysis of McEliece Variants with Compact Keys. - Jean-Charles Faugère; Ayoub Otmani; Ludovic Perret; Jean-Pierre Tillich (EUROCRYPT, 2010)

FGb: A Library for Computing Gröbner Bases. - Jean-Charles Faugère (ICMS, 2010)

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 (ISSAC, 2010)

Decomposition of generic multivariate polynomials. - Jean-Charles Faugère; Joachim von zur Gathen; Ludovic Perret (ISSAC, 2010)

Cryptanalysis of the Hidden Matrix Cryptosystem. - Jean-Charles Faugère; Antoine Joux; Ludovic Perret; Joana Treger (LATINCRYPT, 2010)

Implicit Factoring with Shared Most Significant and Middle Bits. - Jean-Charles Faugère; Raphaël Marinier; Guénaël Renault (Public Key Cryptography, 2010)

Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem. - Jean-Charles Faugère; Pierre-Jean Spaenlehauer (Public Key Cryptography, 2010)

Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (CoRR, 2010)

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 (IACR Cryptol. ePrint Arch., 2010)

The Digital Signature Scheme MQQ-SIG. - Danilo Gligoroski; Rune Steinsmo Ødegård; Rune Erlend Jensen; Ludovic Perret; Jean-Charles Faugère; Svein Johan Knapskog; Smile Markovski (IACR Cryptol. ePrint Arch., 2010)

Foreword. - Jean-Charles Faugère; Ludovic Perret (Math. Comput. Sci., 2010)

MQQ-SIG - An Ultra-Fast and Provably CMA Resistant Digital Signature Scheme. - Danilo Gligoroski; Rune Steinsmo Ødegård; Rune Erlend Jensen; Ludovic Perret; Jean-Charles Faugère; Svein Johan Knapskog; Smile Markovski (INTRUST, 2011)

Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices. - Jean-Charles Faugère; Chenqi Mou (ISSAC, 2011)

Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants. - Luk Bettale; Jean-Charles Faugère; Ludovic Perret (Public Key Cryptography, 2011)

On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms. - Martin R. Albrecht; Carlos Cid; Jean-Charles Faugère; Ludovic Perret (IACR Cryptol. ePrint Arch., 2011)

Polly Cracker, Revisited. - Martin R. Albrecht; Pooya Farshim; Jean-Charles Faugère; Ludovic Perret (IACR Cryptol. ePrint Arch., 2011)

New Subexponential Algorithms for Factoring in SL(2, fq). - Jean-Charles Faugère; Ludovic Perret; Christophe Petit 001; Guénaël Renault (IACR Cryptol. ePrint Arch., 2011)

Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (J. Symb. Comput., 2011)

Artificial discontinuities of single-parametric Gröbner bases. - Jean-Charles Faugère; Ye Liang 001 (J. Symb. Comput., 2011)

Pivoting in Extended Rings for Computing Approximate Gröbner Bases. - Jean-Charles Faugère; Ye Liang 001 (Math. Comput. Sci., 2011)

Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields. - Jean-Charles Faugère; Ludovic Perret; Christophe Petit 001; Guénaël Renault (EUROCRYPT, 2012)

Solving polynomial systems over finite fields: improved analysis of the hybrid approach. - Luk Bettale; Jean-Charles Faugère; Ludovic Perret (ISSAC, 2012)

Critical points and Gröbner bases: the unmixed case. - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (ISSAC, 2012)

Solving polynomial systems globally invariant under an action of the symmetric group and application to the equilibria of N vortices in the plane. - Jean-Charles Faugère; Jules Svartz (ISSAC, 2012)

Attacking (EC)DSA Given Only an Implicit Hint. - Jean-Charles Faugère; Christopher Goyet; Guénaël Renault (Selected Areas in Cryptography, 2012)

Fast change of ordering with exponent ω. - Jean-Charles Faugère; Pierrick Gaudry; Louise Huot; Guénaël Renault (ACM Commun. Comput. Algebra, 2012)

On enumeration of polynomial equivalence classes and their application to MPKC. - Dongdai Lin; Jean-Charles Faugère; Ludovic Perret; Tianze Wang (Finite Fields Their Appl., 2012)

Analysis of the algebraic side channel attack. - Claude Carlet; Jean-Charles Faugère; Christopher Goyet; Guénaël Renault (J. Cryptogr. Eng., 2012)

On the relation between the MXL family of algorithms and Gröbner basis algorithms. - Martin R. Albrecht; Carlos Cid; Jean-Charles Faugère; Ludovic Perret (J. Symb. Comput., 2012)

On the complexity of computing gröbner bases for quasi-homogeneous systems. - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (ISSAC, 2013)

Gröbner bases of ideals invariant under a commutative group: the non-modular case. - Jean-Charles Faugère; Jules Svartz (ISSAC, 2013)

Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials. - Jérémy Berthomieu; Jean-Charles Faugère; Ludovic Perret (CoRR, 2013)

Computing Gröbner bases for quasi-homogeneous systems - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (CoRR, 2013)

Polynomial Systems Solving by Fast Linear Algebra - Jean-Charles Faugère; Pierrick Gaudry; Louise Huot; Guénaël Renault (CoRR, 2013)

Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. - Luk Bettale; Jean-Charles Faugère; Ludovic Perret (Des. Codes Cryptogr., 2013)

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions. - Martin R. Albrecht; Jean-Charles Faugère; Robert Fitzpatrick; Ludovic Perret (IACR Cryptol. ePrint Arch., 2013)

A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search. - Jean-Sébastien Coron; Jean-Charles Faugère; Guénaël Renault; Rina Zeitoun (IACR Cryptol. ePrint Arch., 2013)

On the complexity of solving quadratic Boolean systems. - Magali Bardet; Jean-Charles Faugère; Bruno Salvy; Pierre-Jean Spaenlehauer (J. Complex., 2013)

On the complexity of the generalized MinRank problem. - Jean-Charles Faugère; Mohab Safey El Din; Pierre-Jean Spaenlehauer (J. Symb. Comput., 2013)

A Distinguisher for High-Rate McEliece Cryptosystems. - Jean-Charles Faugère; Valérie Gauthier-Umaña; Ayoub Otmani; Ludovic Perret; Jean-Pierre Tillich (IEEE Trans. Inf. Theory, 2013)

Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form. - Jean-Charles Faugère; Ludovic Perret; Frédéric de Portzamparc (ASIACRYPT (1), 2014)

Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus. - Jean-Charles Faugère; Louise Huot; Antoine Joux; Guénaël Renault; Vanessa Vitse (EUROCRYPT, 2014)

Structural weakness of compact variants of the McEliece cryptosystem. - Jean-Charles Faugère; Ayoub Otmani; Ludovic Perret; Frédéric de Portzamparc; Jean-Pierre Tillich (ISIT, 2014)

Sub-cubic change of ordering for Gröbner basis: a probabilistic approach. - Jean-Charles Faugère; Pierrick Gaudry; Louise Huot; Guénaël Renault (ISSAC, 2014)

Sparse Gröbner bases: the unmixed case. - Jean-Charles Faugère; Pierre-Jean Spaenlehauer; Jules Svartz (ISSAC, 2014)

Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions. - Martin R. Albrecht; Jean-Charles Faugère; Robert Fitzpatrick; Ludovic Perret; Yosuke Todo; Keita Xagawa (Public Key Cryptography, 2014)

On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems. - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (CoRR, 2014)

Lazy Modulus Switching for the BKW Algorithm on LWE. - Martin R. Albrecht; Jean-Charles Faugère; Robert Fitzpatrick; Ludovic Perret (IACR Cryptol. ePrint Arch., 2014)

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. - Jingguo Bi; Jean-Sébastien Coron; Jean-Charles Faugère; Phong Q. Nguyen; Guénaël Renault; Rina Zeitoun (IACR Cryptol. ePrint Arch., 2014)

A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems. - Jean-Charles Faugère; Danilo Gligoroski; Ludovic Perret; Simona Samardjiska; Enrico Thomae (IACR Cryptol. ePrint Arch., 2014)

Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. - Jean-Charles Faugère; Pierrick Gaudry; Louise Huot; Guénaël Renault (J. Cryptol., 2014)

Mathematical and computer algebra techniques in cryptology. - Jean-Charles Faugère; Domingo Gómez-Pérez; Jaime Gutierrez 001; Ludovic Perret (J. Symb. Comput., 2014)

Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case. - Marta Conde Pena; Jean-Charles Faugère; Ludovic Perret (Public Key Cryptography, 2015)

Algebraic algorithms for LWE problems. - Martin R. Albrecht; Carlos Cid; Jean-Charles Faugère; Robert Fitzpatrick; Ludovic Perret (ACM Commun. Comput. Algebra, 2015)

A survey on signature-based Gröbner basis computations. - Christian Eder; Jean-Charles Faugère (ACM Commun. Comput. Algebra, 2015)

Sparse Gröbner bases: algorithms and complexity. - Jean-Charles Faugère; Pierre-Jean Spaenlehauer; Jules Svartz (ACM Commun. Comput. Algebra, 2015)

On the complexity of the BKW algorithm on LWE. - Martin R. Albrecht; Carlos Cid; Jean-Charles Faugère; Robert Fitzpatrick; Ludovic Perret (Des. Codes Cryptogr., 2015)

Factoring N=pr qs for Large r and s. - Jean-Sébastien Coron; Jean-Charles Faugère; Guénaël Renault; Rina Zeitoun (IACR Cryptol. ePrint Arch., 2015)

Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case. - Jérémy Berthomieu; Jean-Charles Faugère; Ludovic Perret (J. Complex., 2015)

On the complexity of the F5 Gröbner basis algorithm. - Magali Bardet; Jean-Charles Faugère; Bruno Salvy (J. Symb. Comput., 2015)

Factoring N=p^rq^s for Large r and s. - Jean-Sébastien Coron; Jean-Charles Faugère; Guénaël Renault; Rina Zeitoun (CT-RSA, 2016)

A Superfast Randomized Algorithm to Decompose Binary Forms. - Matías R. Bender; Jean-Charles Faugère; Ludovic Perret; Elias P. Tsigaridas (ISSAC, 2016)

Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra. - Jérémy Berthomieu; Jean-Charles Faugère (ISSAC, 2016)

Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery. - Bernard Bonnard; Jean-Charles Faugère; Alain Jacquemard; Mohab Safey El Din; Thibaut Verron (ISSAC, 2016)

GBLA: Gröbner Basis Linear Algebra Package. - Brice Boyer; Christian Eder; Jean-Charles Faugère; Sylvian Lachartre; Fayssal Martani (ISSAC, 2016)

Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. - Jean-Charles Faugère; Pierre-Jean Spaenlehauer; Jules Svartz (ISSAC, 2016)

The Quantum-Safe Revolution. - Jean-Charles Faugère; Ludovic Perret (WISA, 2016)

Polly Cracker, revisited. - Martin R. Albrecht; Jean-Charles Faugère; Pooya Farshim; Gottfried Herold; Ludovic Perret (Des. Codes Cryptogr., 2016)

Structural cryptanalysis of McEliece schemes with compact keys. - Jean-Charles Faugère; Ayoub Otmani; Ludovic Perret; Frédéric de Portzamparc; Jean-Pierre Tillich (Des. Codes Cryptogr., 2016)

On the complexity of computing Gröbner bases for weighted homogeneous systems. - Jean-Charles Faugère; Mohab Safey El Din; Thibaut Verron (J. Symb. Comput., 2016)

Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups. - Jean-Charles Faugère; Ayoub Otmani; Ludovic Perret; Frédéric de Portzamparc; Jean-Pierre Tillich (IEEE Trans. Inf. Theory, 2016)

In-depth comparison of the Berlekamp - Massey - Sakata and the Scalar-FGLM algorithms: the non adaptive variants. - Jérémy Berthomieu; Jean-Charles Faugère (CoRR, 2017)

Fast Quantum Algorithm for Solving Multivariate Quadratic Equations. - Jean-Charles Faugère; Kelsey Horan; Delaram Kahrobaei; Marc Kaplan; Elham Kashefi; Ludovic Perret (IACR Cryptol. ePrint Arch., 2017)

Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences. - Jérémy Berthomieu; Brice Boyer; Jean-Charles Faugère (J. Symb. Comput., 2017)

A survey on signature-based algorithms for computing Gröbner bases. - Christian Eder; Jean-Charles Faugère (J. Symb. Comput., 2017)

Sparse FGLM algorithms. - Jean-Charles Faugère; Chenqi Mou (J. Symb. Comput., 2017)

Combinatorial Digital Signature Scheme. - Eliane Koussa; Jean-Charles Faugère; Gilles Macario-Rat; Jacques Patarin; Ludovic Perret (BDCSIntell, 2018)

Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors. - Matías R. Bender; Jean-Charles Faugère; Angelos Mantzaflaris; Elias P. Tsigaridas (ISSAC, 2018)

Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case. - Matías R. Bender; Jean-Charles Faugère; Elias P. Tsigaridas (ISSAC, 2018)

A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations. - Jérémy Berthomieu; Jean-Charles Faugère (ISSAC, 2018)

Towards Mixed Gr{ö}bner Basis Algorithms: the Multihomogeneous and Sparse Case. - Matías R. Bender; Jean-Charles Faugère; Elias P. Tsigaridas (CoRR, 2018)

The point decomposition problem over hyperelliptic curves - Toward efficient computation of discrete logarithms in even characteristic. - Jean-Charles Faugère; Alexandre Wallet (Des. Codes Cryptogr., 2018)

PKP-Based Signature Scheme. - Jean-Charles Faugère; Eliane Koussa; Gilles Macario-Rat; Jacques Patarin; Ludovic Perret (IACR Cryptol. ePrint Arch., 2018)

PKP-Based Signature Scheme. - Ward Beullens; Jean-Charles Faugère; Eliane Koussa; Gilles Macario-Rat; Jacques Patarin; Ludovic Perret (INDOCRYPT, 2019)

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems. - Matías R. Bender; Jean-Charles Faugère; Elias P. Tsigaridas (ISSAC, 2019)

Gr{ö}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems. - Matías R. Bender; Jean-Charles Faugère; Elias P. Tsigaridas (CoRR, 2019)

Non-quantum cryptanalysis of the noisy version of Aaronson-Christiano's quantum money scheme. - Marta Conde Pena; Raúl Durán Díaz; Jean-Charles Faugère; Luis Hernández Encinas; Ludovic Perret (IET Inf. Secur., 2019)

Software Toolkit for HFE-based Multivariate Schemes. - Jean-Charles Faugère; Ludovic Perret; Jocelyn Ryckeghem (IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019)

In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: The adaptive variants. - Jérémy Berthomieu; Jean-Charles Faugère (J. Symb. Comput., 2020)

Cryptanalysis of the extension field cancellation cryptosystem. - Olive Chakraborty; Jean-Charles Faugère; Ludovic Perret (Des. Codes Cryptogr., 2021)

A nearly optimal algorithm to decompose binary forms. - Matías R. Bender; Jean-Charles Faugère; Ludovic Perret; Elias P. Tsigaridas (J. Symb. Comput., 2021)

Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems. - Matías R. Bender; Jean-Charles Faugère; Angelos Mantzaflaris; Elias P. Tsigaridas (SIAM J. Appl. Algebra Geom., 2021)

A New Perturbation for Multivariate Public Key Schemes such as HFE and UOV. - Jean-Charles Faugère; Gilles Macario-Rat; Jacques Patarin; Ludovic Perret (IACR Cryptol. ePrint Arch., 2022)

Polynomial-division-based algorithms for computing linear recurrence relations. - Jérémy Berthomieu; Jean-Charles Faugère (J. Symb. Comput., 2022)

Rectangular Attack on VOX. - Gilles Macario-Rat; Jacques Patarin; Benoit Cogliati; Jean-Charles Faugère; Pierre-Alain Fouque; Louis Goubin; Robin Larrieu; Brice Minaud (IACR Cryptol. ePrint Arch., 2023)

Computing critical points for invariant algebraic systems. - Jean-Charles Faugère; George Labahn; Mohab Safey El Din; Éric Schost; Thi Xuan Vu (J. Symb. Comput., 2023)