generating using coin flipping, 78       generating, 140, 45       Interchange Key (IK), 433       introduction, 2, 3       key crunching, 144       key-encryption key, 146       keystream generator and, 170, 71       lifetime of, 150, 51       master and master terminal, 413       master key, 146       pass phrase and, 145       poor choices for, 142, 44       reduced keyspaces, 141, 42       ROM, 148, 49       semi-weak keys, 233       session, 42       software and hardware implementations, 148       storing, 148, 49       symmetric cryptosystems, 26, 27       transferring, 145, 47       transmitting messages and, 46       verifying, 147, 48       weak DES, 232, 34Keyspace, 2Keystream generator, 169, 72Khufu and Khafre, 257, 59Kilian, Joe, 74, 97Klein, Daniel, 48Knapsack algorithm, 277, 81       creating public key from private, 278, 79       decryption, 279, 80       encryption, 279       one-way hash functions, 337       patents, 281       practical implementations, 280       security, 280       superincreasing, 278       variants, 280, 81Known-plaintext attack, 5Knudson, Lars, 255, 256Knuth, D., 201, 203, 211Koblitz, Neal, 275, 317Konheim, Alan, 237Korzhik, V. I., 316Kranakis, Evengelos, 200KryptoKnight, 425Kurosawa, T., 318L'Ecuyer, Pierre, 349LaGrange interpolating polynomial scheme, 383, 84Lai, Xuejia, 260, 264, 266, 340, 341, 343, 345LaMacchia, Brian, 307, 381Language, rate and redundancy of, 190, 91Large numbers used in cryptography, 15, 16Lawsuits and patents, 447, 48Legendre symbol, 206Lehmann prime number algorithm, 215Length, maximal, of LSFRs, 351Lenstra, Arjen, 212, 306, 309Lexar Corporation, 237Lidl, Rudolph, 318Lifetime of keys, 150, 51Linear algorithms, 194linear congruential generators, 347, 51Linear cryptanalysis, 241Linear feedback shift registers (LFSR), 351, 55Linear sieve, 217Link-by-link encryption, 178, 79, 180Linking protocols, 63, 64Logarithms, discrete       in finite field, 216, 18       problem, 153, 317, 395       zero knowledge proofs, 401, 3LOKI, 255, 57LOKI double-block hash function, 342LOKI single-block hash function, 339Low exponent attack against RSA, 287, 88LSFR.  See Linear feedback shift registersLu-Lee cryptosystem, 280Luby-Rackoff method, 270, 71LUCIFER, 220, 236, 244, 45MAC (Message Authentication Code), 345Macintosh system 7, 148Madryga, 245, 47Mail systems       digital certified mail, 103, 4       MITRENET, 414, 15       privacy-enhanced mail (PEM), 428, 36Man-in-the-middle attack, 43, 44, 49, 50Manasse, 212Manipulation detection code (MDC), 28MASKs, 253Massey, James, 260, 340, 343, 364, 367, 439Master key, 146, 413Master terminal key, 413Mathematical theory.  See Information theoryMatsui, Mitsuru, 241, 252Matsumoto-Imai algorithm, 318Matyas, S. M., 413Maximal length generator, 347Mauborgne, Major Joseph, 13Maurer, Ueli, 367McCurley, Kevin, 275, 304McEliece algorithm, 316MD2, 333MD4, 329MD5, 329, 33       chaining variables, 330       description of, 329, 32       security, 332, 33MDC-4, 343, 44Mechanical encryption devices, 11Meet-in-the-middle attack, 166Memory management, 152, 183Mental poker       anonymous key distribution, 80, 81       attacks against poker protocols, 80       introduction, 78       with three players, 78, 79Merchants, cheating, 119, 22Merkle, Ralph, 166, 167, 257, 59, 273, 277, 324, 329, 344Merkle-Hellman knapsack algorithm, 277, 81Merritt, Michael, 110, 378, 380, 424Message Authentication code (MAC), 345Message Digest, 28, 329Message digest cipher (MDC), 271, 72Message Integrity Check (MIC), 429Message security protocol (MSP), 436Messages       broadcasting keys and, 46, 47, 57       information theory, 189, 93       introduction, 1, 2Metal insulator semiconductor capacitor (MISC), 370Meyer, C. H. W., 232, 338, 413Meyer, Joseph A., 453Meyer-Schilling hash function, 344Micali, Silvio, 80, 82, 100, 295, 386, 398, 406, 407Miller, V. S., 275, 317Minimum, disclosure proof, 84MITRENET, 414, 15Miyaguchi hash function, 339, 40Miyaguchi, Shoji, 249MMB (Modular Multiplication-based Block cipher), 266, 68(m,n)-threshold scheme, 59, 383Modular arithmetic, 198, 200       greatest common divisor, 200, 1       inverses in modular arithmetic, 201, 3       prime numbers, 200Modular reduction, 198Moore, J. H., 288Motorola, 306, 7Muller, Winfried, 318Multiple DES, 241Multiple encryption, 165, 69       double encryption, 165, 66       doubling block length via, 167, 69       encrypt-decrypt-encrypt (EDE) mode, 166, 67       meet-in-the-middle attack, 166       multiple algorithms for, 168       triple encryption, 166, 67       with multiple algorithms, 168Multiple keys, public-key cryptography, 56, 58, 381Multiple signatures, 36, 296, 298, 99Multiplexer generator, 359Multiplier, 347Multispeed inner-product generator, 363Mutual authentication, 49, 51N-Hash one-way hash function, 326, 28N-party identification, 296National Bureau of Standards (NBS), 219, 21National Computer Security Center (NCSC), 440, 41National Institute of Standards and Technology (NIST), 218, 304,441, 44National Security Agency, 130, 184, 85, 439, 40       and DES,  219, 23, 232, 236, 37, 273, 74       and DSS, 312, 13       Skipjack, 269, 70, 437Needham, 52, 177Needham and Schroeder protocol, 52, 54Networks       factoring algorithms on, 212, 13       IBM secret-key management protocol, 413, 14       key distribution in, 147Neumann, John von, 39NewDES, 247, 49New South Wales, University of, 256Niederreiter cryptosystem, 280Niederreiter, Harald, 318Niemi cryptosystem, 280Nippon Telephone and Telegraph, 326Nobauer, Wilfried, 318Noninteractive zero-knowledge proofs, 90, 91NP problems, 196, 98NP-complete problems, 197, 98, 277NTT Japan, 249, 252, 314Number Field Sieve, (NFS), 211, 217Number Theory, 198, 211       Blum integers, 208       Chinese remainder theorem, 204, 5       Euler totient function, 203, 4       Fermat's little theorem, 203       Galois field, computing in, 209, 10, 276       generators, 208, 9       GF(2^n), computing in, 210, 11, 276       Jacobi symbol, 207, 8, 290       Legendre symbol, 206       modular arithmetic, 198, 200       Primative polynomials mod 2, 353, 56       quadratic residues and nonresidues, 206       solving for coefficients, 203Numbers, relatively prime, 200Numbers and nonuniform distributions, 372, 74Nurmi, Hannu, 109Oblivious transfer       algorithm, 404       fair cryptosystems, 82, 83       introduction, 97, 98Octway-Rees protocol, 54Odlyzko, Andrew, 307, 381Office of Technology Assessment, 223Ohta, Kazuo, 123, 319Ohta-Okamoto identification scheme, 296Okamoto 92 algorithm, 316, 17Okamoto, Tatsuaki, 123, 314, 319Omaa, Arto, 109One-key algorithms, 3One-time pads       overview, 13, 16       security of, 7One-time tape, 366One-way functions       abreast Davies-Meyer, 343       bit commitment using 73       coin flipping using, 75, 76       Davies-Meyer, 338, 39, 340, 41       equal block and key sizes, 340       LOKI double-block, 342       LOKI single-block, 339       MDC-4, 343, 44       Miyaguchi, 339, 40       Preneel-Bosselaers-Govaerts-Vandewalle, 341       prime numbers and , 213       public-key cryptography, 27, 28       Quisquater-Girault, 341, 42       tandem Davies-Meyer, 342, 43       trap-door, 28       using block Algorithms as one-way hash functions, 338, 44One-way hash functions, 28, 29, 270, 72       background, 321, 24       birthday attack, 322       choosing best, 345       design overview, 323, 24       diffusing randomness, 372       HAVAL, 336, 37       Karn, 270       key-dependent, 345, 46       length of, 323       Luby-Rackoff, 270, 71       MAC, 345       MD2, 333       MD4, 329       MD5, 329, 33       Message Digest, 329       message digest cipher (MDC), 271, 72       N-Hash, 326, 28       RIPE-MD, 336       Secure Hash Algorithm (SHA), 308, 333, 36       Snefru, 324, 25       using public-key algorithms, 344       using symmetric block algorithms, 338, 44Ong-Schnorr-Shamir algorithm, 299, 300, 387, 88Open Computing Security Group, 425Opponents, 4Orange Book, 440Outerbridge, Richard, 167Output feedback (OFB) mode, 162       DES, 231       error propagation, 162       security problems, 162       stream ciphers, 172, 73Output feedback with a non-linear function (OFBNLF), 164P problems, 196Padding, 158, 59       triple encryption with, 167Painvin, Georges, 10Parallel zero-knowledge proofs, 89Pass phrase, 145Passive attacks, 25Passive cheaters, 25Passwords, authentication, 47, 51Patents, 447, 48       CA-1.1, 268, 69       Diffie-Hellman, 276       Digital Signature Algorithm (DSA), 313, 14       ElGamal, 302       ESIGN, 315       FEAL, 252       Fiat-Shamir signature scheme, 296       IDEA, 266       knapsacks, 281       LOKI, 256       Lucifer, 245       Pohlig-Hellman algorithm, 289       REDOC, 254, 55       RSA algorithm, 288       Schnorr algorithm, 304Pederson, Torben, 395PEM public-key protocol, 153Perfect secrecy, 191Period of cypher, 10Periodic keystream generators, 171, 72Permutations       DES, 227, 30       generating random, 374, 75Permuted choice, 227PES (Proposed Encryption Standard), 260Pfitzmann, Brigit, 69Pfleeger, Charles, 80Pieprzyk, Josef, 336Pieprzyk cryptosystem, 280PINs, 221, 381Plaintext       introduction, 1, 2       pairs, characteristics of, 238Plaintext block chaining (PCB) mode, 164Plaintext feedback (PFB) mode, 164Playfair cipher, 10Pless generator, 359Pohlig, S. C., 217Pohlig-Hellman algorithm, 289Poker.  See Mental pokerPolicy Certification Authorities (PCAs), 430Pollard, J. M., 300Pollard's Monte Carlo Algorithm, 211Polyalphabetic substitution cyphers, 9, 10Polygram substitution cipher, 9, 10Polynomial time algorithms, 194Pomerance, Carl, 212Price, W. L., 414Preliminary Message Security Protocol (PMSP), 436Preneel, Bart, 323, 340, 341, 345Preneel-Bosselaers-Govaerts-Vandewalle hash function, 341Pretty Good Privacy (PGP), 153, 436, 37Prevention, secret sharing with, 387Primative polynomials mod 2, 353, 56Prime numbers, 200, 213, 16       Lehmann prime number algorithm, 215       Rabin-Miller, 214, 15       Solvay-Strassen, 214       strong primes, 215, 16Primitives, 208Principle square root, 208Privacy-enhanced mail (PEM), 428, 36       certificates, 430       messages, 430, 34       PEM documents, 429       RIPEM, 435, 36       security, 434       TIS-PEM, 434, 35Private keys       compromised, 150       creating public from, knapsack algorithm, 278, 79       fair cryptosystems, 82, 386, 398, 99       introduction, 4       lifetime of, 151Private keys.  See Secret keysProbabilistic encryption, 406, 8Problems       complexity classes, 196, 97       complexity of, 195, 97       discrete logarithm, 317, 395       hard, 196, 319       mathematical classes of, 196, 98       tractable and intractable, 195, 96       undecidable, 196Proof-of-identity protocols, 49, 301Proofs       broadcast interactive proofs, 91       minimum-disclosure proof, 84       Zero-knowledge, 84, 91Propagating cipher block chaining (PCBC) mode, 163, 64, 418Protocols       adjudicated, 23, 24       arbitrated, 21, 23       attacks against, 24, 25       basic zero-knowledge, 85, 87       cryptographic, 20       distributed protocols, 64, 65       example company, 21       interactive, 86       interlock, 44, 45, 49, 51       introduction to, 19, 25       ISO authentication framework, 425, 28       Kerberos protocol, 55       linking protocols, 63, 64       Needham and Schroeder protocol, 52, 54       Otway-Rees protocol, 54       proof-of-identity, 49       purpose of, 20, 21       secret-key identification (SKID), 50, 51       self-enforcing, 24       simplistic voting, 105, 6       SPX protocols, 55, 56       steps involved in, 20       Wide-Mouth Frog protocol, 51, 52       Yahalom protocol, 52Pseudo-random.  See also Random numbers       key crunching, 144       sequence generation, 15, 39, 41       sequence generators, bit commitment using, 73, 74       unpredictable numbers, 41Pseudo-random sequence generators.  See also Real random sequence generators       combining linear congruential generators, 349, 51       linear congruential generators, 347, 51       linear feedback shift registers (LFSR), 351, 55       modified LFSRs, 356       Shamir's pseudo-random number generator, 365PSPACE-complete problems, 197Public algorithms, 183, 84Public-Key algorithms       as hash functions, 344       attacks against, 274, 75       Cade, 318       cellular automata, 317       choosing, 320       compared to symmetric, 31       Diffie-Hellman, 275, 77       Digital Signature Algorithm (DSA), 304, 14       ElGamal, 300, 2       elliptic curve cryptosystems, 317, 318       ESIGN, 314, 15       fair, 83, 386, 398, 99       Feige-Fiat-Shamir, 291, 96       Guillou-Quisquater, 297, 99       hard problems, 319       introduction, 3, 4, 273, 74       Knapsack algorithms, 277, 81