1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
|
/*=============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2012 William Hart
******************************************************************************/
#define ulong ulongxx /* interferes with system includes */
#include <stdio.h>
#include <stdlib.h>
#undef ulong
#define ulong mp_limb_t
#include <gmp.h>
#include "flint.h"
#include "ulong_extras.h"
slong n_sqrtmod_2pow(mp_limb_t ** sqrt, mp_limb_t a, slong exp)
{
mp_limb_t r = (a & 1);
mp_limb_t * s;
if (exp == 0) /* special case for sqrt of 0 mod 1 */
{
*sqrt = flint_malloc(sizeof(mp_limb_t));
(*sqrt)[0] = 0;
return 1;
}
if (exp == 1) /* special case mod 2 */
{
*sqrt = flint_malloc(sizeof(mp_limb_t));
if (r) (*sqrt)[0] = 1;
else (*sqrt)[0] = 0;
return 1;
}
if (exp == 2) /* special case mod 4 */
{
r = (a & 3);
if (r < 2) /* 0, 1 mod 4 */
{
*sqrt = flint_malloc(sizeof(mp_limb_t)*2);
(*sqrt)[0] = r;
(*sqrt)[1] = r + 2;
return 2;
} else /* 2, 3 mod 4 */
{
*sqrt = NULL;
return 0;
}
}
if (r) /* a is odd */
{
mp_limb_t roots[2];
slong i, ex, pow;
if ((a & 7) != 1) /* check square root exists */
{
*sqrt = NULL;
return 0;
}
roots[0] = 1; /* one of each pair of square roots mod 8 */
roots[1] = 3;
pow = 8;
for (ex = 3; ex < exp; ex++, pow *= 2) /* lift roots */
{
i = 0;
r = roots[0];
if (((r*r) & (2*pow - 1)) == (a & (2*pow - 1)))
roots[i++] = r;
r = pow - r;
if (((r*r) & (2*pow - 1)) == (a & (2*pow - 1)))
{
roots[i++] = r;
if (i == 2) continue;
}
r = roots[1];
if (((r*r) & (2*pow - 1)) == (a & (2*pow - 1)))
{
roots[i++] = r;
if (i == 2) continue;
}
r = pow - r;
roots[i] = r;
}
*sqrt = flint_malloc(sizeof(mp_limb_t)*4);
(*sqrt)[0] = roots[0]; /* write out both pairs of roots */
(*sqrt)[1] = pow - roots[0];
(*sqrt)[2] = roots[1];
(*sqrt)[3] = pow - roots[1];
return 4;
} else /* a is even */
{
slong i, k, num, pow;
for (k = 2; k <= exp; k++) /* find highest power of 2 dividing a */
{
if (a & ((UWORD(1)<<k) - 1))
break;
}
k--;
if (a == 0)
{
a = (UWORD(1)<<(exp - k/2));
num = (UWORD(1)<<(k/2));
s = flint_malloc(num*sizeof(mp_limb_t));
for (i = 0; i < num; i++)
s[i] = i*a;
*sqrt = s;
return num;
}
if (k & 1) /* not a square */
{
*sqrt = NULL;
return 0;
}
pow = (UWORD(1)<<k);
exp -= k;
a /= pow;
num = n_sqrtmod_2pow(&s, a, exp); /* divide through by 2^k and recurse */
a = (UWORD(1)<<(k/2));
r = a*(UWORD(1)<<exp);
if (num == 0) /* check that roots were actually returned */
{
*sqrt = NULL;
return 0;
}
for (i = 0; i < num; i++) /* multiply roots by 2^(k/2) */
s[i] *= a;
if (num == 1) /* one root */
{
s = flint_realloc(s, a*sizeof(mp_limb_t));
for (i = 1; i < a; i++)
s[i] = s[i - 1] + r;
} else if (num == 2) /* two roots */
{
s = flint_realloc(s, 2*a*sizeof(mp_limb_t));
for (i = 1; i < a; i++)
{
s[2*i] = s[2*i - 2] + r;
s[2*i + 1] = s[2*i - 1] + r;
}
} else /* num == 4, i.e. four roots */
{
s = flint_realloc(s, 4*a*sizeof(mp_limb_t));
for (i = 1; i < a; i++)
{
s[4*i] = s[4*i - 4] + r;
s[4*i + 1] = s[4*i - 3] + r;
s[4*i + 2] = s[4*i - 2] + r;
s[4*i + 3] = s[4*i - 1] + r;
}
}
*sqrt = s;
return num*a;
}
}
slong n_sqrtmod_primepow(mp_limb_t ** sqrt, mp_limb_t a, mp_limb_t p, slong exp)
{
mp_limb_t r, ex, pow, k, a1, pinv, powinv;
mp_limb_t * s;
slong i, num;
if (exp < 0)
{
flint_printf("Exception (n_sqrtmod_primepow). exp must be non-negative.\n");
abort();
}
if (exp == 0) /* special case, sqrt of 0 mod 1 */
{
*sqrt = flint_malloc(sizeof(mp_limb_t));
(*sqrt)[0] = 0;
return 1;
}
if (p == 2) /* deal with p = 2 specially */
return n_sqrtmod_2pow(sqrt, a, exp);
if (exp == 1) /* special case, roots mod p */
{
r = n_sqrtmod(a, p);
if (r == 0 && a != 0)
{
*sqrt = NULL;
return 0;
}
*sqrt = flint_malloc(sizeof(mp_limb_t)*(1 + (r != 0)));
(*sqrt)[0] = r;
if (r) (*sqrt)[1] = p - r;
return 1 + (r != 0);
}
pinv = n_preinvert_limb(p);
a1 = n_mod2_preinv(a, p, pinv);
r = n_sqrtmod(a1, p);
if (r == 0 && a1 != 0)
{
*sqrt = NULL;
return 0;
}
if (r) /* gcd(a, p) = 1, p is odd, lift r and p - r */
{
for (ex = 1, pow = p; ex < exp; ex++, pow *= p) /* lift root */
{
/* set k = ((r^2 - a) mod (p^(ex + 1))) / p^ex */
powinv = n_preinvert_limb(pow*p);
a1 = n_mulmod2_preinv(r, r, pow*p, powinv);
k = (a < a1 ? a1 - a : a - a1);
k = n_mod2_preinv(k, pow*p, powinv);
k /= pow;
if (a < a1)
k = n_negmod(k, p);
/* set k = k / 2r mod p */
a1 = n_mulmod2_preinv(2, r, p, pinv);
k = n_mulmod2_preinv(n_invmod(a1, p), k, p, pinv);
/* set r = r + k*p^ex */
r += k*pow;
}
*sqrt = flint_malloc(sizeof(mp_limb_t)*2);
(*sqrt)[0] = r;
(*sqrt)[1] = pow - r;
return 2;
} else /* special case, one root lifts to p roots */
{
for (k = 1, pow = p; k < exp; k++) /* find highest power of p dividing a */
{
mp_limb_t pow2 = pow * p;
if (a % pow2 != 0)
break;
pow = pow2;
}
if (a == 0) /* special case, a == 0 */
{
a = n_pow(p, exp - k/2);
num = n_pow(p, k/2);
s = flint_malloc(num*sizeof(mp_limb_t));
for (i = 0; i < num; i++)
s[i] = i*a;
*sqrt = s;
return num;
}
if (k & 1) /* not a square */
{
*sqrt = NULL;
return 0;
}
exp -= k;
a /= pow;
num = n_sqrtmod_primepow(&s, a, p, exp); /* divide through by p^k and recurse */
if (num == 0)
{
*sqrt = NULL;
return 0;
}
a = n_pow(p, k/2);
r = a*n_pow(p, exp);
s[0] *= a; /* multiply roots by p^(k/2) */
s[1] *= a;
s = flint_realloc(s, 2*a*sizeof(mp_limb_t));
for (i = 1; i < a; i++)
{
s[2*i] = s[2*i - 2] + r;
s[2*i + 1] = s[2*i - 1] + r;
}
*sqrt = s;
return 2*a;
}
}
|
