A Computational Introduction to Number Theory and Algebra
This note contains below topics, Title, Preliminaries, Basic properties of the integers, Congruences, Computing with large integers, Euclid s algorithm, The distribution of primes, Abelian groups, Rings, Finite and discrete probability distributions, Probabilistic algorithms, Probabilistic primality testing, Finding generators and discrete logarithms in Zp, Quadratic reciprocity and computing modular square roots, Modules and vector spaces, Matrices, Subexponentialtime discrete logarithms and factoring, More rings.
Author(s): Victor Shoup
598 Pages