📄 book-index.html
字号:
<DD>with symmetric algorithm, 4</DL><DD>den Boer, Bert, 434, 436, 441<DD>Denning-Sacco protocol, 63<DD>Dense, 378<DD>Dereferencing keys, 221–222<DD>Derived sequence attack, 381<DD>Designated confirmer signatures, 82–83, 539–540<DD>Desmedt, Yvo, 81<DD>DES, <I>see</I> Data Encryption Standard<DD>Destruction:<DL><DD>information, 228–229<DD>of keys, 184–185</DL><DD>DESX, 295<DD>Dictionary attack, 52, 171–173<DD>Differential cryptanalysis, 284–290<DL><DD>attacks against<DL><DD>DES, 288–290<DD>DES variants, 298<DD>Lucifer, 303</DL><DD>extending to higher-order differentials, 293<DD>strength against, block cipher design theory, 348–349</DL><DD>Differential-linear cryptanalysis, 293<DD>Diffie, Whitfield, 31, 37, 122, 216, 283, 419, 461, 501, 565<DD>Diffie-Hellman:<DL><DD>EKE implementation, 519–520<DD>extended, 515<DD>failsafe, 547–548fair, 546–547<DD>Hughes variant, 515<DD>key exchange without exchanging keys, 515<DD>patents, 516<DD>with three or more parties, 514</DL><DD>Diffie’s randomized stream cipher, 419<DD>Diffusion, 237, 346–347<DD>Digital card, properties, 146<DD>Digital cash, 139–147<DL><DD>anonymous, 139<DL><DD>credit cards, 147<DD>money orders, 140</DL><DD>double spending problem, 140–141<DD>off-line systems, 146<DD>on-line systems, 145–146<DD>other protocols, 145–147<DD>perfect crime, 145<DD>practical, 145<DD>secret splitting, 142–145</DL><DD>Digital certified mail, 122–123<DD>Digital Notary System, 78<DD>Digital Signature Algorithm, 17, 483–494<DL><DD>attacks against <I>k</I>, 492<DD>computation time comparison with RSA, 489<DD>criticisms, 484–486<DD>dangers of common modulus, 493<DD>description, 486–488<DD>ElGamal encryption with, 490–491<DD>patents, 493–494<DD>prime generation, 488–490<DD>proposal for NIST standard, 483–486<DD>RSA encryption with, 491<DD>security, 491–492<DD>speed precomputations, 487–488<DD>subliminal channel, 493, 534–536<DL><DD>foiling, 536</DL><DD>variants, 494–495</DL><DD>Digital signatures, 34–41<DL><DD>algorithms, 39<DD>applications, 41<DD>blind, 112–115, 549–550<DD>convertible undeniable signatures, 538–539<DD>converting identification schemes to, 512<DD>definition, 39<DD>designated confirmer signatures, 82–83, 539–540<DD>ElGamal, 476–478<DD>with encryption, 41–44<DD>entrusted undeniable, 82<DD>fail-stop, 85<DD>Fiat-Shamir signature scheme, 507–508<DD>group signatures, 84–85<DD>Guillou-Quisquater signature scheme, 509–510<DD>improved arbitrated solution, 76<DD>key exchange with, 50<DD>multiple, 39–40<DL><DD>Guillou-Quisquater, 510</DL><DD>nonrepudiation, 40<DD>oblivious, 117<DD>protocol, 40<DD>proxy, 83<DD>public-key algorithms, 483–502<DL><DD>Cade algorithm, 500–501<DD>cellular automata, 500<DD>Digital Signature Algorithm, <I>see</I> Digital Signature Algorithm<DD>discrete logarithm signature schemes, 496–498<DD>ESIGN, 499–500<DD>GOST digital signature algorithm, 495–496</DL></DL><DD>Digital signatures (<I>Cont.</I>)<DL><DD>public-key algorithms (<I>Cont.</I>)<DL><DD>Matsumoto-Imai algorithm, 500<DD>Ong-Schnorr-Shamir, 498–499</DL><DD>public-key cryptography, 37–38<DL><DD>attacks against, 43–44<DD>one-way hash functions and, 38–39</DL><DD>resend attack, foiling, 43<DD>RSA, 473–474<DD>Schnorr signature scheme, 511–512<DD>subliminal-free, 80<DD>with symmetric cryptosystems and arbitrator, 35–37<DD>terminology, 39<DD>timestamps, 38<DD>trees, 37<DD>undeniable, 81–82, 536–539</DL><DD>Dining Cryptographers Problem, 137<DD>Discrete logarithm, 245<DL><DD>in finite field, 261–263<DD>zero-knowledge proofs, 548</DL><DD>Discrete Logarithm Problem, 501, 540–541<DD>Discrete logarithm signature schemes, 496–498<DD>Distributed Authentication Security Service, 62<DD>Distributed convertible undeniable signatures, 539<DD>Distributed key management, 187<DD>DNA computing, 163–164<DD>DNRSG, 387<DD>DoD key generation, 175<DD>Double encryption, 357–358<DD>Double OFB/counter, 363–364<DD>Double spending problem, 140–141<DD>Driver-level encryption, 222–223<DD>DSA, <I>see</I> Digital Signature Algorithm<DD>Dynamic random-sequence generator, 387<DD>E-box, 273<DD>ECB, <I>see</I> Electronic codebook mode<DD>Electronic checks, 146<DD>Electronic codebook mode, 189–191, 208–210<DL><DD>combined with OFB, 364<DD>DES, 277–278padding, 190–191<DD>triple encryption, 362–363</DL><DD>Electronic coins, 146<DD>Electronic Frontier Foundation, 608<DD>Electronic-funds transfer, DES adoption, 268<DD>Electronic Privacy Information Center, 608<DD>ElGamal, 532–533<DL><DD>EKE implementation, 519<DD>encryption, 478<DL><DD>with DSA, 490–491</DL><DD>patents, 479<DD>signatures, 476–478<DD>speed, 478–479</DL><DD>ElGamal, Taher, 263<DD>Elliptic curve cryptosystems, 480–481<DD>Elliptic curve method, 256<DD>Ellison, Carl, 362<DD>Encoding, 226<DD>Encrypt-decrypt-encrypt mode, 359<DD>Encrypted Key Exchange:<DL><DD>applications, 521–522<DD>augmented, 520–521<DD>basic protocol, 518–519<DD>implementation with<DL><DD>Diffie-Hellman, 519–520<DD>ElGamal, 519<DD>RSA, 519</DL><DD>strengthening, 520</DL><DD>Encryption, 1<DL><DD>communication channels, 216–220<DL><DD>combining link-by-link and end-to-end, 219–221</DL><DD>with compression and error control, 226<DD>data, for storage, 220–222<DD>detection, 226–227<DD>digital signatures with, 41–44<DD>driver-level versus file-level, 222–223<DD>ElGamal, 478<DL><DD>with DSA, 490–491</DL><DD>end-to-end, 217–220<DD>with interleaving, 210–211<DD>key, 3<DD>knapsack algorithms, 464<DD>link-by-link, 216–218<DD>multiple, 357<DD>with a private key, 39<DD>probabilistic, 552–554<DD>RSA, 468<DL><DD>with DSA, 491</DL><DD>with symmetric algorithm, 4<DD>using public key, 5</DL><DD>End-to-end encryption, 217–220<DL><DD>combined with link-by-link, 219–221</DL><DD>Enigma, 13, 414<DD>Entropy, 233–234<DD>Entrusted undeniable signature, 82<DD>Error detection:<DL><DD>during decryption, 179<DD>during transmission, 178</DL><DD>Error extension, cipher block chaining mode, 196<DD>Error propagation:<DL><DD>cipher block chaining mode, 195–196<DD>cipher-feedback mode, 201–202<DD>output-feedback mode, 204</DL><DD>Escrow agencies, 592<DD>Escrowed Encryption Standard, 97, 593<DD>ESIGN, 499–500, 533–534<DD>Euclid’s algorithm, 245<DD>Euler totient function, 248–249<DD>Expansion permutation, 273–275, 315<DD>Export:<DL><DD>of algorithms, 215–216, 610–616<DD>foreign, 617</DL><DD>Exportable Protection Device, 389<DD>Export Administration Act, 610<DD>EXPTIME, 241<DD>Extended Euclidean algorithm, 246–248<DD>Factoring, 255–258<DL><DD>general number field sieve, 159–160<DD>long-range predictions, 162<DD>public-key encryption algorithms, 158–159<DD>special number field sieve, 160–161<DD>using quadratic sieve, 159</DL><DD>Factoring Problem, 501<DD>Failsafe:<DL><DD>Diffie-Hellman, 547–548<DD>key escrowing, 98</DL><DD>Fail-stop digital signatures, 85<DD>Fair cryptosystems, 97<DD>Fait-Shamir, 508<DD>FAPKC0, 482<DD>FAPKC1, 482<DD>FAPKC2, 482<DD>FEAL, 308–312<DL><DD>cryptanalysis, 311–312<DD>description, 308–10<DD>patents, 311</DL><DD>Feedback:<DL><DD>cipher block chaining mode, 193, 195<DD>internal, output-feedback mode, 203</DL><DD>Feedback function, 373<DD>Feedback shift register, 373<DD>Feedback with carry shift registers, 402–404<DL><DD>combining generators, 405, 410<DD>maximal-length, tap sequences, 408–409<DD>maximal-period, connection integers, 406–407</DL><DD>Feedforward, cipher block chaining mode, 195<DD>Feige, Uriel, 503–504<DD>Feige-Fiat-Shamir, 503–508<DL><DD>enhancements, 506–507<DD>identification scheme, 504–505<DD>simplified, 503–504</DL><DD>Feistel, Horst, 266, 303<DD>Feistel network, 347<DL><DD>Blowfish, 337<DD>practically secure, 349</DL><DD>Fermat’s little theorem, 248<DL><DD>Euler’s generalization, 248</DL><DD>FFT-Hash, 446<DD>Fiat, Amos, 503–504<DD>Fiat-Shamir signature scheme, 507–508<DD>Fibonacci configuration, 373, 379<DD>Fibonacci shrinking generator, 391<DD>File-level encryption, 222–223<DD>Filter generator, 381<DD>Finite field, 254<DL><DD>discrete logarithms, 261–263</DL><DD>FIPS PUB 46, 267<DD>FIPS PUB 74, 267<DD>FIPS PUB 81, 267<DD>FIPS PUB 112, 267<DD>Fish, 391<DD>Fixed bit index, 543<DD>Flat keyspace, 176<DD>Flipping coins, <I>see</I> Coin flipping<DD>Fortified key negotiation, 522<DD>Galois configuration, linear feedback shift registers, 378–379<DD>Galois field, computing in, 254–255<DD>Garey, Michael, 241<DD>Gatekeeper, 278<DD>Geffe generator, 382–383<DD>General number field sieve, 159–160, 256<DD>General Services Administration, DES adoption, 268<DD>Generators, 253–254<DD>Gifford, 392–393<DD>Gifford, David, 392<DD>Gill, J., 501<DD>Global deduction, 8<DD>Goldwasser, Shafi, 94, 552<DD>Gollmann, Dieter, 386<DD>Gollmann cascade, 387–388<DD>Goodman-McAuley cryptosystem, 466<DD>Goresky, Mark, 404<DD>GOST, 331–334, 354<DL><DD>source code, 643–647</DL><DD>GOST digital signature algorithm, 495–496<DD>GOST hash function, 454<DD>GOST R 34.10–94, 495<DD>Gosudarstvennyi Standard Soyuza SSR, 331–334<DD>Graham-Shamir knapsacks, 465<DD>Graph isomorphism, 104–105<DD>Greatest common divisor, 245–246<DD>Grossman, Edna, 266<DD>Group signatures, 84–85<DD>Group Special Mobile, 389<DD>Group structure, block ciphers design theory, 348<DD>GSM, 389<DD>Guillou, Louis, 102, 508<DD>Guillou-Quisquater:<DL><DD>identification scheme, 508–510<DD>signature scheme, 509–510</DL><DD>Gutmann, Peter, 353<DD>Guy, Richard, 159<DD>Haber, Stuart, 75, 485, 488<DD>Hamiltonian cycles, 105–106<DD>Hard drive, encrypted, providing random access to, 222<DD>Hardware:<DL><DD>DES implementation, 278–279<DD>encryption, 223–225<DD>RSA, 469</DL><DD>Hash functions, <I>see</I> One-way hash functions<DD>Hash value, 30<DD>HAVAL, 445–446<DD>Hellman, Martin, 31–32, 37, 262, 283, 293, 358–359, 461–462<DD>Hiding information from an oracle, 86<DD>Historical terms, 9<DD>Homophonic substitution cipher, 10–11<DD>Hughes, 515<DD>Hughes, Eric, 609<DD>Hughes XPD/KPD, 389–390<DD>Hybrid cryptosystems, 32–34, 461<DD>IBC-Hash, 458<DD>IBM Common Cryptographic Architecture, 573–574<DD>IBM secret-key management protocol, 561–562<DD>IDEA, 319–325, 354<DL><DD>cryptanalysis, 323<DD>description, 320–322<DD>modes of operation, 323–325<DD>overview, 320–321<DD>patents, 325<DD>S-boxes, 349<DD>source code, 637–643<DD>speed, 322–323<DD>strength against differential cryptanalysis, 348<DD>variants, 325</DL><DD>Ideal secrecy, 236<DD>Identification schemes:<DL><DD>converting to signature schemes, 512<DD>Feige-Fiat-Shamir, 503–508<DD>Guillou-Quisquater, 508–510<DD>Ohta-Okamoto, 508<DD>Schnorr authentication and signature scheme, 510–512</DL><DD>Identity-based cryptosystems, 115<DD>Ignition key, 564<DD>Import, foreign, 617<DD>Index of coincidence, 14<DD>Information:<DL><DD>amount, information theory definition, 233<DD>deduction, 8<DD>destruction, 228–229</DL><DD>Information-theoretic approach, 418<DL><DD>stream ciphers, 415</DL><DD>Information theory, 233–237<DL><DD>cryptosystem security, 234–235<DD>entropy and uncertainty, 233–234<DD>in practice, 236–237<DD>rate of the language, 234<DD>unicity distance, 235–236⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -