内容

目次

Preface.- Advisory board members.- List of contributors.-Acknowledgements.- A5/1.- ABA digital signature guidelines .- accesscontrol.- access structure.- acquirer.- adaptive chosen ciphertext attack.-adaptive chosen plaintext and chosen ciphertext attack.- adaptive chosenplaintext attack.- Alberti encryption.- alphabet.- anonymity.- asymmetriccryptosystem.- attribute certificate.- attributes management.- authenticatedencryption.- authentication.- authentication token.- authorizationarchitecture.- authorization management.- authorization policy.-auto-correlation.- availability.- Beaufort encryption.- Berlekamp-Masseyalgorithm.- Berlekamp Q matrix.- binary Euclidean algorithm .- binaryexponentiation method.- binomial distribution.- biometrics.- birthdayparadox.- blind signature.- blinding techniques.- block ciphers.- Blowfish.-BLS short digital signatures.- Blum integer.- Blum-Blum-Shub Pseudorandom bitgenerator.- Blum-Goldwasser public key encryption system.- Bolero.net.-Boolean functions.- boomerang attack.- broadcast encryption.- Caesar cipher.-Camellia.- CAST.- CBC-MAC and variants.- CCIT-2.- CEPS standard.-certificate.- certificate management.- certificate of primality.- certificaterevocation.- certification authority.- certified mail.- chaffing andwinnowing.- challenge-response protocol.- Chaum blind signature scheme.-Chinese Remainder Theorem.- chosen ciphertext attack.- chosen plaintextattack.- chosen plaintext-chosen ciphertext attack.- ciphertext only attack.-claw-free.- CLIP-scheme.- clock-controlled generator.- closest vectorproblem.- code book attack.- collision attack.- collision resistance.-combination generator.- commitment.- Common Criteria.- communication channelanonymity.- compromizing emanations.- computational complexity.- contractsigning.- control vector.- copy protection.- correcting-block attack.-correlation attack for stream ciphers.- correlation-immune and resilientBoolean functions.- covert channel.- CPS, Certificate Practice Statement.-Cramer-Shoup public key scheme.- credentials .- cross-correlation.-cryptanalysis (classical).- crypto machines.- cryptology (classical).-cryptosystem.- CRYPTREC (Japanese algorithms evaluation).- cut-and-chooseprotocol.- cyclic codes.- Data Encryption Standard (DES).- data remanence.-Davies-Meyer.- DC Network.- de Bruijn sequence.- decisional Diffie-Hellmannproblem.- decryption exponent.- deniable encryption.- denial-of-service.-derived key.- designated confirmer signature.- DES-X.- dictionary attack(1).- dictionary attack (2).- differential cryptanalysis .- differentialpower analysis .- differential-linear attack.- Diffie-Hellman key agreement.-Diffie-Hellman problem.- digital signature schemes.- Digital SignatureStandard .- digital steganography.- discrete logarithm problem.- E0(Bluetooth cipher).- eavesdropper.- ECC challenges .- electromagneticattack.- electronic cash .- electronic cheque.- electronic negotiableinstruments.- electronic payment.- electronic postage.- electronic votingschemes.- electronic wallet.- ElGamal digital signature scheme.- ElGamalpublic key encryption.- elliptic curve cryptography.- elliptic curve discretelogarithm problem .- Elliptic Curve key agreement schemes.- elliptic curvekeys.- elliptic curve method for factoring.- elliptic curve pointmultiplication using halving.- Elliptic Curve public-key encryption schemes.-Elliptic Curve signature schemes.- elliptic curves.- elliptic curves forprimality proving.- EMV-standard.- encryption.- encryption exponent.-entitlements management.- entity authentication.- Euclidean algorithm .-Euler's totient function.- exhaustive key search.- existential forgery.-exponential time.- exponentiation algorithms.- extension field.- factorbase.- factoring circuits.- fail-stop signature.- fair exchange.- fastcorrelation attack.- fault attack.- FEAL.- Feistel cipher.- Fermat primalitytest.- Fermat's little theorem.- Fiat-Shamir identification protocol andFeige Fiat-Shamir signature scheme.- field.- field polynomial.- filtergenerator.- fingerprinting.- finite field.- FIPS 140.- firewall.- fixed-baseexponentiation.- fixed-exponent exponentiation.- forgery.- gap.- generalizedMersenne prime.- generator.- GMR signature.- Goldwasser-Micali encryptionscheme.- Golomb's randomness postulates.- GOST.- greatest common divisor.-group .- group key agreement.- group signature.- hard core bit.- HardwareSecurity Module.- hash function.- HMAC.- homomorphism.- HTTPS, secure HTTP.-IDEA.- identification.- identity based cryptosystems.- identity basedencryption.- identity management.- identity verification protocol.-impersonation attack.- impossible-differential attack.- index-calculusmethod.- information theory.- integer factoring.- interactive argument.-interactive proof.- interpolation attack.- intrusion detection.- invasiveattacks.- inversion attack.- inversion in finite fields and rings.- IPES.-IPsec.- irreducible polynomial .- issuer.- Itoh-Tsujii inversion algorithm.-Jacobi symbol.- Karatsuba algorithm.- KASUMI/MISTY1.- Kerberos authenticationprotocol.- key.- key agreement.- key authentication.- key encryption key.-key escrow.- key management.- knapsack cryptographic schemes.- knownplaintext attack .- lattice.- lattice reduction.- lattice-basedcryptography.- least common multiple.- Legendre symbol.- linear complexity(or linear equivalence).- linear congruential generator.- linear consistencyattack.- linear cryptanalysis for block ciphers.- linear cryptanalysis forstream ciphers.- linear feedback shift register.- linear syndrome attack.-L-notation.- Luby-Rackoff cipher.- MAA.- MAC algorithms.- man-in-the-middleattack.- MARS.- MASH functions (Modular Arithmetic Secure Hash).- masterkey.- Maurer's method.- maxims.- maximum-length linear sequence.- McEliecepublic key cryptosystem.- MD4-MD5.- MDC2 and MDC 4 .- meet-in-the-middleattack.- Mersenne prime.- Miller-Rabin probabilistic primality test.- minimalpolynomial.- MIPS-year.- miss-in-the-middle attack.- MIX networks.- modes ofoperation of a block cipher.- modular arithmetic.- modular root.- modulus.-MONDEX-scheme.- Montgomery arithmetic.- Moore's law.- multipartycomputation.- multiple encryption.- multi-precision multiplication.-multi-precision squaring.- multi-set attacks.- Needham-Schroeder protocols.-NESSIE project.- Niederreiter encryption scheme.- non-interactive proofs .-nonlinear feedback shift register.- non-linearity of Boolean functions.-non-malleability.- non-repudiation.- non-secret key encryption.- NTRU.-Number field.- Number Field Sieve.- number theory.- Nyberg-Rueppel signaturescheme.- OAEP: optimal asymmetric encryption padding.- oblivious transfer.-one-time password.- one-way function.- O-notation.- optimal extensionfields.- order.- overspender detection.- overspending prevention.- Paillierencryption and signature schemes.- password.- payment card.- PEM, PrivacyEnhanced Mail.- penetration testing.- perfect forward secrecy / PFS.-personal identification number (PIN).- physical attacks.- PKCS.- PKIX -Public Key Infrastructure (X.509).- Playfair cipher.- PMAC.- policy.-Polybios square encryption.- polynomial time.- Porta encryption.- preimageresistance.- Pretty Good Privacy.- primality proving algorithm.- primalitytest.- prime generation.- prime number.- primitive element.- privacy.-privilege management.- probabilistic primality test.- probabilisticpublic-key encryption.- product cipher, superencryption.- proof of knowledgevs proof of membership.- propagation characteristics of Boolean functions.-protocol.- Proton.- pseudo Mersenne primes.- pseudo-noise sequence.-pseudonyms.- pseudoprime.- pseudo-random function.- pseudo-random numbergenerator .- public key cryptography.- Public Key Infrastructure.- public keyproxy encryption.- public key proxy signatures.- quadratic residue.-Quadratic Residuosity Problem.- Quadratic Sieve.- quantum cryptography.-Rabin cryptosystem.- Rabin digital signature scheme.- radio frequencyattacks.- random bit generation (hardware).- random oracle model.- RC4.-RC5.- RC6.- recipient anonymity.- Reed-Muller codes.- RegistrationAuthority.- related key attack.- relatively prime.- relay attack.- replayattack.- response.- resynchronization attack.- rights management.-right-to-left exponentiation.- Rijndael/AES.- ring.- RIPEMD family.- RSAdigital signature scheme.- RSA factoring challenge .- RSA problem.- RSApublic-key encryption.- run.- running key.- safe prime.- salt.- Schnorrdigital signature scheme.- Schnorr Identification Protocol .- SEAL.- secondpreimage resistance.- secret sharing schemes.- secure signatures from the"strong RSA" assumption.- Secure Socket Layer (SSL) .- security.- SecurityArchitecture.- Security Evaluation Criteria.- security standards activities.-selective forgery.- self-shrinking generator.- self-synchronizing streamcipher.- semantic security.- sender anonymity.- sequences.- Serpent.- SET.-SHA family (Secure Hash Algorithm).- Shamir's threshold scheme.- Shannon'smodel.- share.- shortest vector problem.- shrinking generator.- side-channelanalysis.- side-channel attacks.- sieving.- sieving in function fields .-signcryption.- signed digit exponentiation.- simultaneous exponentiation.-Skipjack.- slide attack.- sliding window exponentiation .- smartcard tamperresistance.- S/MIME.- smoothness.- smoothness probability.- solitaire.-SPKI.- SSH.- station-to-station protocol / STS protocol.- stream cipher.-strong prime.- strong RSA assumption.- structural cryptanalysis.-sub-exponential time.- subgroup.- subgroup cryptosystems.- substitutions andpermutations.- substitution-permutation (SP) network.- summation generator.-symmetric cryptosystem.- synchronous stream cipher.- tamper detection.-tamper resistance.- tamper response.- tempest.- threshold cryptography.-threshold scheme.- threshold signature.- time stamping.- time-memorytradeoffs.- timing attack.- token.- traitor tracing.- Transport LayerSecurity (TLS).- trapdoor one-way function .- Triple DES.- Trojan horses,computer viruses and worms .- truncated differentials.- trust models.-trusted third party.- TWIRL.- two-factor authentication.- TWOFISH.-two-to-the-k-ary exponentiation.- undeniable signatures.- Universal One-WayHash Functions (UOWHF).- unlinkability.- untraceability.- userauthentication.- verifiable encryption.- verifiable secret sharing .- Vernamcipher.- Vigenere cryptosystem .- virus protection.- visual secret sharingscheme.- watermarking.- weak keys.- web security.- Wiener, Boneh-Durfee, andMay Attacks on the RSA Public Key Cryptosystem.- witness hiding.- X.509.-zero-knowledge.- Index.