default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Charles Faugère
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j47]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. J. Symb. Comput. 116: 365-399 (2023)- [i56]Gilles Macario-Rat, Jacques Patarin, Benoit Cogliati, Jean-Charles Faugère, Pierre-Alain Fouque, Louis Goubin, Robin Larrieu, Brice Minaud:
Rectangular Attack on VOX. IACR Cryptol. ePrint Arch. 2023: 1822 (2023) - 2022
- [j46]Jérémy Berthomieu
, Jean-Charles Faugère:
Polynomial-division-based algorithms for computing linear recurrence relations. J. Symb. Comput. 109: 1-30 (2022) - [i55]Jean-Charles Faugère, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
A New Perturbation for Multivariate Public Key Schemes such as HFE and UOV. IACR Cryptol. ePrint Arch. 2022: 203 (2022) - 2021
- [j45]Olive Chakraborty, Jean-Charles Faugère, Ludovic Perret:
Cryptanalysis of the extension field cancellation cryptosystem. Des. Codes Cryptogr. 89(6): 1335-1364 (2021) - [j44]Matías R. Bender, Jean-Charles Faugère, Ludovic Perret, Elias P. Tsigaridas:
A nearly optimal algorithm to decompose binary forms. J. Symb. Comput. 105: 71-96 (2021) - [j43]Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas:
Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems. SIAM J. Appl. Algebra Geom. 5(4): 589-619 (2021) - [i54]Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas:
Koszul-type determinantal formulas for families of mixed multilinear systems. CoRR abs/2105.13188 (2021) - [i53]Jérémy Berthomieu, Jean-Charles Faugère:
Polynomial-Division-Based Algorithms for Computing Linear Recurrence Relations. CoRR abs/2107.02582 (2021) - 2020
- [j42]Jérémy Berthomieu, Jean-Charles Faugère:
In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: The adaptive variants. J. Symb. Comput. 101: 270-303 (2020) - [i52]Jean-Charles Faugère, George Labahn, Mohab Safey El Din, Éric Schost, Thi Xuan Vu:
Computing critical points for invariant algebraic systems. CoRR abs/2009.00847 (2020)
2010 – 2019
- 2019
- [j41]Marta Conde Pena, Raúl Durán Díaz, Jean-Charles Faugère, Luis Hernández Encinas, Ludovic Perret:
Non-quantum cryptanalysis of the noisy version of Aaronson-Christiano's quantum money scheme. IET Inf. Secur. 13(4): 362-366 (2019) - [j40]Jean-Charles Faugère, Ludovic Perret, Jocelyn Ryckeghem:
Software Toolkit for HFE-based Multivariate Schemes. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(3): 257-304 (2019) - [c65]Ward Beullens, Jean-Charles Faugère, Eliane Koussa, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
PKP-Based Signature Scheme. INDOCRYPT 2019: 3-22 - [c64]Matías R. Bender, Jean-Charles Faugère, Elias P. Tsigaridas:
Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems. ISSAC 2019: 42-49 - [i51]Matías R. Bender, Jean-Charles Faugère, Elias P. Tsigaridas:
Gr{ö}bner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems. CoRR abs/1902.00208 (2019) - 2018
- [j39]Jean-Charles Faugère, Alexandre Wallet:
The point decomposition problem over hyperelliptic curves - Toward efficient computation of discrete logarithms in even characteristic. Des. Codes Cryptogr. 86(10): 2279-2314 (2018) - [c63]Eliane Koussa, Jean-Charles Faugère, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
Combinatorial Digital Signature Scheme. BDCSIntell 2018: 48-54 - [c62]Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas:
Bilinear Systems with Two Supports: Koszul Resultant Matrices, Eigenvalues, and Eigenvectors. ISSAC 2018: 63-70 - [c61]Matías R. Bender, Jean-Charles Faugère, Elias P. Tsigaridas:
Towards Mixed Gröbner Basis Algorithms: the Multihomogeneous and Sparse Case. ISSAC 2018: 71-78 - [c60]Jérémy Berthomieu, Jean-Charles Faugère:
A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations. ISSAC 2018: 79-86 - [i50]Matías R. Bender, Jean-Charles Faugère, Elias P. Tsigaridas:
Towards Mixed Gr{ö}bner Basis Algorithms: the Multihomogeneous and Sparse Case. CoRR abs/1805.03577 (2018) - [i49]Matías R. Bender, Jean-Charles Faugère, Angelos Mantzaflaris, Elias P. Tsigaridas:
Bilinear systems with two supports: Koszul resultant matrices, eigenvalues, and eigenvectors. CoRR abs/1805.05060 (2018) - [i48]Jérémy Berthomieu, Jean-Charles Faugère:
In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants. CoRR abs/1806.00978 (2018) - [i47]Matías R. Bender, Jean-Charles Faugère, Ludovic Perret, Elias P. Tsigaridas:
A nearly optimal algorithm to decompose binary forms. CoRR abs/1810.12588 (2018) - [i46]Jean-Charles Faugère, Eliane Koussa, Gilles Macario-Rat, Jacques Patarin, Ludovic Perret:
PKP-Based Signature Scheme. IACR Cryptol. ePrint Arch. 2018: 714 (2018) - 2017
- [j38]Jean-Charles Faugère, Chenqi Mou:
Sparse FGLM algorithms. J. Symb. Comput. 80: 538-569 (2017) - [j37]Christian Eder, Jean-Charles Faugère:
A survey on signature-based algorithms for computing Gröbner bases. J. Symb. Comput. 80: 719-784 (2017) - [j36]Jérémy Berthomieu, Brice Boyer, Jean-Charles Faugère:
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences. J. Symb. Comput. 83: 36-67 (2017) - [e1]Jean-Charles Faugère, Michael B. Monagan, Hans-Wolfgang Loidl:
Proceedings of the International Workshop on Parallel Symbolic Computation, PASCO@ISSAC 2017, Kaiserslautern, Germany, July 23-24, 2017. ACM 2017, ISBN 978-1-4503-5288-8 [contents] - [i45]Jérémy Berthomieu, Jean-Charles Faugère:
In-depth comparison of the Berlekamp - Massey - Sakata and the Scalar-FGLM algorithms: the non adaptive variants. CoRR abs/1709.07168 (2017) - [i44]Jean-Charles Faugère, Kelsey Horan, Delaram Kahrobaei, Marc Kaplan, Elham Kashefi, Ludovic Perret:
Fast Quantum Algorithm for Solving Multivariate Quadratic Equations. CoRR abs/1712.07211 (2017) - [i43]Jean-Charles Faugère, Kelsey Horan, Delaram Kahrobaei, Marc Kaplan, Elham Kashefi, Ludovic Perret:
Fast Quantum Algorithm for Solving Multivariate Quadratic Equations. IACR Cryptol. ePrint Arch. 2017: 1236 (2017) - 2016
- [j35]Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Structural cryptanalysis of McEliece schemes with compact keys. Des. Codes Cryptogr. 79(1): 87-112 (2016) - [j34]Martin R. Albrecht, Jean-Charles Faugère, Pooya Farshim, Gottfried Herold, Ludovic Perret:
Polly Cracker, revisited. Des. Codes Cryptogr. 79(2): 261-302 (2016) - [j33]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
On the complexity of computing Gröbner bases for weighted homogeneous systems. J. Symb. Comput. 76: 107-141 (2016) - [j32]Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups. IEEE Trans. Inf. Theory 62(1): 184-198 (2016) - [c59]Jean-Sébastien Coron, Jean-Charles Faugère, Guénaël Renault, Rina Zeitoun:
Factoring N=p^rq^s for Large r and s. CT-RSA 2016: 448-464 - [c58]Matías R. Bender, Jean-Charles Faugère, Ludovic Perret, Elias P. Tsigaridas:
A Superfast Randomized Algorithm to Decompose Binary Forms. ISSAC 2016: 79-86 - [c57]Jérémy Berthomieu, Jean-Charles Faugère:
Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra. ISSAC 2016: 95-102 - [c56]Bernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron:
Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery. ISSAC 2016: 103-110 - [c55]Brice Boyer, Christian Eder, Jean-Charles Faugère, Sylvian Lachartre, Fayssal Martani:
GBLA: Gröbner Basis Linear Algebra Package. ISSAC 2016: 135-142 - [c54]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. ISSAC 2016: 223-230 - [c53]Jean-Charles Faugère, Ludovic Perret:
The Quantum-Safe Revolution. WISA 2016: 258-266 - [i42]Brice Boyer, Christian Eder, Jean-Charles Faugère, Sylvian Lachartre, Fayssal Martani:
GBLA - Gröbner Basis Linear Algebra Package. CoRR abs/1602.06097 (2016) - [i41]Bernard Bonnard, Jean-Charles Faugère, Alain Jacquemard, Mohab Safey El Din, Thibaut Verron:
Determinantal sets, singularities and application to optimal control in medical imagery. CoRR abs/1605.00887 (2016) - [i40]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems. CoRR abs/1605.05889 (2016) - 2015
- [j31]Christian Eder, Jean-Charles Faugère:
A survey on signature-based Gröbner basis computations. ACM Commun. Comput. Algebra 49(2): 61 (2015) - [j30]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Sparse Gröbner bases: algorithms and complexity. ACM Commun. Comput. Algebra 49(2): 61-62 (2015) - [j29]Martin R. Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret:
Algebraic algorithms for LWE problems. ACM Commun. Comput. Algebra 49(2): 62 (2015) - [j28]Martin R. Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret:
On the complexity of the BKW algorithm on LWE. Des. Codes Cryptogr. 74(2): 325-354 (2015) - [j27]Jérémy Berthomieu, Jean-Charles Faugère, Ludovic Perret:
Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case. J. Complex. 31(4): 590-616 (2015) - [j26]Magali Bardet, Jean-Charles Faugère, Bruno Salvy:
On the complexity of the F5 Gröbner basis algorithm. J. Symb. Comput. 70: 49-70 (2015) - [c52]Jérémy Berthomieu, Brice Boyer, Jean-Charles Faugère:
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences. ISSAC 2015: 61-68 - [c51]Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Simona Samardjiska, Enrico Thomae:
A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems. Public Key Cryptography 2015: 150-174 - [c50]Marta Conde Pena, Jean-Charles Faugère, Ludovic Perret:
Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case. Public Key Cryptography 2015: 194-213 - [i39]Jean-Sébastien Coron, Jean-Charles Faugère, Guénaël Renault, Rina Zeitoun:
Factoring N=pr qs for Large r and s. IACR Cryptol. ePrint Arch. 2015: 71 (2015) - 2014
- [j25]Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault:
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. J. Cryptol. 27(4): 595-635 (2014) - [j24]Jean-Charles Faugère, Domingo Gómez-Pérez, Jaime Gutierrez, Ludovic Perret:
Mathematical and computer algebra techniques in cryptology. J. Symb. Comput. 64: 1-2 (2014) - [c49]Jean-Charles Faugère, Ludovic Perret, Frédéric de Portzamparc:
Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form. ASIACRYPT (1) 2014: 21-41 - [c48]Jean-Charles Faugère, Louise Huot, Antoine Joux, Guénaël Renault, Vanessa Vitse:
Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus. EUROCRYPT 2014: 40-57 - [c47]Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Structural weakness of compact variants of the McEliece cryptosystem. ISIT 2014: 1717-1721 - [c46]Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault:
Sub-cubic change of ordering for Gröbner basis: a probabilistic approach. ISSAC 2014: 170-177 - [c45]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Sparse Gröbner bases: the unmixed case. ISSAC 2014: 178-185 - [c44]Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun:
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. Public Key Cryptography 2014: 185-202 - [c43]Martin R. Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret:
Lazy Modulus Switching for the BKW Algorithm on LWE. Public Key Cryptography 2014: 429-445 - [c42]Martin R. Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret, Yosuke Todo, Keita Xagawa:
Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions. Public Key Cryptography 2014: 446-464 - [i38]Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz:
Sparse Gröbner Bases: the Unmixed Case. CoRR abs/1402.7205 (2014) - [i37]Christian Eder, Jean-Charles Faugère:
A survey on signature-based Gröbner basis computations. CoRR abs/1404.1774 (2014) - [i36]Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups. CoRR abs/1405.5101 (2014) - [i35]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
On the complexity of computing Gr{ö}bner bases for weighted homogeneous systems. CoRR abs/1412.7547 (2014) - [i34]Martin R. Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret:
Lazy Modulus Switching for the BKW Algorithm on LWE. IACR Cryptol. ePrint Arch. 2014: 19 (2014) - [i33]Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Structural Cryptanalysis of McEliece Schemes with Compact Keys. IACR Cryptol. ePrint Arch. 2014: 210 (2014) - [i32]Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Frédéric de Portzamparc, Jean-Pierre Tillich:
Folding Alternant and Goppa Codes with Non-Trivial Automorphism Groups. IACR Cryptol. ePrint Arch. 2014: 353 (2014) - [i31]Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun:
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. IACR Cryptol. ePrint Arch. 2014: 437 (2014) - [i30]Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Simona Samardjiska, Enrico Thomae:
A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems. IACR Cryptol. ePrint Arch. 2014: 811 (2014) - [i29]Martin R. Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret:
Algebraic Algorithms for LWE Problems. IACR Cryptol. ePrint Arch. 2014: 1018 (2014) - 2013
- [j23]Luk Bettale, Jean-Charles Faugère, Ludovic Perret:
Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic. Des. Codes Cryptogr. 69(1): 1-52 (2013) - [j22]Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the complexity of solving quadratic Boolean systems. J. Complex. 29(1): 53-75 (2013) - [j21]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
On the complexity of the generalized MinRank problem. J. Symb. Comput. 55: 30-58 (2013) - [j20]Jean-Charles Faugère, Valérie Gauthier-Umaña, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich:
A Distinguisher for High-Rate McEliece Cryptosystems. IEEE Trans. Inf. Theory 59(10): 6830-6844 (2013) - [c41]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
On the complexity of computing gröbner bases for quasi-homogeneous systems. ISSAC 2013: 189-196 - [c40]Jean-Charles Faugère, Jules Svartz:
Gröbner bases of ideals invariant under a commutative group: the non-modular case. ISSAC 2013: 347-354 - [i28]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron:
Computing Gröbner bases for quasi-homogeneous systems. CoRR abs/1301.5612 (2013) - [i27]Jean-Charles Faugère, Chenqi Mou:
Sparse FGLM algorithms. CoRR abs/1304.1238 (2013) - [i26]Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault:
Polynomial Systems Solving by Fast Linear Algebra. CoRR abs/1304.6039 (2013) - [i25]Jérémy Berthomieu, Jean-Charles Faugère, Ludovic Perret:
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials. CoRR abs/1307.4974 (2013) - [i24]Magali Bardet, Jean-Charles Faugère, Bruno Salvy:
On the Complexity of the F5 Gröbner basis Algorithm. CoRR abs/1312.1655 (2013) - [i23]Martin R. Albrecht, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret:
Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions. IACR Cryptol. ePrint Arch. 2013: 470 (2013) - [i22]Jean-Sébastien Coron, Jean-Charles Faugère, Guénaël Renault, Rina Zeitoun:
A Variant of Coppersmith's Algorithm with Improved Complexity and Efficient Exhaustive Search. IACR Cryptol. ePrint Arch. 2013: 483 (2013) - 2012
- [j19]Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault:
Fast change of ordering with exponent ω. ACM Commun. Comput. Algebra 46(3/4): 92-93 (2012) - [j18]Dongdai Lin, Jean-Charles Faugère, Ludovic Perret, Tianze Wang:
On enumeration of polynomial equivalence classes and their application to MPKC. Finite Fields Their Appl. 18(2): 283-302 (2012) - [j17]Claude Carlet, Jean-Charles Faugère, Christopher Goyet, Guénaël Renault:
Analysis of the algebraic side channel attack. J. Cryptogr. Eng. 2(1): 45-62 (2012) - [j16]Martin R. Albrecht, Carlos Cid, Jean-Charles Faugère, Ludovic Perret:
On the relation between the MXL family of algorithms and Gröbner basis algorithms. J. Symb. Comput. 47(8): 926-941 (2012) - [c39]Jean-Charles Faugère, Ludovic Perret, Christophe Petit, Guénaël Renault:
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields. EUROCRYPT 2012: 27-44 - [c38]Luk Bettale, Jean-Charles Faugère, Ludovic Perret:
Solving polynomial systems over finite fields: improved analysis of the hybrid approach. ISSAC 2012: 67-74 - [c37]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical points and Gröbner bases: the unmixed case. ISSAC 2012: 162-169 - [c36]Jean-Charles Faugère, Jules 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 2012: 170-178 - [c35]Jean-Charles Faugère, Christopher Goyet, Guénaël Renault:
Attacking (EC)DSA Given Only an Implicit Hint. Selected Areas in Cryptography 2012: 252-274 - [i21]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Critical Points and Gröbner Bases: the Unmixed Case. CoRR abs/1202.0179 (2012) - [i20]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Gottfried Herold, Ludovic Perret:
Polly Cracker, Revisited. Electron. Colloquium Comput. Complex. TR12 (2012) - [i19]Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault:
Using Symmetries in the Index Calculus for Elliptic Curves Discrete Logarithm. IACR Cryptol. ePrint Arch. 2012: 199 (2012) - [i18]Martin R. Albrecht, Carlos Cid, Jean-Charles Faugère, Robert Fitzpatrick, Ludovic Perret:
On the Complexity of the BKW Algorithm on LWE. IACR Cryptol. ePrint Arch. 2012: 636 (2012) - 2011
- [j15]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity. J. Symb. Comput. 46(4): 406-437 (2011) - [j14]Jean-Charles Faugère, Ye Liang:
Artificial discontinuities of single-parametric Gröbner bases. J. Symb. Comput. 46(4): 459-466 (2011) - [j13]Jean-Charles Faugère, Ye Liang:
Pivoting in Extended Rings for Computing Approximate Gröbner Bases. Math. Comput. Sci. 5(2): 179-194 (2011) - [c34]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret:
Polly Cracker, Revisited. ASIACRYPT 2011: 179-196 - [c33]Danilo Gligoroski, Rune Steinsmo Ødegård, Rune Erlend Jensen, Ludovic Perret, Jean-Charles Faugère, Svein Johan Knapskog, Smile Markovski:
MQQ-SIG - An Ultra-Fast and Provably CMA Resistant Digital Signature Scheme. INTRUST 2011: 184-203 - [c32]Jean-Charles Faugère, Chenqi Mou:
Fast algorithm for change of ordering of zero-dimensional Gröbner bases with sparse multiplication matrices. ISSAC 2011: 115-122 - [c31]Jean-Charles Faugère, Valérie Gauthier-Umaña, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich:
A distinguisher for high rate McEliece cryptosystems. ITW 2011: 282-286 - [c30]Luk Bettale, Jean-Charles Faugère, Ludovic Perret:
Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants. Public Key Cryptography 2011: 441-458 - [c29]Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, Ludovic Perret:
Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem. Public Key Cryptography 2011: 473-493 - [i17]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer:
On the Complexity of the Generalized MinRank Problem. CoRR abs/1112.4411 (2011) - [i16]Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer:
On the Complexity of Solving Quadratic Boolean Systems. CoRR abs/1112.6263 (2011) - [i15]Dongdai Lin, Jean-Charles Faugère, Ludovic Perret, Tianze Wang:
On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC. IACR Cryptol. ePrint Arch. 2011: 55 (2011) - [i14]Martin R. Albrecht, Carlos Cid, Jean-Charles Faugère, Ludovic Perret:
On the Relation Between the Mutant Strategy and the Normal Selection Strategy in Gröbner Basis Algorithms. IACR Cryptol. ePrint Arch. 2011: 164 (2011) - [i13]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret:
Polly Cracker, Revisited. IACR Cryptol. ePrint Arch. 2011: 289 (2011) - [i12]Luk Bettale, Jean-Charles Faugère, Ludovic Perret:
Cryptanalysis of HFE, Multi-HFE and Variants for Odd and Even Characteristic. IACR Cryptol. ePrint Arch. 2011: 399 (2011) - [i11]