ABSTRACT

Building on the success of the first edition, An Introduction to Number Theory with Cryptography, Second Edition, increases coverage of the popular and important topic of cryptography, integrating it with traditional topics in number theory.

The authors have written the text in an engaging style to reflect number theory's increasing popularity. The book is designed to be used by sophomore, junior, and senior undergraduates, but it is also accessible to advanced high school students and is appropriate for independent study. It includes a few more advanced topics for students who wish to explore beyond the traditional curriculum.

Features of the second edition include

  • Over 800 exercises, projects, and computer explorations

  • Increased coverage of cryptography, including Vigenere, Stream, Transposition,and Block ciphers, along with RSA and discrete log-based systems

  • "Check Your Understanding" questions for instant feedback to students

  • New Appendices on "What is a proof?" and on Matrices

  • Select basic (pre-RSA) cryptography now placed in an earlier chapter so that the topic can be covered right after the basic material on congruences

  • Answers and hints for odd-numbered problems

About the Authors:  

Jim Kraft received his Ph.D. from the University of Maryland in 1987 and has published several research papers in algebraic number theory. His previous teaching positions include the University of Rochester, St. Mary's College of California, and Ithaca College, and he has also worked in communications security. Dr. Kraft currently teaches mathematics at the Gilman School.

Larry Washington received his Ph.D. from Princeton University in 1974 and has published extensively in number theory, including books on cryptography (with Wade Trappe), cyclotomic fields, and elliptic curves. Dr. Washington is currently Professor of Mathematics and Distinguished Scholar-Teacher at the University of Maryland.

chapter 1|8 pages

Introduction

chapter 2|41 pages

Divisibility

chapter 3|12 pages

Linear Diophantine Equations

chapter 4|12 pages

Unique Factorization

chapter 5|38 pages

Applications of Unique Factorization

chapter 6|42 pages

Congruences

chapter 7|33 pages

Classical Cryptosystems

chapter 8|19 pages

Fermat, Euler, and Wilson

chapter 9|18 pages

RSA

chapter 10|12 pages

Polynomial Congruences

chapter 11|33 pages

Order and Primitive Roots

chapter 12|16 pages

More Cryptographic Applications

chapter 13|30 pages

Quadratic Reciprocity

chapter 14|38 pages

Primality and Factorization

chapter 15|28 pages

Geometry of Numbers

chapter 16|15 pages

Arithmetic Functions

chapter 17|41 pages

Continued Fractions

chapter 18|23 pages

Gaussian Integers

chapter 19|25 pages

Algebraic Integers

chapter 20|18 pages

The Distribution of Primes

chapter 21|10 pages

Epilogue: Fermat’s Last Theorem