ANTS
2008
Springer
13 years 6 months ago
2008
Springer
![Faster Multiplication in GF(2)[x]](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Faster Multiplication in GF(2)[x]")
Abstract. In this paper, we discuss an implementation of various algorithms for multiplying polynomials in GF(2)[x]: variants of the window methods, Karatsuba's, Toom-Cook...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
We discuss arithmetic in the Jacobian of a hyperelliptic curve C of genus g. The traditional approach is to fix a point P C and represent divisor classes in the form E - d(P) wher...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We further analyze the solutions to the Diophantine equations from which prime-order elliptic curves of embedding degrees k = 3, 4 or 6 (MNT curves) may be obtained. We g...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
