Cryptography : theory and practice / Douglas R. Stinson.

Format:

Book

Author/Creator:

Stinson, Douglas R. (Douglas Robert), 1956-

Contributor:

Alumni and Friends Memorial Book Fund.

Language:

English

Subjects (All):

Coding theory.

Cryptography.

Physical Description:

339 pages : illustrations ; 25 cm

Edition:

Second edition.

Place of Publication:

Boca Raton : Chapman & Hall/CRC, [2002]

Summary:

Major advances over the last five years precipitated this major revision of the bestselling Cryptography: Theory and Practice. With more than 40 percent new or updated material, the second edition now provides an even more comprehensive treatment of modern cryptography. It focuses on the new Advanced Encryption Standards and features an entirely new chapter on that subject. Another new chapter explores the applications of secret sharing schemes, including ramp schemes, visual cryptography, threshold cryptography, and broadcast encryption. This is an ideal introductory text for both computer science and mathematics students and a valuable reference for professionals.

Contents:

1 Classical Cryptography 1

1.1 Introduction: Some Simple Cryptosystems 1

1.1.1 The Shift Cipher 3

1.1.2 The Substitution Cipher 7

1.1.3 The Affine Cipher 8

1.1.4 The Vigenere Cipher 12

1.1.5 The Hill Cipher 13

1.1.6 The Permutation Cipher 18

1.1.7 Stream Ciphers 20

1.2 Cryptanalysis 25

1.2.1 Cryptanalysis of the Affine Cipher 27

1.2.2 Cryptanalysis of the Substitution Cipher 28

1.2.3 Cryptanalysis of the Vigenere Cipher 31

1.2.4 Cryptanalysis of the Hill Cipher 34

1.2.5 Cryptanalysis of the LFSR Stream Cipher 36

2 Shannon's Theory 45

2.2 Elementary Probability Theory 46

2.3 Perfect Secrecy 48

2.4 Entropy 54

2.4.1 Huffman Encodings 56

2.5 Properties of Entropy 59

2.6 Spurious Keys and Unicity Distance 62

2.7 Product Cryptosystems 67

3 Block Ciphers and the Advanced Encryption Standard 73

3.2 Substitution-Permutation Networks 74

3.3 Linear Cryptanalysis 79

3.3.1 The Piling-up Lemma 80

3.3.2 Linear Approximations of S-boxes 82

3.3.3 A Linear Attack on an SPN 85

3.4 Differential Cryptanalysis 89

3.5 The Data Encryption Standard 95

3.5.1 Description of DES 95

3.5.2 Analysis of DES 100

3.6 The Advanced Encryption Standard 102

3.6.1 Description of AES 103

3.6.2 Analysis of AES 108

3.7 Modes of Operation 109

4 Cryptographic Hash Functions 117

4.1 Hash Functions and Data Integrity 117

4.2 Security of Hash Functions 119

4.2.1 The Random Oracle Model 120

4.2.2 Algorithms in the Random Oracle Model 121

4.2.3 Comparison of Security Criteria 125

4.3 Interated Hash Functions 127

4.3.1 The Merkle-Damgard Construction 128

4.3.2 The Secure Hash Algorithm 133

4.4 Message Authentication Codes 136

4.4.1 Nested MACs and HMAC 138

4.4.2 CBC-MAC 140

4.5 Unconditionally Secure MACs 141

4.5.1 Strongly Universal Hash Families 144

4.5.2 Optimality of Deception Probabilities 146

5 The RSA Cryptosystem and Factoring Integers 155

5.1 Introduction to Public-key Cryptography 155

5.2 More Number Theory 157

5.2.1 The Euclidean Algorithm 157

5.2.2 The Chinese Remainder Theorem 162

5.3 The RSA Cryptosystem 167

5.3.1 Implementing RSA 168

5.4 Primality Testing 171

5.5 Square Roots Modulo n 181

5.6 Factoring Algorithms 182

5.6.1 The Pollard p

1 Algorithm 182

5.6.2 The Pollard Rho Algorithm 184

5.6.3 Dixon's Random Squares Algorithm 187

5.6.4 Factoring Algorithms in Practice 192

5.7 Other Attacks on RSA 194

5.7.1 Computing [phi](n) 194

5.7.2 The Decryption Exponent 195

5.7.3 Wiener's Low Decryption Exponent Attack 200

5.8 The Rabin Cryptosystem 204

5.8.1 Security of the Rabin Cryptosystem 206

5.9 Semantic Security of RSA 208

5.9.1 Partial Information Concerning Plaintext Bits 209

5.9.2 Optimal Asymmetric Encryption Padding 212

6 Public-key Cryptosystems Based on the Discrete Logarithm Problem 226

6.1 The ElGamal Cryptosystem 226

6.2 Algorithms for the Discrete Logarithm Problem 228

6.2.1 Shank's Algorithm 229

6.2.2 The Pollard Rho Discrete Logarithm Algorithm 231

6.2.3 The Pohlig-Hellman Algorithm 234

6.2.4 The Index Calculus Method 237

6.3 Lower Bounds on the Complexity of Generic Algorithms 239

6.4 Finite Fields 243

6.5 Elliptic Curves 247

6.5.1 Elliptic Curves over the Reals 247

6.5.2 Elliptic Curves Modulo a Prime 250

6.5.3 Properties of Elliptic Curves 254

6.5.4 Point Compression and the ECIES 255

6.5.5 Computing Point Multiples on Elliptic Curves 257

6.6 Discrete Logarithm Algorithms in Practice 259

6.7 Security of ElGamal Systems 261

6.7.1 Bit Security of Discrete Logarithms 261

6.7.2 Semantic Security of ElGamal Systems 264

6.7.3 The Diffie-Hellman Problems 265

7 Signature Schemes 274

7.2 Security Requirements for Signature Schemes 277

7.2.1 Signatures and Hash Functions 279

7.3 The ElGamal Signature Scheme 280

7.3.1 Security of the ElGamal Signature Scheme 282

7.4 Variants of the ElGamal Signature Scheme 286

7.4.1 The Schnorr Signature Scheme 286

7.4.2 The Digital Signature Algorithm 288

7.4.3 The Elliptic Curve DSA 291

7.5 Provably Secure Signature Schemes 292

7.5.1 One-time Signatures 292

7.5.2 Full Domain Hash 297

7.6 Undeniable Signatures 300

7.7 Fail-stop Signatures 305.

Notes:

Includes bibliographical references (pages 317-330) and indexes.

Local Notes:

Acquired for the Penn Libraries with assistance from the Alumni and Friends Memorial Book Fund.

ISBN:

1584882069

OCLC:

48803500