Algorithmic Number Theory
Lattices, Number Fields, Curves and Cryptography
Part of Mathematical Sciences Research Institute Publications
- Editors:
- J. P. Buhler, Reed College, Oregon
- P. Stevenhagen, Universiteit Leiden
- Date Published: July 2011
- availability: Available
- format: Paperback
- isbn: 9780521208338
Paperback
Other available formats:
Hardback
Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact [email protected] providing details of the course you are teaching.
-
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.
Read more- 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
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: July 2011
- format: Paperback
- isbn: 9780521208338
- length: 664 pages
- dimensions: 234 x 156 x 34 mm
- weight: 0.92kg
- availability: Available
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.
Related Books
related journals
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×