index

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

       Matsumoto-Imai, 318
       McEliece, 316
       Okamoto, 92, 316, 17
       Ong-Schnorr-Shamir, 299, 300
       Pohlig-Hellman, 289
       Rabin, 289, 91
       RSA, 281, 88
       Schnorr, 302, 4
       security, 274, 75, 319
       Yagisawa, 318
Public key cryptography
       attacks against, 30, 31
       coin flipping using, 76, 77
       communications using, 29, 31
       generating keys for, 144, 45
       key exchange, 42, 47
       multiple-key, 56, 58
       one-way functions and, 27, 28
       one-way hash functions, 34, 35, 39
       prime numbers and, 213, 16
       signing documents, 33, 34
       user identification with, 48, 49
Public Key Distribution Center, 414, 15
Public Key Partners (PKP), 276, 288, 289
Public keys, 35, 36.  See also Keys; Public-Key algorithms
       certificates, 153
       creating from private, knapsack algorithm, 278, 79
       database, 43
       introducers and distributed key management, 153
       introduction, 4
       management, 152, 53
       one-way functions and, 27, 28
       security, 30
PURPLE, Japanese diplomatic code, 6

Q-code cryptosystems, 8
Quadratic algorithms, 194
Quadratic residues and nonresidues, 206
Quadratic Sieve, 211
Quantum cryptography, 408, 10
Queensland University of Technology, 247
Quisquater, Jean-Jacques, 85
Quisquater-Girault hash function, 341, 42

Rabin algorithm, 289, 91, 435
Rabin, Michael, 86, 404
Rabin-Miller prime number algorithm, 214, 15
Rackoff, C., 270
Rainbow Books, 441
RAND tables, 368, 69
Random noise, 370
Random numbers.  See also Pseudo-random
       crypotographically, 40
       generating, 14, 15, 39, 41, 144
       keystream generators, 170
Random permutations, generating, 374, 75
Randomized stream ciphers, 367
Rate of language, 190, 91
RC2 and RC4, 259, 60, 364
Real random sequence generators, 368, 72.  See also Pseudo-random sequence generators
       biases and correlations, 371, 72
       diffusing randomness, 372
       measuring keyboard latency, 370
       RAND tables, 368, 69
       random noise, 370, 71
       using computer clocks, 369, 70
Real, world random numbers, 41
Receipts, resending message as, 37, 38
Receiver, 1
REDOC, 252, 55
Redundancy of language, 190, 91
Regan, Ronald and NSDD, 145, 222
Related-key cryptanalysis, 240, 41
Relatively prime numbers, 200
Relativized cryptography, 192
Research and Development in Advanced Communication Technologies in Europe (RACE), 336, 446
Resend attacks, 39
Residues in modular arithmetic, 198, 203
Restricted algorithms, 2
Ribenboim, Paulo, 200
Richter, Manfield, 370
RIPEM, 435, 36
RIPE-MAC, 345, 446
RIPE-MD one-way hash function, 336
RIPE project, secret-key identification (SKID), 50, 51, 343, 446
Rivest, Ron, 12, 100, 259, 282, 329, 332, 35
Riorden, Mark, 435
Robotron, 237
ROM keys, 148, 49
Rotor machines, 11
Rounds, DES, 224, 237
RSA (Rivest, Shamir, and Adleman) algorithm, 281, 88
       attacks against poker protocols, 80
       common modulus attack, 287
       digital signatures and, 33
       encrypted key exchange (EKE), 379
       in hardware, 285
       introduction, 12
       low exponent attack against RSA, 287, 88
       multiple public-key cryptography, 381
       patents, 288
       restrictions on, 288
       security, 282, 85
       speed of, 285, 86, 306
       as standard, 288
       zero-knowledge proof of ability to break, 403
RSA Data Security, Inc. (RSADI), 259, 60, 305, 364, 444, 45
RSA generator, 365
Rueppel, Ranier, 345, 357, 358, 363, 364

Salomaa, Arto, 399
Salt, 47, 48
Santean, Lila, 109, 399
S-boxes, 228, 29, 237, 38, 242
Scherbius, Arthur, 11
Schnorr, C. P., 299, 337, 367
Schnorr algorithm, 302, 4
Schroeder, 52, 177
Sci.crypt, 445
Scott, Robert, 247
Seberry, Jennifer, 336
Secrecy, ideal, 192
Secrecy, perfect, 191
Secret broadcasting, 382, 83
Secret-key algorithms, 3
Secret-key identification protocols (SKID), 50, 51
Secret keys
       compromised, 150
       database of, 30, 33
       introduction, 4
Secret sharing
       advanced threshold schemes, 385, 86
       all-or-nothing disclosure (ANDOS), 83, 84, 399, 401
       Asmuth-Bloom, 385
       backup keys, 149
       with cheaters, 60, 386, 87
       Karnin-Greene-Hellman, 385
       LaGrange interpolating polynomial scheme, 383, 84
       (m,n)-threshold scheme, 59, 383
       with prevention, 387
       without revealing shares, 386
       schemes for, 59, 61
       shadows, 59
       simultaneous exchange, 104, 5
       threshold scheme, 59
       without Trent, 60, 61
       vector scheme, 384
Secret splitting, 58, 59
Secure algorithm
       introduction, 7
Secure Data Network System (SDNS), 436
Secure Hash Algorithm (SHA), 333, 36
       description of, 334, 35
       and DSS, 308
       security, 335, 36
Secure Hash Standard (SHS), 323
Secure multiparty computation
       protocols, 114, 16, 404, 6
       secure circuit evaluation, 116, 17
Security
       of CA-1.1, 268
       cheating, 25
       cryptosystems, 7, 191
       DES, 232
       DSA, 311, 13
       ESIGN algorithm, 315
       hardware and software encryption, 181, 83
       Kerberos, 424
       key length and future security, 139, 40
       and keys, 2, 4
       keystream generators and, 170
       knapsack algorithm, 280
       MD5, 332, 33
       of MMB, 267, 68
       multiple encryption, 165, 69
       network, 178, 80
       PEM, 434
       problems with OFB, 162
       pseudo-random sequences and, 40, 41
       public-key algorithms, 274, 75, 319
       restricted algorithms, 2
       of REDOC II, 253, 54
       of REDOC III, 254
       RSA, 282, 85
       Secure Hash Algorithm (SHA), 308, 335, 36
Self-decimated generators, 362, 63
Self-enforcing protocols, 24
Semi-weak keys, 233
Sender
       introduction, 1
       unconditional, and recipient untraceability, 125
Sequence, superincreasing, 278
Session keys, 42, 418
Shadows, 59, 383
Shamir, Adi, 12, 60, 91, 234, 237, 238, 240, 43, 244, 252, 254, 
       255, 259, 260, 277, 280, 282, 295, 299, 324, 325, 326, 383
Shamir's pseudo-random number generator, 365
Shamir's three-pass protocol, 376, 77
Shannon, Claude Elmwood, 189, 193
Shares, secret sharing without revealing, 386
Shift registers, 351
Shifting identities problem, 93
Shimizu, Akihiro, 249
Shmuley, Z., 275
Shroyer, Les, 306
Signatures.  See Digital signatures
Signing contracts, simultaneous
       with arbitrators, 99
       without arbitrator, (face-to-face), 99, 100
       without arbitrator, (not face-to-face), 100, 1
       without arbitrator, (using cryptography), 101-3
Signing documents
       and timestamps, 34, 39
       with public-key cryptography, 33, 35
       with symmetric cryptosystems and arbitrator, 31, 33
Simmons, Gustavus, 67, 318, 387
Simple substitution cypher, 8
Simultaneous exchange of secrets, 104, 5
Single-key algorithm, 3
Smart card applications, 296, 297, 309
Smith, Peter, 318
Snefru one-way hash function, 324, 25
Software
       brute-force attacks, 135, 36
       DES implementation, 231
       encryption, 148, 182, 83
Software Publishers Association (SPA), 260
Solvay-Strassen prime number algorithm, 214
Soviet Union, 237
Space complexity of algorithms, 194
Speed
       DES, 231
       DES compared to RSA, 286, 306
       of IDEA, 263, 64
       of RSA, 285, 86
SPX protocols, 55, 56
Square roots modulo N, 213, 289
Square roots, coin flipping using, 396
Standards.  See Data Encryption Standard (DES), RSA algorithm
Stereotyped beginnings and endings, 155
Stern, 349
Store-and-forward network, 46, 47
Storing keys, 148, 49
Stornetta, W. Scott, 62
Straight permutation, 230
Stream algorithms, 3
Stream ciphers, 168, 77, 356, 67
       alternating stop-and-go generator, 360, 61
       Beth-Piper stop-and-go generators, 359
       bilateral stop-and-go generator, 361
       Blum-Mitcali generator, 365
       BlumBlumShub (BBS) generator, 365, 66, 407
       cellular automaton generator, 363
       complexity, theoretic approach, 365, 66
       crypt(1), 364
       Geffe generator, 358, 59
       Gollmann cascade, 360
       I/p generator, 363, 64
       information theory approach, 366, 67
       insertion attack, 174
       introduction, 3
       keystream generators, 169, 72
       MAC, 345, 46
       multiplexer generator, 359
       multispeed inner-product generator, 363
       Pless generator, 359
       randomized, 367
       RC4, 364
       RSA generator, 365
       self-synchronous, 172, 174, 75
       self-decimated generators, 362, 63
       Shamir's pseudo-random number generator, 365
       summation generator, 364
       synchronous, 172
       system-theoretic approach, 357, 64
       threshold generator, 361, 62
       using block ciphers as, 175, 76
       vs. block ciphers, 176, 77
Stream ciphers.  See also pseudo-random sequence generators
Strong algorithms, 7
Strong primes, 215, 16
Subliminal channels
       applications of, 68
       DES, 313
       DSA, 390, 92
       ElGamal, 388, 89
       ESIGN, 389, 90
       Ong-Schorr-Shamir, 387, 88
       protocols, 66, 68
       subliminal-free signatures, 68
Substitution, 8, 10, 193
       S-box substitution, DES, 228, 29
Summation generator, 364
Sumoto, T., 270
Superincreasing knapsack, 278
Superincreasing sequence, 278
Superpolynomial algorithms, 194
Swap files, 152, 183
Symmetric algorithms
       compared to public-key, 31
       introduction, 3, 4
Symmetric cryptography
       bit commitment using, 72
       communications using, 26, 27
       key exchange with, 42, 43
       keys and, 26, 27
       security of, 129, 30
       signing documents with arbitrator, 31, 33
       vs. public-key cryptography, 177, 78
Symposium on the theory of Computing (STOC), 91
Synchronous stream ciphers, 172, 74
       counter mode, 172, 173
       introduction, 172
       output feedback mode, 172, 73

Tandem Davies-Meyer hash function, 342, 43
Tap sequence, 351
TCP/IP networks, 417
TEMPEST, 181
Threshold generators, 361, 62
Threshold scheme, 59, 385
Ticket-Granting Server (TGS), 419
Ticket-Granting Service (TGS), 419
Ticket Granting Ticket (TGT), 421
Tickets, 419
Time complexity of algorithms, 194
Time estimates for brute-force attack, 130, 35, 195
Timestamping
       arbitrated solution, 62, 63
       distributed protocols, 64, 65
       document signing and, 34, 39
       linking protocols, 63, 64
       services, 61, 65
TIS-PEM, 434, 35
Tractable problems, 195
Traffic-flow security, 178
Transferring keys, 145, 47
Transposition ciphers, 10
Trap-door one-way functions, 28
Trial Division, 212
Triple encryption, 166, 67
Trusted Information Systems.  See Privacy-Enhanced Mail (PEM)
Trusted parties, 21
Tsujii, S., 318
Tuchman, W. L., 166, 232, 413
Turing, Alan, 11, 193, 196
Turing machine, 195
Turkin, A. I., 316

U.S. export rules, 447, 54
U.S. government cryptosystems
       Clipper and Capstone chips, 181, 269, 436, 437, 38
       DES (Data Encryption Standard), 12
Unconditionally secure algorithm, 7
Unconditionally secure multiparty protocols, 125, 26
Undecidable problems, 196
Undeniable digital signatures, 68, 69, 392, 95
Unicity distance, 192
Unicity point, 192
UNIX
       CRYPT(3), 242
       Crypt Breakers Workbench (CBW), 364
       encryption operations, 148
       generating random values, 369, 70
       Kerberos, 417, 25
       ROT13, 9, 10
       salt, 48
       TIS-PEM, 434, 35
Unpredictable to left/right, 366
Untraceability, unconditional sender and recipient and, 125
User identification, with public-key cryptography, 48, 49

Van Oorschot, Paul, 167
Variants, DES, 241, 43
Vector scheme, 384
Verifying keys, 147, 48
Vernam, Gilbert, 13
Vigenere cipher
       classical cryptography, 10
       simple XOR, 12, 13
Viruses, 137
Voting.  See Elections, secure

Waidner, Michael, 69
Waterloo, University of, 337
Wayner, Peter, 66
Weak DES keys, 232, 34
Weizmann Institute in Israel, 291
Well, coin flipping into, 77
Wichmann, B. A., 349
Wide-Mouth Frog protocols, 51, 52
Wiener, Michael, 167, 287
Windows NT, 148
Wolfram, Steve, 337, 363
Wood, Michael, 252, 254
Woollven, Jack, 345
Work factor, breaking algorithms, 7
World War I ciphers, 10
World War II ciphers, 11

X.509 protocols, 425
XOR algorithm, 12, 13
Xuejia, Lai, 260

Yagisawa algorithm, 318
Yahalom protocol, 52
Yamagishi, Atsuhiro, 252
Yang, Shouboa, 393
Yung, Moti, 69
Yuval, G., 322

Zenith video scrambling, 2
Zero knowledge identification algorithm, 297
Zero-knowledge proofs of identity
       chess grandmaster problem, 91, 93
       introduction, 91, 93
       shifting identities problem, 93
Zero-knowledge proofs of knowledge
       basic protocol, 85, 87
       convincing third parties, 89, 90
       Cut and choose technique, 85, 86
       discrete logarithm, proofs of, 401, 3
       Feige-Fiat-Shamir algorithm, 291, 96
       generalities, 91
       graph isomorphism, 88, 89
       Hamiltonian cycle, 87, 88
       introduction, 84
       minimum-disclosure proofs, 84
       noninteractive proofs, 90, 91
       parallel proofs, 89
       RSA, ability to break, 403
Zheng, Yuliang, 270, 336
Zippel, 280