Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Algorithmic Number Theory

All titles
Algorithmic Number Theory

Algorithmic Number Theory

Lattices, Number Fields, Curves and Cryptography
J. P. Buhler, Reed College, Oregon
P. Stevenhagen, Universiteit Leiden
Mathematical Sciences Research Institute
December 2008
Hardback
9780521808545
£170.00
GBP
Hardback
GBP
Paperback
    Description

    Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.

    • Introduction aimed at beginning graduate students
    • Extensive coverage by a large body of experts

    Reviews & endorsements

    Review of the hardback: '… can be warmly recommended to anyone interested in the fascinating area of computational number theory.' EMS Newsletter

    See more reviews

    Product details

    December 2008
    Hardback
    9780521808545
    664 pages
    234 × 156 × 37 mm
    1.03kg
    Available

    Often bought together

    Computational Cryptography
    Computational Cryptography

    : Paperback

    Algorithmic Aspects of Cryptology

    Thin Groups and Superstrong Approximation
    Thin Groups and Superstrong Approximation

    : Hardback

    Elliptic Curves in Cryptography
    Elliptic Curves in Cryptography

    : Paperback

    Automatic Sequences
    Automatic Sequences

    : Hardback

    Theory, Applications, Generalizations

    Often bought together

    cambridge core banner

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    : Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    Journal of the Institute of Mathematics of Jussieu
    Journal of the Institute of Mathematics of Jussieu

    : Journal

    Journal of the Institute of Mathematics of Jussieu covers all domains in pure mathematics.

    Compositio Mathematica
    Compositio Mathematica

    : Journal

    Compositio Mathematica is a prestigious, well-established journal publishing first-class research papers that traditionally focus on the mainstream of pure mathematics. Compositio Mathematica has a broad scope which includes the fields of algebra, number theory, topology, algebraic and differential geometry and (geometric) analysis. Papers on other topics are welcome if they are of broad interest. All contributions are required to meet high standards of quality and originality. The Journal has an international editorial board reflected in the journal content. Online access is free for all papers published 5 years ago or more. Papers published before 1997 are available from the NUMDAM website. Compositio is owned and published by non-profit organisations (the Foundation Compositio Mathematica and the London Mathematical Society) that use any surplus income from journal subscriptions to sponsor mathematics and mathematical research.

    Mathematical Proceedings of the Cambridge Philosophical Society
    Mathematical Proceedings of the Cambridge Philosophical Society

    : Journal

    Mathematical Proceedings is one of the few high-quality journals publishing original research papers that cover the whole range of pure and applied mathematics, theoretical physics and statistics. All branches of pure mathematics are covered, in particular logic and foundations, number theory, algebra, geometry, algebraic and geometric topology, classical and functional analysis, dynamical systems, probability and statistics. On the applied side, mechanics, mathematical physics, relativity and cosmology are included.

    Related Journals

    Also by this Author

    Contents

    Table of Contents

    • 1. Solving Pell's equation Hendrik Lenstra
    • 2. Basic algorithms in number theory Joe Buhler and Stan Wagon
    • 3. Elliptic curves Bjorn Poonen
    • 4. The arithmetic of number rings Peter Stevenhagen
    • 5. Fast multiplication and applications Dan Bernstein
    • 6. Primality testing Rene Schoof
    • 7. Smooth numbers: computational number theory and beyond Andrew Granville
    • 8. Smooth numbers and the quadratic sieve Carl Pomerance
    • 9. The number field sieve Peter Stevenhagen
    • 10. Elementary thoughts on discrete logarithms Carl Pomerance
    • 11. The impact of the number field sieve on the discrete logarithm problem in finite fields Oliver Schirokauer
    • 12. Lattices Hendrik Lenstra
    • 13. Reducing lattices to find small-height values of univariate polynomials Dan Bernstein
    • 14. Protecting communications against forgery Dan Bernstein
    • 15. Computing Arakelov class groups Rene Schoof
    • 16. Computational class field theory Henri Cohen and Peter Stevenhagen
    • 17. Zeta functions over finite fields Daqing Wan
    • 18. Counting points on varieties over finite fields Alan Lauder and Daqing Wan
    • 19. How to get your hands on modular forms using modular symbols William Stein
    • 20. Congruent number problems in dimension one and two Jaap Top and Noriko Yui.
      • Show more

    Look inside

    Courses
    Resources
    Additional Information
    About the authors
      Contributors

    • Dan Berstein, Dan Boneh, Joe Buhler, Henri Cohen, Cynthia Dwork, Andrew Granville, Hendrik Lenstra, Andrew Odlyzko, Carl Pomerance, Bjorn Poonen, Oliver Schirokauer, Rene Schoof, Jeffrey Shallit, William Stein, Peter Stevenhagen, Stan Wagon, Daqing Wan, Noriko Yui

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services