book-index.html

Wiley - Applied Cryptography, Protocols, Algorthms, and Source Code in C

<DD>Memorandum of Understanding, 601&#150;603
<DD>S-box development role, 278, 280
</DL>
<DD>Navy Research Laboratory, protocol analyzer, 67&#150;68
<DD>Needham, Roger, 58, 66, 216
<DD>Needham-Schroeder protocol, 58&#150;59
<DD>Networks, large, key distribution, 177
<DD>Neuman-Stubblebine protocol, 60&#150;62
<DD>Neural networks, breaking algorithms, 155
<DD>NewDES, 306&#150;308
<DD><I>N</I>-Hash, 433&#150;435
<DD>Niederreiter, Harald, 501
<DD>Niederreiter algorithm, 480
<DD>Niemi cryptosystem, 466
<DD>Nobauer, Wilfried, 481
<DD>Noise, random, using as random-sequence generator, 423&#150;424
<DD>Nonce-verification rule, 66
<DD>Non-Interactive Key Sharing systems, 115
<DD>Nonlinear-feedback shift registers, 412&#150;413
<DD>Nonlinear keyspace, 175&#150;176
<DD>Nonrepudiation, 2
<DD>Notz, Bill, 266
<DD>NP-complete problem, 240&#150;242
<DL>
<DD>graph isomorphism, 104
<DD>knapsack algorithms, 462
<DD>McEliece algorithm, 479
<DD>solving, 163&#150;164
</DL>
<DD>NRL Protocol Analyzer, 67&#150;68
<DD>NSDD-145, 268
<DD>Nuclear Non-Proliferation Act, 610
<DD>Number field sieve, 256
<DD>Numbers:
<DL>
<DD>2&#150;adic, 404
<DD>large, 17&#150;18
</DL>
<DD>Number theory, 242&#150;255
<DL>
<DD>Barrett&#146;s algorithm, 244
<DD>Blum integers, 253
<DD>Chinese remainder theorem, 249&#150;250
<DD>Euclid&#146;s algorithm, 245
<DD>Euler totient function, 248&#150;249
<DD>extended Euclidean algorithm, 246&#150;248
<DD>Fermat&#146;s little theorem, 248
<DD>Galois field, computing in, 254&#150;255
<DD>generators, 253&#150;254
<DD>greatest common divisor, 245&#150;246
<DD>inverses modulo a number, 246&#150;248
<DD>Jacobi symbol, 252&#150;253
<DD>Legendre symbol, 251
<DD>modular arithmetic, 242&#150;245
<DD>Montgomery&#146;s method, 244
<DD>prime numbers, 245
<DD>quadratic residues, 250&#150;251
<DD>solving for coefficients, 248
</DL>
<DD>Nyberg, Kaisa, 348
<DD>Oblivious transfer, 116&#150;117, 550
<DD>Oblivous signatures, 117
<DD>OFB, <I>see</I> Output-feedback mode
<DD>Ohta, Kazuo, 146, 501
<DD>Ohta-Okamoto identification scheme, 508
<DD>Okamoto, Tatsuaki, 146, 501
<DD>1/p generator, 414
<DD>One-time pad, 15&#150;17
<DL>
<DD>hiding ciphertext in ciphertext, 227&#150;228
</DL>
<DD>One-time tape, 418
<DD>One-way accumulators, 95&#150;96, 543
<DD>One-way function, 29&#150;30
<DL>
<DD>authentication using, 52
<DD>bit commitment using, 87&#150;88
<DD>coin flipping using, 90
<DD>trap-door, 158
</DL>
<DD>One-way hash functions, 30&#150;31, 351&#150;354
<DL>
<DD>background, 429&#150;431
<DD>birthday attacks, 165&#150;166, 430
<DD>choosing, 455
<DD>cipher security, 353&#150;354
<DD>compression function, 431
<DD>encryption speeds, 456
<DD>HAVAL, 445&#150;446
<DD>improved arbitrated solution, 76
<DD>Karn, 351&#150;352
<DD>length, 430&#150;431
<DD>Luby-Rackoff, 352&#150;353
<DD>MD2, 441
<DD>MD3, 446
<DD>MD4, 435&#150;436
<DD>MD5, 436&#150;441
<DD>MD-strengthening, 431
<DD>message authentication codes, 455&#150;459
<DD>Message Digest Cipher, 353&#150;354
<DD>multiple signatures, 40
<DD><I>N</I>-Hash, 433&#150;435
<DD>RIPE-MD, 445
<DD>Secure Hash Algorithm, 442&#150;445signing documents with, 38&#150;39
<DD>Snefru, 432
<DD>as unbiased random-bit generator, 107
<DD>using public-key algorithms, 455
<DD>using symmetric block algorithms, 446&#150;455
<DL>
<DD>AR hash function, 453
<DD>GOST hash function, 454
<DD>hash length equals block size, 447&#150;449
<DD>LOKI Double-Block, 451
<DD>MDC-2 and MDC-4, 452&#150;454
<DD>modified Davies-Meyer, 449&#150;450
<DD>parallel Davies-Meyer, 451
<DD>Preneel-Bosselaers-Govaerts-Vandewalle, 450
<DD>Quisquater-Girault, 450
<DD>tandem and abreast Davies-Meyer, 451&#150;452
</DL>
</DL>
<DD>Ong-Schnorr-Shamir, 498&#150;499, 531&#150;532
<DD>Orange Book, 599&#150;600
<DD>Otway-Rees protocol, 59&#150;60
<DD>Outerbridge, Richard, 363
<DD>Outer-CBC, 360
<DD>Output-feedback mode, 203&#150;205, 208&#150;210
<DL>
<DD>combined with ECB, 364
<DD>DES, 277
<DD>with a nonlinear function, 208
</DL>
<DD>Overtake, 598
<DD>Overwriting, 229
<DD>Padding:
<DL>
<DD>cipher block chaining mode, 195
<DD>electronic codebook mode, 190&#150;191
<DD>MD5, 436
<DD>Secure Hash Algorithm, 442
<DD>triple encryption with, 362
</DL>
<DD>Painvin, Georges, 12
<DD>Pass phrases, 174&#150;175
<DD>Passive attack, 27
<DD>Passive cheaters, 27
<DD>Patents, 609&#150;610; <I>See also</I> specific algorithms
<DD>P-boxes:
<DL>
<DD>design criteria, 294
<DD>permutation, 275, 277, 316
</DL>
<DD>PEM, <I>see</I> Privacy-Enhanced Mail
<DD>Perfect secrecy, 235
<DD>Period, 11
<DL>
<DD>shift register, 373
</DL>
<DD>Permutation, 237
<DL>
<DD>key, DES, 272&#150;273
</DL>
<DD>PES, 319, 324
<DD>Pike, 391&#150;392
<DD>PKZIP, 394&#150;395
<DD>Plaintext, 1&#150;2
<DD>Plaintext block chaining mode, 208
<DD>Plaintext feedback mode, 208
<DD>Plaintext pair, right and wrong pairs, 287
<DD>Pless generator, 413&#150;414
<DD>p-NEW scheme, 498
<DD>Pohlig, Stephen, 262
<DD>Pohlig-Hellman encryption scheme, 474
<DD>Polarized photons, 555
<DD>Pollard&#146;s Monte Carlo algorithm, 256
<DD>Polyalphabetic substitution cipher, 10&#150;11
<DD>Polygram substitution cipher, 10&#150;11
<DD>Polynomials:
<DL>
<DD>degree, shift register length, 374
<DD>dense, 378
<DD>irreducible, 255, 481
<DD>sparse, 378
</DL>
<DD>Pomerance, Carl, 257
<DD>Powerline System, 466
<DD>Pre-image, 30
<DD>Preneel, Bart, 457
<DD>Preneel-Bosselaers-Govaerts-Vandewalle, 450
<DD>Pretty Good Privacy, 584&#150;587
<DD>Price, William, 562
<DD>Prime numbers, 245
<DL>
<DD>generation, 258&#150;261
<DL>
<DD>DSA, 488&#150;490
<DD>practical considerations, 260&#150;260
</DL>
<DD>relatively prime, 245
<DD>strong, 261
</DL>
<DD>Primitive, 253
<DD>Principal square root, 251
<DD>Privacy-Enhanced Mail, 577&#150;584
<DL>
<DD>certificates, 579
<DD>documents, 578
<DD>messages, 579&#150;582
<DD>RIPEM, 583&#150;584
<DD>security, 582&#150;583
<DD>TIS/PEM, 583
</DL>
<DD>Private key, 5
<DL>
<DD>creating public key from, 464
<DD>for public-key cryptography, lifetime, 184
</DL>
<DD>Probabilistic encryption, 552&#150;554
<DD>Problems:
<DL>
<DD>complexity, 239&#150;241
<DD>EXPTIME, 241
<DD>hard, 239
<DD>intractable, 239
<DD>PSPACE, 241
</DL>
<DD>Problems (<I>Cont.</I>)
<DL>
<DD>tractable, 239
<DD>undecidable, 240
<DD><I>See also</I> NP-complete problem
</DL>
<DD>Processing complexity, 9
<DD>Product cipher, 347
<DD>Proofs of Membership, 111
<DD>Propagating cipher block chaining mode, 207
<DD>Proposed Encryption Standard, 319
<DD>Protocols, 21, 47
<DL>
<DD>adjudicated, 26, 70&#150;71
<DD>all-or-nothing disclosure of secrets, 96
<DD>analysis, approaches, 65&#150;66
<DD>anonymous message broadcast, 137&#150;139
<DD>arbitrated, 23&#150;26
<DD>attacks against, 27
<DD>authentication, 576&#150;577
<DD>authentication and key-exchange, formal analysis, 65&#150;68
<DD>BAN logic, 66&#150;67
<DD>basic zero-knowledge, 102&#150;104
<DD>bit commitment, 86&#150;88
<DD>blind signatures, 112&#150;115
<DD>characteristics, 21
<DD>cryptographic, 22
<DD>DASS, 62
<DD>definition, 21
<DD>Denning-Sacco, 63
<DD>digital cash, <I>see</I> Digital cash
<DD>digital certified mail, 122&#150;123
<DD>digital signatures, 40
<DD>distributed, timestamping, 77&#150;78
<DD>fair coin flips, 89&#150;92
<DD>IBM Common Cryptographic Architecture, 573&#150;574
<DD>IBM secret-key management, 561&#150;562
<DD>identity-based public-key cryptography, 115
<DD>interactive, 103
<DD>interlock, 49&#150;50, 54&#150;55
<DD>Kerberos, 60, 566&#150;571
<DD>key escrow, 97&#150;100
<DD>key exchange, 47&#150;52
<DD>KryptoKnight, 571&#150;572
<DD>lessons, 64&#150;65
<DD>mental poker, 92&#150;95
<DD>multiparty unconditionally secure, 137
<DD>Needham-Schroeder, 58
<DD>Neuman-Stubblebine, 60&#150;62
<DD>oblivious signatures, 117
<DD>oblivious transfer, 116&#150;117
<DD>one-way accumulators, 95&#150;96
<DD>Otway-Rees, 59&#150;60
<DD>purpose, 22&#150;23
<DD>secret splitting, 70&#150;71
<DD>secure circuit evaluation, 137
<DD>secure elections, <I>see</I> Secure elections
<DD>secure multiparty computation, 134&#150;137
<DD>self-enforcing, 26&#150;27
<DD>SESAME, 572
<DD>simultaneous contract signing, 118&#150;122
<DD>simultaneous exchange of secrets, 123&#150;124
<DD>subliminal channel, 79&#150;80
<DD>timestamping, 75&#150;79
<DD>types, 24
<DD>Wide-Mouth Frog, 56&#150;57
<DD>Woo-Lam, 63&#150;64
<DD>Yahalom, 57&#150;58
<DD><I>See also</I> Authentication; Zero-knowledge proofs
</DL>
<DD>Pseudo-Hadamard Transform, 340
<DD>Pseudo-random function family, SEAL, 398&#150;399
<DD>Pseudo-random-number generator, 78, 416
<DD>Pseudo-random sequence, 44&#150;45
<DD>Pseudo-random-sequence generator, 44
<DL>
<DD>bit commitment using, 88
<DD>generating multiple streams, 420&#150;421
<DD>linear congruential generators, 369&#150;372
<DD>linear feedback shift registers, 372&#150;379
</DL>
<DD>PSPACE, 241
<DD>Public key, 5
<DL>
<DD>certificates, 185&#150;187
<DD>creating from private key, 464
<DD>key length, 158&#150;165
<DL>
<DD>recommended lengths, 161&#150;163
</DL>
<DD>key management, 185&#150;187
</DL>
<DD>Public-key algorithms, 4&#150;5, 33, 500&#150;502
<DL>
<DD>background, 461&#150;462
<DD>based on linear error-correcting codes, 480
<DD>Diffie-Hellman, 513
<DD>ElGamal, 476&#150;479
<DD>elliptic curve cryptosystems, 480&#150;481
<DD>finite automaton cryptosystems, 482
<DD>knapsack algorithms, 462&#150;466
<DD>LUC, 481
<DD>McEliece, 479&#150;480
<DD>one-way hash functions using, 455
<DD>Pohlig-Hellman, 474
<DD>Rabin, 475&#150;476
<DD>RSA, <I>see</I> RSA
<DD>security, 461&#150;462
<DD>strength, 502
</DL>
<DD>Public-key cryptography:
<DL>
<DD>attacks against, 43&#150;44
<DD>authentication using, 53&#150;54
<DD>coin flipping using, 90&#150;91
<DD>communications using, 31&#150;34
<DD>identity-based, 115
<DD>key exchange with, 48
<DD>multiple-key, 68&#150;69
<DD>private keys, lifetime, 184
<DD>signing documents with, 37&#150;38
<DL>
<DD>one-way hash functions, 38&#150;39
</DL>
<DD>versus symmetric cryptography, 216&#150;217
</DL>
<DD>Public-Key Cryptography Standards, 588&#150;589
<DD>Public Key Partners, 604&#150;605
<DD>Public-key ring, 585
<DD>Purchase-key attack, 7
<DD>Quadratic nonresidues, 251
<DD>Quadratic residues, 250&#150;251
<DL>
<DD>generator, 417
</DL>
<DD>Quadratic sieve, 256
<DL>
<DD>factoring, 159
</DL>
<DD>Quantum computing, 164&#150;165
<DD>Quantum cryptography, 554&#150;557
<DD>Quintuple encryption, 366
<DD>Quisquater, Jean-Jacques, 102, 508
<DD>Quisquater-Girault, 450
<DD>Rabin, 475&#150;476
<DD>Rabin, Michael, 103, 259, 518, 550
<DD>Rabin-Miller algorithm, 259&#150;260
<DD>RACE Integrity Primitives Evaluation, 605&#150;606
<DD>Rackoff, Charles, 352
<DD>Rainbow Books, 600
<DD>Rambutan, 390
<DD>Random keys, 173&#150;174
<DD>Random noise, as random-sequence generator, 423&#150;424
<DD>Random-number generation, 44
<DD>Random-sequence generators, 421&#150;428
<DL>
<DD>biases and correlations, 425&#150;426
<DD>computer clock, 424
<DD>distilling randomness, 426&#150;428
<DD>keyboard latency measurement, 424&#150;425
<DD>RAND tables, 422&#150;423
<DD>using random noise, 423&#150;424
</DL>
<DD>Random sequences, real, 45&#150;46
<DD>Randomized approach, stream ciphers, 415
<DD>Randomized stream cipher, 419
<DD>Randomness, distilling, 426&#150;428
<DD>RAND tables, 422&#150;423
<DD>Rao-Nam algorithm, 346
<DD>Rate of the language, 234
<DD>RC2, 318&#150;319
<DD>RC4, 319, 397&#150;398
<DD>RC5, 344&#150;346
<DL>
<DD>source code, 659&#150;662
</DL>
<DD>RDES, 297&#150;298
<DD>Receipt, resending message as, 42&#150;43
<DD>REDOC II, 311&#150;313
<DD>REDOC III, 313
<DD>Redundancy, of language, 234
<DD>Reeds, Jim, 369
<DD>Related-key cryptanalysis, 290
<DD>Renji, Tao, 482
<DD>Renting Passports, 111
<DD>Replay attacks, 58&#150;59
<DD>Research and Development in Advanced Communication Technologies, Integrity Primitives Evaluation, 605&#150;606
<DD>Resend attack, foiling, 43
<DD>Residue, 242
<DL>
<DD>quadratic, 250&#150;251
<DD>reduced set, 248
</DL>
<DD>Restricted algorithms, 3
<DD>RFC 1421, 578
<DD>RFC 1422, 578
<DD>RFC 1423, 578
<DD>RFC 1424, 578
<DD>Richter, Manfield, 423
<DD>Riordan, Mark, 583&#150;584
<DD>RIPE, 605&#150;606
<DD>RIPEM, 583&#150;584
<DD>RIPE-MAC, 457&#150;458
<DD>RIPE-MD, 445
<DD>Rip van Winkle cipher, 41