Elementary Number Theory Cryptography And Codes Universitext -

If you have ever browsed the "Universitext" section of a math library (or the dusty corners of Springer’s online catalog), you have likely seen it: a modestly titled volume, Elementary Number Theory, Cryptography and Codes by M. Welleda Baldoni, Ciro Ciliberto, and G.M. Piacentini Cattaneo.

You will start with Euclid’s algorithm (ancient Greece) and, within a few chapters, find yourself breaking the RSA cryptosystem using Euler’s theorem. You will learn about quadratic residues not for their elegance, but because they power the Goldwasser-Micali encryption system. Elementary Number Theory Cryptography And Codes Universitext

It’s not the flashiest book on the shelf. But it is one of the most honest. It respects the reader enough to teach the hard parts, and it respects the subject enough to show you the applications without hype. If you have ever browsed the "Universitext" section

It sneaks you into the heart of modern cryptography using nothing but the math you thought you already knew. For the uninitiated, Springer’s Universitext series sits perfectly between a dense graduate monograph and a remedial undergraduate primer. These books assume you are smart, but not omniscient. They move fast, but not recklessly. You will start with Euclid’s algorithm (ancient Greece)