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
/*
Copyright (C) 2008 Peter Shrimpton
Copyright (C) 2009 William Hart
Copyright (C) 2014, 2015 Dana Jacobsen
Copyright (C) 2015 Kushagra Singh
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include <math.h>
#include "ulong_extras.h"
int
n_is_prime_pocklington(ulong n, ulong iterations)
{
int pass;
slong i;
ulong j;
ulong n1, cofactor, b, c, ninv, limit, F, Fsq, det, rootn, val, c1, c2, upper_limit;
n_factor_t factors;
c = 0;
#if FLINT64
upper_limit = 2642246; /* 2642246^3 is approximately 2^64 */
#else
upper_limit = 1626; /* 1626^3 is approximately 2^32 */
#endif
if (n == 1)
return 0;
else if (n % 2 == 0)
return (n == UWORD(2));
rootn = n_sqrt(n); /* floor(sqrt(n)) */
if (n == rootn*rootn)
return 0;
n1 = n - 1;
n_factor_init(&factors);
limit = (ulong) pow((double)n1, 1.0/3);
val = n_pow(limit, 3);
while (val < n1 && limit < upper_limit) /* ensuring that limit >= n1^(1/3) */
{
limit++;
val = n_pow(limit, 3);
}
cofactor = n_factor_partial(&factors, n1, limit, 1);
if (cofactor != 1) /* check that cofactor is coprime to factors found */
{
for (i = 0; i < factors.num; i++)
{
if (factors.p[i] > FLINT_FACTOR_TRIAL_PRIMES_PRIME)
{
while (cofactor >= factors.p[i] && (cofactor % factors.p[i]) == 0)
{
factors.exp[i]++;
cofactor /= factors.p[i];
}
}
}
}
F = n1/cofactor; /* n1 = F*cofactor */
Fsq = F*F;
if (F <= rootn) /* cube root method applicable only if n^1/3 <= F < n^1/2 */
{
c2 = n1/(Fsq); /* expressing n as c2*F^2 + c1*F + 1 */
c1 = (n1 - c2*Fsq )/F;
det = c1*c1 - 4*c2;
if (n_is_square(det)) /* BSL's test for (n^1/3 <= F < n^1/2) */
return 0;
}
ninv = n_preinvert_limb(n);
c = 1;
for (i = factors.num - 1; i >= 0; i--)
{
ulong exp = n1 / factors.p[i];
pass = 0;
for (j = 2; j < iterations && pass == 0; j++)
{
b = n_powmod2_preinv(j, exp, n, ninv);
if (n_powmod2_ui_preinv(b, factors.p[i], n, ninv) != UWORD(1))
return 0;
b = n_submod(b, UWORD(1), n);
if (b != UWORD(0))
{
c = n_mulmod2_preinv(c, b, n, ninv);
pass = 1;
}
else if (c == 0)
return 0;
}
if (j == iterations)
return -1;
}
return (n_gcd(n, c) == UWORD(1));
}