Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jean-Charles Faugère
2010 – today
- 2013
[j19]Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer: On the complexity of solving quadratic Boolean systems. J. Complexity 29(1): 53-75 (2013)- [j18]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)
- [i24]Jean-Charles Faugère, Mohab Safey El Din, Thibaut Verron: Computing Gröbner bases for quasi-homogeneous systems. CoRR abs/1301.5612 (2013)
- [i23]
- [i22]Jean-Charles Faugère, Pierrick Gaudry, Louise Huot, Guénaël Renault: Polynomial Systems Solving by Fast Linear Algebra. CoRR abs/1304.6039 (2013)
- 2012
- [j17]Dongdai Lin, Jean-Charles Faugère, Ludovic Perret, Tianze Wang: On enumeration of polynomial equivalence classes and their application to MPKC. Finite Fields and Their Applications 18(2): 283-302 (2012)
- [j16]Claude Carlet, Jean-Charles Faugère, Christopher Goyet, Guénaël Renault: Analysis of the algebraic side channel attack. J. Cryptographic Engineering 2(1): 45-62 (2012)
- [j15]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)
- [c35]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
- [c34]Luk Bettale, Jean-Charles Faugère, Ludovic Perret: Solving polynomial systems over finite fields: improved analysis of the hybrid approach. ISSAC 2012: 67-74
- [c33]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer: Critical points and Gröbner bases: the unmixed case. ISSAC 2012: 162-169
- [c32]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
- [c31]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. Electronic Colloquium on Computational Complexity (ECCC) 19: 165 (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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 2012: 636 (2012)
- 2011
- [j14]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)
- [j13]Jean-Charles Faugère, Ye Liang: Artificial discontinuities of single-parametric Gröbner bases. J. Symb. Comput. 46(4): 459-466 (2011)
- [j12]Jean-Charles Faugère, Ye Liang: Pivoting in Extended Rings for Computing Approximate Gröbner Bases. Mathematics in Computer Science 5(2): 179-194 (2011)
- [c30]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret: Polly Cracker, Revisited. ASIACRYPT 2011: 179-196
- [c29]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
- [c28]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
- [c27]Luk Bettale, Jean-Charles Faugère, Ludovic Perret: Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants. Public Key Cryptography 2011: 441-458
- [c26]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 Cryptology ePrint Archive 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 Cryptology ePrint Archive 2011: 164 (2011)
- [i13]Martin R. Albrecht, Pooya Farshim, Jean-Charles Faugère, Ludovic Perret: Polly Cracker, Revisited. IACR Cryptology ePrint Archive 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 Cryptology ePrint Archive 2011: 399 (2011)
- [i11]Jean-Charles Faugère, Ludovic Perret, Christophe Petit, Guénaël Renault: New Subexponential Algorithms for Factoring in SL(2, fq). IACR Cryptology ePrint Archive 2011: 598 (2011)
- 2010
- [j11]Jean-Charles Faugère, Ludovic Perret: Foreword. Mathematics in Computer Science 3(2): 127-128 (2010)
- [c25]Jean-Charles Faugère, Rune Steinsmo Ødegård, Ludovic Perret, Danilo Gligoroski: Analysis of the MQQ Public Key Cryptosystem. CANS 2010: 169-183
- [c24]Jean-Charles Faugère, Sylvain Lachartre: Parallel Gaussian elimination for Gröbner bases computations in finite fields. PASCO 2010: 89-97
- [c23]Martin R. Albrecht, Carlos Cid, Thomas Dullien, Jean-Charles Faugère, Ludovic Perret: Algebraic Precomputations in Differential and Integral Cryptanalysis. Inscrypt 2010: 387-403
- [c22]Jean-Charles Faugère, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich: Algebraic Cryptanalysis of McEliece Variants with Compact Keys. EUROCRYPT 2010: 279-298
- [c21]
- [c20]Jean-Charles Faugère, Joachim von zur Gathen, Ludovic Perret: Decomposition of generic multivariate polynomials. ISSAC 2010: 131-137
- [c19]Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer: Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology. ISSAC 2010: 257-264
- [c18]Jean-Charles Faugère, Antoine Joux, Ludovic Perret, Joana Treger: Cryptanalysis of the Hidden Matrix Cryptosystem. LATINCRYPT 2010: 241-254
- [c17]Jean-Charles Faugère, Pierre-Jean Spaenlehauer: Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem. Public Key Cryptography 2010: 35-52
- [c16]Jean-Charles Faugère, Raphaël Marinier, Guénaël Renault: Implicit Factoring with Shared Most Significant and Middle Bits. Public Key Cryptography 2010: 70-87
- [i10]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. CoRR abs/1001.4004 (2010)
- [i9]Danilo Gligoroski, Svein Johan Knapskog, Smile Markovski, Rune Steinsmo Ødegård, Rune Erlend Jensen, Ludovic Perret, Jean-Charles Faugère: The Digital Signature Scheme MQQ-SIG. CoRR abs/1010.3163 (2010)
- [i8]Jean-Charles Faugère, Valérie Gauthier, Ayoub Otmani, Ludovic Perret, Jean-Pierre Tillich: A Distinguisher for High Rate McEliece Cryptosystems. IACR Cryptology ePrint Archive 2010: 331 (2010)
- [i7]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. IACR Cryptology ePrint Archive 2010: 504 (2010)
- [i6]Danilo Gligoroski, Rune Steinsmo Ødegård, Rune Erlend Jensen, Ludovic Perret, Jean-Charles Faugère, Svein Johan Knapskog, Smile Markovski: The Digital Signature Scheme MQQ-SIG. IACR Cryptology ePrint Archive 2010: 527 (2010)
2000 – 2009
- 2009
- [j10]Luk Bettale, Jean-Charles Faugère, Ludovic Perret: Hybrid approach for solving multivariate systems over finite fields. J. Mathematical Cryptology 3(3): 177-197 (2009)
- [j9]Gerald Bourgeois, Jean-Charles Faugère: Algebraic attack on NTRU using Witt vectors and Gröbner bases. J. Mathematical Cryptology 3(3): 205-214 (2009)
- [j8]
- [j7]Daniel Augot, Jean-Charles Faugère, Ludovic Perret: Foreword. J. Symb. Comput. 44(12): 1605-1607 (2009)
- [j6]Daniel Augot, Magali Bardet, Jean-Charles Faugère: On the decoding of binary cyclic codes with the Newton identities. J. Symb. Comput. 44(12): 1608-1625 (2009)
- [j5]Jean-Charles Faugère, Ludovic Perret: An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography. J. Symb. Comput. 44(12): 1676-1689 (2009)
- [c15]Jean-Charles Faugère: Solving Structured Polynomial Systems and Applications to Cryptology. CASC 2009: 79-80
- [c14]Jean-Charles Faugère, Ludovic Perret: Algebraic Cryptanalysis of Curry and Flurry Using Correlated Messages. Inscrypt 2009: 266-277
- [c13]Jean-Charles Faugère, Sajjad Rahmany: Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. ISSAC 2009: 151-158
- [c12]Jean-Charles Faugère, Ludovic Perret: High order derivatives and decomposition of multivariate polynomials. ISSAC 2009: 207-214
- [c11]Jean-Charles Faugère: Interactions between computer algebra (Gröbner bases) and cryptology. ISSAC 2009: 383-384
- [i5]Jean-Charles Faugère, David Lubicz, Damien Robert: Computing modular correspondences for abelian varieties. CoRR abs/0910.4668 (2009)
- [i4]Jean-Charles Faugère, Ludovic Perret: On the Security of UOV. IACR Cryptology ePrint Archive 2009: 483 (2009)
- [i3]Charles Bouillaguet, Jean-Charles Faugère, Pierre-Alain Fouque, Ludovic Perret: Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem. IACR Cryptology ePrint Archive 2009: 583 (2009)
- 2008
- [c10]Luk Bettale, Jean-Charles Faugère, Ludovic Perret: Cryptanalysis of the TRMS Signature Scheme of PKC'05. AFRICACRYPT 2008: 143-155
- [c9]Luk Bettale, Jean-Charles Faugère, Ludovic Perret: Security Analysis of Multivariate Polynomials for Hashing. Inscrypt 2008: 115-124
- [c8]Jean-Charles Faugère, Françoise Levy-dit-Vehel, Ludovic Perret: Cryptanalysis of MinRank. CRYPTO 2008: 280-296
- [c7]Jean-Charles Faugère, Guillaume Moroz, Fabrice Rouillier, Mohab Safey El Din: Classification of the perspective-three-point problem, discriminant variety and real solving polynomial systems of inequalities. ISSAC 2008: 79-86
- [i2]Jean-Charles Faugère, Ludovic Perret: Algebraic Cryptanalysis of Curry and Flurry using Correlated Messages. IACR Cryptology ePrint Archive 2008: 402 (2008)
- 2007
- [i1]Daniel Augot, Magali Bardet, Jean-Charles Faugère: On formulas for decoding binary cyclic codes. CoRR abs/cs/0701070 (2007)
- 2006
- [j4]Frédéric Cazals, Jean-Charles Faugère, Marc Pouget, Fabrice Rouillier: The implicit structure of ridges of a smooth parametric surface. Computer Aided Geometric Design 23(7): 582-598 (2006)
- [c6]
- [c5]Jean-Charles Faugère, Ludovic Perret: Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects. EUROCRYPT 2006: 30-47
- 2005
- [j3]Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel: The arithmetic of Jacobian groups of superelliptic cubics. Math. Comput. 74(249): 389-410 (2005)
- 2004
- [c4]Abdolali Basiri, Andreas Enge, Jean-Charles Faugère, Nicolas Gürel: Implementing the Arithmetic of C3, 4Curves. ANTS 2004: 87-101
- [c3]Gwénolé Ars, Jean-Charles Faugère, Hideki Imai, Mitsuru Kawazoe, Makoto Sugita: Comparison Between XL and Gröbner Basis Algorithms. ASIACRYPT 2004: 338-353
- 2003
- [c2]Jean-Charles Faugère, Antoine Joux: Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases. CRYPTO 2003: 44-60
- [c1]Abdolali Basiri, Jean-Charles Faugère: Changing the ordering of Gröbner bases with LLL: case of two variables. ISSAC 2003: 23-29
1990 – 1999
- 1998
- [j2]Jean-Charles Faugère, François Moreau de Saint-Martin, Fabrice Rouillier: Design of regular nonseparable bidimensional wavelets using Grobner basis techniques. IEEE Transactions on Signal Processing 46(4): 845-856 (1998)
- 1993
- [j1]Jean-Charles Faugère, Patrizia M. Gianni, Daniel Lazard, Teo Mora: Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. J. Symb. Comput. 16(4): 329-344 (1993)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-03 21:39 CEST by the dblp team