Algorithmic Number Theory: 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings
Author: Duncan Buell
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-22156-2
DOI: 10.1007/b98210

Table of Contents:

Computing Zeta Functions via p-Adic Cohomology
Using Primitive Subgroups to Do More with Fewer Bits
Elliptic Curves of Large Rank and Small Conductor
Binary GCD Like Algorithms for Some Complex Quadratic Rings
On the Complexity of Computing Units in a Number Field
Implementing the Arithmetic of C
Pseudocubes and Primality Testing
Elliptic Curves with a Given Number of Points
Rational Divisors in Rational Divisor Classes
Conjectures about Discriminants of Hecke Algebras of Prime Level
Montgomery Scalar Multiplication for Genus 2 Curves
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves
Elliptic Curves x
Proving the Primality of Very Large Numbers with fastECPP
A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii’s Algorithm
Function Field Sieve in Characteristic Three
A Comparison of CEILIDH and XTR
Stable Models of Elliptic Curves, Ring Class Fields, and Complex Multiplication
An Algorithm for Computing Isomorphisms of Algebraic Function Fields
A Method to Solve Cyclotomic Norm Equations

"The sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington"--Preface
Includes bibliographical references and index
Part I: Invited talks -- 1. Computing zeta functions via p-Adic cohomology -- 2. Using primitive subgroups to do more with fewer bits -- 3. Elliptic curves of large rank and small conductor -- Part II: Contributed papers -- 4. Binary GCD like algorithms for some complex quadratic rings -- 5. On the complexity of computing units in a number field -- 6. Implementing the arithmetic of C₃, ₄ curves -- 7. Pseudocubes and primality testing -- 8. Elliptic curves with a given number of points -- 9. Rational divisors in rational divisor classes -- 10. Conjectures about discriminants of Hecke algebras of prime level -- 11. Montgomery scalar multiplication for genus 2 curves -- 12. Improved weil and tate pairings for elliptic and hyperelliptic curves -- 13. Elliptic curves x³+y³=k of high rank -- 14. Proving the primality of very largenumbers with fastECPP -- 15. A low-memory parallel version of Matsuo, Chao, and Tsujii's algorithm -- 16. Function field sieve in characteristic three -- 17. A comparison of CEILIDH and XTR -- 18. Stable models of elliptical curves, ring class fields, and complex multiplication -- 19. An algorithm for computing isomorphisms -- 20. A method to solve cyclotomic norm equations f * f̄̄ -- 21. Imaginary cyclic quartic fields with large minus class numbers -- 22. Nonic 3-adic fields -- 23. Montgomery addition for genus two curves -- 24. Numerical evaluation at negative integers of the dedekind zeta functions of totally real cubic number fields -- 25. Salem numbers of trace -2 and traces of totally positive algebraic integers -- 26. Low-dimensional lattice basis reduction revisited -- 27. Computing order statistics in the Faray sequence -- 28. The discrete lorarithm in logarithmic l-class groups and its applications in K-theory -- 29. Point counting on genus 3 non hyperelliptic curves -- 30. Algorithmicaspects of cubic function fields -- 31. A binary recursive god algorithm -- 32. Lagrange resolvents constructedfrom stark units -- 33. Cryptanalysis of a divisor class group based public-key cryptosystem