Algorithmic Number Theory

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

  • Claus Fieker
  • David R. Kohel

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

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-43863-2
  • Online ISBN 978-3-540-45455-7
  • Series Print ISSN 0302-9743
  • About this book
Industry Sectors