- 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: 20 2. Algorithms for Numbers and Th
- 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 and 150:
144 References 20. Gauss, C.F., Dis
- Page 151 and 152:
146 Index efficient algorithm, 2 eq