<<

. 2
( 5 .)



>>

decision-making module, 35
cross-certi¬cation, 632 direct payment schemes, 176
decorrelation, 45, 353
cross-correlation, 113 discrete Fourier transform, 54, 403
decryption, 202, 568
crossing step, 460 discrete logarithm, 164
decryption algorithm, 119
crowds, 384, 385, 478 discrete logarithm problem, 164“67
decryption exponent, 142
CRT, 75 discretionary access control, 4
decryption steps, 202
cryptanalysis, 43, 113 discriminant, 184
DECT, 367
crypto machines, 116“18 Disquisitiones Arithmeticae, 472
Deep Crack, 626
cryptographic boundary, 229 distance, 124
de¬nitely composite, 480
cryptographic message syntax, 592 distinguished points, 615
degree, 211, 313, 347, 430
cryptographic module, 458 distinguisher, 287, 383
676 Index


distinguishing algorithm, 43 electronic funds transfer, 176 EtM, 13
distinguishing attack, 354 electronic negotiable instruments, Euclidean algorithm, 204“6
distributed DoS attack, 144 175 EU-CMA, 546
distributed key generation, 646 electronic noise source, 511 Euler liar, 473
distributivity, 524 electronic payment, 175“77 Euler pseudoprime, 473
divide-and-conquer attack, 105 electronic postage, 177“78 Euler™s phi function, 206
division intractable, 546 electronic purse, 180“82 Euler™s theorem, 206, 392, 394, 537
Dixon™s random squares methods, 294 electronic voting schemes, 179“80 Euler™s totient function, 206, 394,
DLP, 164“67 electronic wallet, 180“82 537
DMCA, 101 Elements, 471 evaluation assurance level, 86, 87“88
DMZ, 300 ElGamal digital signature scheme, evaluation of policy, 463
domain parameters, 189, 190 182 Even-Mansour, 587
DoS, 143, 300 ElGamal public key encryption, 183 exact identi¬cation, 226
double-and-add, 33 elliptic curve cryptography, 186 excluded subtrees, 636
double-DES, 626 elliptic curve discrete logarithm exculpability scheme, 251
double key, 323 problem, 186“88 exhaustive key search, 43, 114, 206
DP, 615 elliptic curve integrated encryption existential forgery, 209, 362, 363
DPA, 152, 171, 302, 572, 573 scheme, 195 expansion, 129
DPD, 69 elliptic curve key agreement explicit policy indicator, 635
DPV, 69 schemes, 189 exponential security, 93
DRM, 101 elliptic curve keys, 189 exponential time, 210
DRMS, 101 elliptic curve method for factoring, exponentiation, 244
DSA, 158 190 exponentiation algorithms, 210“11,
DSG, 421 elliptic curve point multiplication 520
DSS, 158“59 using halving, 191“94 extended Euclidean algorithm, 204
DTR, 230 elliptic curve primailty proving extended MD4, 261
dual code, 124 algortihm, 474 extension degree, 211
DVD, 656 elliptic curve public-key extension ¬eld, 211
dynamic adversary, 399 encryption schemes, 195 extension ¬eld operations, 449
dynamic attribute, 25 elliptic curve signature schemes, external collision, 364
dynamic authentication, 198 195
F
dynamic data authentication, 198 elliptic curves, 183“86
dynamic group signature scheme, 250 elliptic curves for primality
factor base, 166, 213, 293, 432, 493
dynamic traitor tracing, 622, 623 proving, 196
factoring, 290“96
EMA, 170“73
E factoring circuits, 213
EMAC, 17, 64, 365, 366, 410, 411
FACTORING problem, 93, 96
EMP, 504
E&M, 14 fail-stop signature, 213
EMV, 181, 197“201, 482
E0 (Bluetooth), 169 fair blind signature, 38
encapsulating security payload, 310
EAL, 86, 87“88 fair exchange, 97, 215
enciphering, 202
easy, 333 fairness, 399
Encrypt-and-MAC, 14
eavesdropper, 169, 591 false accept error, 35
encrypt copyrighted content, 100
EAX, 16, 17 false positive, 143, 226, 299, 651
encryption, 202, 568
Ebay, 215 false reject error, 35
encryption algorithm, 119
ECB, 386 fast correlation attack, 216
encryption exponent, 202
ECC, 124, 186 fast data encipherment algorithm, 219
encryption key, 202, 488
ECC challenges, 170 fault attacks, 218“19, 302
encryption rule, 202
ECDLP, 186“88 fault generation, 591
encryption step, 202
ECDSA, 195, 410, 411 FCG, 506
Encrypt-then-MAC, 13
ECIES, 195 FDH, 502, 528
end entity, 594
ECMS, 100, 655 FEAL, 219
endomorphic cryptosystem, 119
ECPP, 474 feature extraction module, 35
enforcement, 2, 461
ECSTR, 599 Federal Information Processing
Enigma, 117
ED, 335 Standard, 227“30
entitlement, 202
EE, 594 federation, 285
entitlements management, 202
ef¬ciency, 245, 246, 248, 651 feedback bit, 355
entity authentication, 203
egress ¬ltering, 231, 233 feedback coef¬cients, 355
entropy, 289, 486
electromagnetic attack, 170“73, 302 feedback function/polynomial, 355, 356,
envelope, 226
electromagnetic pulse, 504 415
envelope MAC, 365, 366
electronic cash, 174“75 feedback shift register, 415
environmental attacks, 576
electronic cheque, 175 Feige-Fiat-Shamir signature scheme,
EPC, 482
electronic codebook mode (ECB), 386 222
ephemeral, 325, 457
electronic coin, 174 Feistel cipher, 221
equivalent, 391
electronic commerce, 7, 313 Fermat liar, 472, 473
equivocation, 289
electronic copyright management Fermat primality test, 221, 293, 484
erasure-free, 612
system, 100, 655 Fermat prime, 483
error-correcting code, 124
Electronic Frontier Foundation, 626 Fermat™s little theorem, 221, 292, 472
ESP, 310
Index 677


Fiat“Naor construction, 58 general purpose primality test, 437, 438 Hellmann™s time-memory trade-off, 646
Fiat-Shamir identi¬cation protocol generalized Feistel, 221 HEMP, 504
and Feige Fiat-Shamir generalized inversion attack, 307 Hermite-Korkine-Zolotarev lattice
signature scheme, 222 generalized Mersenne number, 239 reduction, 346
FIB, 303, 305 generalized Mersenne prime, 239 hidden ¬elds, 665
¬eld, 222, 227 generator, 240 hider, 580
¬eld polynomial, 223 generator matrix, 124 hierarchical namespace, 273
¬lter generator, 223 generator polynomial, 125 high order DPA, 171
¬ltering (packets), 231 generic, 514 history variable, 419
¬ngerprinting, 101, 161, 225“26 Gennaro-Halevi-Rabin scheme, 546, 547 HMAC, 14, 267, 366, 410, 411
¬ngerprinting code, 226 geometry of numbers, 345 holocryptic, 323
¬nite ¬eld, 223, 227 GHS attack, 188 homomorphic secret sharing, 609
FIPS, 129, 227“30, 268, 386, 487, 566, Givierge™s maxim, 371 homomorphism, 268
626 GKE, 244“48 homophone, 202
¬rewall, 230“33 global deduction, 43 honest-but-curious adversary, 399
Fischlin scheme, 547 glue logic design, 305 host security, 662
¬xed-base comb method, 234 GMR signature, 240 HSM, 254
¬xed-base Euclidean method, 235 GNFS, 430, 431, 432 HTTP, 230
¬xed-base exponentiation, 210, 233 GNU Privacy Guard, 466, 468 HTTPS, secure HTTP, 268
¬xed-base windowing method, 233 GOC PKI, 557 hyperelliptic cryptosystems, 577
¬xed-exponent exponentiation, 210, Golay code, 125 hypertext transfer protocol, 230
235 Gold sequence, 375
I
¬xed point attack, 259 Goldwasser“Micali encryption
¬‚at namespace, 273 scheme, 241
IACBC, 15
¬‚exible RSA assumption, 546 Golomb ruler, 224
IAPM, 13, 15
¬‚ip-¬‚op metastability source, 511, 512 Golomb™s randomness postulates,
IBE, 273, 280“81
¬‚ooding DoS attack, 143 242, 487
IBIP, 177
¬‚ow, 300 Goppa codes, 375, 376, 377, 378
IBS, 273, 276
focused ion beam, 303, 305 GOST, 242
ICC, 218
forgery, 237 GPS, 410, 411
ICE-CAR, 557
forgery attack, 361, 362 Graham-Shamir scheme, 335, 337
ID, 299“301
Fortezza, 586 greatest common divisor, 243
IDEA, 271
forward mixing, 368 grille, 601
ideal, 125
forward secrecy, 245 group, 243
ideal SSS, 545
forward security, 251, 613 group axioms, 243
ideally secure hash function, 258
fragmentation, 384 Group Computational Dif¬e-Hellman
identi¬able parent property, 226
frame, 519 assumption, 247
identi¬cation, 203, 272
frame counter, 519 group key agreement, 244“48
identi¬er, 282
frame number, 1 group key distribution, 244
identity, 244, 476, 524
frequency matching, 114 group manager, 645
identity based cryptosystems,
freshness, 245, 407 group names, 594
273“78
Frobenius map, 187 group of units, 524
identity based encryption, 280“81
Frobenius-Grantham primality test, group session key, 248
identity based scheme, 222
473, 474 group signature, 250“51
identity based signature, 273, 274, 276
FSR, 415 GSM, 1
identity escrow scheme, 251
Fujiwara-Okamoto transformation, 276, Guillou-Quisquater signature scheme,
identity management, 282“85
278 274
identity provider, 285
full-domain hash method, 502, 528
H identity theft, 285
full-knowledge prenetration test, 456
identity uniqueness, 272
full positive difference set, 224
Hadamard transform, 54 identity veri¬cation protocol, 285
function ¬eld, 577
Hagelin, 117 IDS, 300
fundamental theorem of arithmetic, 470
half-trace, 193 IEEE P1363, 556
G halving, 192 IEEE P802, 556
Hamiltonian graph, 481 IEFT, 596
Galois ¬eld, 227 Hamming distance, 53, 124, 416 IEMP, 505
gap, 239 Hamming weight, 53, 124 IETF, 71, 313, 619
gap Dif¬e-Hellman assumption, 582 handshake, 548 IKE, 310, 312
gap Dif¬e-Hellman group, 276, 613 hard core bit, 253 imbalance, 353
Gaussian integer method, 288 Hardware Security Module, 254 impersonation attack, 21, 286
gcd, 243 hash function, 256“64 impossible cryptanalysis, 150
GCDH assumption, 247 hash rate, 261 impossible differential attack, 286
G-DES, 518 hash127, 14 improved Davies attack, 132
Geffe generator, 486 hash-and-sign, 616 incremental hash function, 264
general exponentiation, 210 Hasse™s theorem, 185 IND, 559
general knapsack scheme, 336 HAVAL, 261 IND-CCA2, 108, 109
general NFS, 430, 431, 432 HELIX, 18 independent key, 290
678 Index


independent subkeys, 133 irreducible polynomial, 313 key recovery attack, 363
index of coincidence, 115 ISAKMP, 310, 312 key revocation, 56, 278
index-calculus method, 166, 187, ISO, 86, 87, 200, 201, 268, 361, 530, 619 key schedule algorithm, 41
287“89 isolog, 113 key schedule attacks, 45
indirect payment systems, 175 isomorph, 113 key space, 568
indistinguishability of encryptions, 559 issuer, 181, 313, 594, 595 key stream, 539
individual conversion operation, 145, ITA, 313“16 key symmetric cryptosystem, 325
642 iterated attacks, 43 key text, 119, 323
individual key, 324 iterated cipher, 41 key token, 621
inferential power analysis, 573 iterated hash function, 258 key translation, 99
Information Based Indicia Program, iterated Merkle-Hellman scheme, 334, key transport, 326
177 337 KeyNote system, 463
information hiding, 159, 161 iterative cipher, 480, 586 key-whitening, 46
information integrity, 21 Itoh-Tsujii inversion algorithm, Khufu, 287, 383
information leakage, 571 313“16 kleptography, 106
information symbols, 124 ITSEC, 552 KN cipher, 298
Information Technology Security ITU, 459, 669 knapsack cryptographic schemes,
Evaluation Criteria, 552 IV (initial value), 258, 386 333“40
information theoretic security, 551 knapsack problem, 263, 333
J
information theory, 289“90 knowledge extractor, 481
Ingemarsson-Tang-Wong protocol, 246 known plaintext attack, 42, 114, 342
Jacobi Sum Test, 474
ingress ¬ltering, 231, 233 known related key, 518
Jacobi symbol, 317
inhibit any policy extension, 635 Knuth-Schroeppel function, 494
Java, 659
inhibit any policy indicator, 636 Koblitz curve, 170, 187, 192
JavaScript, 661
initial policy set, 635
L
JCP, 557
initial state, 355
Jenning generator, 350
initial value, 258, 386
L3 lattice reduction, 346
in-line TTP, 71, 97
K label, 579
inner CBC, 389
Lagarias and Odlyzko attack, 336, 337
inner modes, 389
KA, 319“21 Lagrange interpolation formula, 298
inside out attack, 56

<<

. 2
( 5 .)



>>