Let $k$ be a locally compact complete field with respect to a discrete valuation $v$ . Let $ \mathcal{O} $ be the valuation ring, $\mathfrak{m}$ the maximal ideal and $F(x)\in \mathcal{O} [x] $ a monic separable polynomial of degree $n$ . Let $\delta = v(\mathrm{Disc} (F))$ . The Montes algorithm computes an OM factorization of $F$ . The single-factor lifting algorithm derives from this data a factorization of $F(\mathrm{mod~} {\mathfrak{m}}^{\nu } )$ , for a prescribed precision $\nu $ . In this paper we find a new estimate for the complexity of the Montes algorithm, leading to an estimation of $O({n}^{2+ \epsilon } + {n}^{1+ \epsilon } {\delta }^{2+ \epsilon } + {n}^{2} {\nu }^{1+ \epsilon } )$ word operations for the complexity of the computation of a factorization of $F(\mathrm{mod~} {\mathfrak{m}}^{\nu } )$ , assuming that the residue field of $k$ is small.

We determine which isogeny classes of supersingular abelian surfaces over a finite field $k$ of characteristic 2 contain jacobians. We deal with this problem in a direct way by computing explicitly the zeta function of all supersingular curves of genus 2. Our procedure is constructive, so that we are able to exhibit curves with prescribed zeta function and find formulas for the number of curves, up to $k$ -isomorphism, leading to the same zeta function.