Introduction to cryptography principles and applications / [electronic resource] :
- 作者： Delfs, Hans.
- 其他作者：
- 其他題名：
- Information security and cryptography
- 出版： Berlin, Heidelberg : Springer Berlin Heidelberg :Imprint: Springer
- 版本：3rd ed.
- 叢書名： Information security and cryptography
- 主題： Computer security , Cryptography , Computer networks--Security measures , Coding theory , Computer science , Data Structures, Cryptology and Information Theory. , Number theory , Systems and Data Security. , Mathematics of Computing.
- ISBN： 9783662479742 (electronic bk.) 、 9783662479735 (paper)
-
FIND@SFXID:
CGU
- 資料類型: 電子書
- 內容註: 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 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.
-
讀者標籤：
- 系統號： 005136985 | 機讀編目格式
館藏資訊
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.