📄 book-index.html
字号:
</DL><DD>Ingemarsson, Ingemar, 418<DD>Initialization vector:<DL><DD>cipher block chaining mode, 194<DD>cipher-feedback mode, 201<DD>output-feedback mode, 204</DL><DD>Inner-CBC, 360, 363<DD>Insertion attack, synchronous stream ciphers, 203<DD>Instance deduction, 8<DD>Institute of Electrical and Electronics Engineers, 608<DD>Integrated Services Digital Network, 563–565<DD>Integrity, 2<DD>Interactive protocol, 103<DD>Interchange Key, 581<DD>Interleave, 210–211<DD>Interlock protocol, mutual authentication using, 54–55<DD>Internal feedback, 203<DD>International Association for Cryptologic Research, 605<DD>International Standards Organization:<DL><DD>authentication framework, 574–577<DD>DES adoption, 268</DL><DD>International Traffic in Arms Regulations, 610–614<DD>Internet, Privacy-Enhanced Mail, 577–584<DD>Introducers, 187<DD>Inverses modulo a number, 246–248<DD>IPES, 319<DD>ISDN, 563–565<DD>ISO 8732, 359<DD>ISO 9796, 472, 474, 486<DD>ISO/IEC 9979, 607<DD>ISO X.509 protocols, 574–577<DD>Iterated block cipher, 347<DD>Jacobi symbol, 252–253<DD>J-algebras, 501<DD>Jam, 414<DD>Jennings generator, 383–384<DD>Johnson, David, 241<DD>Jueneman’s methods, 457<DD>Kaliski, Burt, 342<DD>Karn, 351–352<DD>Karn, Phil, 351<DD>Karnin-Greene-Hellman, 530<DD>Kerberos, 60, 566–571<DL><DD>abbreviations, 567<DD>authentication steps, 567<DD>credentials, 568<DD>getting initial ticket, 569<DD>getting server tickets, 569–570<DD>licenses, 571<DD>model, 566<DD>requesting services, 570<DD>security, 571<DD>Version 4, 570–571<DD>Version 5 messages, 568</DL><DD>Kerckhoffs, A., 5<DD>Kerckhoffs’s assumption, 7<DD>Key, 3<DL><DD>backup, 181–182<DD>CDMF shortening, 366<DD>complement, DES, 281–282<DD>compromised, 182–183<DD>controlling usage, 180<DD>dereferencing, 221–222<DD>destroying, 184–185<DD>distribution in large networks, 177<DD>generating, 170–175<DL><DD>ANSI X9.17 standard, 175<DD>DoD, 175<DD>pass phrases, 174–175<DD>poor choices, 171–173<DD>random keys, 173–174<DD>reduced keyspaces, 170–171</DL><DD>ISDN, 563–564<DD>lifetime, 183–184<DD>possibly weak, DES, 281–282<DD>semiweak, DES, 280–281<DD>session, 33, 180<DD>storing, 180–181<DD>transferring, 176–177<DD>transmission, error detection, 178<DD>updating, 180<DD>using, 179–180<DD>verification, 178–179<DD>weak<DL><DD>block ciphers design theory, 348DES, 280–281</DL></DL><DD>Key and message broadcast, 51–52<DD>Key and message transmission, 51<DD>Key Auto-Key, 202<DD>Keyboard latency, as random-sequence generator, 424–425<DD>Key Certification Authority, 43<DD>Key control vectors, 562<DD>Key distribution:<DL><DD>anonymous, 94–95<DD>conference, 524</DL><DD>Key Distribution Center, 43–44<DD>Key-Encryption Keys, 176, 184<DD>Key escrow, 97–100, 181–182, 591<DL><DD>politics, 98–100</DL><DD>Key exchange, 47–52<DL><DD>DASS, 62<DD>Denning-Sacco protocol, 63<DD>with digital signatures, 50<DD>interlock protocol, 49–50<DD>Kerberos, 60<DD>key and message broadcast, 51–52<DD>key and message transmission, 51<DD>man-in-the-middle attack, 48–49<DD>Needham-Schroeder protocol, 58–59<DD>Neuman-Stubblebine protocol, 60–62<DD>Otway-Rees protocol, 59–60<DD>protocols, formal analysis, 65–68<DD>with public-key cryptography, 48<DD>with symmetric cryptography, 47–48<DD>Wide-Mouth Frog protocol, 56–57<DD>without exchanging keys, 515<DD>Woo-Lam protocol, 63–64<DD>Yahalom, 57–58</DL><DD>Key-exchange algorithms:<DL><DD>COMSET, 517–518<DD>conference key distribution and secret broadcasting, 523–525<DD>Diffie-Hellman, 513–516<DD>Encrypted Key Exchange, 518–522<DD>fortified key negotiation, 522<DD>Shamir’s three-pass protocol, 516–517<DD>station-to-station protocol, 516<DD>Tatebayashi-Matsuzaki-Newman, 524–525</DL><DD>Key generation, using coin flipping, 92<DD>Key length:<DL><DD>comparing symmetric and public-key, 165–166<DD>deciding on, 166–167<DD>DES, 283–284<DD>public-key, 158–165<DL><DD>DNA computing, 163–164<DD>quantum computing, 164–165<DD>recommended lengths, 161–163</DL><DD>symmetric, 151–158<DL><DD>biotechnology as cryptanalysis tool, 156–157<DD>brute-force attack, 151–154<DD>Chinese Lottery, 156–157<DD>neural networks, 155<DD>software-based brute-force attacks, 154–155<DD>thermodynamic limitations on brute-force attacks, 157–158<DD>using viruses to spread cracking program, 155–156</DL></DL><DD>Key management, 169–187<DL><DD>distributed, 187<DD>public-key, 185–187</DL><DD>Key negotiation, fortified, 522<DD>Key notarization, 562<DD>Key revocation certificate, 585<DD>Keyspace, 3<DL><DD>flat, 176<DD>nonlinear, 175–176<DD>reduced, 170–171</DL><DD>Keystream generator, 197–198<DL><DD>counter mode, 206<DD>periodic, 202</DL><DD>Khafre, 317–318, 349<DD>Khufu, 317, 349<DD>Kilian, Joe, 116<DD>Kim, Kwangjo, 298, 350<DD>Kinetic Protection Device, 389–390<DD>Klapper, Andy, 404<DD>Klein, Daniel, 53, 171<DD>Knapsack algorithms, 462–466<DL><DD>decryption, 465<DD>encryption, 464<DD>implementations, 465<DD>patents, 466<DD>public key created from private key, 464<DD>security, 465<DD>superincreasing, 463–464<DD>variants, 465–466</DL><DD>Knapsack problem, 501<DD>Known-plaintext attack, 6–7, 151, 359<DD>Knudsen, Lars, 8, 293, 314, 316, 348–349<DD>Knuth, 393, 501<DD>Koblitz, Neal, 480<DD>Konheim, Alan, 266, 280<DD>Kravitz, David, 493<DD>Kravitz-Reed, 481<DD>KryptoKnight, 571–572<DD>Lagged Fibonacci generators, 390<DD>LaGrange interpolating polynomial scheme, 528–529<DD>Lai, Xuejia, 319, 449<DD>Langford, Susan, 293<DD>Law Enforcement Access Field, 591<DD>Legal issues, 618<DD>Legendre symbol, 251<DD>Lehmann, 259<DD>Lehmann algorithm, 259<DD>Length, shift register, 373<DD>Lenstra, Arjen, 159, 162, 257, 485, 488<DD>LFSR/FCSR summation/parity cascade, 410–411<DD>Lidl, Rudolph, 481<DD>Linear complexity:<DL><DD>profile, 380<DD>stream ciphers, 380</DL><DD>Linear congruential generators, 369–372<DL><DD>combining, 371–372<DD>constants, 370</DL><DD>Linear consistency test, 381<DD>Linear cryptanalysis:<DL><DD>DES, 290–293<DD>strength against, block cipher design theory, 348–349</DL><DD>Linear error-correcting codes, algorithms based on, 480<DD>Linear feedback shift registers, 372–379<DL><DD>Galois, 378–379<DD>primitive polynomials mod 2, 376–377<DD>software, 378–379<DD>stream ciphers using, <I>see</I> Stream ciphers</DL><DD>Linear syndrome algorithm, 381<DD>Link-by-link encryption, 216–218<DL><DD>combined with end-to-end, 219–221</DL><DD>Linking protocol, timestamping, 76–77<DD>Li-Wang algorithm, 346<DD>Local deduction, 8<DD>Lock-in, 388<DD>Logarithms, discrete, <I>see</I> Discrete logarithm<DD>LOKI, 314–316<DL><DD>S-boxes, 349<DD>source code, 632–637</DL><DD>LOKI Double-Block, 451<DD>Low decryption exponent attack, RSA, 473<DD>Low encryption exponent attack, RSA, 472–473<DD>Luby, Michael, 352<DD>Luby-Rackoff, 352–353<DL><DD>xDES<SUP>1</SUP>, 365</DL><DD>LUC, 481<DD>Lucas number, 481<DD>Luccio-Mazzone, 501<DD>Lucifer, 266, 303–304<DD>Lu-Lee cryptosystem, 466<DD>Lyndon words, 501<DD>MacGuffin, 346<DD>Madryga, W. E., 304<DD>Mafia Fraud, 110<DD>Magic numbers, 423<DD>Manasse, Mark, 159, 257<DD>Man-in-the-middle attack, 48–49<DD>Masks, REDOC II, 312<DD>Massey, James, 319, 339, 386, 418, 449<DD>Master Key, 561<DD>Master Terminal Key, 561<DD>Matsui, Mitsuru, 290–291<DD>Matsumoto-Imai algorithm, 500<DD>Mauborgne, Joseph, 15<DD>Maurer, Ueli, 419<DD>Maurer’s randomized stream cipher, 419<DD>Maximal period generator, 369<DD>MBAL, 344<DD>McEliece, Robert, 479<DD>McEliece algorithm, 346, 479–480<DD>MD2, 441<DD>MD3, 446<DD>MD4, 435–436<DD>MD5, 436–441<DD>MDC, 353–354<DD>MDC-2, 452–453<DD>MDC-4, 452–454<DD>MD-strengthening, 431<DD>Meet-in-the-middle attack, 358, 381<DD>Mental poker, 92–95<DD>Merkle, Ralph, 34, 316–318, 358–359, 432, 455, 461–462<DD>Merkle’s puzzles, 34<DD>Merritt, Michael, 67, 518, 520–521, 571<DD>Message:<DL><DD>authentication, 56<DD>broadcasting, 69<DD>Privacy-Enhanced Mail, 579–582<DD>recovery, 497–498<DD>resending as receipt, 42–43</DL><DD>Message authentication codes, 31, 455–459<DL><DD>bidirectional, 457<DD>CBC-MAC, 456<DD>IBC-Hash, 458<DD>Jueneman’s methods, 457<DD>message authenticator algorithm, 456–457<DD>one-way hash functions as, 458–459<DD>RIPE-MAC, 457–458<DD>stream ciphers, 459</DL><DD>Message authenticator algorithm, 456–457<DD>Message broadcast, anonymous, 137–139<DD>Message Digest, 435–436<DD>Message Digest Cipher, 353<DD>Message Integrity Check, 578<DD>Message-meaning rule, 66<DD>Message Security Protocol, 584<DD>Meyer, Carl, 266, 278<DD>Meyer, Joseph A., 614<DD>Meyer-Schilling, 452<DD>Micali, Silvio, 94, 508, 546–547, 552<DD>Miller, Gary, 259<DD>Miller, V. S., 480<DD>Mimic functions, 10<DD>Minimum-disclosure proofs, 108<DD>MITRENET, 562–563<DD>Miyaguchi, Shoji, 308<DD>MMB, 325–327<DD>m*n-bit S box, 349<DD>Modular arithmetic, 242–245<DD>Modular Multiplication-based Block cipher, 325–327<DD>Modular reduction, 242<DD>Modulo, inverses, 246–248<DD>Monoalphabetic cipher, 10<DD>Montgomery’s method, 244<DD>Moore’s Law, 153<DD>m-sequence, 374<DD>MSP, 584<DD>Muller, Winfried, 481<DD>Multiparty unconditionally secure protocols, 137<DD>Multiple-bit generator, 421<DD>Multiple encryption, 357<DL><DD>quintuple, 366</DL><DD>Multiple Identity Fraud, 111<DD>Multiple-key public-key cryptography, 527–528<DD>Multiple signatures, 39–40<DD>Multiplier, 369<DD>Multispeed inner-product generator, 386–387<DD>Mush, 392<DD>Mutual shrinking generator, 392<DD>MYK-80, 593–594<DD>Mykotronx Clipper chip, 328<DD>MYK-78T, 591–593<DD>Nanoteq, 390<DD>National Bureau of Standards, <I>see</I> National Institute of Standards and Technology<DD>National Computer Security Center, 599–600<DD>National Institute of Standards and Technology, 600–603<DL><DD>DES development, 265–267<DD>Memorandum of Understanding, 601–603</DL><DD>National Security Agency, 597–599<DL><DD>DES development, 266–267<DD>export of cryptography, 614–615<DD>Memorandum of Understanding, 601–603<DD>S-box development role, 278, 280</DL><DD>Navy Research Laboratory, protocol analyzer, 67–68<DD>Needham, Roger, 58, 66, 216<DD>Needham-Schroeder protocol, 58–59<DD>Networks, large, key distribution, 177<DD>Neuman-Stubblebine protocol, 60–62<DD>Neural networks, breaking algorithms, 155<DD>NewDES, 306–308<DD><I>N</I>-Hash, 433–435<DD>Niederreiter, Harald, 501<DD>Niederreiter algorithm, 480<DD>Niemi cryptosystem, 466<DD>Nobauer, Wilfried, 481<DD>Noise, random, using as random-sequence generator, 423–424<DD>Nonce-verification rule, 66<DD>Non-Interactive Key Sharing systems, 115<DD>Nonlinear-feedback shift registers, 412–413<DD>Nonlinear keyspace, 175–176<DD>Nonrepudiation, 2<DD>Notz, Bill, 266<DD>NP-complete problem, 240–242<DL><DD>graph isomorphism, 104<DD>knapsack algorithms, 462<DD>McEliece algorithm, 479<DD>solving, 163–164</DL><DD>NRL Protocol Analyzer, 67–68<DD>NSDD-145, 268<DD>Nuclear Non-Proliferation Act, 610<DD>Number field sieve, 256<DD>Numbers:<DL><DD>2–adic, 404<DD>large, 17–18</DL><DD>Number theory, 242–255<DL><DD>Barrett’s algorithm, 244<DD>Blum integers, 253<DD>Chinese remainder theorem, 249–250<DD>Euclid’s algorithm, 245<DD>Euler totient function, 248–249<DD>extended Euclidean algorithm, 246–248<DD>Fermat’s little theorem, 248<DD>Galois field, computing in, 254–255<DD>generators, 253–254<DD>greatest common divisor, 245–246<DD>inverses modulo a number, 246–248<DD>Jacobi symbol, 252–253<DD>Legendre symbol, 251<DD>modular arithmetic, 242–245<DD>Montgomery’s method, 244<DD>prime numbers, 245<DD>quadratic residues, 250–251<DD>solving for coefficients, 248</DL><DD>Nyberg, Kaisa, 348⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -