Index

"academic" constructions, 65

active attacker, 84

AddKey, 19

Adleman, 1

advantage of the algorithm, 80

AES, 16, 18

alphabet, 54

anagrams, 15

anonymity, 63, 68

Arazi's cryptosystem, 170

Arithmetica key exchange, 35

Artin group, 36

asymmetric cipher, 1

Atlantic City algorithm, 10

atmospheric noise, 58

attacks, 171

authentication, 1, 37, 69

authenticity, 63

avalanche effect, 18

avoiding inversions, 132

Bell's theorem, 13

big primes, 26

big random primes, 27

binary symmetric channel, 55

binding an identity, 68

bit commitment schemes, 41

bit operations, 8

bit security, 79, 169, 171

bit security problem, 153

blinded, 143

Blum, 53

Blum-Blum-Shub pRNG, 57

Blum integers, 4

braid group, 36

brute force attacks, 142

ByteSub, 19

canonical height, 103

Carmichael number, 21

CCAl-security, 86

CCA2-secure, 85

CCA2-security, 86

certifiable large primes, 41

certificate, 67

certificate chains, 68

channel, 55, 73

channel capacity, 56

character values HNP, 164

Chinese Remainder Theorem, 20

chord-and-tangent rule, 126

chosen ciphertext security, 84

chosen ciphertext security (CCA1), 85

ciphertext space, 74

class NP, 9

class P, 9

classical efficient algorithms, 75

closest vector problem (CVP), 164

cofactor multiplication, 123

coin flipping over the phone, 41

collision, 168

collision search, 107

common modulus, 5

complexity, 8

compression, 55

compression permutation, 17

computability, 9

computational Diffie-Hellman assumption,

76

computing roots, 5

confidentiality, 63

conjugacy problem, 36

continued fractions, 27, 47

Coppersmith's short pad attack, 7

coupon collector's test, 57

Coxeter groups, 36

CR-HNP, 163

Cramer-Shoup CCA2-secure encryption

scheme, 85

cryptograms, 15

CryptoLib, 170

decay of radioactive isotopes, 58

decisional Diffie-Hellman assumption, 76

decryption, 74

decryption exponent, 3

decryption oracle, 76

decryption step, 4

179