📄 book-index.html
字号:
<DL>
<DD>combined with end-to-end, 219–221
</DL>
<DD>Linking protocol, timestamping, 76–77
<DD>Li-Wang algorithm, 346
<DD>Local deduction, 8
<DD>Lock-in, 388
<DD>Logarithms, discrete, <I>see</I> Discrete logarithm
<DD>LOKI, 314–316
<DL>
<DD>S-boxes, 349
<DD>source code, 632–637
</DL>
<DD>LOKI Double-Block, 451
<DD>Low decryption exponent attack, RSA, 473
<DD>Low encryption exponent attack, RSA, 472–473
<DD>Luby, Michael, 352
<DD>Luby-Rackoff, 352–353
<DL>
<DD>xDES<SUP>1</SUP>, 365
</DL>
<DD>LUC, 481
<DD>Lucas number, 481
<DD>Luccio-Mazzone, 501
<DD>Lucifer, 266, 303–304
<DD>Lu-Lee cryptosystem, 466
<DD>Lyndon words, 501
<DD>MacGuffin, 346
<DD>Madryga, W. E., 304
<DD>Mafia Fraud, 110
<DD>Magic numbers, 423
<DD>Manasse, Mark, 159, 257
<DD>Man-in-the-middle attack, 48–49
<DD>Masks, REDOC II, 312
<DD>Massey, James, 319, 339, 386, 418, 449
<DD>Master Key, 561
<DD>Master Terminal Key, 561
<DD>Matsui, Mitsuru, 290–291
<DD>Matsumoto-Imai algorithm, 500
<DD>Mauborgne, Joseph, 15
<DD>Maurer, Ueli, 419
<DD>Maurer’s randomized stream cipher, 419
<DD>Maximal period generator, 369
<DD>MBAL, 344
<DD>McEliece, Robert, 479
<DD>McEliece algorithm, 346, 479–480
<DD>MD2, 441
<DD>MD3, 446
<DD>MD4, 435–436
<DD>MD5, 436–441
<DD>MDC, 353–354
<DD>MDC-2, 452–453
<DD>MDC-4, 452–454
<DD>MD-strengthening, 431
<DD>Meet-in-the-middle attack, 358, 381
<DD>Mental poker, 92–95
<DD>Merkle, Ralph, 34, 316–318, 358–359, 432, 455, 461–462
<DD>Merkle’s puzzles, 34
<DD>Merritt, Michael, 67, 518, 520–521, 571
<DD>Message:
<DL>
<DD>authentication, 56
<DD>broadcasting, 69
<DD>Privacy-Enhanced Mail, 579–582
<DD>recovery, 497–498
<DD>resending as receipt, 42–43
</DL>
<DD>Message authentication codes, 31, 455–459
<DL>
<DD>bidirectional, 457
<DD>CBC-MAC, 456
<DD>IBC-Hash, 458
<DD>Jueneman’s methods, 457
<DD>message authenticator algorithm, 456–457
<DD>one-way hash functions as, 458–459
<DD>RIPE-MAC, 457–458
<DD>stream ciphers, 459
</DL>
<DD>Message authenticator algorithm, 456–457
<DD>Message broadcast, anonymous, 137–139
<DD>Message Digest, 435–436
<DD>Message Digest Cipher, 353
<DD>Message Integrity Check, 578
<DD>Message-meaning rule, 66
<DD>Message Security Protocol, 584
<DD>Meyer, Carl, 266, 278
<DD>Meyer, Joseph A., 614
<DD>Meyer-Schilling, 452
<DD>Micali, Silvio, 94, 508, 546–547, 552
<DD>Miller, Gary, 259
<DD>Miller, V. S., 480
<DD>Mimic functions, 10
<DD>Minimum-disclosure proofs, 108
<DD>MITRENET, 562–563
<DD>Miyaguchi, Shoji, 308
<DD>MMB, 325–327
<DD>m*n-bit S box, 349
<DD>Modular arithmetic, 242–245
<DD>Modular Multiplication-based Block cipher, 325–327
<DD>Modular reduction, 242
<DD>Modulo, inverses, 246–248
<DD>Monoalphabetic cipher, 10
<DD>Montgomery’s method, 244
<DD>Moore’s Law, 153
<DD>m-sequence, 374
<DD>MSP, 584
<DD>Muller, Winfried, 481
<DD>Multiparty unconditionally secure protocols, 137
<DD>Multiple-bit generator, 421
<DD>Multiple encryption, 357
<DL>
<DD>quintuple, 366
</DL>
<DD>Multiple Identity Fraud, 111
<DD>Multiple-key public-key cryptography, 527–528
<DD>Multiple signatures, 39–40
<DD>Multiplier, 369
<DD>Multispeed inner-product generator, 386–387
<DD>Mush, 392
<DD>Mutual shrinking generator, 392
<DD>MYK-80, 593–594
<DD>Mykotronx Clipper chip, 328
<DD>MYK-78T, 591–593
<DD>Nanoteq, 390
<DD>National Bureau of Standards, <I>see</I> National Institute of Standards and Technology
<DD>National Computer Security Center, 599–600
<DD>National Institute of Standards and Technology, 600–603
<DL>
<DD>DES development, 265–267
<DD>Memorandum of Understanding, 601–603
</DL>
<DD>National Security Agency, 597–599
<DL>
<DD>DES development, 266–267
<DD>export of cryptography, 614–615
<DD>Memorandum of Understanding, 601–603
<DD>S-box development role, 278, 280
</DL>
<DD>Navy Research Laboratory, protocol analyzer, 67–68
<DD>Needham, Roger, 58, 66, 216
<DD>Needham-Schroeder protocol, 58–59
<DD>Networks, large, key distribution, 177
<DD>Neuman-Stubblebine protocol, 60–62
<DD>Neural networks, breaking algorithms, 155
<DD>NewDES, 306–308
<DD><I>N</I>-Hash, 433–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–424
<DD>Nonce-verification rule, 66
<DD>Non-Interactive Key Sharing systems, 115
<DD>Nonlinear-feedback shift registers, 412–413
<DD>Nonlinear keyspace, 175–176
<DD>Nonrepudiation, 2
<DD>Notz, Bill, 266
<DD>NP-complete problem, 240–242
<DL>
<DD>graph isomorphism, 104
<DD>knapsack algorithms, 462
<DD>McEliece algorithm, 479
<DD>solving, 163–164
</DL>
<DD>NRL Protocol Analyzer, 67–68
<DD>NSDD-145, 268
<DD>Nuclear Non-Proliferation Act, 610
<DD>Number field sieve, 256
<DD>Numbers:
<DL>
<DD>2–adic, 404
<DD>large, 17–18
</DL>
<DD>Number theory, 242–255
<DL>
<DD>Barrett’s algorithm, 244
<DD>Blum integers, 253
<DD>Chinese remainder theorem, 249–250
<DD>Euclid’s algorithm, 245
<DD>Euler totient function, 248–249
<DD>extended Euclidean algorithm, 246–248
<DD>Fermat’s little theorem, 248
<DD>Galois field, computing in, 254–255
<DD>generators, 253–254
<DD>greatest common divisor, 245–246
<DD>inverses modulo a number, 246–248
<DD>Jacobi symbol, 252–253
<DD>Legendre symbol, 251
<DD>modular arithmetic, 242–245
<DD>Montgomery’s method, 244
<DD>prime numbers, 245
<DD>quadratic residues, 250–251
<DD>solving for coefficients, 248
</DL>
<DD>Nyberg, Kaisa, 348
<DD>Oblivious transfer, 116–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–17
<DL>
<DD>hiding ciphertext in ciphertext, 227–228
</DL>
<DD>One-time tape, 418
<DD>One-way accumulators, 95–96, 543
<DD>One-way function, 29–30
<DL>
<DD>authentication using, 52
<DD>bit commitment using, 87–88
<DD>coin flipping using, 90
<DD>trap-door, 158
</DL>
<DD>One-way hash functions, 30–31, 351–354
<DL>
<DD>background, 429–431
<DD>birthday attacks, 165–166, 430
<DD>choosing, 455
<DD>cipher security, 353–354
<DD>compression function, 431
<DD>encryption speeds, 456
<DD>HAVAL, 445–446
<DD>improved arbitrated solution, 76
<DD>Karn, 351–352
<DD>length, 430–431
<DD>Luby-Rackoff, 352–353
<DD>MD2, 441
<DD>MD3, 446
<DD>MD4, 435–436
<DD>MD5, 436–441
<DD>MD-strengthening, 431
<DD>message authentication codes, 455–459
<DD>Message Digest Cipher, 353–354
<DD>multiple signatures, 40
<DD><I>N</I>-Hash, 433–435
<DD>RIPE-MD, 445
<DD>Secure Hash Algorithm, 442–445signing documents with, 38–39
<DD>Snefru, 432
<DD>as unbiased random-bit generator, 107
<DD>using public-key algorithms, 455
<DD>using symmetric block algorithms, 446–455
<DL>
<DD>AR hash function, 453
<DD>GOST hash function, 454
<DD>hash length equals block size, 447–449
<DD>LOKI Double-Block, 451
<DD>MDC-2 and MDC-4, 452–454
<DD>modified Davies-Meyer, 449–450
<DD>parallel Davies-Meyer, 451
<DD>Preneel-Bosselaers-Govaerts-Vandewalle, 450
<DD>Quisquater-Girault, 450
<DD>tandem and abreast Davies-Meyer, 451–452
</DL>
</DL>
<DD>Ong-Schnorr-Shamir, 498–499, 531–532
<DD>Orange Book, 599–600
<DD>Otway-Rees protocol, 59–60
<DD>Outerbridge, Richard, 363
<DD>Outer-CBC, 360
<DD>Output-feedback mode, 203–205, 208–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–191
<DD>MD5, 436
<DD>Secure Hash Algorithm, 442
<DD>triple encryption with, 362
</DL>
<DD>Painvin, Georges, 12
<DD>Pass phrases, 174–175
<DD>Passive attack, 27
<DD>Passive cheaters, 27
<DD>Patents, 609–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–273
</DL>
<DD>PES, 319, 324
<DD>Pike, 391–392
<DD>PKZIP, 394–395
<DD>Plaintext, 1–2
<DD>Plaintext block chaining mode, 208
<DD>Plaintext feedback mode, 208
<DD>Plaintext pair, right and wrong pairs, 287
<DD>Pless generator, 413–414
<DD>p-NEW scheme, 498
<DD>Pohlig, Stephen, 262
<DD>Pohlig-Hellman encryption scheme, 474
<DD>Polarized photons, 555
<DD>Pollard’s Monte Carlo algorithm, 256
<DD>Polyalphabetic substitution cipher, 10–11
<DD>Polygram substitution cipher, 10–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–587
<DD>Price, William, 562
<DD>Prime numbers, 245
<DL>
<DD>generation, 258–261
<DL>
<DD>DSA, 488–490
<DD>practical considerations, 260–260
</DL>
<DD>relatively prime, 245
<DD>strong, 261
</DL>
<DD>Primitive, 253
<DD>Principal square root, 251
<DD>Privacy-Enhanced Mail, 577–584
<DL>
<DD>certificates, 579
<DD>documents, 578
<DD>messages, 579–582
<DD>RIPEM, 583–584
<DD>security, 582–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–554
<DD>Problems:
<DL>
<DD>complexity, 239–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–71
<DD>all-or-nothing disclosure of secrets, 96
<DD>analysis, approaches, 65–66
<DD>anonymous message broadcast, 137–139
<DD>arbitrated, 23–26
<DD>attacks against, 27
<DD>authentication, 576–577
<DD>authentication and key-exchange, formal analysis, 65–68
<DD>BAN logic, 66–67
<DD>basic zero-knowledge, 102–104
<DD>bit commitment, 86–88
<DD>blind signatures, 112–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–123
<DD>digital signatures, 40
<DD>distributed, timestamping, 77–78
<DD>fair coin flips, 89–92
<DD>IBM Common Cryptographic Architecture, 573–574
<DD>IBM secret-key management, 561–562
<DD>identity-based public-key cryptography, 115
<DD>interactive, 103
<DD>interlock, 49–50, 54–55
<DD>Kerberos, 60, 566–571
<DD>key escrow, 97–100
<DD>key exchange, 47–52
<DD>KryptoKnight, 571–572
<DD>lessons, 64–65
<DD>mental poker, 92–95
<DD>multiparty unconditionally secure, 137
<DD>Needham-Schroeder, 58
<DD>Neuman-Stubblebine, 60–62
<DD>oblivious signatures, 117
<DD>oblivious transfer, 116–117
<DD>one-way accumulators, 95–96
<DD>Otway-Rees, 59–60
<DD>purpose, 22–23
<DD>secret splitting, 70–71
<DD>secure circuit evaluation, 137
<DD>secure elections, <I>see</I> Secure elections
<DD>secure multiparty computation, 134–137
<DD>self-enforcing, 26–27
<DD>SESAME, 572
<DD>simultaneous contract signing, 118–122
<DD>simultaneous exchange of secrets, 123–124
<DD>subliminal channel, 79–80
<DD>timestamping, 75–79
<DD>types, 24
<DD>Wide-Mouth Frog, 56–57
<DD>Woo-Lam, 63–64
<DD>Yahalom, 57–58
<DD><I>See also</I> Authentication; Zero-knowledge proofs
</DL>
<DD>Pseudo-Hadamard Transform, 340
<DD>Pseudo-random function family, SEAL, 398–399
<DD>Pseudo-random-number generator, 78, 416
<DD>Pseudo-random sequence, 44–45
<DD>Pseudo-random-sequence generator, 44
<DL>
<DD>bit commitment using, 88
<DD>generating multiple streams, 420–421
<DD>linear congruential generators, 369–372
<DD>linear feedback shift registers, 372–379
</DL>
<DD>PSPACE, 241
<DD>Public key, 5
<DL>
<DD>certificates, 185–187
<DD>creating from private key, 464
<DD>key length, 158–165
<DL>
<DD>recommended lengths, 161–163
</DL>
<DD>key management, 185–187
</DL>
<DD>Public-key algorithms, 4–5, 33, 500–502
<DL>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -