Sciweavers

120
Voted
ANTS
2008
Springer
133views Algorithms» more  ANTS 2008»
15 years 2 months ago
Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors
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...
Steven D. Galbraith, Michael Harrison, David J. Mi...
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
15 years 2 months ago
Abelian Varieties with Prescribed Embedding Degree
We present an algorithm that, on input of a CM-field K, an integer k 1, and a prime r 1 mod k, constructs a q-Weil number OK corresponding to an ordinary, simple abelian variety ...
David Freeman, Peter Stevenhagen, Marco Streng
120
Voted
ANTS
2008
Springer
115views Algorithms» more  ANTS 2008»
15 years 2 months ago
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group
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...
Lassina Dembélé, Steve Donnelly
97
Voted
ANTS
2008
Springer
111views Algorithms» more  ANTS 2008»
15 years 2 months ago
Computing L-Series of Hyperelliptic Curves
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...
Kiran S. Kedlaya, Andrew V. Sutherland
111
Voted
ANTS
2008
Springer
110views Algorithms» more  ANTS 2008»
15 years 2 months ago
Computing Hilbert Class Polynomials
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 < ...
Juliana Belding, Reinier Bröker, Andreas Enge...
Algorithms
Top of PageReset Settings