This text presents a careful introduction to methods of cryptology and error correction in wide use throughout the world and the concepts of abstract algebra and number theory that are essential for understanding these methods. The objective is to provide a thorough understanding of RSA, DiffieHellman, and BlumGoldwasser cryptosystems and Hamming and ReedSolomon error correction: how they are constructed, how they are made to work efficiently, and also how they can be attacked. To reach that level of understanding requires and motivates many ideas found in a first course in abstract algebrarings, fields, finite abelian groups, basic theory of numbers, computational number theory, homomorphisms, ideals, and cosets. Those who complete this book will have gained a solid mathematical foundation for more specialized applied courses on cryptology or error correction, and should also be well prepared, both in concepts and in motivation, to pursue more advanced study in algebra and number theory. This text is suitable for classroom or online use or for independent study. Aimed at students in mathematics, computer science, and engineering, the prerequisite includes one or two years of a standard calculus sequence. Ideally the reader will also take a concurrent course in linear algebra or elementary matrix theory. A solutions manual for the 400 exercises in the book is available to instructors who adopt the text for their course.

Exercises in each chapter are real-world application based Provides solid mathematical preparation for more specialized applied courses on cryptography/error correction Presents some of the remarkable strategies for dealing with information in the computer age and the basic algebraic ideas behind those strategies Solutions manual is available to instructors who adopt the text for their course Request lecturer material: sn.pub/lecturer-material

Autorentext
Lindsay N. Childs is Professor Emeritus at the University of Albany where he earned recognition as a much-loved mentor of students, and as an expert in Galois field theory. Capping his tenure at Albany, he was named a Collins Fellow for his extraordinary devotion to the University at Albany and the people in it over a sustained period of time. Post University of Albany, Professor Childs has taught a sequence of online courses whose content evolved into this book. Lindsay Childs is author of A Concrete Introduction to Higher Algebra , published in Springer's Undergraduate Texts in Mathematics series, as well as a monograph, Taming Wild Extensions: Hopf Algebras and Local Galois Module Theory (American Mathematical Society), and more than 60 research publications in abstract algebra.

Inhalt
Preface.- 1. Secure, Reliable Information.- 2. Modular Arithmetic.- 3. Linear Equations Modulo m.- 4. Unique Factorization in Z.- 5. Rings and Fields.- 6. Polynomials.- 7. Matrices and Hamming Codes.- 8. Orders and Euler's theorem.- 9. RSA Cryptography and Prime Numbers.- 10. Groups, Cosets, and Lagrange's theorem.- 11. Solving Systems of Congruences.- 12. Homomorphisms and Euler's Phi function.- 13. Cyclic Groups and Cryptography.- 14. Applications of Cosets.- 15. An Introduction to ReedSolomon codes.- 16. BlumGoldwasser Cryptography.- 17. Factoring by the Quadratic Sieve.- 18. Polynomials and Finite Fields.- 19. Reed-Solomon Codes II.- Bibliography.