© 2002

Algorithmic Number Theory

5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings

  • Claus Fieker
  • David R. Kohel
Conference proceedings ANTS 2002

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2369)

Table of contents

  1. Front Matter
    Pages I-X
  2. Invited Talks

  3. Number Theory

    1. Wieb Bosma, Bart de Smit
      Pages 67-79
    2. Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
      Pages 80-94
    3. Graham Everest, Peter Rogers, Thomas Ward
      Pages 95-107
    4. Michael J. Jacobson Jr., Alfred J. van der Poorten
      Pages 120-133
  4. Arithmetic Geometry

    1. Roland Auer, Jaap Top
      Pages 163-171
    2. Enrique González-Jiménez, Josep González, Jordi Guàrdia
      Pages 189-197
    3. Andrew Kresch, Yuri Tschinkel
      Pages 198-204
  5. Elliptic Curves and CM

    1. Jean-Marc Couveignes, Thierry Henocq
      Pages 234-243

About these proceedings


Algebraic Geometry Algebraic Number Fields Algorithmic Number Theory Computational Number Theory Cryptography Elliptic Curve Computations Factoring Finite Field Computations L-Functions Symbol algorithms complexity database finite field number theory

Editors and affiliations

  • Claus Fieker
    • 1
  • David R. Kohel
    • 1
  1. 1.School of Mathematics and Statistics, F07University of SydneySydneyAustralia

Bibliographic information


From the reviews:

"The book contains 39 articles about computational algebraic number theory, arithmetic geometry and cryptography. … The articles in this book reflect the broad interest of the organizing committee and the participants. The emphasis lies on the mathematical theory as well as on computational results. We recommend the book to students and researchers who want to read about current research in number theory and arithmetic geometry and its applications." (R. Carls, Nieuw Archief voor Wiskunde, Vol. 6 (3), 2005)