# Algebra for Cryptologists

- 1 Mentions
- 20k Downloads

Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)

Advertisement

Textbook

- 1 Mentions
- 20k Downloads

Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)

This textbook provides an introduction to the mathematics on which modern cryptology is based. It covers not only public key cryptography, the glamorous component of modern cryptology, but also pays considerable attention to secret key cryptography, its workhorse in practice.

Modern cryptology has been described as the science of the integrity of information, covering all aspects like confidentiality, authenticity and non-repudiation and also including the protocols required for achieving these aims. In both theory and practice it requires notions and constructions from three major disciplines: computer science, electronic engineering and mathematics. Within mathematics, group theory, the theory of finite fields, and elementary number theory as well as some topics not normally covered in courses in algebra, such as the theory of Boolean functions and Shannon theory, are involved.Although essentially self-contained, a degree of mathematical maturity on the part of the reader is assumed, corresponding to his or her background in computer science or engineering. *Algebra for Cryptologists* is a textbook for an introductory course in cryptography or an upper undergraduate course in algebra, or for self-study in preparation for postgraduate study in cryptology.

Algebra Cryptology Symmetric cryptography Asymmetric cryptography Secret key cryptography Public key cryptography Number theory Finite fields Boolean functions Stream ciphers Block ciphers

- DOI https://doi.org/10.1007/978-3-319-30396-3
- Copyright Information Springer International Publishing Switzerland 2016
- Publisher Name Springer, Cham
- eBook Packages Mathematics and Statistics Mathematics and Statistics (R0)
- Print ISBN 978-3-319-30395-6
- Online ISBN 978-3-319-30396-3
- Series Print ISSN 1867-5506
- Series Online ISSN 1867-5514
- Buy this book on publisher's site