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 2008 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.

*"synopsis" may belong to another edition of this title.*

This comprehensive 2008 introduction for beginning graduate students contains articles by the leading experts in the field. It covers basic topics such as algorithmic aspects of number fields, elliptic curves, and lattice basis reduction and advanced topics including cryptography, computational class field theory, zeta functions and L-series, and quantum computing.

Joe Buhler received his Ph.D. from Harvard University in 1977, writing a thesis on algebraic number theory. He has taught at the Pennsylvania State Universtiy, Harvard University, and Reed College, and served as the Deputy Director at the Mathematical Sciences Research Institute in Berkeley, California. His research interests include number theory, combinatorics, algebra, and algorithmic aspects of these fields. In addition to research papers and monographs he has written popular articles on mathematics, and the mathematics of juggling. He has served on various committees of the American Mathematical Society and the Mathematics Association of America, is an editor for several journals, and has organized several major conferences in number theory. Peter Stevenhagen obtained his PhD from the University of California at Berkeley in 1988. He was charge de recherche in the CNRS in Besancon, France before forming a small number theory group at the University of Amsterdam. Since 1993, he is the organizer of the biweekly Intercity Number Theory Seminar, the Dutch national platform for research in number theory. In 2000 he was appointed at Leiden University, the oldest university in the Netherlands, which was founded in 1575. Besides his research papers, his bibliography counts various papers in number theory of popularizing and historical nature. He is a member of the board of the Dutch Mathematical Society, the Wiskundig Genootschap.

*"About this title" may belong to another edition of this title.*

Published by
Cambridge University Press
(2008)

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Quantity Available: > 20

Seller

Rating

**Book Description **Cambridge University Press, 2008. HRD. Book Condition: New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IP-9780521808545

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Hardcover
Quantity Available: 5

Seller

Rating

**Book Description **Cambridge University Press. Hardback. Book Condition: new. BRAND NEW PRINT ON DEMAND., Algorithmic Number Theory: Lattices, Number Fields, Curves and Cryptography, Joe P. Buhler, Peter Stevenhagen, 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. Bookseller Inventory # B9780521808545

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2016)

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Paperback
Quantity Available: 1

Seller

Rating

**Book Description **Cambridge University Press, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9780521808545_lsuk

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **2008. Hardback. Book Condition: NEW. 9780521808545 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE0477037

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge Univ Pr
(2008)

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Hardcover
Quantity Available: 1

Seller

Rating

**Book Description **Cambridge Univ Pr, 2008. Hardcover. Book Condition: Brand New. 1st edition. 662 pages. 9.50x6.25x1.50 inches. In Stock. Bookseller Inventory # __0521808545

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2008)

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Quantity Available: > 20

Seller

Rating

**Book Description **Cambridge University Press, 2008. HRD. Book Condition: New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. Bookseller Inventory # IP-9780521808545

More Information About This Seller | Ask Bookseller a Question

Published by
Cambridge University Press
(2008)

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Hardcover
Quantity Available: 10

Seller

Rating

**Book Description **Cambridge University Press, 2008. Hardcover. Book Condition: New. Bookseller Inventory # INGM9780521808545

More Information About This Seller | Ask Bookseller a Question

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Quantity Available: 5

Seller

Rating

**Book Description **Book Condition: New. Bookseller Inventory # NU-ING-00308577

More Information About This Seller | Ask Bookseller a Question

Published by
CAMBRIDGE UNIVERSITY PRESS, United Kingdom
(2008)

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Hardcover
Quantity Available: 10

Seller

Rating

**Book Description **CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2008. Hardback. Book Condition: New. 231 x 157 mm. Language: English . Brand New Book ***** Print on Demand *****. 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. Bookseller Inventory # APC9780521808545

More Information About This Seller | Ask Bookseller a Question

Published by
CAMBRIDGE UNIVERSITY PRESS, United Kingdom
(2008)

ISBN 10: 0521808545
ISBN 13: 9780521808545

New
Hardcover
Quantity Available: 10

Seller

Rating

**Book Description **CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2008. Hardback. Book Condition: New. 231 x 157 mm. Language: English . Brand New Book ***** Print on Demand *****.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. Bookseller Inventory # APC9780521808545

More Information About This Seller | Ask Bookseller a Question