opac header image
Image from Google Jackets
Image from Coce

Cryptology and error correction : an algebraic introduction and real-world applications

By: Childs, Lindsay NMaterial type: TextTextSeries: Springer undergraduate texts in mathematics and technologyPublication details: Cham, Switzerland : Springer, 2019. Description: xiv, 351 pages : illustrations (some color)ISBN: 9783030154516Subject(s): Algebra | Cryptography | Cryptology | Data encryption (Computer science) | Number theory | Caeser ciphers | Chinese remainder theorem | El Gamal cryptography | Luhn's formula | Lagrange's theoremDDC classification: 003.26:512 Online resources: Table of content | Reviews Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)

Includes bibliographical references and index.

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.

There are no comments on this title.

to post a comment.
© 2025 Copyright: Customised and Maintained by Central Library NISER

Central Library, NISER Library Building, PO-Jatni, Khurda, Odisha - 752050, India | Email: libniser@niser.ac.in Phone: +91-674-2494171

Powered by Koha