Pierre-Jean Spaenlehauer

41 papers B 5Journal 33Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Computing Isomorphisms between Products of Supersingular Elliptic Curves.
CoRR
Pierrick Gaudry, Julien Soumier, Pierre-Jean Spaenlehauer
2025 — book
Fast Algebraic Algorithms for Arithmetic Geometry and Polynomial Systems.
Pierre-Jean Spaenlehauer
2025 J jnl
Isogeny-based Cryptography using Isomorphisms of Superspecial Abelian Surfaces.
IACR Cryptol. ePrint Arch.
Pierrick Gaudry, Julien Soumier, Pierre-Jean Spaenlehauer
2024 J jnl
Computing a group action from the class field theory of imaginary hyperelliptic function fields.
J. Symb. Comput.
Antoine Leudière, Pierre-Jean Spaenlehauer
2023 J jnl
Dimension results for extremal-generic polynomial systems over complete toric varieties.
CoRR
Matías R. Bender, Pierre-Jean Spaenlehauer
2022 J jnl
Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields.
CoRR
Antoine Leudière, Pierre-Jean Spaenlehauer
2022 J jnl
Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields.
IACR Cryptol. ePrint Arch.
Antoine Leudière, Pierre-Jean Spaenlehauer
2020 J jnl
A fast randomized geometric algorithm for computing Riemann-Roch spaces.
Math. Comput.
Aude Le Gluher, Pierre-Jean Spaenlehauer
2020 J jnl
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve.
CoRR
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
2020 J jnl
Refined Analysis of the Asymptotic Complexity of the Number Field Sieve.
IACR Cryptol. ePrint Arch.
Aude Le Gluher, Pierre-Jean Spaenlehauer, Emmanuel Thomé
2019 J jnl
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves.
Found. Comput. Math.
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2018 J jnl
A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces.
CoRR
Aude Le Gluher, Pierre-Jean Spaenlehauer
2018 J jnl
A Polyhedral Method for Sparse Systems with Many Positive Solutions.
SIAM J. Appl. Algebra Geom.
Frédéric Bihan, Francisco Santos, Pierre-Jean Spaenlehauer
2018 J jnl
Counting points on genus-3 hyperelliptic curves with explicit real multiplication.
CoRR
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2017 J jnl
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves.
CoRR
Simon Abelard, Pierrick Gaudry, Pierre-Jean Spaenlehauer
2016 J jnl
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation.
Found. Comput. Math.
Éric Schost, Pierre-Jean Spaenlehauer
2016 B conf
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems.
ISSAC
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
2016 J jnl
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems.
CoRR
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
2016 B conf
Critical Point Computations on Smooth Varieties: Degree and Complexity Bounds.
ISSAC
Mohab Safey El Din, Pierre-Jean Spaenlehauer
2016 J jnl
Critical Point Computations on Smooth Varieties: Degree and Complexity bounds.
CoRR
Mohab Safey El Din, Pierre-Jean Spaenlehauer
2015 J jnl
Sparse Gröbner bases: algorithms and complexity.
ACM Commun. Comput. Algebra
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
2015 J jnl
Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes.
CoRR
Frédéric Bihan, Pierre-Jean Spaenlehauer
2014 J jnl
Exact Solutions in Structured Low-Rank Approximation.
SIAM J. Matrix Anal. Appl.
Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels
2014 J jnl
On the Complexity of Computing Critical Points with Gröbner Bases.
SIAM J. Optim.
Pierre-Jean Spaenlehauer
2014 J jnl
Sparse Gröbner Bases: the Unmixed Case.
CoRR
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
2014 B conf
Sparse Gröbner bases: the unmixed case.
ISSAC
Jean-Charles Faugère, Pierre-Jean Spaenlehauer, Jules Svartz
2013 J jnl
A Quadratically Convergent Algorithm for Structured Low-Rank Approximation.
CoRR
Éric Schost, Pierre-Jean Spaenlehauer
2013 J jnl
Algebraic Methods for Structured Low-Rank Approximation.
CoRR
Giorgio Ottaviani, Pierre-Jean Spaenlehauer, Bernd Sturmfels
2013 J jnl
Complexity Bounds for Computing Critical Points with Gröbner Bases Algorithms: the Mixed Case.
CoRR
Pierre-Jean Spaenlehauer
2013 J jnl
Newton-like iteration for determinantal systems and structured low rank approximation.
ACM Commun. Comput. Algebra
Éric Schost, Pierre-Jean Spaenlehauer
2013 J jnl
On the complexity of solving quadratic Boolean systems.
J. Complex.
Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer
2013 J jnl
On the complexity of the generalized MinRank problem.
J. Symb. Comput.
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2012 J jnl
Critical Points and Gröbner Bases: the Unmixed Case
CoRR
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2012 B conf
Critical points and Gröbner bases: the unmixed case.
ISSAC
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2012 — —
Solving multi-homogeneous and determinantal systems: algorithms, complexity, applications. (Résolution de systèmes multi-homogènes et déterminantiels : algorithmes, complexité, applications).
Pierre-Jean Spaenlehauer
2011 J jnl
Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree (1, 1): Algorithms and complexity.
J. Symb. Comput.
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2011 J jnl
On the Complexity of Solving Quadratic Boolean Systems
CoRR
Magali Bardet, Jean-Charles Faugère, Bruno Salvy, Pierre-Jean Spaenlehauer
2011 J jnl
On the Complexity of the Generalized MinRank Problem
CoRR
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2010 — conf
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem.
Public Key Cryptography
Jean-Charles Faugère, Pierre-Jean Spaenlehauer
2010 B conf
Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology.
ISSAC
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer
2010 J jnl
Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity
CoRR
Jean-Charles Faugère, Mohab Safey El Din, Pierre-Jean Spaenlehauer