- Authors:
- Hans Delfs,
- Helmut Knebl
The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises. In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks. The third edition is a further substantive extension, with new topics added, including: elliptic curve cryptography; Paillier encryption; quantum cryptography; the new SHA-3 standard for cryptographic hash functions; a considerably extended section on electronic elections and Internet voting; mix nets; and zero-knowledge proofs of shuffles. The book is appropriate for undergraduate and graduate students in computer science, mathematics, and engineering.
Cited By
- Ghunaim T, Kamel I and Al Aghbari Z (2023). Secure kNN query of outsourced spatial data using two-cloud architecture, The Journal of Supercomputing, 79:18, (21310-21345), Online publication date: 1-Dec-2023.
- Xu F and Zeng H (2022). Cryptanalysis of Two Signature Schemes for IoT and Mobile Health Systems, Wireless Personal Communications: An International Journal, 122:3, (2035-2043), Online publication date: 1-Feb-2022.
- McMurtry E, Pereira O and Teague V When Is a Test Not a Proof? Computer Security – ESORICS 2020, (23-41)
Perera C, Qin Y, Estrella J, Reiff-Marganiec S and Vasilakos A (2017). Fog Computing for Sustainable Smart Cities, ACM Computing Surveys, 50:3, (1-43), Online publication date: 31-May-2018.
Index Terms
- Introduction to Cryptography: Principles and Applications
Recommendations
Reviews
Burkhard Englert
Cryptography is the foundation of any secure communication. It is essential for and enables e-commerce, the digitization of information, cloud computing, and the list goes on. Cryptography uses mathematical functions to scramble messages so that they become indistinguishable from random bit strings. To date, many cryptographic algorithms have been shown to be very effective, and they have become the backbone of modern computing. Also, cryptographic algorithms, because of their mathematical nature, can be proven to be correct; if implemented correctly, they are universally trusted. Delfs and Knebl in this book focus on the mathematical aspects of cryptography. They are not concerned with the implementation of its algorithms, but instead attempt to teach the user the mathematical background of cryptography and then to prove the correctness of its algorithms. Because of its purely theoretical focus, I believe that this book is best suited for a graduate course in mathematics. The book is organized in two parts. The first part has 11 chapters that cover the following topics: symmetric key cryptography, public-key cryptography, general cryptographic protocols, probabilistic algorithms, one-way functions, bit-security of one-way functions and pseudorandomness, provably secure encryption, unconditional security of cryptosystems, and provable secure digital signatures. This provides an overview over the main cryptographic algorithms and includes proofs of their correctness. The second part, the appendix, covers the mathematical background needed to understand the first part. Nevertheless, since the appendix with its mathematical theorems is separate from the rest of the book, a reader with little mathematical background would have to continuously go back and forth, making it very hard to read this book. Because of this setup, I feel that this book is best suited for readers who already have the necessary background in number theory, abstract algebra, probability, and information theory. Since the appendix does not directly connect its material to the content of the main chapters, novice readers could become frustrated very easily. A mixed approach might have been better, where the mathematical background is covered just in time to explain a particular cryptographic algorithm. Because of this, I can really only recommend this book for readers with strong mathematical backgrounds who are interested in the foundations of the field. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.