An algorithm for list decoding number field codes

We present an algorithm for list decoding codewords of algebraic number field codes in polynomial time. This is the first explicit procedure for decoding number field codes whose construction were previously described by Lenstra [12] and Guruswami [8]. We rely on a new algorithm for computing the Hermite normal form of the basis of an OK -module due to Biasse and Fieker [2] where OK is the ring of integers of a number field K

Modular curves over number fields and ECM

International audienceWe construct families of elliptic curves defined over number fields and containing torsion groups Z=M1Z x Z=M2Z where (M1;M2) belongs to f(1; 11), (1; 14), (1; 15), (2; 10), (2; 12), (3; 9), (4; 8), (6; 6)g (i.e., when the corresponding modular curve X1(M1;M2) has genus 1). We provide formulae for the curves and give examples of number fields for which the corresponding elliptic curves have non-zero ranks, giving explicit generators using D. Simon's program whenever possible. The reductions of these curves can be used to speed up ECM for factoring numbers with special properties, a typical example being (factors of) Cunningham numbers bn - 1 such that M1 j n. We explain how to find points of potentially large orders on the reduction, if we accept to use quadratic twists

A new computational approach to ideal theory in number fields

Let $K$ be the number field determined by a monic irreducible polynomial $f(x)$ with integer coefficients. In previous papers we parameterized the prime ideals of $K$ in terms of certain invariants attached to Newton polygons of higher order of the defining equation $f(x)$. In this paper we show how to carry out the basic operations on fractional ideals of $K$ in terms of these constructive representations of the prime ideals. From a computational perspective, these results facilitate the manipulation of fractional ideals of $K$ avoiding two heavy tasks: the construction of the maximal order of $K$ and the factorization of the discriminant of $f(x)$. The main computational ingredient is Montes algorithm, which is an extremely fast procedure to construct the prime ideals

A new computational approach to ideal theory in number fields

Let K be the number field determined by a monic irreducible polynomial f(x) with integer coefficients. In previous papers we parameterized the prime ideals of K in terms of certain invariants attached to Newton polygons of higher order of f(x). In this paper we show how to carry out the basic operations on fractional ideals of K in terms of these constructive representations of the prime ideals. From a computational perspective, these results facilitate the manipulation of fractional ideals of K avoiding two heavy tasks: the construction of the maximal order of K and the factorization of the discriminant of f(x). The main computational ingredient is Montes algorithm, which is an extremely fast procedure to construct the prime idealsPostprint (author’s final draft