Description
Book SynopsisThis book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist. The text also includes many interesting historical notes.
Table of ContentsPreface, Introduction, Chapter 1. Fundamental algorithms, Chapter 2. Unique factorization, Chapter 3. Prime numbers, Chapter 4. Modular arithmetic, Chapter 5. Induction and Fermat, Chapter 6. Pseudoprimes, Chapter 7. Systems of Congruences, Chapter 8. Groups, Chapter 9. Mersenne and Fermat, Chapter 10. Primality tests and primitive roots, Chapter 11. The RSA cryptosystem, Coda, Appendix. Roots and powers, Bibliography, Index of the main algorithms, Index of the main results, Index
