index

应用密码学密码算法源代码

Newsgroups: sci.crypt,comp.security.misc,alt.security
Subject: APPLIED CRYPTOGRAPHY - Electronic Version of Index
Message-ID: <[e-mail]>
From: [e-mail] (Bruce Schneier)
Date: Thu, 18 Nov 1993 05:58:37 GMT
Organization: Chinet - Public Access UNIX
Lines: 1747

Attached is the index to my book, Applied Cryptography.  Please feel free to
distribute it at will in electronic form.  Permission is not given to print
the index out; for that you have to buy the book.  I would appreciate it if
this index were placed on various crypto ftp sites around the world.

Bruce

******************************************************************************

APPLIED CRYPTOGRAPHY INDEX

copyright 1994 by John Wiley & Sons.  Permission is granted only to copy and
distribute this index electronically.


Abreast Davies-Meyer hash function, 343
Accreditation, single, 292
Active attacks, 25
Active cheaters, 25
Adaptive-chosen-plaintext attack, 5
ADFGVX cipher, 10
Adjudicator, 23, 24
Adleman, Leonard, 12, 282
Advanced threshold schemes, 385, 86
Adversaries, 4
Agnew, G. B., 370
Algebraic coding theory, 316
Algorithms
       and ciphers, 2, 3
       breakable, 7
       choosing, 183, 85, 272, 320
       complexity of, 194, 95
       for export, 184, 85, 448, 54
       introduction, 2, 3
       multiple and multiple encryption, 168
       public, 183, 84
       restricted, 2
       secure, 7
       security of symmetric cryptosystem and, 129, 30
       strong, 7
       types of, mathematically defined, 194
       unconditionally secure, 7
All or nothing disclosure of secrets (ANDOS)
       introduction, 83, 84
       multiple parties buying from single seller, 399, 401
       voting with single central facility, 109
Alternating stop-and-go generator, 360, 61
American Bankers Association, 221
American National Standards Institute (ANSI).  See ANSI.
Anderson, Ross, 360
Anonymous key distribution, 80, 81
Anonymous messages
       broadcasting, 124, 26
       Dining Cryptographers problem, 124
       multiparty unconditionally secure protocols, 126
Anonymous money orders, 117, 19
ANSI standards, DES, 221, 22
ANSI X9.17 key generation, 145
Arbitrated
       protocols, 21, 23
       solutions, 62, 63
       timestamping services, 62
Arbitrators
       computer, 23
       difference between adjudicators and, 24
       group signatures with trusted, 70, 71
       role of, 21, 23
       signing documents with symmetric cryptosystems and, 31, 33
       simultaneous contract signing with, 99
       simultaneous contract signing without, (face-to-face), 99, 100
       simultaneous contract signing without, (not face-to-face), 100, 1
       simultaneous contract signing without, (using cryptography),101, 3
Ascom-Tech AG, 266
Asmuth-Bloom, 385
Athena project, 417, 425
AT&T, 370
Attacks.  See also Authentication; Cryptanalysis
       active, 25
       against DES, 234, 238, 39
       against poker protocols, 80
       against proof-of-identity protocols, 49
       against protocols, 24, 25
       against public-key cryptography, 30, 31, 274
       attackers, 4
       birthday attack, 295, 322
       block replay, 155, 57
       brute-force, 130, 35
       chosen-ciphertext attack, 274, 75, 286, 87
       common modulus attack against RSA, 287
       Den Boer and Bosselaer's attacks, 329, 333, 336, 337
       dictionary, 142, 44
       dictionary, and salt, 47, 48
       digital signatures and encryption, 38
       foiling resend, 39
       insertion attack, stream ciphers, 174
       introduction, 4
       low exponent attack against RSA, 287, 88
       man-in-the-middle attack, 43, 44, 50
       meet-in-the-middle attack, 166
       passive, 25
       reduced keyspaces and, 141, 42
       software-only brute-force, 135, 36
       time and cost estimates for brute-force attack, 130, 35, 195
       types of, 5, 6
       viruses, 137
Authentication
       dictionary attacks and salt, 47, 48
       Feige-Fiat-Shamir algorithm, 291, 96
       introduction, 47
       key exchange and, 51, 56
       mutual, using interlock protocol, 49, 51
       Schnorr algorithm, 303
       SKID, 51
       user identification with public-key cryptography, 48, 49
Authenticators, 419
Avalanche effect, 227, 245

Backup keys, 149
Banks and digital cash, 117, 24
Bardell, Paul, 363
Battisa, Leon, 10
Beaufort cipher, 10
Bellcore, 306
Bell Laboratories, 237
Bell-Northern Research, 415
Bellovin, Steve, 50, 378, 380, 424
Bennett, Charles, 408, 410
Ben-Or, Michael, 100
Berkovitz, Shimshon, 382
Berson, Tom, 333
Beth-Piper stop-and-go generators, 359, 60
Beth, Thomas, 301
Biases and correlations, generated sequences, 371, 72
Biham, E., 234, 237, 238, 240, 244, 247, 249, 252, 253, 259, 260,
       264, 268, 272, 324, 326, 329
Bilateral stop-and-go generator, 361
Biotechnology and brute-force attacks, 138, 39
Birthday attacks, 322, 23
       Fiat-Shamir signature scheme, 294, 96
Bishop, Matthew, 429
Bit commitment, 71, 74
       blobs, 74
       using one-way functions, 73
       using pseudo-random sequence generators, 73, 74
       using symmetric cryptography, 72
Blakley, G. R., 60, 384
Blind signatures
       algorithm, 403, 4
       completely, 94, 95
       cut-and-choose technique, 95, 96
       envelopes, 96
       introduction, 93, 94
       voting with, 106, 7
Blobs, bit commitment, 74
Block algorithms.  See Algorithms, block
Block chaining (BC) mode, 163
Block cipher MAC, 345
Block cipher modes
       block chaining (BC) mode, 163
       block replay, 155, 57
       choosing, 164, 65
       cipher block chaining (CBC) mode, 157, 60, 231
       cipher block chaining of plaintext difference (CBCPD), 164
       cipher feedback (CFB) mode, 160, 61, 231
       counter mode, 163
       Electronic Codebook mode (ECB), 154, 55, 231
       error propagation, 159, 60, 161, 162
       framing, 160
       Initialization vector, 48, 158, 161, 162
       output feedback (OFB) mode, 162, 231
       output feedback with a non-linear function (OFBNLF), 164
       padding, 158, 59
       plaintext block chaining (PCB) mode, 164
       plaintext feedback (PFB) mode, 164
       propagating cipher block chaining (PCBC) mode, 163, 64
       self-recovering errors, 160
Block ciphers
       CA-1.1, 268, 69
       DES as,  224
       DES, overview and outline, 224
       FEAL-N, 249, 52
       IDEA, 260, 266, 436  
       introduction, 3
       Khufu and Khafre, 257, 59
       LOKI, 255, 57
       Lucifer, 220, 236, 244, 45
       Madryga, 245, 47
       MMB, 266, 68
       NewDES, 247, 49
       RC2 and RC4, 259, 60
       REDOC, 252, 55
       Skipjack, 269, 70, 437
       stereotyped beginnings and endings, 155
       using as stream ciphers, 175, 76
       vs. stream ciphers, 176, 77
Blocks
       introduction, 3
       length, doubling via multiple encryption, 167, 69
       replay, 155, 57
       size for computer analysis, 3
Bloom, J., 385
Blum integers, 208, 397, 98
Blum, Manuel, 75, 87, 91, 407
Blum-Mitcali generator, 365
BlumBlumShub (BBS) generator, 365, 66, 407
Boolean circuit, 117
Bosselaers, A., 329, 333
Boyar, Joan, 349
Boyd, Colin, 56
Branstead, Dennis, 223
Brassard, Giles, 74, 408, 410
Breakable algorithms and work factor, 7
Brickell, Ernie, 304, 315
British Telecom, 410
Broadcast interactive proofs, 91
Broadcasting
       keys and messages, 46, 47, 57
       anonymous messages, 124, 26
       secrets, 381, 83
Brute-force attack, 130, 35, 195
       biotechnology, 138, 39
       Chinese Lottery, 137
       software crackers, 135, 36
       software only, 135, 36
       time and cost estimates for brute-force attacks, 130, 35, 195
       viruses, 137
Burmester, Mike, 91

CA-1.1, 268, 69
Cade algorithm, 318
Cash, Digital.  See Digital Cash
CCITT X.508 public-key protocol, 153
CD-ROM applications, 15
Cellular automata (CA), 268, 317, 337
Cellular automaton generator, 363
Central Legitimization Agency (CLA), 107
Central Tabulating Facility (CTF), 105
Certificates, 153, 426, 430
Certification Authorities (CAs), 426, 430
Certifying authority (CA), 153, 426
Chaining variables, 330
Chaining, 157, 60
Chambers, W. G., 362
Chaum, David, 68, 70, 114, 392, 393, 403, 404
Cheaters
       passive and active, 25
       secret sharing with, 60, 386, 87
Cheating
       secure elections, 113, 14
       with digital cash, 117, 24
       with digital signatures, 36, 37
Chess grandmaster problem, 91, 93
Chinese Lottery, 137, 38
Chinese remainder theorem, 204, 5
Chips
       and random noise, 370
       Clipper and Capstone, 181, 269, 436, 437, 38
       DES chip, 231
       RSA, 281, 288
Chor-Rivest knapsack, 280, 81
Chosen-ciphertext attack, 5, 6, 274, 75, 286, 87
Chosen-plaintext attack, 5, 274
Cipher block chaining (CBC) mode, 157, 60
       DES, 231
       error propagation, 159, 60
       initialization vector, 158
       padding, 158, 59
Cipher block chaining of plaintext difference (CBCPD), 164
Cipher feedback (CFB) mode, 160, 61
       DES, 231
       error propagation, 161
       self-synchronous stream ciphers, 174, 75
Cipherpunks, 445
Ciphers
       and algorithms, 2, 3
       blocks.  See Block ciphers
       historic term, 8
       stream.  See Stream ciphers
       substitution, 8, 10, 193
       transposition, 10
Ciphertext, 1, 2
Ciphertext pairs, 238
Ciphertext-only attack, 5
Civil War, American, 10
Cleartext, 1-2
Clock pulse, 351
Clocks, computer for real random sequence generators, 369, 70
Codes.  See also Cryptanalysis
       historic term, 8
       PURPLE, Japanese diplomatic, 6
       q-code cryptosystems, 8
Coefficients, solving for, 203
Coin flipping
       Dining Cryptographers problem, 124, 26
       fair coin flips, 74, 78, 395, 98
       into well, 77
       key generation using, 78
       using Blum integers, 397, 98
       using exponentiation modulo p, 396, 97
       using one-way functions, 75, 76
       using public-key cryptography, 76, 77
       using square roots, 396
Commercial COMSEC Endorsement Program (CCEP), 223
Common modulus attack on RSA, 287
Communications
       ANSI standards, 221, 22
       protocols, purpose of, 20, 21
       using public-key cryptography, 29, 31
       using symmetric cryptography, 26, 27
Communications networks, encrypting, 178, 80
       end-to-end encryption, 179, 80
       link-by-link encryption, 178, 79, 180
       traffic-flow security, 178
Company, example, 21
Complement keys, 234
Complexity classes of problems, 196, 97
Complexity theory, 193, 98
       algorithms, 194, 95, 319
       computational complexity, 193
       NP, complete problems, 197, 98, 277
       problems, 195, 97
       stream ciphers, 365, 66
Compression permutation, 227
Compromised keys, 150
Computational complexity, 193
Computer analysis
       adjudicated protocols, 24
       arbitrators, 23
       block size for, 3
       processors for brute-force attack, 131, 34
       pseudo-random sequence generation, 15, 39, 41
       software-only brute force attacks, 135, 36
       XOR algorithm, 12, 13
Computer communications.  See Communications
Computer Professionals for Social Responsibility (CPSR), 438,446, 47
Computer Security Act of 1987, 221, 304, 441
Computing with encrypted data, 71, 395
Computationally secure algorithm, 7
COMSET (COMmunications SETup), 377, 78
Confirmation messages, 37, 38
Confusion, 193
Connell, Charles, 249
Continued Fraction Algorithm, 211
Contract signing.  See Signing contracts, simultaneously
Contraction functions, 28
Convertible undeniable signatures, 393, 95
Cook, S. A., 197
Coppersmith, Don, 80, 240, 341
Cost estimates for brute-force attack, 130, 35, 195
Counter mode, 163, 172, 173
Crime and digital cash, 123
crypt(1), 364
CRYPT(3), 242
Crypt Breakers Workbench (CBW), 364
Cryptanalysis
       differential, 237, 238, 40
       introduction, 1, 4, 7
       linear, 241
       of FEAL, 251, 52
       of IDEA, 264
       of LOKI, 255, 56
       of Madryga, 247
       of N-Hash, 326, 28
       of NewDES, 248, 49
       related-key, 240, 41
       Snefru one-way hash function, 324, 25
Cryptanalysts, 1
Cryptech, Inc., 255
CRYPTO conference, 91
Cryptographers, 1
Cryptographic facility, 414
Cryptographic protection of databases, 61
Cryptographic protocols, 20
Cryptographically secure pseudo-random sequence generators (CSPRSGs), 
356
Cryptography
       definition, 1
       hybrid systems, 177
       implementations.  See Example implementations
       large numbers used in, 15, 16
       quantum, 408, 10
       relativized, 192
       simultaneous contract signing without arbitrator, 101, 3
Cryptologists, 1
Cryptology, 1
Cryptosystems
       introduction, 4
              security, 7, 191
Cubic algorithms, 194
Cusick, Thomas, 253
Cut and choose technique, 85, 86
       blind signatures and, 95, 96

Damgard, Ivan, 337
Damm, Arvid Gerhard, 11
Data authentication code (DAC), 28
Data Encryption Standard (DES)
       adoption of, 221, 22
       algorithm, overview and outline, 224
       alternate S-boxes, 242
       attacks against, 234, 238, 39
       avalanche criteria, 227
       complement keys, 234
       compression permutation, 227
       CRYPT(3), 242
       decrypting, 230
       development of, 219, 21
       differential cryptanalysis, 237, 238, 40
       E-boxes, 227
       encryption speed, 231
       expansion permutation, 227, 28
       final permutation, 230
       FIPS PUBs, 221
       generalized (GDES), 243
       hardware and software implementations of, 231
       in 1987, 222, 23
       in 1992, 223, 24
       initial permutation, 26
       key length, 236, 37
       key transformation, 226, 27
       linear cryptanalysis, 241
       modes of, 231
       multiple, 241
       non-group benefits, 234, 45
       P-box permutation, 230
       permuted choice, 227
       related-key cryptanalysis, 240, 41
       rounds, 224, 237
       S-boxes, 228, 29, 237, 38
       security, 232
       speed, compared to RSA, 286
       straight permutation, 230