The book revolves around RSA. The motivation for the book is that the reader wants to understand public/private key cryptography, where this is represented by the seminal RSA algorithm.
The author assumes little previous acquaintance with number theory on your part. He develops his arguments from this minimal background. So modular arithmetic is introduced, and thence such key ideas as groups, primality tests, Chinese Remainder Theorem and, finally, the RSA cryptosystem. Each chapter has a problem set of moderate difficulty.
A maths undergraduate at the sophomore level or higher should be able to benefit from the book.