The following pages link to Jean-Charles Faugère (Q247235):
Displaying 50 items.
- Structural cryptanalysis of McEliece schemes with compact keys (Q264131) (← links)
- Polly cracker, revisited (Q285245) (← links)
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic (Q356715) (← links)
- On the complexity of the generalized MinRank problem (Q390388) (← links)
- On the relation between the MXL family of algorithms and Gröbner basis algorithms (Q414624) (← links)
- Using symmetries in the index calculus for elliptic curves discrete logarithm (Q484325) (← links)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- Artificial discontinuities of single-parametric Gröbner bases (Q629351) (← links)
- Computing modular correspondences for abelian varieties (Q661914) (← links)
- Pivoting in extended rings for computing approximate Gröbner bases (Q691644) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography (Q733509) (← links)
- On enumeration of polynomial equivalence classes and their application to MPKC (Q765801) (← links)
- Polynomial-division-based algorithms for computing linear recurrence relations (Q820938) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering (Q1318849) (← links)
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
- Sparse FGLM algorithms (Q1711988) (← links)
- A survey on signature-based algorithms for computing Gröbner bases (Q1711995) (← links)
- On the complexity of solving quadratic Boolean systems (Q1931429) (← links)
- A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
- Cryptanalysis of the extension field cancellation cryptosystem (Q2034996) (← links)
- Computing critical points for invariant algebraic systems (Q2100065) (← links)
- PKP-based signature scheme (Q2179377) (← links)
- In-depth comparison of the Berlekamp-Massey-Sakata and the Scalar-FGLM algorithms: the adaptive variants (Q2188986) (← links)
- On the complexity of the BKW algorithm on LWE (Q2256097) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case (Q2349096) (← links)
- The membrane inclusions curvature equations (Q2486640) (← links)
- The implicit structure of ridges of a smooth parametric surface (Q2506954) (← links)
- Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences (Q2628309) (← links)
- Factoring $$N=p^rq^s$$ for Large r and s (Q2799036) (← links)
- Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences (Q2819739) (← links)
- Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases (Q2883811) (← links)
- High order derivatives and decomposition of multivariate polynomials (Q2883818) (← links)
- Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields (Q2894399) (← links)
- Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form (Q2938836) (← links)
- A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems (Q2941190) (← links)
- Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case (Q2941192) (← links)
- Decomposition of generic multivariate polynomials (Q2946531) (← links)
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology (Q2946547) (← links)
- On the complexity of computing gröbner bases for quasi-homogeneous systems (Q2963233) (← links)
- Gröbner bases of ideals invariant under a commutative group (Q2963257) (← links)
- Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups (Q2977045) (← links)
- Moment Varieties of Gaussian Mixtures (Q2985045) (← links)
- A Superfast Randomized Algorithm to Decompose Binary Forms (Q2985811) (← links)
- Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra (Q2985813) (← links)
- Determinantal Sets, Singularities and Application to Optimal Control in Medical Imagery (Q2985814) (← links)
- GBLA (Q2985820) (← links)
- Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems (Q2985831) (← links)