• Publications
  • Influence
Sharp estimates for triangular sets
Polynomial bounds are proved in terms of intrinsic quantities for the height and degree of the coefficients of triangular sets of zero-dimensional varieties defined over the rational field.
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator
The best currently known upper bounds for factoring integers deterministically and for computing the Cartier-Manin operator of hyperelliptic curves are improved.
Fast algorithms for computing isogenies between elliptic curves
A new algorithm is introduced that computes an isogeny of degree l (l different from the characteristic) in time quasi-linear with respect to l based on fast algorithms for power series expansion of the Weierstrass ℘-function and related functions.
Computing Parametric Geometric Resolutions
  • É. Schost
  • Computer Science, Mathematics
    Applicable Algebra in Engineering, Communication…
  • 1 February 2003
This work presents a probabilistic algorithm to compute a parametric resolution of parameters of a polynomial system of n equations in n unknowns, and presents several applications, notably to computa- tions in the Jacobian of hyperelliptic curves and to questions of real geometry.
Genus 2 point counting over prime fields
Lifting techniques for triangular decompositions
We present lifting techniques for triangular decompositions of zero-dimensional varieties, that extend the range of the previous methods. We discuss complexity aspects, and report on a preliminary
A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii?s Algorithm
We present an algorithm based on the birthday paradox, which is a low-memory parallel counterpart to the algorithm of Matsuo, Chao and Tsujii. This algorithm computes the group order of the Jacobian