Algorithmic Number Theory

4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000. Proceedings

  • Wieb Bosma

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Contributed Papers

    1. Werner Backes, Susanne Wetzel
      Pages 135-152
    2. Simon R. Blackburn, Edlyn Teske
      Pages 153-168
    3. Nils Bruin
      Pages 169-184
    4. David G. Cantor, Daniel M. Gordon
      Pages 185-208
    5. Stefania Cavallar
      Pages 209-231
    6. Gautam Chinta, Paul E. Gunnells, Robert Sczech
      Pages 247-256
    7. Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
      Pages 257-268
    8. Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
      Pages 269-283
    9. Claus Fieker, Carsten Friedrichs
      Pages 285-296
    10. William F. Galway
      Pages 297-312
    11. Pierrick Gaudry, Robert Harley
      Pages 313-332
    12. Bert van Geemen, Jaap Top
      Pages 333-346

About these proceedings

Keywords

Algorithmic Number Theory Computational Number Theory Elliptic Curve Computations Factoring Finite Field Computations L Functions Lattice Computations Number theory Zeta Functions algorithms cryptography

Editors and affiliations

  • Wieb Bosma
    • 1
  1. 1.Mathematisch InstituutUniversiteit NijmegenNijmegenThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/10722028
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-67695-9
  • Online ISBN 978-3-540-44994-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book