<<

. 36
( 36 .)




Ta-Shma, A. 171
Kahn, D. 6
Kerckhoffs, A. 3
Vanstone, S. 93
Koblitz, N. 83
Vernam, G. S. 118
Matchikina, E. 173
Zuckerman, D. 171
Menezes, A. 93
Mercle, R. C. 6
Miller, V. S. 83
Monarev, V. A. 175
Montgomery, P. L. 102

Needham, R. M. 79
Neumann, J. von 171
Nisan, N. 171

193
This page intentionally left blank
Subject Index



AES block cipher, 92, 141, 148 76, 77, 115
asymmetric-key, see public key digital cash protocol, 70-75
digital signature, 30, 43, 72, 77, 165
attack, 3, 76
digital signature algorithm, see DSA
baby-step giant-step algorithm, 9, discrete logarithm, 8
35-37,91 discrete logarithm problem, 14, 24,
blind signature, 72, 73 26, 33-41, 46, 58
block cipher, 140, 166 DSA, 49-52, 95
book stack test, 176
brute-force attack, 3 ECB block cipher mode, 159
ElGamal cipher, see ElGamal
Caesar cipher, 2, 137 encryption
CBC block cipher mode, 159 ElGamal digital signature, 46-49
challengeresponse protocol, 12 ElGamal encryption, 24-26, 41, 46,
chi-square test, 176 80,94
Chinese remainder theorem, 104, 109 elliptic curve, 83, 84
chosen-plaintext attack, 5, 140, 179 affine representation, 97
cipher key, see secret key anomalous, 93
ciphertext, 2 discrete logarithm problem, 91, 94
ciphertext-only attack, 5, 139 division polynomial, 103
computationally secure cipher, 137 mixed addition, 99
coprime numbers, 15 point addition, see point
composition
cryptogram, 116
cryptographic protocol, 55 point at infinity, 86
point composition, 85, 96, 97, 100,
cryptosystem, 3
CTR block cipher mode, 163, 180 101
point doubling, see point
composition
DES block cipher, 141
point multiplication, 91, 96
differential crypt analysis, 140, 148
projective representation, 98
Diffie-Hellman key agreement, see
singular, 85
Diffie-Hellman system
Diffie-Hellman system, 12-15, 24, 41: supersingular, 93

195
Basics of Contemporary Cryptography for IT Practitioners
196


torsion point, 103 linear cryptanalysis, 140, 148
entropy, see Shannon entropy
Euclidean algorithm, 17, 109 Markov source, 128
Euler (totient) function, 16 memoryless source, 124, 125
Euler theorem, 16 mental poker, 55-59
exhaustive key search, 4, 140 mutual identification, 76, 78-80
exponentiation, 8, 9, 21
extended Euclidean algorithm, 18, 20, Needham-Schroeder protocol, 79, 80,
98 115
NP-complete problem, 60, 64
Feistel structure, 142 number field sieve, 41
Fermat theorem, 16
frequency cryptanalysis, 138 OFB block cipher mode, 162
onetime pad, see Vernam cipher
gcd, see greatest common divisor one-way function, 7, 27, 29, 73, 174
GOST 28147-89 block cipher,
141-144 password, 7, 10-12
gradient statistical attack, 178 perfect secrecy, see perfectly secure
graph colouring problem, 60-63 cryptosystem
greatest common divisor, 17 perfectly secure cryptosystem,
116-118, 131
Hamiltonian cycle problem, 63, 64 plaintext, 2
hash function, 8, 44, 46, 50, 74, 112, Pohlig-Hellman algorithm, 14, 92
165 prime number, 15
private key, 13, 25, 27, 44, 46, 49, 94
ideal cryptosystem, see strongly ideal pseudo-random number generator,
cryptosystem 160, 173
identification, 77 pseuderandom sequence, 145
index calculus algorithm, 37-41 public key, 6, 13, 25, 27, 44, 46, 49,
initialisation vector, 159 77, 94
integer factorisation problem, 29, 41, public key certification, 76
46 public-key cipher, 77, 137
inverse cipher, 2, 139, 140
inverse number, 19 random number, 169
inverse polynomial, 151 random number generator, 13, 170
randomised cipher, 66
Kerckhoffs assumptions, 3 randomness testing, 175, 178
key agreement, 13 RC4 stream cipher, 163-165
key distribution scheme, 12 RC5 block cipher, 144-146, 179
key establishment, see also key RC6 block cipher, 144, 146-148
agreement, 77-80 redundancy, 5, 74, 79, 124
key source, 3 relatively prime numbers, see coprime
known-plaintext attack, 5, 139, 149, numbers
163 Rijndael block cipher, 144, 148-158
round key, 142
linear congruential generator, 161 round key schedule, 145
Subject Index 197


round of cipher, 140
RSA cipher, see RSA encryption
RSA digital signature, 30, 43-46, 71
RSA encryption, 27-30, 41, 46, 62,
65, 68, 77, 93, 174
RSA multiplicative property, 73, 74
RSA-based generator, 174
running-key cipher, 162

S-box, 142, 152
Schoof™s algorithm, 102-110
secret key, 2, 76, 94
secret-key cryptosystem, 125
secure channel, 2, 115
secured channel, 115
Shamir cipher, 22-24, 41
Shannon entropy, 120, 172, 173
smooth number, 37
statistical test, 170
stream cipher, 160
strongly ideal cipher, 130
strongly ideal cryptosystem, 119

theoretically secure ciphers, 137
trace of F™robenius, 102
trapdoor function, 27, 29

unicity distance, 127, 128

Vernam cipher, 118-119, 130, 160

zero-knowledge proof, 59-70

<<

. 36
( 36 .)