by J.P. Buhler, P. Stevenhagen
Publisher: Cambridge University Press 2008
ISBN/ASIN: 0521808545
ISBN-13: 9780521808545
Number of pages: 662
ISBN/ASIN: 0521808545
ISBN-13: 9780521808545
Number of pages: 662
Description:
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, such as the fundamental algorithms of elementary number theory, lattice basis reduction, elliptic curves, algebraic number fields, and methods for factoring and primality proving.
Download or read it online here: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, such as the fundamental algorithms of elementary number theory, lattice basis reduction, elliptic curves, algebraic number fields, and methods for factoring and primality proving.
(multiple PDF files)
0 Comments: