http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
1 online resource (614 pages) : 13 illustrations.
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 practitioners of cryptography in industry.
chapter 1 Arithmetic of Integers -- chapter 2 Arithmetic of Finite Fields -- chapter 3 Arithmetic of Polynomials -- chapter 4 Arithmetic of Elliptic Curves -- chapter 5 Primality Testing -- chapter 6 Integer Factorization -- chapter 7 Discrete Logarithms -- chapter 8 Large Sparse Linear Systems -- chapter 9 Public-Key Cryptography.
Discrete mathematics and its applications