ABSTRACT

Developed from the author's popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and pract

chapter 1|74 pages

Arithmetic of Integers

chapter 2|46 pages

Arithmetic of Finite Fields

chapter 3|56 pages

Arithmetic of Polynomials

chapter 4|88 pages

Arithmetic of Elliptic Curves

chapter 5|32 pages

Primality Testing

chapter 6|48 pages

Integer Factorization

chapter 7|48 pages

Discrete Logarithms

chapter 8|36 pages

Large Sparse Linear Systems

chapter 9|36 pages

Public-Key Cryptography