Finite Fields, Linear Algebra, and Number Theory
Aiden A. Bruen, Mario A. Forcinito · 2004
This chapter contains sections titled: Modular Arithmetic A Little Linear Algebra Applications to RSA Primitive Roots for Primes and Diffie–Hellman The Extended Euclidean Algorithm Proof that the RSA Algorithm Works Constructing Finite Fields Pollard's p – 1 Factoring Algorithm Turing Machines, Complexity, P and NP Problems Solutions