The mathematics of encryption : an elementary introduction
 Responsibility
 Margaret Cozzens, Steven J. Miller.
 Publication
 Providence, Rhode Island : American Mathematical Society, [2013]
 Physical description
 xvii, 332 pages ; 26 cm.
 Series
 Mathematical world ; v. 29.
Access
Available online
Science Library (Li and Ma)
Stacks
Call number  Status 

QA268 .C697 2013  Unknown 
More options
Creators/Contributors
 Author/Creator
 Cozzens, Margaret B.
 Contributor
 Miller, Steven J., 1974
Contents/Summary
 Bibliography
 Includes bibliographical references and index.
 Contents

 Historical introduction Classical cryptology: Methods Enigma and Ultra Classical cryptography: Attacks I Classical cryptography: Attacks II Modern symmetric encryption Introduction to publicchannel cryptography Publicchannel cryptography Error detecting and correcting codes Modern cryptography Primality testing and factorization Solutions to selected exercises Bibliography Index.
 (source: Nielsen Book Data)9780821883211 20160612
 Publisher's Summary
 How quickly can you compute the remainder when dividing $109837^{97}$ 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 publickey 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.
(source: Nielsen Book Data)9780821883211 20160612
Subjects
Bibliographic information
 Publication date
 2013
 Series
 Mathematical world ; volume 29
 ISBN
 9780821883211 (alk. paper)
 0821883216 (alk. paper)