.

0 (hodnocen0 x )

(1) Půjčeno:1x 

BK

2nd ed.

New York : John Wiley & Sons, 1996

xxiii,758 s.

ISBN 0-471-11709-9 (brož.)

Obsahuje bibliografii na s. 675-741 a rejstřík

Kryptografie - učebnice vysokošk.

000005024

PART I CRYPTOGRAPHIC PROTOCOLS // 2.8 Random and Pseudo-Random-Sequence Generation 44 // 2.4 One-Way Hash Functions 30 // 2.5 Communications Using Public-Key Cryptography 31 // 2.6 Digital Signatures 34 // 1.1 Terminology 1 // 1.2 Steganography 9 // 1.3 Substitution Ciphers and Transposition Ciphers 10 // Foreword by Whitfield Diffie xv // Preface xix // How to Read this Book xx // Acknowledgments xxii // About the Author xxiii // 2 PROTOCOL BUILDING BLOCKS 21 // 2.1 Introduction to Protocols 21 // 2.2 COMMUNICATIONS USING SYMMETRIC Cryptography 28 // 3 BASIC PROTOCOLS 47 // 3.1 Key Exchange 47 // 3.2 Authentication 52 // 3.3 Authentication and Key Exchange 56 // 3.4 Formal Analysis of Authentication and Key-Exchange Protocols 65 // 3.5 Multiple-Key Public-Key Cryptography 68 // 3.6 Secret Splitting 70 // 3.7 Secret Sharing 71 // 3.8 Cryptographic Protection of Databases 73 // 4 INTERMEDIATE PROTOCOLS 75 // 4.1 Timestamping Services 75 // 4.2 Subliminal Channel 79 // 4.3 Undeniable Digital Signatures 81 // 4.4 Designated Confirmer Signatures 82 // 4.5 PROXY Signatures 83 // 4.6 Group Signatures 84 // 4.7 Fail-Stop Digital Signatures 85 // 4.8 Computing with Encrypted Data 85 // 4.9 Bit Commitment 86 // 4.10 Fair Coin Flips 89 // 4.11 Mental Poker 92 // 4.12 One-Way Accumulators 95 // 4.13 All-Or-Nothing Disclosure OF Secrets 96 // 4.14 Key Escrow 97 // 5 ADVANCED PROTOCOLS 101 // 5.1 Zero-Knowledge Proofs 101 // 5.2 zero-knowledge Proofs of Identity 109 // 5.3 Blind Signatures 112 // 5.4 Identity-Based Public-Key Cryptography 115 // 5.5 Oblivious TRANSFER 116 // 5.6 Oblivious Signatures 117 // 5.7 Simultaneous CONTRACT SIGNING 118 // 5.8 Digital Certified Mail 122 // 5.9 Simultaneous Exchange of Secrets 123 // 6 ESOTERIC PROTOCOLS 125 // 6.1 SECURE Elections 125 // 6.2 Secure Multiparty Computation 134 // 6.3 Anonymous Message Broadcast 137 // 6.4 Digital Cash 139 //

PART II CRYPTOGRAPHIC TECHNIQUES // 7 KEY LENGTH 151 // 7.1 Symmetric Key Length 151 // 7.2 Public-Key Key Length 158 // 7.3 Comparing Symmetric and Public-Key Key Length 165 // 7 A Birthday Attacks against One-Way Hash Functions 165 // 7.5 How Long Should a Key Be? 166 // 7.6 CAVEAT Emptor 168 // 8 KEY MANAGEMENT 169 // 8.1 GENERATING Keys 170 // 8.2 Nonlinear Keyspaces 175 // 8.3 Transferring Keys 176 // 8.4 Verifying Keys 178 // 8.5 Using Keys 179 // 8.6 Updating Keys 180 // 8.7 Storing Keys 180 // 8.8 Backup Keys 181 // 8.9 Compromised Keys 182 // 8.10 Lifetime of Keys 183 // 8.11 Destroying Keys 184 // 8.12 PUBLIC-KEY KEY MANAGEMENT 185 // 9 ALGORITHM TYPES AND MODES 189 // 9.1 Electronic Codebook Mode 189 // 9.2 Block Replay 191 // 9.3 Cipher Block Chaining MODE 193 // 9.4 STREAM Ciphers 197 // 9.5 Self-Synchronizing STREAM Ciphers 198 // 9.6 Cipher-Feedback MODE 200 // 9.7 SYNCHRONOUS STREAM Ciphers 202 // 9.8 OUTPUT-FEEDBACK MODE 203 // 9.9 COUNTER MODE 205 // 9.10 Other Block-Cipher Modes 206 // 9.11 Choosing a CIPHER MODE 208 // 9.12 INTERLEAVING 210 // 9.13 Block Ciphers versus Stream Ciphers 210 // 10 USING ALGORITHMS 213 // 10.1 Choosing An Algorithm 214 // 10.2 Public-Key Cryptography versus Symmetric Cryptography 216 // 10.3 Encrypting Communications Channels 216 // 10.4 Encrypting Data for STORAGE 220 // 10.5 Hardware Encryption versus Software Encryption 223 // Contents // 10.6 Compression, Encoding, and Encryption 226 // 10.7 Detecting Encryption 226 // 10.8 Hiding Ciphertext IN Ciphertext 227 // 10.9 Destroying Information 228 // PART III CRYPTOGRAPHIC ALGORITHMS // 11 MATHEMATICAL BACKGROUND 233 // 11.1 Information Theory 233 // 11.2 Complexity Theory 237 // 11.3 Number Theory 242 // 11.4 Factoring 255 // 11.5 Prime Number Generation 258 // 11.6 Discrete Logarithms In a Finite Field 261 // 12 DATA ENCRYPTION STANDARD (DES) 265 //

12.1 Background 265 // 12.2 Description of DES 270 // 12.3 Security of DES 278 // 12.4 Differential and Linear Cryptanalysis 285 // 12.5 The REAL Design Criteria 293 // 12.6 DES Variants 294 // 12.7 How Secure Is DES Today? 300 // 13 OTHER BLOCK CIPHERS 303 // 13.1 Lucifer 303 // 13.2 Madryga 304 // 13.3 NewDES 306 // 13.4 FEAL 308 // 13.5 REDOC 311 // 13.6 LOKI 314 // 13.7 Khufu and Khafre 316 // 13.8 RC2 318 // 13.9 IDEA 319 // 13.10 MMB 325 // 13.11 CA-1.1 327 // 13.12 Skipjack 328 // 14 STILL OTHER BLOCK CIPHERS 331 // 14.1 GOST 331 // 14.2 CAST 334 // 14.3 Blowfish 336 // 14.4 SAFER 339 // 14.5 3-WAY 341 // 14.6 Crab 342 // 14.7 SXAL8/MBAL 344 // 14.8 RC5 344 // 14.9 Other Block Algorithms 346 // 14.10 Theory of Block Cipher Design 346 // 14.11 Using One-Way Hash Functions 351 // 14.12 Choosing a Block Algorithm 354 // 15 COMBINING BLOCK CIPHERS 357 // 15.1 Double Encryption 357 // 15.2 Triple Encryption 358 // 15.3 Doubling the Block Length 363 // 15.4 Other Multiple Encryption Schemes 363 // 15.5 CDMF Key Shortening 366 // 15.6 Whitening 366 // 15.7 Cascading Multiple Block Algorithms 367 // 15.8 Combining Multiple Block Algorithms 368 // 16 PSEUDO-RANDOM-SEQUENCE // GENERATORS AND STREAM CIPHERS 369 // 16.1 Linear Congruential Generators 369 // 16.2 Linear Feedback Shift Registers 372 // 16.3 Design and Analysis of Stream Ciphers 379 // 16.4 STREAM CIPHERS USING LFSRs 381 // 16.5 �5 389 // 16.6 Hughes XPD/KPD 389 // 16.7 Nanoteq 390 // 16.8 Rambutan 390 // 16.9 Additive Generators 390 // 16.10 Gifford 392 // 16.11 ALGORITHM M 393 // 16.12 PKZIP 394 // 17 OTHER STREAM CIPHERS AND REAL RANDOM-SEQUENCE GENERATORS 397 // 17.1 RC4 397 // 17.2 SEAL 398 // 17.3 WAKE 400 // 17.4 Feedback with Carry Shift Registers 402 // 17.5 STREAM CIPHERS USING FCSRs 405 // 17.6 Nonlinear-Feedback Shift Registers 412 // 17.7 OTHER STREAM Ciphers 413 //

17.8 System-Theoretic Approach to Stream-Cipher Design 415 // 17.9 Complexity-Thematic Approach to Stream-Cipher Design 416 // 17.10 Other Approaches to Stream-Cipher Design 418 // 17.11 Cascading Multiple Stream Ciphers 419 // 17.12 Choosing a Stream Cipher 420 // 17.13 Generating Multiple Streams from a // Single Pseudo-Random-Sequence Generator 420 // 17.14 Real Random-Sequence Generators 421 // 18 ONE-WAY HASH FUNCTIONS 429 // 18.1 BACKGROUND 429 // 18.2 Snefru 431 // 18.3 N-Hash 432 // 18.4 MD4 435 // 18.5 MD5 436 // 18.6 MD2 441 // 18.7 Secure Hash Algorithm (SHA) 441 // 18.8 RIPE-MD 445 // 18.9 HAVAL 445 // 18.10 Other One-Way Hash Functions 446 // 18.11 One-Way Hash Functions Using Symmetric Block Algorithms 446 // 18.12 Using Public-Key Algorithms 455 // 18.13 Choosing a One-Way Hash Function 455 // 18.14 Message Authentication Codes 455 // 19 PUBLIC-KEY ALGORITHMS 461 // 19.1 BACKGROUND 461 // 19.2 Knapsack Algorithms 462 // 19.3 RSA 466 // 19.4 Pohlig-Hellman 474 // 19.5 Rabin 475 // 19.6 ElGamal 476 // 19.7 McEliece 479 // 19.8 Elliptic Curve Cryptosystems 480 // 19.9 LUC 481 // 19.10 Finite Automaton Public-Key Cryptosystems 482 // 20 PUBLIC-KEY DIGITAL SIGNATURE ALGORITHMS 483 // 20.1 Digital Signature Algorithm (DSA) 483 // 20.2 DSA VARIANTS 494 // 20.3 GOST Digital Signature Algorithm 495 // 20.4 Discrete Logarithm SIGNATURE Schemes 496 // 20.5 Ong-Schnorr-Shamir 498 // 20.6 ESIGN 499 // 20.7 Cellular Automata 500 // 20.8 Other Public-Key Algorithms 500 // 21 IDENTIFICATION SCHEMES 503 // 21.1 Feige-Fiat-Shamir 503 // 21.2 Guillou-Quisquater 508 // 21.3 Schnorr 510 // 21.4 Converting Identification Schemes To Signature Schemes 512 // 22 KEY-EXCHANGE ALGORITHMS 513 // 22.1 Diffie-Hellman 513 // 22.2 Station-to-Station Protocol 516 // 22.3 Shamir’s Three-Pass Protocol 516 // 22.4 COMSET 517 // 22.5 encrypted Key Exchange 518 //

22.6 Fortified Key Negotiation 522 // 22.7 Conference Key Distribution and Secret Broadcasting 523 // 23 SPECIAL ALGORITHMS FOR PROTOCOLS 527 // 23.1 Multiple-Key Public-Key Cryptography 527 // 23.2 Secret-Sharing Algorithms 528 // 23.3 Subliminal Channel 531 // 23.4 Undeniable Digital Signatures 536 // 23.5 Designated Confirmer Signatures 539 // 23.6 Computing with Encrypted Data 540 // 23.7 Fair Coin Flips 541 // 23.8 One-Way Accumulators 543 // 23.9 All-or-Nothing Disclosure Of SECRETS 543 // 23.10 Fair and Failsafe Cryptosystems 546 // 23.11 Zero-Knowledge Proofs of KNOWLEDGE 548 // 23.12 BLIND SIGNATURES 549 // 23.13 Oblivious TRANSFER 550 // 23.14 Secure Multiparty Computation 551 // 23.15 Probabilistic Encryption 552 // 23.16 Quantum Cryptography 554 // PART IV THE REAL WORLD // 24 EXAMPLE IMPLEMENTATIONS 561 // 24.1 IBM Secret-Key MANAGEMENT Protocol 561 // 24.2 MITRENET 562 // 24.3 ISDN 563 // 24.4 STU-UI 565 // 24.5 Kerberos 566 // 24.6 KryptoKnight 571 // 24.7 SESAME 572 // 24.8 IBM Common Cryptographic Architecture 573 // 24.9 ISO AUTHENTICATION Framework 574 // 24.10 Privacy-Enhanced Mail (PEM) 577 // 24.11 Message Security Protocol (MSP) 584 // 24.12 Pretty Good Privacy (PGP) 584 // 24.13 Smart Cards 587 // 24.14 Public-Key Cryptography Standards (PKCS) 588 // 24.15 Universal Electronic Payment System (UEPS) 589 // 24.16 Clipper 591 // 24.17 Capstone 593 // 24.18 AT&T Model 3600 Telephone Security Device (TSD) 594 // 25 POLITICS 597 // 25.1 National Security Agency (NSA) 597 // 25.2 National Computer Security Center (NCSC) 599 // 25.3 National Institute of Standards and Technology (NIST) 600 // 25.4 RSA Data SECURITY, Inc. 603 // 25.5 Public Key PARTNERS 604 // 25.6 International Association for Cryptographic Research (IACR) 605 // 25.7 RACE Integrity Primitives Evaluation (RIPE) 605 //

25.8 Conditional Access for Europe (CAFE) 606 // 25.9 ISO/IEC 9979 607 // 25.10 Professional, Civil Liberties, and Industry Groups 608 // 25.11 Sci.crypt 608 // 25.12 Cypherpunks 609 // 25.13 PATENTS 609 // 25.14 U.S. EXPORT RULES 610 // 25.15 Foreign Import and Export of Cryptography 617 // 25.16 Legal Issues 618 // Afterword by Matt Blaze 619 // PART V SOURCE CODE // Source Code 623 // References 675