1 // m > 0, m = 2^m1 - 1 (m1 > 1)
3 class cl_heap_modint_ring_pow2m1 : public cl_heap_modint_ring {
4 SUBCLASS_cl_heap_modint_ring()
7 cl_heap_modint_ring_pow2m1 (const cl_I& m, uintL m1); // m = 2^m1 - 1
9 ~cl_heap_modint_ring_pow2m1 () {}
10 // Additional information.
15 #if !(defined(__GNUC__) && (__GNUC__ == 2) && (__GNUC_MINOR__ <= 90)) // workaround g++-2.7.2 and egcs-1.0.2-prerelease bug
18 const cl_I pow2m1_reduce_modulo (cl_heap_modint_ring* _R, const cl_I& x)
20 var cl_heap_modint_ring_pow2m1* R = (cl_heap_modint_ring_pow2m1*)_R;
22 // If x>=0, split x into pieces of m1 bits and sum them up.
23 // x = x0 + 2^m1*x1 + 2^(2*m1)*x2 + ... ==>
24 // mod(x,m) = mod(x0+x1+x2+...,m).
25 // If x<0, apply this to -1-x, and use mod(x,m) = m-1-mod(-1-x,m).
27 var cl_boolean sign = minusp(x);
28 if (sign) { x = lognot(x); }
29 var const uintL m1 = R->m1;
30 if (x >= R->modulus) {
31 x = plus1(x); // avoid staying at x = m
33 var uintL xlen = integer_length(x);
34 var cl_I y = ldb(x,cl_byte(m1,0));
35 for (var uintL i = m1; i < xlen; i += m1)
36 y = y + ldb(x,cl_byte(m1,i));
38 } while (x > R->modulus);
42 if (sign) { x = R->modulus - 1 - x; }
46 static const _cl_MI pow2m1_canonhom (cl_heap_modint_ring* R, const cl_I& x)
48 return _cl_MI(R, pow2m1_reduce_modulo(R,x));
51 static const _cl_MI pow2m1_mul (cl_heap_modint_ring* _R, const _cl_MI& x, const _cl_MI& y)
53 var cl_heap_modint_ring_pow2m1* R = (cl_heap_modint_ring_pow2m1*)_R;
54 var const uintL m1 = R->m1;
55 var cl_I zr = x.rep * y.rep;
56 zr = ldb(zr,cl_byte(m1,m1)) + ldb(zr,cl_byte(m1,0));
57 return _cl_MI(R, zr >= R->modulus ? zr - R->modulus : zr);
60 static const _cl_MI pow2m1_square (cl_heap_modint_ring* _R, const _cl_MI& x)
62 var cl_heap_modint_ring_pow2m1* R = (cl_heap_modint_ring_pow2m1*)_R;
63 var const uintL m1 = R->m1;
64 var cl_I zr = square(x.rep);
65 zr = ldb(zr,cl_byte(m1,m1)) + ldb(zr,cl_byte(m1,0));
66 return _cl_MI(R, zr >= R->modulus ? zr - R->modulus : zr);
69 #define pow2m1_addops std_addops
70 static cl_modint_mulops pow2m1_mulops = {
84 inline cl_heap_modint_ring_pow2m1::cl_heap_modint_ring_pow2m1 (const cl_I& m, uintL _m1)
85 : cl_heap_modint_ring (m, &std_setops, &pow2m1_addops, &pow2m1_mulops), m1 (_m1) {}