Index D(n), 24 I(u, f), 125 O(f(n)), 16 O(f), 16 R[X], 97 R[X]/(h), 106 X, 98 Ω(f(n)), 16 Ω(f), 16 Θ(f(n)), 16 Θ(f), 16 deg(f), 98 gcd(n, m), 24 〈a〉, 60 ←, 14 ⌊x⌋, ⌈x⌉, 136 ln n, 4 log n, 4 div, 25 mod, 25 |, 23 ordG(a), 62 ordp(n), 71 π(x), 45 ϕ(n), 34, 38, 70 f mod h, 105 f(X), 101 f(s), 100 A-liar, 80 A-witness, 80 abelian group, 57 addition, 68 additive notation, 57 Adleman, 2 Agrawal, 115 algorithm, determ<strong>in</strong>istic, 8 algorithm, randomized, 15 arithmetic, fundamental theorem of, 43 array, 13 assignment, 14 associated <strong>polynomial</strong>s, 108 associativity, 55 b<strong>in</strong>ary operation, 55 b<strong>in</strong>omial coefficient, 46, 50, 115, 133 b<strong>in</strong>omial theorem, 47, 136 bit operation, 18 boolean values, 14 break statement, 14 cancellation <strong>ru</strong>le, 34, 57 Carmichael number, 76 ceil<strong>in</strong>g function, 136 certificate, 8 Chebychev, 45 Ch<strong>in</strong>ese Rema<strong>in</strong>der Theorem, 36, 37 coefficient, 96 commutative group, 57 commutative monoid, 66 commutative r<strong>in</strong>g, 67 comparison of coefficients, 98 composite, 39 composite number, 1 cong<strong>ru</strong>ence, 32 cong<strong>ru</strong>ence class, 33 cong<strong>ru</strong>ence of <strong>polynomial</strong>s, 104 cong<strong>ru</strong>ent, 32 constant, 13 constant <strong>polynomial</strong>, 98 determ<strong>in</strong>istic algorithm, 8 determ<strong>in</strong>istic primality test, 115 distributive law, 67 divisibility, 23 divisibility of <strong>polynomial</strong>s, 104 division, 25, 68 division of <strong>polynomial</strong>s, 102, 103 division with rema<strong>in</strong>der, 25 divisor, 23, 25 E-liar, 93 E-witness, 93
146 Index efficient algorithm, 2 equivalence relation, 32, 58, 104 Eratosthenes, 39, 118 Euclid, 39 Euclidean Algorithm, 27 Euclidean Algorithm, extended, 30 Euler liar, 93 Euler witness, 93 Euler’s criterion, 86 Euler’s totient function, 34 Euler, a theorem of, 64 exponentiation, fast, 69 F-liar, 74 F-witness, 73 factorial, 133 factor<strong>in</strong>g problem, 10 fast exponentiation, 69 Fermat liar, 74 Fermat test, 74 Fermat test, iterated, 76 Fermat witness, 73 Fermat’s Little Theorem, 64, 73, 101 field, 68, 95 f<strong>in</strong>ite fields, 68 floor function, 136 for loop, 15 Fouvry’s theorem, 120 fundamental theorem, 43 Gauss, 2 generate, 61 generated subgroup, 60 generat<strong>in</strong>g element, 61 generator, 70 Germa<strong>in</strong>, 122 greatest common divisor, 24, 26 group, 55 half system, 137 harmonic number, 137 if statements, 14 <strong>in</strong>dentation, 14 <strong>in</strong>tegers, 23 <strong>in</strong>trospective, 125 <strong>in</strong>verse element, 55, 57 irreducible, 108 Jacobi symbol, 87, 91 Kayal, 115 lead<strong>in</strong>g coefficient, 98 Legendre, 47 Legendre symbol, 87 l<strong>in</strong>ear comb<strong>in</strong>ation, 26 Miller-Rab<strong>in</strong> test, 81 modular arithmetic, 32 modulus, 25, 32 monic <strong>polynomial</strong>, 99 monoid, 66 monoid, commutative, 66 multiple, 23 multiplication, 68 multiplication of <strong>polynomial</strong>s, 99 multiplicative group, 34 natural numbers, 23 neutral element, 55, 57 nonconstant <strong>polynomial</strong>, 98 nonresidue, 85 operation, b<strong>in</strong>ary, 55 order, 62 order (of a group element), 62 order modulo p, 71 parentheses, 55 perfect power, 20, 118 permutation, 133 <strong>polynomial</strong>, 95 <strong>polynomial</strong> division, 102, 103 <strong>polynomial</strong>s over R, 97 power, of group element, 59 primality prov<strong>in</strong>g, 9 prime, 39 prime decomposition, 2, 42 prime generation, 10 prime number, 1, 39 Prime Number Theorem, 45 primitive rth root of unity, 113 primitive element, 70, 71 proper divisor (for <strong>polynomial</strong>s), 104 proper divisor (of a <strong>polynomial</strong>), 108 pseudoprimes, 74 quadratic nonresidue, 85 quadratic reciprocity law, 90, 137, 140, 141 quadratic residue, 85 quotient, 25 quotient of r<strong>in</strong>gs, 106 randomization, 3 randomized algorithm, 15
- Page 1 and 2:
Lecture Notes in Computer Science 3
- Page 3 and 4:
Martin Dietzfelbinger Primality Tes
- Page 5 and 6:
To Angelika, Lisa, Matthias, and Jo
- Page 7 and 8:
VIII Preface toundingly it gets by
- Page 9 and 10:
X Contents 5. The Miller-Rabin Test
- Page 11 and 12:
2 1. Introduction: Efficient Primal
- Page 13 and 14:
4 1. Introduction: Efficient Primal
- Page 15 and 16:
6 1. Introduction: Efficient Primal
- Page 17 and 18:
8 1. Introduction: Efficient Primal
- Page 19 and 20:
10 1. Introduction: Efficient Prima
- Page 21 and 22:
12 1. Introduction: Efficient Prima
- Page 23 and 24:
14 2. Algorithms for Numbers and Th
- Page 25 and 26:
16 2. Algorithms for Numbers and Th
- Page 27 and 28:
18 2. Algorithms for Numbers and Th
- Page 29 and 30:
20 2. Algorithms for Numbers and Th
- Page 31 and 32:
3. Fundamentals from Number Theory
- Page 33 and 34:
3.1 Divisibility and Greatest Commo
- Page 35 and 36:
3.2 The Euclidean Algorithm 27 Prop
- Page 37 and 38:
3.2 The Euclidean Algorithm 29 (b)
- Page 39 and 40:
3.2 The Euclidean Algorithm 31 We n
- Page 41 and 42:
3.3 Modular Arithmetic 33 Lemma 3.3
- Page 43 and 44:
3.4 The Chinese Remainder Theorem 3
- Page 45 and 46:
3.4 The Chinese Remainder Theorem 3
- Page 47 and 48:
3.5 Prime Numbers 39 3.5.1 Basic Ob
- Page 49 and 50:
3.5 Prime Numbers 41 steps in the v
- Page 51 and 52:
3.5 Prime Numbers 43 r ≥ 0. Clear
- Page 53 and 54:
ϕ(n) = � 3.6 Chebychev’s Theor
- Page 55 and 56:
3.6 Chebychev’s Theorem on the De
- Page 57 and 58:
3.6 Chebychev’s Theorem on the De
- Page 59 and 60:
3.6 Chebychev’s Theorem on the De
- Page 61 and 62:
3.6 Chebychev’s Theorem on the De
- Page 63 and 64:
56 4. Basics from Algebra: Groups,
- Page 65 and 66:
58 4. Basics from Algebra: Groups,
- Page 67 and 68:
60 4. Basics from Algebra: Groups,
- Page 69 and 70:
62 4. Basics from Algebra: Groups,
- Page 71 and 72:
64 4. Basics from Algebra: Groups,
- Page 73 and 74:
66 4. Basics from Algebra: Groups,
- Page 75 and 76:
68 4. Basics from Algebra: Groups,
- Page 77 and 78:
70 4. Basics from Algebra: Groups,
- Page 79 and 80:
5. The Miller-Rabin Test In this ch
- Page 81 and 82:
5.1 The Fermat Test 75 multiples of
- Page 83 and 84:
5.1 The Fermat Test 77 the set {n |
- Page 85 and 86:
5.2 Nontrivial Square Roots of 1 79
- Page 87 and 88:
5.2 Nontrivial Square Roots of 1 81
- Page 89 and 90:
Lemma 5.3.1. (a) L A n ⊆ BA n . (
- Page 91 and 92:
6. The Solovay-Strassen Test The pr
- Page 93 and 94:
6.2 The Jacobi Symbol 87 Definition
- Page 95 and 96:
a 6.3 The Law of Quadratic Reciproc
- Page 97 and 98:
6.3 The Law of Quadratic Reciprocit
- Page 99 and 100: 6.4 Primality Testing by Quadratic
- Page 101 and 102: 7. More Algebra: Polynomials and Fi
- Page 103 and 104: 7.1 Polynomials over Rings 97 Defin
- Page 105 and 106: 7.1 Polynomials over Rings 99 Remar
- Page 107 and 108: 7.1 Polynomials over Rings 101 (b)
- Page 109 and 110: 7.2 Division with Remainder and Div
- Page 111 and 112: 7.3 Quotients of Rings of Polynomia
- Page 113 and 114: 7.3 Quotients of Rings of Polynomia
- Page 115 and 116: 7.4 Irreducible Polynomials and Fac
- Page 117 and 118: 7.5 Roots of Polynomials 111 X, has
- Page 119 and 120: 7.6 Roots of the Polynomial X r −
- Page 121 and 122: 8. Deterministic Primality Testing
- Page 123 and 124: 8.2 The Algorithm of Agrawal, Kayal
- Page 125 and 126: 8.3 The Running Time 119 Time for t
- Page 127 and 128: 8.3 The Running Time 121 Lemma 8.3.
- Page 129 and 130: 8.5 Proof of the Main Theorem 123 B
- Page 131 and 132: 8.5 Proof of the Main Theorem 125 L
- Page 133 and 134: 8.5 Proof of the Main Theorem 127 P
- Page 135 and 136: 8.5 Proof of the Main Theorem 129 (
- Page 137 and 138: 8.5 Proof of the Main Theorem 131 i
- Page 139 and 140: 134 A. Appendix Proof. For k < 0ork
- Page 141 and 142: 136 A. Appendix as an abbreviation
- Page 143 and 144: 138 A. Appendix a 1 2 3 4 5 6 7 8 9
- Page 145 and 146: 140 A. Appendix Lemma A.3.3. If p
- Page 147 and 148: 142 A. Appendix Induction step: Ass
- Page 149: 144 References 20. Gauss, C.F., Dis