Sciweavers

ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
13 years 9 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler
ANTS
2000
Springer
94views Algorithms» more  ANTS 2000»
13 years 9 months ago
Computing All Integer Solutions of a General Elliptic Equation
Roel J. Stroeker, Nikolaus Tzanakis
ANTS
2000
Springer
117views Algorithms» more  ANTS 2000»
13 years 9 months ago
Modular Forms for GL(3) and Galois Representations
Abstract. A description and an example are given of numerical experiments which look for a relation between modular forms for certain congruence subgroups of SL(3, ZZ) and Galois r...
Bert van Geemen, Jaap Top
ANTS
2000
Springer
92views Algorithms» more  ANTS 2000»
13 years 9 months ago
Computing Special Values of Partial Zeta Functions
We discuss computation of the special values of partial zeta functions associated to totally real number fields. The main tool is the Eisenstein cocycle Ψ, a group cocycle for GL...
Gautam Chinta, Paul E. Gunnells, Robert Sczech
ANTS
2000
Springer
96views Algorithms» more  ANTS 2000»
13 years 9 months ago
Coverings of Curves of Genus 2
We shall discuss the idea of finding all rational points on a curve C by first finding an associated collection of curves whose rational points cover those of C. This classical ...
E. Victor Flynn
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
13 years 9 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan