📄 book-index.html
字号:
<html><head><TITLE>APPLIED CRYPTOGRAPHY, SECOND EDITION: Protocols, Algorithms, and Source Code in C:Index</TITLE>
<!-- BEGIN HEADER --><META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW"><SCRIPT><!--function displayWindow(url, width, height) { var Win = window.open(url,"displayWindow",'width=' + width +',height=' + height + ',resizable=1,scrollbars=yes');}//--></SCRIPT></HEAD><body bgcolor="ffffff" link="#006666" alink="#006666" vlink="#006666"><P>
<CENTER><B>Applied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C (cloth)</B>
<FONT SIZE="-2">
<BR>
<I>(Publisher: John Wiley & Sons, Inc.)</I>
<BR>
Author(s): Bruce Schneier
<BR>
ISBN: 0471128457
<BR>
Publication Date: 01/01/96
</FONT></CENTER>
<P>
<!-- Empty Reference Subhead -->
<!--ISBN=0471128457//-->
<!--TITLE=APPLIED CRYPTOGRAPHY, SECOND EDITION: Protocols, Algorithms, and Source Code in C//-->
<!--AUTHOR=Bruce Schneier//-->
<!--PUBLISHER=Wiley Computer Publishing//-->
<!--CHAPTER=Index//-->
<!--PAGES=743-758//-->
<!--UNASSIGNED1//-->
<!--UNASSIGNED2//-->
<CENTER>
<TABLE BORDER>
<TR>
<TD><A HREF="appendix-b.html">Previous</A></TD>
<TD><A HREF="ewtoc.html">Table of Contents</A></TD>
<TD><A HREF="ewtoc.html">Next</A></TD></TR>
</TABLE>
</CENTER>
<P><BR></P>
<H2><A NAME="Heading1"></A><FONT COLOR="#000077">Index</FONT></H2>
<DL>
<DD>A5, 389, 662–667
<DD>Abadi, Martin, 66
<DD>Absolute rate, of language, 234
<DD>Accreditation, 103
<DD>Active attacks, 27
<DD>Active cheaters, 27
<DD>Adams, Carlisle, 334
<DD>Adaptive-chosen-plaintext attack, 6
<DD>Addition chaining, 244
<DD>Additive generators, 390–392
<DD>Adjudicated protocol, 26, 71
<DD>Adjudicator, 26
<DD>Adleman, Leonard M., 163–164, 467
<DD>Adler, Roy, 266
<DD>Agnew, G. B., 423
<DD>Algebraic structure, DES, 282–283
<DD>Algorithm M, 393–394
<DD>Algorithms, 2–4, 17
<DL>
<DD>all-or-nothing disclosure of secrets, 543–546
<DD>Asmuth-Bloom, 529–530
<DD>Barrett’s, 244
<DD>Berlekamp-Massey algorithm, 380, 404
<DD>block
<DL>
<DD>chain mode, 206–207
<DD>choosing, 354–355
<DD>replay, 191–193
</DL>
<DD>breaking, 8
<DD>CAST, 334–335
<DD>choosing, 214–216
<DD>cipher block chaining mode, 193–197, 208–210
<DD>cipher block chaining of plaintext difference mode, 208
<DD>cipher block chaining with checksum, 207–208
<DD>cipher-feedback mode, 200–202, 208–210
<DD>cipher mode
<DL>
<DD>choosing, 208–210
<DD>summary, 209
</DL>
<DD>classes, 217
<DD>coin flipping
<DL>
<DD>using Blum integers, 543
<DD>using exponentiation modulo <I>p</I>, 542–543
<DD>using square roots, 541–542
</DL>
<DD>complexity, 237–239
<DD>constant, 238
<DD>convertible undeniable signatures, 538–539
<DD>counter mode, 205–206, 209
<DD>cubic, 238
<DD>data compression, 226
<DD>designated confirmer signatures, 539–540
<DD>Diffie-Hellman, fair, 546–547
<DD>digital signatures, 39
<DD>exponential, 238
<DD>for export, 215–216
<DD>extended Euclidean, 246–248
<DD>factoring, 256
<DD>ISO/IEC 9979 registered, 607
<DD>Karnin-Greene-Hellman, 530
<DD>Khafre, 317–318
<DD>Khufu, 317
<DD>linear, 238
<DD>linear syndrome, 381
<DD>modes, DES, 277–278
<DD>multiple block
<DL>
<DD>cascading, 367–368
<DD>combining, 368
</DL>
<DD>multiple-key public-key cryptography, 527–528
<DD>oblivious transfer, 550
<DD>one-way accumulators, 543
<DD>output-feedback mode, 203–205, 208–210
<DD>output feedback with a nonlinear function, 208
<DD>plaintext block chaining mode, 208
<DD>plaintext feedback mode, 208
<DD>polynomial, 238
<DD>polynomial-time, 238
<DD>probabilistic encryption, 552–554
<DD>propagating cipher block chaining mode, 207
<DD>public-key, 4–5, 33
<DD>quadratic, 238
<DD>quantum cryptography, 554–557
<DD>restricted, 3
<DD>running times, 238–239
<DD>secret-sharing algorithms, 528–531
<DD>secure multiparty computation, 551–552
</DL>
<DD>Algorithms (<I>Cont.</I>)
<DL>
<DD>security, 8–9
<DD>self-synchronizing stream cipher, 198–199
<DD>stream ciphers, 197–198
<DD>subliminal-channel signature, 79
<DD>superpolynomial, 238
<DD>symmetric, 4
<DD>synchronous stream cipher, 202–203
<DD>TEA, 346
<DD>types, 189
<DD>unconditionally secure, 8
<DD>undeniable digital signatures, 536–539
<DD>using, 213–229
<DD>vector scheme, 529
<DD>zero-knowledge proofs, 548–550
<DD><I>See also</I> Block ciphers; Stream ciphers
</DL>
<DD>All-or-nothing disclosure of secrets, 96, 543–546
<DL>
<DD>voting with a single central facility, 128–130
</DL>
<DD>Alternating stop-and-go generator, 383, 385, 410–411
<DD>American National Standards Institute, DES approval, 267–268
<DD>Anderson, Ross, 391
<DD>ANDOS, <I>see</I> All-or-nothing disclosure of secrets
<DD>Anonymous message broadcast, 137–139
<DD>ANSI X3.105, 267
<DD>ANSI X3.106, 267
<DD>ANSI X9.8, 267
<DD>ANSI X9.17, 268, 359
<DL>
<DD>key generation, 175
</DL>
<DD>ANSI X9.19, 267
<DD>ANSI X9.26, 268
<DD>Arbitrated protocol, 23–26
<DD>Arbitration, timestamping, 75–76
<DD>Arbitrator, 23
<DL>
<DD>document signing with, 35–37
<DD>group signatures with, 84–85
</DL>
<DD>AR hash function, 453
<DD>Arithmetic, modular, 242–245
<DD>Arms Export Control Act, 610
<DD>Asmuth-Bloom scheme, 529–530
<DD>Association for Computing Machinery, 608
<DD>Asymmetric algorithms, <I>see</I> Public-key algorithms
<DD>Atomic Energy Act, 610
<DD>Attack, 5
<DD>AT&T Model 3600 Telephone Security Device, 594–595
<DD>Authentication, 2, 52–56
<DL>
<DD>DASS, 62
<DD>Denning-Sacco protocol, 63
<DD>dictionary attacks, 52
<DD>ISO framework, 574–577
<DD>Kerberos, 60
<DD>message, 56
<DD>Needham-Schroeder protocol, 58–59
<DD>Neuman-Stubblebine protocol, 60–62
<DD>Otway-Rees protocol, 59–60
<DD>protocols, formal analysis, 65–68
<DD>salt, 52–53
<DD>Schnorr, 511
<DD>SESAME, 572
<DD>SKEY, 53
<DD>SKID, 55–56
<DD>using interlock protocol, 54–55
<DD>using one-way functions, 52
<DD>using public-key cryptography, 53–54
<DD>Wide-Mouth Frog protocol, 56–57
<DD>Woo-Lam protocol, 63–64
<DD>Yahalom, 57–58
</DL>
<DD>Authenticators, 568
<DD>Avalanche effect, 273
<DD>Backup keys, 181–182
<DD>BAN logic, 66–67
<DD>Barrett’s algorithm, 244
<DD>BaseKing, 346
<DD>Basis, polarization measurement, 555
<DD>Battista, Leon, 11
<DD>BBS generator, 417
<DL>
<DD>add to spelled out, 553–554
</DL>
<DD>Beacons, 64
<DD>Bellovin, Steve, 518, 520–521, 571
<DD>Bennett, Charles, 555, 557
<DD>Berlekamp-Massey algorithm, 380, 404
<DD>Bernstein, Dan, 616
<DD>Berson, Tom, 441
<DD>Best affine approximation attack, 381
<DD>Beth-Piper stop-and-go generator, 383–384
<DD>Bias, 425
<DD>Bidirectional message authentication codes, 457
<DD>Biham, Eli, 284–285, 288, 296, 301, 303, 306, 308, 311–312, 314, 316, 319, 354, 361, 434
<DD>Bilateral stop-and-go generator, 384–385
<DD>Binary trees, 78
<DD>Biotechnology, as cryptanalysis tool, 156–157
<DD>Birthday attack, 165–166, 430
<DD>Bit commitment, 86–88
<DL>
<DD>using one-way functions, 87–88
<DD>using pseudo-random-sequence generators, 88
<DD>using symmetric cryptography, 86–87
</DL>
<DD>Blakley, George, 72, 529
<DD>Blaze, Matt, 346, 364
<DD>Blinding factor, 112
<DD>Blind signatures, 112–115, 549–550
<DL>
<DD>patents, 115
<DD>voting with, 126–127
</DL>
<DD>Blobs, 88
<DD>Block algorithms, 4
<DD>Block chain mode, 206–207
<DD>Block ciphers, 4, 189
<DL>
<DD>Blowfish, 336–339
<DD>CA-1.1, 327–328
<DD>cascading algorithms, 367–368
<DD>CAST, 334–335
<DD>CDMF key shortening, 366
<DD>choosing algorithms, 354–355
<DD>combining algorithms, 368
<DD>counter mode, 205–206, 209
<DD>Crab, 342–344
<DD>CRYPTO-MECCANO, 346
<DD>designing, 351
<DD>design theory, 346–351
<DL>
<DD>Feistel networks, 347
<DD>group structure, 348
<DD>S-box, 349–351
<DD>simple relations, 347–348
<DD>strength against differential and linear cryptanalysis, 348–349
<DD>weak keys, 348
</DL>
<DD>double encryption, 357–358
<DD>double OFB/counter, 363–364
<DD>doubling length, 363
<DD>electronic codebook mode, 189–191, 208–210
<DD>encryption speeds, 355
<DD>FEAL, 308–312
<DD>feedback, 193
<DD>GOST, 331–334
<DD>IDEA, 319–325
<DD>iterated, 347
<DD>Li-Wang algorithm, 346
<DD>LOKI, 314–316
<DD>Lucifer, 303–304
<DD>Madryga, 304–306
<DD>McEliece algorithm, 346
<DD>MMB, 325–327
<DD>multiple encryption, 357
<DD>NewDES, 306–308
<DD>Rao-Nam algorithm, 346
<DD>RC2, 318–319
<DD>RC5, 344–346
<DD>REDOC II, 311–313
<DD>REDOC III, 313
<DD>SAFER K-64, 339–341
<DD>security, based on one-way hash functions, 353–354
<DD>Skipjack, 328–329
<DD>versus stream ciphers, 210–211
<DD>SXAL8/MBAL, 344
<DD>triple encryption, 358–363
<DD>3–Way, 341–342
<DD>using one-way hash functions, 351–354
<DD>whitening, 366–367
<DD>xDES<SUP>1</SUP>, 365–366
</DL>
<DD>Block length, doubling, 363
<DD>Block replay, 191–193
<DD>Blocks, 4
<DD>Blowfish, 336–339, 354, 647–654
<DD>Blum, Manuel, 89, 105, 108
<DD>Blum, Blum, and Shub generator, 417–418
<DD>Blum integers, 253
<DL>
<DD>coin flipping, 543
<DD>zero-knowledge proofs, 549
</DL>
<DD>Blum-Micali generator, 416–417
<DD>Boolean functions, in S-boxes, 350
<DD>Bosselaers, Antoon, 436, 441
<DD>Boyar, Joan, 369
<DD>Brassard, Gilles, 555, 557
<DD>Broadcasting:
<DL>
<DD>anonymous, 137–139
<DD>secret, 523–524
</DL>
<DD>Brute-force attack, 8, 151–152
<DL>
<DD>software-based, 154–155
<DD>time and cost estimates, 152–154
</DL>
<DD>Bureau of Export Administration, 610–611
<DD>Burrows, Michael, 66
<DD>CA-1.1, 327–328
<DD>Cade algorithm, 500–501
<DD>Caesar Cipher, 11
<DD>CAFE, 606–607
<DD>CALC, 346
<DD>Cantwell Bill, 615–616
<DD>Capstone, 593–594
<DD>Cascade generators, 405
<DD>Cascades, Gollmann, 387–388
<DD>Cascading:
<DL>
<DD>multiple block algorithms, 367–368
<DD>multiple stream ciphers, 419–420
</DL>
<DD>Cash, digital, <I>see</I> Digital cash
<DD>Cassells, Ian, 381
<DD>CAST, 334–335
<DL>
<DD>S-boxes, 349
</DL>
<DD>CBC, <I>see</I> Cipher block chaining mode
<DD>CCEP, 269, 598–599
<DD>CDMF, 366, 574
<DD>Cellhash, 446
<DD>Cellular automata, 500
<DD>Cellular automaton generator, 414
<DD>Certificates:
<DL>
<DD>Privacy-Enhanced Mail, 579
<DD>public-key, 185–187
<DD>X.509, 574–575
</DL>
<DD>Certification authority, 186
<DD>Certification path, 576
<DD>Certified mail, digital, 122–123
<DD>Chaining variables, 436
<DD>Chambers, Bill, 385–386
<DD>Characteristics, 286–288
<DD>Chaum, David, 84, 115, 133, 137, 536, 549
<DD>Cheater, 27
<DL>
<DD>sharing secrets with, 531
</DL>
<DD>Chess Grandmaster Problem, 109
<DD>Chinese Lottery, 156–157
<DD>Chinese remainder theorem, 249–250, 470
<DD>Chor-Rivest knapsack, 466
<DD>Chosen-ciphertext attack, 6–7, 471–472
<DD>Chosen-key attack, 7
<DD>Chosen-plaintext attack, 6–7, 359
<DD>Chosen-text attack, 7
<DD>Cipher:
<DL>
<DD>substitution, 10–12
<DD>transposition, 12
</DL>
<DD>Cipher block chaining mode, 193–197, 208–210
<DL>
<DD>DES, 277–278
<DD>error extension, 196
<DD>error propagation, 195–196
<DD>initialization vector, 194
<DD>message authentication codes, 456
<DD>padding, 195
<DD>security, 196–197
<DD>self-recovering, 196
<DD>triple encryption, 360–361
</DL>
<DD>Cipher block chaining of plaintext difference mode, 208
<DD>Cipher block chaining with checksum, 207–208
<DD>Cipher-feedback mode, 200–202, 208–210
<DL>
<DD>DES, 277
<DD>error propagation, 201–202
<DD>initialization vector, 201
</DL>
<DD>Cipher mode:
<DL>
<DD>choosing, 208–210
<DD>summary, 208–210
</DL>
<DD>Ciphertext, 1–2
<DL>
<DD>auto key, 198
<DD>hiding in ciphertext, 227–228
<DD>pairs, differential cryptanalysis, 285
<DD>stealing, 191
</DL>
<DD>Ciphertext-only attack, 5–6
<DD>Cleartext, <I>see</I> Plaintext
<DD>Clipper chip, 591–593
<DD>Clipper key-escrow, 328
<DD>Clipper phone, 594
<DD>Clock-controlled generators, 381
<DD>Clocking, 381
<DD>CoCom, 610
<DD>Code, 9
<DD>Coefficients, solving for, 248
<DD>Coin flipping, 89–92
<DL>
<DD>fair, 541–543
<DD>into a well, 92
<DD>key generation, 92
<DD>using Blum integers, 543
<DD>using one-way functions, 90
<DD>using public-key cryptography, 90–91
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -