For the absolute life of me, I cannot seem to wrap my head around the proofs given in my number theory and cryptography class. Maybe it's the teacher, or the textbook, both or neither, but this is causing me great concern for two reasons.
First is obvious, since I hate solving math without a full comprehensive understanding of the concepts. Second, I have the feeling I'll be asked to prove concepts in my exams.
So how do I go about this? Does anyone have any textbooks or something (or anything) that could help me grasp all this better? To clarify, the main concepts covered in class are GCDs, Euclidean algorithm, concepts of coprimes, Euler-Fermat theorem etc. Then these bleed into solving cryptosystems such as RSA, Chinese Remainder Theorem and others.
Thanks!
While Hardy and Wright is the standard reference I don't feel like this is very readable in general. Don't get me wrong, it's a great resource but maybe a book like Niven et al "Introduction to the theory of numbers" might be a book you would find useful.
Also another good introductory book is by Burton "Elementary Number Theory".