This book is about relations between three different areas of mathematics and theoretical computer science: combinatorial group theory, cryptography, and complexity theory. It explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in pu
Group Theoretic Cryptography
✍ Scribed by Maria Isabel Vasco, Spyros Magliveras, Rainer Steinwandt
- Publisher
- Chapman and Hall/CRC
- Year
- 2015
- Tongue
- English
- Leaves
- 244
- Series
- Chapman & Hall/CRC Cryptography and Network Security Series
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
Group theoretic problems appear to be the most promising source of hard computational problems for deploying new cryptographic constructions. This reference focuses on the specifics of using nonabelian groups in the field of cryptography. It provides an introduction to cryptography (mostly asymmetric) with a focus on group theoretic constructions, making it the first book to use this approach. The authors include all of the needed cryptographic and group theoretic concepts. They supply exercises at the end of each chapter, selected solutions in the back of the book, and suggestions for student projects that require the use of the computer or computer algebra systems.
✦ Subjects
Информатика и вычислительная техника;Информационная безопасность;Безопасность информационных систем и сетей;Безопасность информационных сетей;
📜 SIMILAR VOLUMES
This book offers a mathematical foundation for modern cryptography. It is primarily intended as an introduction for graduate students. Readers should have basic knowledge of probability theory, but familiarity with computational complexity is not required. Starting from Shannon's classic result on s
Algorithmic number theory is a rapidly developing branch of number theory, which, in addition to its mathematical importance, has substantial applications in computer science and cryptography. Among the algorithms used in cryptography, the following are especially important: algorithms for primality