Unformatted text preview: sack, 466 Chosenciphertext attack, 6–7, 471–472 Chosenkey attack, 7 Chosenplaintext attack, 6–7, 359 Chosentext attack, 7 Cipher: substitution, 10–12 transposition, 12 Cipher block chaining mode, 193–197, 208–210 DES, 277–278 error extension, 196 error propagation, 195–196 initialization vector, 194 message authentication codes, 456 padding, 195 security, 196–197 selfrecovering, 196 triple encryption, 360–361 Cipher block chaining of plaintext difference mode, 208 Cipher block chaining with checksum, 207–208 Cipherfeedback mode, 200–202, 208–210 DES, 277 error propagation, 201–202 initialization vector, 201 Cipher mode: choosing, 208–210 summary, 208–210 Ciphertext, 1–2 auto key, 198 hiding in ciphertext, 227–228 pairs, differential cryptanalysis, 285 stealing, 191 Ciphertextonly attack, 5–6 Cleartext, see Plaintext Clipper chip, 591–593 Clipper keyescrow, 328 Clipper phone, 594 Clockcontrolled generators, 381 Clocking, 381 CoCom, 610 Code, 9 Coefficients, solving for, 248 Coin flipping, 89–92 fair, 541–543 into a well, 92 key generation, 92 using Blum integers, 543 using oneway functions, 90 using publickey cryptography, 90–91 using square roots, 541–542 Collision, 166 Collisionfree, 30 Collisionresistance, 429 Combination generator, 381 Combining function, 381 Commercial COMSEC Endorsement Program, 269, 598–599 Commercial Data Masking Facility, 366, 574 Common Cryptographic Architecture, 573–574 Common modulus, dangers of, 493 Common modulus attack, RSA, 472 Communications: using publickey cryptography, 31–34 using symmetric cryptography, 28–29 Communications channels, encryption, 216–220 Communications Setup, 517–518 Complementation property, 281 Complement keys, DES, 281–282 Completely blind signatures, 112–113 Complete set of residues, 242 Complexitytheoretic approach, stream ciphers, 415–418 Complexity theory, 237–242 algorithms, 237–239 complexity of problems, 239–241 Compression, 226 Compression function, 431 Compression permutation, 273–274 Compromise, 5 Compromised keys, 182–183 Computational complexity, 237 Computationally secure, 8 Computer algorithms, 17 Computer clock, as randomsequence generator, 424 Computer Security Act of 1987, 600–601 Computing, with encrypted data, 85–86, 540–541 COMSET, 517–518 Conditional Access for Europe, 606–607 Conference key distribution, 524 Confusion, 237, 346–347 Congruent, 242 Connection integer, 403 feed...
View
Full Document
 Fall '10
 ALIULGER
 Cryptography, Bruce Schneier, Applied Cryptography, EarthWeb, Search Search Tips

Click to edit the document details