Introduction to cryptography : principles and applications

Library	Item Barcode	Call Number	Material Type	Item Category 1	Status
Searching... PSZ JB	30000010141951	QA76.9.A25 D44 2007	Open Access Book	Book	Searching... Unknown
Searching... Razak School	30000010160755	QA76.9.A25 D44 2007	Open Access Book	Book	Searching... Unknown

Due to the rapid growth of digital communication and electronic data exchange, information security has become a crucial issue in industry, business, and administration. Modern cryptography provides essential techniques for securing information and protecting data.

In the first part, 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.

The second edition contains corrections, revisions and new material, including a complete description of the AES, an extended section on cryptographic hash functions, a new section on random oracle proofs, and a new section on public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks.

Reviews 1

Choice Review

This new edition of Introduction to Cryptography (2nd ed., 2007; 1st ed., 2002) provides a fully modern view of the cipher systems in operation today. The book has several new inclusions over its previous editions including the SHA-3 algorithm for hashing and ElGamal encryption. Along with the new algorithms, the volume contains a deep history of the mathematical artistry that has been required to increase the security of information exchange. Delfs and Knebl (both, Technische Hochschule Nürnberg, Germany) delve deeply into the mathematics behind encryption, but not excessively given the subject matter and the knowledge needed by practitioners in the field. Readers must have a background in calculus to comfortably navigate the examples given. The explanations are primarily around the application of the algorithm and not the math behind it. 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, part of the "Information Security and Cryptography" series, offers an excellent view of the current state of cryptography. Summing Up: Highly recommended. Graduate students, researchers/faculty, and professionals/practitioners. --Theodor Dan Richardson, South University

1 Introduction	p. 1
1.1 Encryption and Secrecy	p. 1
1.2 The Objectives of Cryptography	p. 2
1.3 Attacks	p. 4
1.4 Cryptographic Protocols	p. 5
1.5 Provable Security	p. 6
2 Symmetric-Key Encryption	p. 11
2.1 Stream Ciphers	p. 12
2.2 Block Ciphers	p. 15
2.2.1 DES	p. 16
2.2.2 AES	p. 19
2.2.3 Modes of Operation	p. 25
3 Public-Key Cryptography	p. 33
3.1 The Concept of Public-Key Cryptography	p. 33
3.2 Modular Arithmetic	p. 35
3.2.1 The Integers	p. 35
3.2.2 The Integers Modulo n	p. 37
3.3 RSA	p. 41
3.3.1 Key Generation and Encryption	p. 41
3.3.2 Digital Signatures	p. 45
3.3.3 Attacks Against RSA	p. 46
3.3.4 Probabilistic RSA Encryption	p. 51
3.4 Cryptographic Hash Functions	p. 54
3.4.1 Security Requirements for Hash Functions	p. 54
3.4.2 Construction of Hash Functions	p. 56
3.4.3 Data Integrity and Message Authentication	p. 62
3.4.4 Hash Functions as Random Functions	p. 64
3.4.5 Signatures with Hash Functions	p. 65
3.5 The Discrete Logarithm	p. 70
3.5.1 ElGamal's Encryption	p. 70
3.5.2 ElGamal's Signature Scheme	p. 72
3.5.3 Digital Signature Algorithm	p. 73
3.6 Modular Squaring	p. 76
3.6.1 Rabin's Encryption	p. 76
3.6.2 Rabin's Signature Scheme	p. 77
4 Cryptographic Protocols	p. 81
4.1 Key Exchange and Entity Authentication	p. 81
4.1.1 Kerberos	p. 82
4.1.2 Diffie-Hellman Key Agreement	p. 85
4.1.3 Key Exchange and Mutual Authentication	p. 86
4.1.4 Station-to-Station Protocol	p. 88
4.1.5 Public-Key Management Techniques	p. 89
4.2 Identification Schemes	p. 91
4.2.1 Interactive Proof Systems	p. 91
4.2.2 Simplified Fiat-Shamir Identification Scheme	p. 93
4.2.3 Zero-Knowledge	p. 95
4.2.4 Fiat-Shamir Identification Scheme	p. 97
4.2.5 Fiat-Shamir Signature Scheme	p. 99
4.3 Commitment Schemes	p. 100
4.3.1 A Commitment Scheme Based on Quadratic Residues	p. 101
4.3.2 A Commitment Scheme Based on Discrete Logarithms	p. 102
4.3.3 Homomorphic Commitments	p. 103
4.4 Electronic Elections	p. 104
4.4.1 Secret Sharing	p. 105
4.4.2 A Multi-Authority Election Scheme	p. 107
4.4.3 Proofs of Knowledge	p. 110
4.4.4 Non-Interactive Proofs of Knowledge	p. 112
4.4.5 Extension to Multi-Way Elections	p. 112
4.4.6 Eliminating the Trusted Center	p. 113
4.5 Digital Cash	p. 115
4.5.1 Blindly Issued Proofs	p. 117
4.5.2 A Fair Electronic Cash System	p. 123
4.5.3 Underlying Problems	p. 128
5 Probabilistic Algorithms	p. 135
5.1 Coin-Tossing Algorithms	p. 135
5.2 Monte Carlo and Las Vegas Algorithms	p. 140
6 One-Way Functions and the Basic Assumptions	p. 147
6.1 A Notation for Probabilities	p. 148
6.2 Discrete Exponential Function	p. 149
6.3 Uniform Sampling Algorithms	p. 155
6.4 Modular Powers	p. 158
6.5 Modular Squaring	p. 161
6.6 Quadratic Residuosity Property	p. 162
6.7 Formal Definition of One-Way Functions	p. 163
6.8 Hard-Core Predicates	p. 167
7 Bit Security of One-Way Functions	p. 175
7.1 Bit Security of the Exp Family	p. 175
7.2 Bit Security of the RSA Family	p. 182
7.3 Bit Security of the Square Family	p. 190
8 One-Way Functions and Pseudorandomness	p. 199
8.1 Computationally Perfect Pseudorandom Bit Generators	p. 199
8.2 Yao's Theorem	p. 207
9 Provably Secure Encryption	p. 215
9.1 Classical Information-Theoretic Security	p. 216
9.2 Perfect Secrecy and Probabilistic Attacks	p. 220
9.3 Public-Key One-Time Pads	p. 224
9.4 Passive Eavesdroppers	p. 226
9.5 Chosen-Ciphertext Attacks	p. 233
9.5.1 A Security Proof in the Random Oracle Model	p. 236
9.5.2 Security Under Standard Assumptions	p. 245
9.6 Unconditional Security of Cryptosystems	p. 250
9.6.1 The Bounded Storage Model	p. 251
9.6.2 The Noisy Channel Model	p. 260
10 Provably Secure Digital Signatures	p. 265
10.1 Attacks and Levels of Security	p. 265
10.2 Claw-Free Pairs and Collision-Resistant Hash Functions	p. 268
10.3 Authentication-Tree-Based Signatures	p. 271
10.4 A State-Free Signature Scheme	p. 273
A Algebra and Number Theory	p. 289
A.1 The Integers	p. 289
A.2 Residues	p. 295
A.3 The Chinese Remainder Theorem	p. 299
A.4 Primitive Roots and the Discrete Logarithm	p. 301
A.5 Polynomials and Finite Fields	p. 304
A.5.1 The Ring of Polynomials	p. 305
A.5.2 Residue Class Rings	p. 307
A.5.3 Finite Fields	p. 308
A.6 Quadratic Residues	p. 310
A.7 Modular Square Roots	p. 315
A.8 Primes and Primality Tests	p. 319
B Probabilities and Information Theory	p. 325
B.1 Finite Probability Spaces and Random Variables	p. 325
B.2 The Weak Law of Large Numbers	p. 333
B.3 Distance Measures	p. 336
B.4 Basic Concepts of Information Theory	p. 340
References	p. 349
Index	p. 361

Available:*

On Order

Summary

Summary

Reviews 1

Choice Review

Table of Contents