Table of contents (48 papers)

  1. Front Matter
  2. Shimura curve computations
    Noam D. Elkies
    Pages 1-47
  3. The Decision Diffie-Hellman problem
    Dan Boneh
    Pages 48-63
  4. Bounding smooth integers (extended abstract)
    Daniel J. Bernstein
    Pages 128-130
  5. Robert Bennion's “hopping sieve”
    William F. Galway
    Pages 169-178
  6. Trading time for space in prime number sieves
    Jonathan P. Sorenson
    Pages 179-195
  7. Do sums of 4 biquadrates have a positive density?
    Jean -Marc Deshouillers, FranÇois Hennecart, Bernard Landreau
    Pages 196-203
  8. New experimental results concerning the Goldbach conjecture
    J. -M. Deshouillers, H. J. J. te Riele, Y. Saouter
    Pages 204-215
  9. Dense admissible sets
    Daniel M. Gordon, Gene Rodemich
    Pages 216-225
  10. An analytic approach to smooth polynomials over finite fields
    Daniel Panario, Xavier Gourdon, Philippe Flajolet
    Pages 226-236
  11. On the performance of signature schemes based on elliptic curves
    Erik De Win, Serge Mister, Bart Preneel, Michael Wiener
    Pages 252-266
  12. NTRU: A ring-based public key cryptosystem
    Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman
    Pages 267-288

About these proceedings


This book constitutes the refereed proceedings of the Third International Symposium on Algorithmic Number Theory, ANTS-III, held in Portland, Oregon, USA, in June 1998.
The volume presents 46 revised full papers together with two invited surveys. The papers are organized in chapters on gcd algorithms, primality, factoring, sieving, analytic number theory, cryptography, linear algebra and lattices, series and sums, algebraic number fields, class groups and fields, curves, and function fields.


Analysis Prime Prime number Public Key algorithm algorithms communication cryptography finite field linear algebra number theory

Bibliographic information

  • Copyright Information Springer-Verlag 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64657-0
  • Online ISBN 978-3-540-69113-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349