Advertisement

Cryptology and Error Correction

An Algebraic Introduction and Real-World Applications

  • Lindsay N. Childs

Table of contents

  1. Front Matter
    Pages i-xiv
  2. Lindsay N. Childs
    Pages 1-11
  3. Lindsay N. Childs
    Pages 13-26
  4. Lindsay N. Childs
    Pages 27-49
  5. Lindsay N. Childs
    Pages 51-64
  6. Lindsay N. Childs
    Pages 65-82
  7. Lindsay N. Childs
    Pages 83-91
  8. Lindsay N. Childs
    Pages 93-115
  9. Lindsay N. Childs
    Pages 117-133
  10. Lindsay N. Childs
    Pages 135-151
  11. Lindsay N. Childs
    Pages 153-169
  12. Lindsay N. Childs
    Pages 171-193
  13. Lindsay N. Childs
    Pages 195-213
  14. Lindsay N. Childs
    Pages 215-239
  15. Lindsay N. Childs
    Pages 241-257
  16. Lindsay N. Childs
    Pages 259-272
  17. Lindsay N. Childs
    Pages 273-292
  18. Lindsay N. Childs
    Pages 293-312
  19. Lindsay N. Childs
    Pages 313-330
  20. Lindsay N. Childs
    Pages 331-342
  21. Back Matter
    Pages 343-351

About this book

Introduction

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, Diffie–Hellman, and Blum–Goldwasser cryptosystems and Hamming and Reed–Solomon 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 algebra—rings, 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.

Keywords

Caeser ciphers Chinese Remainder Theorem El Gamal cryptography Lagrange's Theorem Luhn's formula Vernam cipher

Authors and affiliations

  • Lindsay N. Childs
    • 1
  1. 1.Department of Mathematics and StatisticsUniversity at Albany, State University of New YorkAlbanyUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-030-15453-0
  • Copyright Information Springer Nature Switzerland AG 2019
  • Publisher Name Springer, Cham
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-030-15451-6
  • Online ISBN 978-3-030-15453-0
  • Series Print ISSN 1867-5506
  • Series Online ISSN 1867-5514
  • Buy this book on publisher's site