📄 book-index.html
字号:
<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<DD>using square roots, 541–542</DL><DD>Collision, 166<DD>Collision-free, 30<DD>Collision-resistance, 429<DD>Combination generator, 381<DD>Combining function, 381<DD>Commercial COMSEC Endorsement Program, 269, 598–599<DD>Commercial Data Masking Facility, 366, 574<DD>Common Cryptographic Architecture, 573–574<DD>Common modulus, dangers of, 493<DD>Common modulus attack, RSA, 472<DD>Communications:<DL><DD>using public-key cryptography, 31–34<DD>using symmetric cryptography, 28–29</DL><DD>Communications channels, encryption, 216–220<DD>Communications Setup, 517–518<DD>Complementation property, 281<DD>Complement keys, DES, 281–282<DD>Completely blind signatures, 112–113<DD>Complete set of residues, 242<DD>Complexity-theoretic approach, stream ciphers, 415–418<DD>Complexity theory, 237–242<DL><DD>algorithms, 237–239<DD>complexity of problems, 239–241</DL><DD>Compression, 226<DD>Compression function, 431<DD>Compression permutation, 273–274<DD>Compromise, 5<DD>Compromised keys, 182–183<DD>Computational complexity, 237<DD>Computationally secure, 8<DD>Computer algorithms, 17<DD>Computer clock, as random-sequence generator, 424<DD>Computer Security Act of 1987, 600–601<DD>Computing, with encrypted data, 85–86, 540–541<DD>COMSET, 517–518<DD>Conditional Access for Europe, 606–607<DD>Conference key distribution, 524<DD>Confusion, 237, 346–347<DD>Congruent, 242<DD>Connection integer, 403<DL><DD>feedback with carry shift registers, maximal-period, 406–407</DL><DD>Continued fraction algorithm, 256<DD>Contract signing, simultaneous:<DL><DD>with an arbitrator, 118<DD>without an arbitrator<DL><DD>face-to-face, 118–119<DD>not face-to-face, 119–120<DD>using cryptography, 120–122</DL></DL><DD>Control Vector, 180<DD>Convertible undeniable signatures, 538–539<DD>Coppersmith, Don, 94, 266, 280, 283, 293, 398, 457<DD>Coppersmith’s algorithm, 263<DD>Correlation attack, 380<DD>Correlation immunity, stream ciphers, 380<DD>Correlations, random-sequence generators, 425<DD>Counter mode, 205–206, 209<DD>Counting coincidences, 14<DD>Crab, 342–344<DD>Credit cards, anonymous, 147<DD>Crepeau, Claude, 555<DD>Crypt(1), 414<DD>CRYPT(3), 296<DD>Cryptanalysis, 1, 5–8<DL><DD>differential, <I>see</I> Differential cryptanalysis<DD>FEAL, 311–312<DD>GOST, 333–334<DD>IDEA, 323<DD>linear, 290–293<DD>LOKI91, 316<DD>Madryga, 306<DD><I>N</I>-Hash, 434–435<DD>related-key, 290<DD>Snefru, 432<DD>types, 5–7</DL><DD>Cryptanalysts, 1<DD>Crypt Breakers Workbench, 414<DD>Cryptographers, 1<DD>Cryptographic algorithm, <I>see</I> Cipher<DD>Cryptographically secure pseudo-random, 45<DD>Cryptographic facility, 562<DD>Cryptographic mode, 189<DD>Cryptographic protection, databases, 73–74<DD>Cryptographic protocol, 22<DD>Cryptography, 1<DD>CRYPTO-LEGGO, 414<DD>Cryptologists, 1<DD>Cryptology, 1<DD>CRYPTO-MECCANO, 346<DD>Cryptosystems, 4<DL><DD>fair, 97<DD>finite automaton public-key, 482<DD>hybrid, 32–34<DD>security, 234–235<DD>weak, 97</DL><DD>Cusick, Thomas, 312<DD>Cut and choose, 103<DD>Cypherpunks, 609<DD>Daemen, Joan, 325, 341, 349, 414<DD>Damgard, Ivan, 446<DD>Damm, Arvid Gerhard, 13<DD>Data, encrypted:<DL><DD>computing with, 85–86, 540–541<DD>discrete logarithm problem, 540–541<DD>for storage, 220–222</DL><DD>Databases, cryptographic protection, 73–74<DD>Data complexity, 9<DD>Data Encryption Algorithm, <I>see</I> Data Encryption Standard<DD>Data Encryption Standard, 17, 265–301<DL><DD>adoption, 267–268<DD>algorithm, brute-force attack efficiency, 152–153<DD>characteristics, 286–288<DD>commercial chips, 279<DD>compared to GOST, 333–334<DD>compression permutation, 273–274<DD>CRYPT(3), 296<DD>decryption, 277<DD>description, 270<DD>DESX, 295<DD>development, 265–267<DD>differential cryptanalysis, 284–290<DL><DD>DES variants, 298</DL><DD>expansion permutation, 273–275<DD>final permutation, 277<DD>generalized, 296–297<DD>hardware and software implementation, 278–279<DD>with independent subkeys, 295<DD>initial permutation, 271<DD>iterated block cipher, 347<DD>key transformation, 272–273<DD>linear cryptanalysis, 290–293<DD>modes, 277–278<DD>multiple, 294–295<DD>1987 review, 268–269<DD>1993 review, 269–270<DD>outline of algorithm, 270–272<DD>P-boxes<DL><DD>design criteria, 294<DD>permutation, 275, 277</DL><DD>RDES, 297–298<DD>related-key cryptanalysis, 290<DD>RIPE-MAC, 457–458<DD>S-boxes, 349<DL><DD>alternate, 296–298<DD>design criteria, 294<DD>key-dependent, 298, 300, 354<DD>substitution, 274–276</DL><DD>security, 278, 280–285<DL><DD>algebraic structure, 282–283<DD>complement keys, 281–282<DD>current, 300–301<DD>key length, 283–284<DD>number of rounds, 284<DD>possibly weak keys, 281–282<DD>S-box design, 284–285<DD>semiweak keys, 280–281<DD>weak keys, 280–281</DL><DD><I>sn</I>DES, 298–299<DD>source code, 623–632<DD>speeds on microprocessors and computers, 279<DD>validation and certification of equipment, 268</DL><DD>Data Exchange Key, 581<DD>Data Keys, 176<DD>Davies, Donald, 562<DD>Davies-Meyer, 448<DL><DD>abreast, 452<DD>modified, 449–450<DD>parallel, 451<DD>tandem, 451–452</DL><DD>Davies-Price, 358<DD>Decoherence, 165<DD>Decryption, 1<DL><DD>DES, 277<DD>key, 3<DD>key-error detection, 179<DD>knapsack algorithms, 465<DD>with a public key, 39
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -