Algorithmic Number Theory

J. P. Buhler

ISBN 10: 0521808545 / ISBN 13: 9780521808545

Published by Cambridge University Press, 2008

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9780521808545

Bibliographic Details

• Title: Algorithmic Number Theory
• Publisher: Cambridge University Press
• Publication Date: 2008
• Language: English
• ISBN 10: 0521808545
• ISBN 13: 9780521808545
• Binding: Buch
• Condition: Neu
• Dimensions: 240W x 161H x 40D millimeters 240 millimeters width by 161 millimeters height by 40 millimeters depth
• Weight: 1151 grams

About this title

Synopsis

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.

Book Description

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.