000			02801nam a22002297a 4500
999			_c55984 _d55984
005			20191121144512.0
008			191121b ||||| |||| 00| 0 eng d
020			_a9781470437336
082			_a652.80151 COZ
100			_aMargaret B Cozzens _a; Steven J Miller
245			_aThe mathematics of encryption _b : an elementary introduction _c/Margaret B Cozzens
260			_aProvidence, Rhode Island _b: American Mathematical Society _c, 2013
300			_axvii, 332 pages _c; 26 cm.
365			_b00
490			_aMathematical world, v. 29.
505			_a Historical introduction -- Classical cryptology : methods -- Enigma and Ultra -- Classical cryptography : attacks I -- Classical cryptography : attacks II -- Modern symmetric encryption -- Introduction to public-channel cryptography -- Public-channel cryptography -- Error detecting and correcting codes -- Modern cryptography -- Primality testing and factorization -- Solutions to selected problems.
520			_aHow quickly can you compute the remainder when dividing 109837⁹⁷ by 120143? Why would you even want to compute this? And what does this have to do with cryptography? Modern cryptography lies at the intersection of mathematics and computer sciences, involving number theory, algebra, computational complexity, fast algorithms, and even quantum mechanics. Many people think of codes in terms of spies, but in the information age, highly mathematical codes are used every day by almost everyone, whether at the bank ATM, at the grocery checkout, or at the keyboard when you access your email or purchase products online. This book provides a historical and mathematical tour of cryptography, from classical ciphers to quantum cryptography. The authors introduce just enough mathematics to explore modern encryption methods, with nothing more than basic algebra and some elementary number theory being necessary. Complete expositions are given of the classical ciphers and the attacks on them, along with a detailed description of the famous Enigma system. The public-key system RSA is described, including a complete mathematical proof that it works. Numerous related topics are covered, such as efficiencies of algorithms, detecting and correcting errors, primality testing and digital signatures. The topics and exposition are carefully chosen to highlight mathematical thinking and problem solving. Each chapter ends with a collection of problems, ranging from straightforward applications to more challenging problems that introduce advanced topics. Unlike many books in the field, this book is aimed at a general liberal arts student, but without losing mathematical completeness
650			_aCryptography
655			_aData encryption (Computer science)
700			_aSteven J Miller
942			_cBOOK