Prerequisites for

Introduction to Algorithms
Cormen, Thomas H. / Leiserson, Charles E. / Rivest, Ronald L. 1990, 1st edition. 1028 pages.
Note: I have not read the newer 2nd edition (release date September 2001).
Categories: Programming, Reference
In this book, Rivest (the "R" in RSA) supplies the section on number-theoretic algorithms, including the RSA cryptosystem. Also discussed is the Chinese remainder theorem, primality testing, integer factorization, and a good sized section on complexity theory. This is a strong reference book. I have not yet seen the second edition (published September 2001), and I'm eager to see what they've included from the last ten years.


Recommended prerequisite books:
This book:   
       
(Read review)
Suggested mathematical background in:

-  Computational Complexity

Suggested computer language experience:

N/A