New edition of successful cryptography textbook
Describes SHA-3 standard for cryptographic hash functions (Keccak), elliptic curve cryptosystems, and quantum cryptography
Suitable for undergraduate and graduate courses in cryptography
New edition of successful cryptography textbook
Describes SHA-3 standard for cryptographic hash functions (Keccak), elliptic curve cryptosystems, and quantum cryptography
Suitable for undergraduate and graduate courses in cryptography
Prof. Dr. Hans Delfs is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, database design, and software architectures.
Prof. Dr. Helmut Knebl is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, algorithms, and theoretical computer science.
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 deillegalscription 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.
Introduction.- Symmetric-Key Encryption.- Public-Key Cryptography.- Cryptographic Protocols.- Probabilistic Algorithms.- One-Way Functions and the Basic Assumptions.- Bit Security of One-Way Functions.- One-Way Functions and Pseudorandomness.- Provably Secure Encryption.- Unconditional Security of Cryptosystems.- Provably Secure Digital Signatures.- App. A, Algebra and Number Theory.- App. B, Probabilities and Information Theory.- References.- Index.
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 deillegalscription 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.
"The book has several new inclusions over its previous editions including the SHA-3 algorithm for hashing and ElGamal encryption. ... The authors also include a textual context for each of the ciphers and hashing algorithms with both historical significance and potential application, which makes this an excellent reference book for graduate-level learners, researchers, and professionals. Overall, this work ... offers an excellent view of the current state of cryptography. ... Summing Up: Highly recommended. Graduate students, researchers/faculty, and professionals/practitioners.” (T. D. Richardson, Choice, Vol. 53 (11), July, 2016)
"This is a thorough introductory text on cryptography from an engineering viewpoint. It provides a good overview of the whole subject, including secret-key (`symmetric´) and public-key methods, hash functions, and signing. There´s a 90-page appendix that summarizes the mathematics needed (mostly number theory, with some abstract algebra and probability). The book is well-written and easy to follow.” (Allen Stenger, MAA Reviews, maa.org, April, 2016)
"Delfs and Knebl in this book focus on the mathematical aspects of cryptography. ... this book is best suited for a graduate course in mathematics. ... recommend this book for readers with strong mathematical backgrounds who are interested in the foundations of the field.” (Burkhard Englert, Computing Reviews, March, 2016)
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 deillegalscription 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.
Introduction.- Symmetric-Key Encryption.- Public-Key Cryptography.- Cryptographic Protocols.- Probabilistic Algorithms.- One-Way Functions and the Basic Assumptions.- Bit Security of One-Way Functions.- One-Way Functions and Pseudorandomness.- Provably Secure Encryption.- Unconditional Security of Cryptosystems.- Provably Secure Digital Signatures.- App. A, Algebra and Number Theory.- App. B, Probabilities and Information Theory.- References.- Index.
"The book has several new inclusions over its previous editions including the SHA-3 algorithm for hashing and ElGamal encryption. ... The authors also include a textual context for each of the ciphers and hashing algorithms with both historical significance and potential application, which makes this an excellent reference book for graduate-level learners, researchers, and professionals. Overall, this work ... offers an excellent view of the current state of cryptography. ... Summing Up: Highly recommended. Graduate students, researchers/faculty, and professionals/practitioners." (T. D. Richardson, Choice, Vol. 53 (11), July, 2016)
"This is a thorough introductory text on cryptography from an engineering viewpoint. It provides a good overview of the whole subject, including secret-key ('symmetric') and public-key methods, hash functions, and signing. There's a 90-page appendix that summarizes the mathematics needed (mostly number theory, with some abstract algebra and probability).The book is well-written and easy to follow." (Allen Stenger, MAA Reviews, maa.org, April, 2016)
"Delfs and Knebl in this book focus on the mathematical aspects of cryptography. ... this book is best suited for a graduate course in mathematics. ... recommend this book for readers with strong mathematical backgrounds who are interested in the foundations of the field." (Burkhard Englert, Computing Reviews, March, 2016)
Prof. Dr. Hans Delfs is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, database design, and software architectures.
Prof. Dr. Helmut Knebl is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, algorithms, and theoretical computer science.
Über den Autor
Prof. Dr. Hans Delfs is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, database design, and software architectures.
Prof. Dr. Helmut Knebl is a member of the Dept. of Computer Science at the Technische Hochschule Nürnberg Georg Simon Ohm. His research and teaching interests include cryptography and information security, algorithms, and theoretical computer science.
Inhaltsverzeichnis
Introduction.- Symmetric-Key Encryption.- Public-Key Cryptography.- Cryptographic Protocols.- Probabilistic Algorithms.- One-Way Functions and the Basic Assumptions.- Bit Security of One-Way Functions.- One-Way Functions and Pseudorandomness.- Provably Secure Encryption.- Unconditional Security of Cryptosystems.- Provably Secure Digital Signatures.- App. A, Algebra and Number Theory.- App. B, Probabilities and Information Theory.- References.- Index.
Klappentext
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 deillegalscription 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.
New edition of successful cryptography textbook
Describes SHA-3 standard for cryptographic hash functions (Keccak), elliptic curve cryptosystems, and quantum cryptography
Suitable for undergraduate and graduate courses in cryptography
