Description
Book SynopsisAlgorithmic number theory is a branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. This book describes the various algorithms used in cryptography.
Table of ContentsPrimality 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 High-precision integer arithmetic Solving systems of linear equations over finite fields Facts from number theory Bibliography Index.
