Hardcover ISBN:  9780821840900 
Product Code:  MMONO/232 
List Price:  $165.00 
MAA Member Price:  $148.50 
AMS Member Price:  $132.00 
eBook ISBN:  9781470418144 
Product Code:  MMONO/232.E 
List Price:  $155.00 
MAA Member Price:  $139.50 
AMS Member Price:  $124.00 
Hardcover ISBN:  9780821840900 
eBook: ISBN:  9781470418144 
Product Code:  MMONO/232.B 
List Price:  $320.00 $242.50 
MAA Member Price:  $288.00 $218.25 
AMS Member Price:  $256.00 $194.00 
Hardcover ISBN:  9780821840900 
Product Code:  MMONO/232 
List Price:  $165.00 
MAA Member Price:  $148.50 
AMS Member Price:  $132.00 
eBook ISBN:  9781470418144 
Product Code:  MMONO/232.E 
List Price:  $155.00 
MAA Member Price:  $139.50 
AMS Member Price:  $124.00 
Hardcover ISBN:  9780821840900 
eBook ISBN:  9781470418144 
Product Code:  MMONO/232.B 
List Price:  $320.00 $242.50 
MAA Member Price:  $288.00 $218.25 
AMS Member Price:  $256.00 $194.00 

Book DetailsTranslations of Mathematical MonographsVolume: 232; 2007; 243 ppMSC: Primary 11; Secondary 94;
Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important:
 algorithms for primality testing;
 factorization algorithms for integers and for polynomials in one variable;
 applications of the theory of elliptic curves;
 algorithms for computation of discrete logarithms;
 algorithms for solving linear equations over finite fields;
 algorithms for performing arithmetic operations on large integers.
The book describes the current state of these and some other algorithms. It also contains extensive bibliography. For this English translation, additional references were prepared and commented on by the author.
ReadershipGraduate students and research mathematicians interested in algorithmic number theory and its applications.

Table of Contents

Chapters

Primality testing and construction of large primes

Factorization of integers with exponential complexity

Factorization of integers with subexponential complexity

Application of elliptic curves to primality testing and factorization of integers

Algorithms for computing discrete logarithm

Factorization of polynomials over finite fields

Reduced lattice bases and their applications

Factorization of polynomials over the field of rational numbers with polynomial complexity

Discrete Fourier transform and its applications

Highprecision integer arithmetic

Solving systems of linear equations over finite fields

Facts from number theory


Additional Material

RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Additional Material
 Requests
Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important:
 algorithms for primality testing;
 factorization algorithms for integers and for polynomials in one variable;
 applications of the theory of elliptic curves;
 algorithms for computation of discrete logarithms;
 algorithms for solving linear equations over finite fields;
 algorithms for performing arithmetic operations on large integers.
The book describes the current state of these and some other algorithms. It also contains extensive bibliography. For this English translation, additional references were prepared and commented on by the author.
Graduate students and research mathematicians interested in algorithmic number theory and its applications.

Chapters

Primality testing and construction of large primes

Factorization of integers with exponential complexity

Factorization of integers with subexponential complexity

Application of elliptic curves to primality testing and factorization of integers

Algorithms for computing discrete logarithm

Factorization of polynomials over finite fields

Reduced lattice bases and their applications

Factorization of polynomials over the field of rational numbers with polynomial complexity

Discrete Fourier transform and its applications

Highprecision integer arithmetic

Solving systems of linear equations over finite fields

Facts from number theory