Introduction |
|
vii | |
|
1 Grobner bases over arithmetical rings |
|
|
1 | (70) |
|
1.1 Dickson's lemma and Grobner bases over fields |
|
|
2 | (10) |
|
1.2 Grobner bases over coherent valuation rings |
|
|
12 | (13) |
|
1.2.1 Grobner bases over Z/pαZ |
|
|
23 | (2) |
|
1.3 Grobner bases over coherent arithmetical rings |
|
|
25 | (13) |
|
1.3.1 A parallelisable algorithm for computing dynamical Grobner bases over Z/mZ |
|
|
31 | (2) |
|
1.3.2 A parallelisable algorithm for computing Grobner bases over (Z/pαZ) × (Z/pαZ) |
|
|
33 | (3) |
|
1.3.3 Dynamical Grobner bases over Boolean rings |
|
|
36 | (2) |
|
1.4 Grobner bases over coherent Bezout rings |
|
|
38 | (6) |
|
1.5 The syzygy theorem over fields, Z, Zpz, and Z/NZ |
|
|
44 | (15) |
|
1.5.1 The syzygy theorem and Schreyer's algorithm for a coherent valuation ring |
|
|
49 | (5) |
|
1.5.2 The syzygy theorem and Schreyer's algorithm for a coherent Bezout ring |
|
|
54 | (2) |
|
1.5.3 The case of the integers |
|
|
56 | (1) |
|
|
57 | (2) |
|
|
59 | (4) |
|
1.7 Solutions to the exercises |
|
|
63 | (8) |
|
2 Varieties, Ideals, and Grobner bases |
|
|
71 | (44) |
|
2.1 The Ideal-Variety Correspondence |
|
|
71 | (11) |
|
2.2 Computing on subvarieties of An (K) with Grobner bases |
|
|
82 | (3) |
|
2.3 Singular points of a plane curve |
|
|
85 | (3) |
|
2.4 Solving polynomial systems with Grobner bases |
|
|
88 | (2) |
|
2.5 Solving zero-dimensional polynomial systems |
|
|
90 | (8) |
|
2.6 Complexity of computing a Grobner basis |
|
|
98 | (1) |
|
|
98 | (4) |
|
|
102 | (5) |
|
2.9 Solutions to the exercises |
|
|
107 | (8) |
|
3 Finite fields and field extensions |
|
|
115 | (22) |
|
3.1 Construction of finite fields |
|
|
115 | (1) |
|
3.2 Field extensions and Galois groups |
|
|
116 | (2) |
|
3.3 Automorphisms group of a finite field |
|
|
118 | (5) |
|
|
123 | (6) |
|
3.5 Solutions to the exercises |
|
|
129 | (8) |
|
4 Algorithms for cryptography |
|
|
137 | (12) |
|
4.1 Public-key cryptosystems --- RSA method |
|
|
137 | (3) |
|
4.2 Groups based cryptography |
|
|
140 | (3) |
|
4.2.1 Diffie-Hellman keys exchange |
|
|
140 | (1) |
|
4.2.2 El-Gamal's encryption |
|
|
141 | (1) |
|
4.2.3 El-Gamal's signature |
|
|
141 | (1) |
|
4.2.4 Massey-Omura coding |
|
|
142 | (1) |
|
4.2.5 The choice of the group |
|
|
142 | (1) |
|
|
143 | (2) |
|
4.4 Solutions to the exercises |
|
|
145 | (4) |
|
|
149 | (72) |
|
5.1 Projective space and projective varieties |
|
|
149 | (3) |
|
5.2 Algebraic plane curves |
|
|
152 | (5) |
|
|
157 | (10) |
|
5.4 Rational maps between algebraic curves |
|
|
167 | (5) |
|
5.5 Resultants and Bezout's theorem |
|
|
172 | (13) |
|
|
173 | (4) |
|
|
177 | (8) |
|
5.6 Genus computation via quadratic transformations |
|
|
185 | (11) |
|
|
196 | (8) |
|
5.8 Solutions to the exercises |
|
|
204 | (17) |
|
|
221 | (44) |
|
6.1 Elliptic curves over a field |
|
|
221 | (11) |
|
6.2 Elliptic curves over a finite field |
|
|
232 | (4) |
|
|
236 | (11) |
|
6.4 Solutions to the exercises |
|
|
247 | (18) |
Index |
|
265 | (4) |
Bibliography |
|
269 | |