28 research outputs found
Fast algorithms for computing isogenies between elliptic curves
We survey algorithms for computing isogenies between elliptic curves defined
over a field of characteristic either 0 or a large prime. We introduce a new
algorithm that computes an isogeny of degree ( different from the
characteristic) in time quasi-linear with respect to . This is based in
particular on fast algorithms for power series expansion of the Weierstrass
-function and related functions
Computation of Discrete Logarithms in GF(2^607)
International audienceWe describe in this article how we have been able to extend the record for computations of discrete logarithms in characteristic 2 from the previous record over GF(2^503) to a newer mark of GF(2^607), using Coppersmith's algorithm. This has been made possible by several practical improvements to the algorithm. Although the computations have been carried out on fairly standard hardware, our opinion is that we are nearing the current limits of the manageable sizes for this algorithm, and that going substantially further will require deeper improvements to the method
Counting points on hyperelliptic curves over finite fields
International audienceWe describe some algorithms for computing the cardinality of hyperelliptic curves and their Jacobians over finite fields. They include several methods for obtaining the result modulo small primes and prime powers, in particular an algorithm à la Schoof for genus 2 using Cantor's division polynomials. These are combined with a birthday paradox algorithm to calculate the cardinality. Our methods are practical and we give actual results computed using our current implementation. The Jacobian groups we handle are larger than those previously reported in the literature
Explicit Methods in Number Theory
These notes contain extended abstracts on the topic of explicit methods in number theory. The range of topics includes asymptotics for field extensions and class numbers, random matrices and L-functions, rational points on curves and higher-dimensional varieties, and aspects of lattice basis reduction
Efficient computation of maximal orders in radical (including Kummer) extensions
AbstractWe describe an algorithm, linear in the degree of the field, for computing a (pseudo) basis for P-maximal orders of radical (which includes Kummer) extensions of global arithmetic fields. We construct our basis in such a way as to further improve maximal order computations in these radical extensions. Using this algorithm for the similar problem of computing maximal orders of class fields is discussed. We give examples of both function fields and number fields comparing the running time of our algorithm to that of the Round 2 or 4 and Fraatz (2005)
Explicit Methods in Number Theory
These notes contain extended abstracts on the topic of explicit methods in number theory. The range of topics includes the Sato-Tate conjecure, Langlands programme, function fields, L-functions and many other topics