Search

We give a new proof of the "weakly admissible implies admissible" theorem of Colmez and Fontaine describing the semi-stable p-adic representations. We study Banach-Colmez spaces, i.e. p-adic Banach spaces with the extra data of a C_p-algebra of analytic functions. The "weakly admissible" theorem is then a result of the existence of dimension and height functions on these objects. Furthermore, we show that the subcategory of Banach-Colmez spaces corresponding to crystalline representations is naturally filtered by the positive rationals., Comment: 20 pages

This article gives a new proof of the fundamental lemma of the "weakly admissible implies admissible" theorem of Colmez-Fontaine that describes the semi-stable p-adic representations. To this end, we introduce the category of spectral Banach spaces, which are p-adic Banach spaces with a C_p-algebra of analytic functions, and the subcategory of effective Banach-Colmez spaces. The fundamental lemma states the surjectivity of certain analytic maps and describes their kernel. It is proven by an explicit count of solutions of the equations defining these maps. It is equivalent to the existence of functions of dimension and height of effective Banach-Colmez spaces., Comment: 17 pages

Consider two elliptic curves $E,E'$ defined over the finite field $\mathbb{F}_q$, and suppose that there exists an isogeny $\psi$ between $E$ and $E'$. We propose an algorithm that determines $\psi$ from the knowledge of $E$, $E'$ and of its degree $r$, by using the structure of the $\ell$-torsion of the curves (where $\ell$ is a prime different from the characteristic $p$ of the base field). Our approach is inspired by a previous algorithm due to Couveignes, that involved computations using the $p$-torsion on the curves. The most refined version of that algorithm, due to De Feo, has a complexity of $\tilde{O}(r^2) p^{O(1)}$ base field operations. On the other hand, the cost of our algorithm is $\tilde{O}(r^2 + \sqrt{r} \log(q))$; this makes it an interesting alternative for the medium- and large-characteristic cases., Comment: 16 pages, 3 figures, submitted to ANTS-XII, modified version with analysis for the choice of \ell and new experimental plots

We study the Isomorphism of Polynomial (IP2S) problem with m=2 homogeneous quadratic polynomials of n variables over a finite field of odd characteristic: given two quadratic polynomials (a, b) on n variables, we find two bijective linear maps (s,t) such that b=t . a . s. We give an algorithm computing s and t in time complexity O~(n^4) for all instances, and O~(n^3) in a dominant set of instances. The IP2S problem was introduced in cryptography by Patarin back in 1996. The special case of this problem when t is the identity is called the isomorphism with one secret (IP1S) problem. Generic algebraic equation solvers (for example using Gr\"obner bases) solve quite well random instances of the IP1S problem. For the particular cyclic instances of IP1S, a cubic-time algorithm was later given and explained in terms of pencils of quadratic forms over all finite fields; in particular, the cyclic IP1S problem in odd characteristic reduces to the computation of the square root of a matrix. We give here an algorithm solving all cases of the IP1S problem in odd characteristic using two new tools, the Kronecker form for a singular quadratic pencil, and the reduction of bilinear forms over a non-commutative algebra. Finally, we show that the second secret in the IP2S problem may be recovered in cubic time.