5. ANTS 2002: Sydney, NSW, Australia

Claus Fieker, David R. Kohel (Eds.): Algorithmic Number Theory, 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002, Proceedings. Lecture Notes in Computer Science 2369 Springer 2002, ISBN 3-540-43863-7 BibTeX

@proceedings{DBLP:conf/ants/2002,
  editor    = {Claus Fieker and
               David R. Kohel},
  title     = {Algorithmic Number Theory, 5th International Symposium, ANTS-V,
               Sydney, Australia, July 7-12, 2002, Proceedings},
  booktitle = {ANTS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2369},
  year      = {2002},
  isbn      = {3-540-43863-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talks

Manjul Bhargava:
Gauss Composition and Generalizations. 1-8
Electronic Edition (Springer LINK) BibTeX
John Coates:
Elliptic Curves - The Crossroads of Theory and Computation. 9-19
Electronic Edition (Springer LINK) BibTeX
Antoine Joux:
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems. 20-32
Electronic Edition (Springer LINK) BibTeX
Bjorn Poonen:
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert's Tenth Problem over Rings of Algebraic Integers. 33-41
Electronic Edition (Springer LINK) BibTeX
Takakazu Satoh:
On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields. 43-66
Electronic Edition (Springer LINK) BibTeX

Number Theory

Wieb Bosma, Bart de Smit:
On Arithmetically Equivalent Number Fields of Small Degree. 67-79
Electronic Edition (Springer LINK) BibTeX
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier:
A Survey of Discriminant Counting. 80-94
Electronic Edition (Springer LINK) BibTeX
Graham Everest, Peter Rogers, Thomas Ward:
A Higher-Rank Mersenne Problem. 95-107
Electronic Edition (Springer LINK) BibTeX
Takashi Fukuda, Keiichi Komatsu:
An Application of Siegel Modular Functions to Kronecker's Limit Formula. 108-119
Electronic Edition (Springer LINK) BibTeX
Michael J. Jacobson Jr., Alfred J. van der Poorten:
Computational Aspects of NUCOMP. 120-133
Electronic Edition (Springer LINK) BibTeX
Stéphane Louboutin:
Efficient Computation of Class Numbers of Real Abelian Number Fields. 134-147
Electronic Edition (Springer LINK) BibTeX
Ulrich Vollmer:
An Accelerated Buchmann Algorithm for Regulator Computation in Real Quadratic Fields. 148-162
Electronic Edition (Springer LINK) BibTeX

Arithmetic Geometry

Roland Auer, Jaap Top:
Some Genus 3 Curves with Many Points. 163-171
Electronic Edition (Springer LINK) BibTeX
Nils Bruin, Noam D. Elkies:
Trinomials ax and ax with Galois Groups of Order 168 and 8·168. 172-188
Electronic Edition (Springer LINK) BibTeX
Enrique González-Jiménez, Josep González, Jordi Guàrdia:
Computations on Modular Jacobian Surfaces. 189-197
Electronic Edition (Springer LINK) BibTeX
Andrew Kresch, Yuri Tschinkel:
Integral Points on Punctured Abelian Surfaces. 198-204
Electronic Edition (Springer LINK) BibTeX
Tony Shaska:
Genus 2 Curves with (3, 3)-Split Jacobian and Large Automorphism Group. 205-218
Electronic Edition (Springer LINK) BibTeX
Helena A. Verrill:
Transportable Modular Symbols and the Intersection Pairing. 219-233
Electronic Edition (Springer LINK) BibTeX

Elliptic Curves and CM

Jean Marc Couveignes, Thierry Henocq:
Action of Modular Correspondences around CM Points. 234-243
Electronic Edition (Springer LINK) BibTeX
Noam D. Elkies:
Curves Dy=x-x of Odd Analytic Rank. 244-251
Electronic Edition (Springer LINK) BibTeX
Andreas Enge, François Morain:
Comparing Invariants for Class Fields of Imaginary Quadratic Fields. 252-266
Electronic Edition (Springer LINK) BibTeX
William A. Stein, Mark Watkins:
A Database of Elliptic Curves - First Report. 267-275
Electronic Edition (Springer LINK) BibTeX

Point Counting

Mireille Fouquet, François Morain:
Isogeny Volcanoes and the SEA Algorithm. 276-291
Electronic Edition (Springer LINK) BibTeX
Hae Young Kim, Jung Youl Park, Jung Hee Cheon, Je Hong Park, Jae Heon Kim, Sang Geun Hahn:
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis. 292-307
Electronic Edition (Springer LINK) BibTeX
Jan Denef, Frederik Vercauteren:
An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2. 308-323
Electronic Edition (Springer LINK) BibTeX

Cryptography

Steven D. Galbraith, Keith Harrison, David Soldera:
Implementing the Tate Pairing. 324-337
Electronic Edition (Springer LINK) BibTeX
Carl Pomerance, Igor Shparlinski:
Smooth Orders and Cryptographic Applications. 338-348
Electronic Edition (Springer LINK) BibTeX
Igor Shparlinski, Ron Steinfeld:
Chinese Remaindering for Algebraic Numbers in a Hidden Field. 349-356
Electronic Edition (Springer LINK) BibTeX

Function Fields

Florian Hess:
An Algorithm for Computing Weierstrass Points. 357-371
Electronic Edition (Springer LINK) BibTeX
Wen-Ching W. Li, Hiren Maharaj, Henning Stichtenoth, Noam D. Elkies:
New Optimal Tame Towers of Function Fields over Small Finite Fields. 372-389
Electronic Edition (Springer LINK) BibTeX
Alfred J. van der Poorten, Xuan Chuong Tran:
Periodic Continued Fractions in Elliptic Function Fields. 390-404
Electronic Edition (Springer LINK) BibTeX

Discrete Logarithms and Factoring

Joshua Holden:
Fixed Points and Two-Cycles of the Discrete Logarithm. 405-415
Electronic Edition (Springer LINK) BibTeX
Jeremy Horwitz, Ramarathnam Venkatesan:
Random Cayley Digraphs and the Discrete Logarithm. 416-430
Electronic Edition (Springer LINK) BibTeX
Antoine Joux, Reynald Lercier:
The Function Field Sieve Is Quite Special. 431-445
Electronic Edition (Springer LINK) BibTeX
Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff Jr.:
MPQS with Three Large Primes. 446-460
Electronic Edition (Springer LINK) BibTeX
Kazuto Matsuo, Jinhui Chao, Shigeo Tsujii:
An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields. 461-474
Electronic Edition (Springer LINK) BibTeX
Peter Ebinger, Edlyn Teske:
Factoring N = pq with the Elliptic Curve Method. 475-490
Electronic Edition (Springer LINK) BibTeX

Gröbner Bases

Allan K. Steel:
A New Scheme for Computing with Algebraically Closed Fields. 491-505
Electronic Edition (Springer LINK) BibTeX

Complexity

J. Maurice Rojas:
Additive Complexity and Roots of Polynomials over Number Fields and \mathfrak{p} -adic Fields. 506-516
Electronic Edition (Springer LINK) BibTeX