3 * Multiprecision arithmetic
5 * (c) 2004 Straylight/Edgeware
8 /*----- Licensing notice --------------------------------------------------*
10 * This file is part of the Python interface to Catacomb.
12 * Catacomb/Python is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2 of the License, or
15 * (at your option) any later version.
17 * Catacomb/Python is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
22 * You should have received a copy of the GNU General Public License
23 * along with Catacomb/Python; if not, write to the Free Software Foundation,
24 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
27 /*----- Header files ------------------------------------------------------*/
29 #include "catacomb-python.h"
31 /*----- General utilities -------------------------------------------------*/
33 PyTypeObject
*mp_pytype
= 0;
34 PyTypeObject
*gf_pytype
= 0;
36 mp
*mp_frompylong(PyObject
*obj
)
39 PyLongObject
*l
= (PyLongObject
*)obj
;
50 assert(MPW_BITS
>= SHIFT
);
51 bits
= (unsigned long)sz
* SHIFT
;
52 w
= (bits
+ MPW_BITS
- 1)/MPW_BITS
;
53 x
= mp_new(w
, l
->ob_size
< 0 ? MP_NEG
: 0);
55 for (i
= 0; i
< sz
; i
++) {
56 r
|= (mpd
)l
->ob_digit
[i
] << b
;
58 while (b
>= MPW_BITS
) {
73 PyObject
*mp_topylong(mp
*x
)
75 unsigned long bits
= mp_bits(x
);
76 int sz
= (bits
+ SHIFT
- 1)/SHIFT
;
77 PyLongObject
*l
= _PyLong_New(sz
);
83 assert(MPW_BITS
>= SHIFT
);
84 while (i
< sz
&& p
< x
->vl
) {
87 while (i
< sz
&& b
>= SHIFT
) {
88 l
->ob_digit
[i
++] = r
& MASK
;
94 l
->ob_digit
[i
++] = r
& MASK
;
97 l
->ob_size
= (x
->f
& MP_NEG
) ?
-sz
: sz
;
98 return ((PyObject
*)l
);
101 mp
*mp_frompyobject(PyObject
*o
, int radix
)
105 if (PyString_Check(o
)) {
108 sc
.buf
= PyString_AS_STRING(o
);
109 sc
.lim
= sc
.buf
+ PyString_GET_SIZE(o
);
110 x
= mp_read(MP_NEW
, radix
, &mptext_stringops
, &sc
);
112 if (sc
.buf
< sc
.lim
) { MP_DROP(x
); return (0); }
115 if ((x
= tomp(o
)) != 0)
120 PyObject
*mp_topystring(mp
*x
, int radix
, const char *xpre
,
121 const char *pre
, const char *post
)
123 int len
= mptext_len(x
, radix
) + 1;
126 size_t xprelen
= xpre ?
strlen(xpre
) : 0;
127 size_t prelen
= pre ?
strlen(pre
) : 0;
128 size_t postlen
= post ?
strlen(post
) : 0;
131 o
= PyString_FromStringAndSize(0, len
+ 1 + xprelen
+ prelen
+ postlen
);
132 p
= PyString_AS_STRING(o
);
134 if (xpre
) { memcpy(sc
.buf
, xpre
, xprelen
); sc
.buf
+= xprelen
; }
135 if (MP_NEGP(x
)) { *sc
.buf
++ = '-'; x
= mp_neg(x
, x
); }
136 if (pre
) { memcpy(sc
.buf
, pre
, prelen
); sc
.buf
+= prelen
; }
137 sc
.lim
= sc
.buf
+ len
;
138 mp_write(x
, radix
, &mptext_stringops
, &sc
);
139 if (post
) { memcpy(sc
.buf
, post
, postlen
); sc
.buf
+= postlen
; }
141 _PyString_Resize(&o
, sc
.buf
- p
);
145 static int good_radix_p(int r
, int readp
)
147 return ((r
>= -255 && r
<= -2) ||
149 (r
>= 2 && r
<= 62));
152 PyObject
*mp_pywrap(mp
*x
)
154 mp_pyobj
*z
= PyObject_New(mp_pyobj
, mp_pytype
);
156 return ((PyObject
*)z
);
159 PyObject
*gf_pywrap(mp
*x
)
161 mp_pyobj
*z
= PyObject_New(mp_pyobj
, gf_pytype
);
163 return ((PyObject
*)z
);
166 int mp_tolong_checked(mp
*x
, long *l
, int must
)
168 static mp
*longmin
= 0, *longmax
= 0;
172 longmin
= mp_fromlong(MP_NEW
, LONG_MIN
);
173 longmax
= mp_fromlong(MP_NEW
, LONG_MAX
);
175 if (MP_CMP(x
, <, longmin
) || MP_CMP(x
, >, longmax
)) {
176 if (must
) VALERR("mp out of range for int");
185 /*----- Python interface --------------------------------------------------*/
187 static void mp_pydealloc(PyObject
*o
)
193 static PyObject
*mp_pyrepr(PyObject
*o
)
194 { return mp_topystring(MP_X(o
), 10, "MP(", 0, "L)"); }
196 static PyObject
*mp_pystr(PyObject
*o
)
197 { return mp_topystring(MP_X(o
), 10, 0, 0, 0); }
199 mp
*tomp(PyObject
*o
)
206 else if (MP_PYCHECK(o
) || GF_PYCHECK(o
))
207 return (MP_COPY(MP_X(o
)));
208 else if (FE_PYCHECK(o
))
209 return (F_OUT(FE_F(o
), MP_NEW
, FE_X(o
)));
210 else if (PFILT_PYCHECK(o
))
211 return (MP_COPY(PFILT_F(o
)->m
));
212 else if (ECPT_PYCHECK(o
)) {
218 } else if (GE_PYCHECK(o
)) {
219 if ((x
= G_TOINT(GE_G(o
), MP_NEW
, GE_X(o
))) == 0)
222 } else if (PyInt_Check(o
))
223 return (mp_fromlong(MP_NEW
, PyInt_AS_LONG(o
)));
224 else if ((l
= PyNumber_Long(o
)) != 0) {
225 x
= mp_frompylong(l
);
234 mp
*getmp(PyObject
*o
)
238 if ((x
= tomp(o
)) == 0) {
239 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to mp",
240 o
->ob_type
->tp_name
);
245 int convmp(PyObject
*o
, void *p
)
248 if ((x
= getmp(o
)) == 0) return (0);
253 mp
*getgf(PyObject
*o
)
257 if ((x
= tomp(o
)) == 0) {
258 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to gf",
259 o
->ob_type
->tp_name
);
264 int convgf(PyObject
*o
, void *p
)
267 if ((x
= getgf(o
)) == 0) return (0);
272 static mp
*implicitmp(PyObject
*o
)
283 static mp
*implicitgf(PyObject
*o
)
294 static int mpbinop(PyObject
*x
, PyObject
*y
, mp
**xx
, mp
**yy
)
296 if ((*xx
= implicitmp(x
)) == 0)
298 if ((*yy
= implicitmp(y
)) == 0) {
305 static int gfbinop(PyObject
*x
, PyObject
*y
, mp
**xx
, mp
**yy
)
307 if ((*xx
= implicitgf(x
)) == 0)
309 if ((*yy
= implicitgf(y
)) == 0) {
316 #define gf_and mp_and
318 #define gf_xor mp_xor
319 #define BINOP(pre, name) \
320 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
322 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
323 zz = pre##_##name(MP_NEW, xx, yy); \
324 MP_DROP(xx); MP_DROP(yy); \
325 return (pre##_pywrap(zz)); \
341 static mp
*mp_abs(mp
*d
, mp
*x
)
344 return (mp_neg(d
, x
));
350 #define UNOP(pre, name) \
351 static PyObject *pre##_py##name(PyObject *x) \
352 { return mp_pywrap(pre##_##name(MP_NEW, MP_X(x))); }
358 static PyObject
*mp_pyid(PyObject
*x
) { RETURN_OBJ(x
); }
360 #define gf_lsr mp_lsr
361 #define SHIFTOP(pre, name, rname) \
362 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
366 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
367 if (mp_tolong_checked(yy, &n, 1)) goto end; \
369 z = pre##_pywrap(mp_##rname(MP_NEW, xx, -n)); \
371 z = pre##_pywrap(mp_##name(MP_NEW, xx, n)); \
373 MP_DROP(xx); MP_DROP(yy); \
376 SHIFTOP(mp
, lsl2c
, lsr2c
)
377 SHIFTOP(mp
, lsr2c
, lsl2c
)
378 SHIFTOP(gf
, lsl
, lsr
)
379 SHIFTOP(gf
, lsr
, lsl
)
382 #define DIVOP(pre, name, qq, rr, gather) \
383 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
386 INIT_##qq(q) INIT_##rr(r) \
387 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
389 ZDIVERR("division by zero"); \
390 pre##_div(ARG_##qq(q), ARG_##rr(r), xx, yy); \
393 MP_DROP(xx); MP_DROP(yy); \
396 #define INIT_YES(p) mp *p = MP_NEW;
398 #define ARG_YES(p) &p
400 DIVOP(mp
, divmod
, YES
, YES
,
401 Py_BuildValue("(NN)", mp_pywrap(q
), mp_pywrap(r
)))
402 DIVOP(mp
, div
, YES
, NO
, mp_pywrap(q
))
403 DIVOP(mp
, mod
, NO
, YES
, mp_pywrap(r
))
404 DIVOP(gf
, divmod
, YES
, YES
,
405 Py_BuildValue("(NN)", gf_pywrap(q
), gf_pywrap(r
)))
406 DIVOP(gf
, div
, YES
, NO
, gf_pywrap(q
))
407 DIVOP(gf
, mod
, NO
, YES
, gf_pywrap(r
))
414 static mp
*mp_modinv_checked(mp
*d
, mp
*x
, mp
*p
)
417 mp_gcd(&g
, 0, &d
, p
, x
);
418 if (!MP_EQ(g
, MP_ONE
)) {
419 MP_DROP(g
); MP_DROP(d
);
420 PyErr_SetString(PyExc_ZeroDivisionError
, "no modular inverse");
423 MP_DROP(g
); return (d
);
426 static PyObject
*mp_pyexp(PyObject
*x
, PyObject
*y
, PyObject
*z
)
428 mp
*xx
= 0, *yy
= 0, *zz
= 0;
432 if ((xx
= implicitmp(x
)) == 0 || (yy
= implicitmp(y
)) == 0 ||
433 (z
&& z
!= Py_None
&& (zz
= tomp(z
)) == 0)) {
434 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
437 if (!z
|| z
== Py_None
) {
438 if (MP_NEGP(yy
)) VALERR("negative exponent");
439 r
= mp_exp(MP_NEW
, xx
, yy
);
441 if (!MP_POSP(zz
)) VALERR("modulus must be positive");
443 if ((xx
= mp_modinv_checked(xx
, xx
, zz
)) == 0) goto end
;
448 mpmont_create(&mm
, zz
);
449 r
= mpmont_exp(&mm
, MP_NEW
, xx
, yy
);
453 mpbarrett_create(&mb
, zz
);
454 r
= mpbarrett_exp(&mb
, MP_NEW
, xx
, yy
);
455 mpbarrett_destroy(&mb
);
460 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
464 static mp
*gf_modinv_checked(mp
*d
, mp
*x
, mp
*p
)
467 gf_gcd(&g
, 0, &d
, p
, x
);
468 if (!MP_EQ(g
, MP_ONE
)) {
469 MP_DROP(g
); MP_DROP(d
);
470 PyErr_SetString(PyExc_ZeroDivisionError
, "no modular inverse");
473 MP_DROP(g
); return (d
);
476 #define BASEOP(name, radix, pre) \
477 static PyObject *mp_py##name(PyObject *x) \
478 { return mp_topystring(MP_X(x), radix, 0, pre, 0); }
480 BASEOP(hex
, 16, "0x");
483 static int mp_pynonzerop(PyObject
*x
) { return !MP_ZEROP(MP_X(x
)); }
485 static PyObject
*mp_pyint(PyObject
*x
)
488 if (!mp_tolong_checked(MP_X(x
), &l
, 0)) return (PyInt_FromLong(l
));
489 else return mp_topylong(MP_X(x
));
491 static PyObject
*mp_pylong(PyObject
*x
)
492 { return (mp_topylong(MP_X(x
))); }
493 static PyObject
*mp_pyfloat(PyObject
*x
)
495 PyObject
*l
= mp_topylong(MP_X(x
));
496 double f
= PyLong_AsDouble(l
);
498 return (PyFloat_FromDouble(f
));
501 #define COERCE(pre, PRE) \
502 static int pre##_pycoerce(PyObject **x, PyObject **y) \
506 if (PRE##_PYCHECK(*y)) { \
507 Py_INCREF(*x); Py_INCREF(*y); \
510 if ((z = tomp(*y)) != 0) { \
512 *y = pre##_pywrap(z); \
521 static int mp_pycompare(PyObject
*x
, PyObject
*y
)
522 { return mp_cmp(MP_X(x
), MP_X(y
)); }
524 static PyObject
*mp_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
530 char *kwlist
[] = { "x", "radix", 0 };
532 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O|i:new", kwlist
, &x
, &radix
))
534 if (MP_PYCHECK(x
)) RETURN_OBJ(x
);
535 if (!good_radix_p(radix
, 1)) VALERR("bad radix");
536 if ((z
= mp_frompyobject(x
, radix
)) == 0) {
537 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to mp",
538 x
->ob_type
->tp_name
);
541 zz
= (mp_pyobj
*)ty
->tp_alloc(ty
, 0);
544 return ((PyObject
*)zz
);
549 PyObject
*l
= mp_topylong(x
);
550 long h
= PyObject_Hash(l
);
551 Py_DECREF(l
); return (h
);
554 static long mp_pyhash(PyObject
*me
) { return (mphash(MP_X(me
))); }
556 static PyObject
*mpmeth_jacobi(PyObject
*me
, PyObject
*arg
)
561 if (!PyArg_ParseTuple(arg
, "O&:jacobi", convmp
, &y
)) goto end
;
562 z
= PyInt_FromLong(mp_jacobi(y
, MP_X(me
)));
568 #define BITOP(pre, name, c) \
569 static PyObject *pre##meth_##name(PyObject *me, PyObject *arg) \
572 if (!PyArg_ParseTuple(arg, "O&:" #name, convulong, &i)) return (0); \
573 return (pre##_pywrap(mp_##name##c(MP_NEW, MP_X(me), i))); \
575 BITOP(mp
, setbit
, 2c
);
576 BITOP(mp
, clearbit
, 2c
);
578 BITOP(gf
, clearbit
, );
581 static PyObject
*mpmeth_testbit(PyObject
*me
, PyObject
*arg
)
584 if (!PyArg_ParseTuple(arg
, "O&:testbit", convulong
, &i
)) return (0);
585 return (getbool(mp_testbit2c(MP_X(me
), i
)));
588 static PyObject
*gfmeth_testbit(PyObject
*me
, PyObject
*arg
)
591 if (!PyArg_ParseTuple(arg
, "O&:testbit", convulong
, &i
)) return (0);
592 return (getbool(mp_testbit(MP_X(me
), i
)));
595 static PyObject
*mpmeth_odd(PyObject
*me
, PyObject
*arg
)
600 if (!PyArg_ParseTuple(arg
, ":odd")) return (0);
601 t
= mp_odd(MP_NEW
, MP_X(me
), &s
);
602 return (Py_BuildValue("(lN)", (long)s
, mp_pywrap(t
)));
605 static PyObject
*mpmeth_sqr(PyObject
*me
, PyObject
*arg
)
607 if (!PyArg_ParseTuple(arg
, ":sqr")) return (0);
608 return (mp_pywrap(mp_sqr(MP_NEW
, MP_X(me
))));
611 static PyObject
*mpmeth_sqrt(PyObject
*me
, PyObject
*arg
)
613 if (!PyArg_ParseTuple(arg
, ":sqrt")) return (0);
614 if (MP_NEGP(MP_X(me
))) VALERR("negative root");
615 return (mp_pywrap(mp_sqrt(MP_NEW
, MP_X(me
))));
620 static PyObject
*mpmeth_gcd(PyObject
*me
, PyObject
*arg
)
622 mp
*y
= 0, *zz
= MP_NEW
;
625 if (!PyArg_ParseTuple(arg
, "O&:gcd", convmp
, &y
)) goto end
;
626 mp_gcd(&zz
, 0, 0, MP_X(me
), y
);
633 static PyObject
*mpmeth_gcdx(PyObject
*me
, PyObject
*arg
)
636 mp
*yy
= 0, *zz
= MP_NEW
, *uu
= MP_NEW
, *vv
= MP_NEW
;
638 if (!PyArg_ParseTuple(arg
, "O&:gcdx", convmp
, &yy
)) goto end
;
639 mp_gcd(&zz
, &uu
, &vv
, MP_X(me
), yy
);
640 z
= Py_BuildValue("(NNN)",
641 mp_pywrap(zz
), mp_pywrap(uu
), mp_pywrap(vv
));
647 static PyObject
*mpmeth_modinv(PyObject
*me
, PyObject
*arg
)
650 mp
*yy
= 0, *zz
= MP_NEW
;
652 if (!PyArg_ParseTuple(arg
, "O&:modinv", convmp
, &yy
) ||
653 (zz
= mp_modinv_checked(MP_NEW
, yy
, MP_X(me
))) == 0)
661 static PyObject
*mpmeth_tostring(PyObject
*me
, PyObject
*arg
, PyObject
*kw
)
664 char *kwlist
[] = { "radix", 0 };
665 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "|i:tostring", kwlist
, &radix
))
667 if (!good_radix_p(radix
, 0)) VALERR("bad radix");
668 return (mp_topystring(MP_X(me
), radix
, 0, 0, 0));
673 static PyObject
*mpmeth_modsqrt(PyObject
*me
, PyObject
*arg
)
676 mp
*yy
= 0, *zz
= MP_NEW
;
678 if (!PyArg_ParseTuple(arg
, "O&:modsqrt", convmp
, &yy
)) goto end
;
679 if ((zz
= mp_modsqrt(MP_NEW
, yy
, MP_X(me
))) == 0)
680 VALERR("no modular square root");
687 static PyObject
*mpmeth_leastcongruent(PyObject
*me
, PyObject
*arg
)
692 if (!PyArg_ParseTuple(arg
, "O&O&:leastcongruent", convmp
, &b
, convmp
, &m
))
694 z
= mp_leastcongruent(MP_NEW
, b
, MP_X(me
), m
);
700 #define STOREOP(name, c) \
701 static PyObject *mpmeth_##name(PyObject *me, \
702 PyObject *arg, PyObject *kw) \
705 char *kwlist[] = { "len", 0 }; \
708 if (!PyArg_ParseTupleAndKeywords(arg, kw, "|l:" #name, \
712 len = mp_octets##c(MP_X(me)); \
715 rc = bytestring_pywrap(0, len); \
716 mp_##name(MP_X(me), PyString_AS_STRING(rc), len); \
722 STOREOP(storel2c
, 2c
)
723 STOREOP(storeb2c
, 2c
)
726 #define BUFOP(ty, pyty) \
727 static PyObject *meth__##pyty##_frombuf(PyObject *me, PyObject *arg) \
735 if (!PyArg_ParseTuple(arg, "Os#:frombuf", &me, &p, &sz)) goto end; \
736 buf_init(&b, p, sz); \
737 if ((x = buf_getmp(&b)) == 0) VALERR("malformed data"); \
738 rc = Py_BuildValue("(NN)", ty##_pywrap(x), \
739 bytestring_pywrapbuf(&b)); \
747 static PyObject
*mpmeth_tobuf(PyObject
*me
, PyObject
*arg
)
754 if (!PyArg_ParseTuple(arg
, ":tobuf")) return (0);
756 n
= mp_octets(x
) + 3;
757 rc
= bytestring_pywrap(0, n
);
758 buf_init(&b
, PyString_AS_STRING(rc
), n
);
761 _PyString_Resize(&rc
, BLEN(&b
));
765 static PyObject
*mpmeth_primep(PyObject
*me
, PyObject
*arg
, PyObject
*kw
)
767 grand
*r
= &rand_global
;
768 char *kwlist
[] = { "rng", 0 };
771 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "|O&", kwlist
, convgrand
, &r
))
773 rc
= getbool(pgen_primep(MP_X(me
), r
));
778 static PyObject
*mpget_nbits(PyObject
*me
, void *hunoz
)
779 { return (PyInt_FromLong(mp_bits(MP_X(me
)))); }
781 static PyObject
*mpget_noctets(PyObject
*me
, void *hunoz
)
782 { return (PyInt_FromLong(mp_octets(MP_X(me
)))); }
784 static PyObject
*mpget_noctets2c(PyObject
*me
, void *hunoz
)
785 { return (PyInt_FromLong(mp_octets2c(MP_X(me
)))); }
787 static PyGetSetDef mp_pygetset
[] = {
788 #define GETSETNAME(op, func) mp##op##_##func
789 GET (nbits
, "X.nbits -> bit length of X")
790 GET (noctets
, "X.noctets -> octet length of X")
791 GET (noctets2c
, "X.noctets2c -> two's complement octet length of X")
796 static PyMethodDef mp_pymethods
[] = {
797 #define METHNAME(func) mpmeth_##func
798 METH (jacobi
, "X.jacobi(Y) -> Jacobi symbol (Y/X) (NB inversion!)")
799 METH (setbit
, "X.setbit(N) -> X with bit N set")
800 METH (clearbit
, "X.clearbit(N) -> X with bit N clear")
801 METH (testbit
, "X.testbit(N) -> true/false if bit N set/clear in X")
802 METH (odd
, "X.odd() -> S, T where X = 2^S T with T odd")
803 METH (sqr
, "X.sqr() -> X^2")
804 METH (sqrt
, "X.sqrt() -> largest integer <= sqrt(X)")
805 METH (gcd
, "X.gcd(Y) -> gcd(X, Y)")
807 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
808 METH (modinv
, "X.modinv(Y) -> multiplicative inverse of Y mod X")
809 METH (modsqrt
, "X.modsqrt(Y) -> square root of Y mod X, if X prime")
810 METH (leastcongruent
,
811 "X.leastcongruent(B, M) -> smallest Z >= B with Z == X (mod M)")
812 KWMETH(primep
, "X.primep(rng = rand) -> true/false if X is prime")
813 KWMETH(tostring
, "X.tostring(radix = 10) -> STR")
814 KWMETH(storel
, "X.storel(len = -1) -> little-endian bytes")
815 KWMETH(storeb
, "X.storeb(len = -1) -> big-endian bytes")
817 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
819 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
820 METH (tobuf
, "X.tobuf() -> buffer format")
825 static PyNumberMethods mp_pynumber
= {
826 mp_pyadd
, /* @nb_add@ */
827 mp_pysub
, /* @nb_subtract@ */
828 mp_pymul
, /* @nb_multiply@ */
830 mp_pymod
, /* @nb_remainder@ */
831 mp_pydivmod
, /* @nb_divmod@ */
832 mp_pyexp
, /* @nb_power@ */
833 mp_pyneg
, /* @nb_negative@ */
834 mp_pyid
, /* @nb_positive@ */
835 mp_pyabs
, /* @nb_absolute@ */
836 mp_pynonzerop
, /* @nb_nonzero@ */
837 mp_pynot2c
, /* @nb_invert@ */
838 mp_pylsl2c
, /* @nb_lshift@ */
839 mp_pylsr2c
, /* @nb_rshift@ */
840 mp_pyand2c
, /* @nb_and@ */
841 mp_pyxor2c
, /* @nb_xor@ */
842 mp_pyor2c
, /* @nb_or@ */
843 mp_pycoerce
, /* @nb_coerce@ */
844 mp_pyint
, /* @nb_int@ */
845 mp_pylong
, /* @nb_long@ */
846 mp_pyfloat
, /* @nb_float@ */
847 mp_pyoct
, /* @nb_oct@ */
848 mp_pyhex
, /* @nb_hex@ */
850 0, /* @nb_inplace_add@ */
851 0, /* @nb_inplace_subtract@ */
852 0, /* @nb_inplace_multiply@ */
853 0, /* @nb_inplace_divide@ */
854 0, /* @nb_inplace_remainder@ */
855 0, /* @nb_inplace_power@ */
856 0, /* @nb_inplace_lshift@ */
857 0, /* @nb_inplace_rshift@ */
858 0, /* @nb_inplace_and@ */
859 0, /* @nb_inplace_xor@ */
860 0, /* @nb_inplace_or@ */
862 mp_pydiv
, /* @nb_floor_divide@ */
863 0, /* @nb_true_divide@ */
864 0, /* @nb_inplace_floor_divide@ */
865 0, /* @nb_inplace_true_divide@ */
868 static PyTypeObject mp_pytype_skel
= {
869 PyObject_HEAD_INIT(0) 0, /* Header */
870 "MP", /* @tp_name@ */
871 sizeof(mp_pyobj
), /* @tp_basicsize@ */
872 0, /* @tp_itemsize@ */
874 mp_pydealloc
, /* @tp_dealloc@ */
876 0, /* @tp_getattr@ */
877 0, /* @tp_setattr@ */
878 mp_pycompare
, /* @tp_compare@ */
879 mp_pyrepr
, /* @tp_repr@ */
880 &mp_pynumber
, /* @tp_as_number@ */
881 0, /* @tp_as_sequence@ */
882 0, /* @tp_as_mapping@ */
883 mp_pyhash
, /* @tp_hash@ */
885 mp_pystr
, /* @tp_str@ */
886 0, /* @tp_getattro@ */
887 0, /* @tp_setattro@ */
888 0, /* @tp_as_buffer@ */
889 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
890 Py_TPFLAGS_CHECKTYPES
|
894 "Multiprecision integers, similar to `long' but more efficient and\n\
895 versatile. Support all the standard arithmetic operations.\n\
897 Constructor mp(X, radix = R) attempts to convert X to an `mp'. If\n\
898 X is a string, it's read in radix-R form, or we look for a prefix\n\
899 if R = 0. Other acceptable things are ints and longs.\n\
903 * Use `//' for division. MPs don't have `/' division.",
905 0, /* @tp_traverse@ */
907 0, /* @tp_richcompare@ */
908 0, /* @tp_weaklistoffset@ */
910 0, /* @tp_iternext@ */
911 mp_pymethods
, /* @tp_methods@ */
912 0, /* @tp_members@ */
913 mp_pygetset
, /* @tp_getset@ */
916 0, /* @tp_descr_get@ */
917 0, /* @tp_descr_set@ */
918 0, /* @tp_dictoffset@ */
920 PyType_GenericAlloc
, /* @tp_alloc@ */
921 mp_pynew
, /* @tp_new@ */
926 static PyObject
*meth__MP_fromstring(PyObject
*me
,
927 PyObject
*arg
, PyObject
*kw
)
935 char *kwlist
[] = { "class", "x", "radix", 0 };
937 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "Os#|i:fromstring",
938 kwlist
, &me
, &p
, &len
, &r
))
940 if (!good_radix_p(r
, 1)) VALERR("bad radix");
941 sc
.buf
= p
; sc
.lim
= p
+ len
;
942 if ((zz
= mp_read(MP_NEW
, r
, &mptext_stringops
, &sc
)) == 0)
943 VALERR("bad integer");
944 z
= Py_BuildValue("(Ns#)", mp_pywrap(zz
),
945 sc
.buf
, (Py_ssize_t
)(sc
.lim
- sc
.buf
));
950 static PyObject
*meth__MP_factorial(PyObject
*me
, PyObject
*arg
)
954 if (!PyArg_ParseTuple(arg
, "OO&:factorial", &me
, convulong
, &i
))
960 static PyObject
*meth__MP_fibonacci(PyObject
*me
, PyObject
*arg
)
964 if (!PyArg_ParseTuple(arg
, "Ol:fibonacci", &me
, &i
)) return (0);
969 #define LOADOP(pre, py, name) \
970 static PyObject *meth__##py##_##name(PyObject *me, PyObject *arg) \
974 if (!PyArg_ParseTuple(arg, "Os#:" #name, &me, &p, &len)) return (0); \
975 return (pre##_pywrap(mp_##name(MP_NEW, p, len))); \
977 LOADOP(mp
, MP
, loadl
)
978 LOADOP(mp
, MP
, loadb
)
979 LOADOP(mp
, MP
, loadl2c
)
980 LOADOP(mp
, MP
, loadb2c
)
981 LOADOP(gf
, GF
, loadl
)
982 LOADOP(gf
, GF
, loadb
)
985 /*----- Products of small integers ----------------------------------------*/
987 typedef struct mpmul_pyobj
{
993 #define MPMUL_LIVEP(o) (((mpmul_pyobj *)(o))->livep)
994 #define MPMUL_PY(o) (&((mpmul_pyobj *)(o))->mm)
996 static void mpmul_pydealloc(PyObject
*me
)
999 mp_drop(mpmul_done(MPMUL_PY(me
)));
1003 static PyObject
*mmmeth_factor(PyObject
*me
, PyObject
*arg
)
1008 if (!MPMUL_LIVEP(me
)) VALERR("MPMul object invalid");
1009 if (PyTuple_Size(arg
) != 1)
1010 i
= PyObject_GetIter(arg
);
1012 if ((q
= PyTuple_GetItem(arg
, 0)) == 0) goto end
;
1013 if ((i
= PyObject_GetIter(q
)) == 0) {
1014 PyErr_Clear(); /* that's ok */
1015 i
= PyObject_GetIter(arg
);
1019 while ((q
= PyIter_Next(i
)) != 0) {
1020 x
= getmp(q
); Py_DECREF(q
); if (!x
) {
1024 mpmul_add(MPMUL_PY(me
), x
);
1033 static PyObject
*mmmeth_done(PyObject
*me
, PyObject
*arg
)
1037 if (!PyArg_ParseTuple(arg
, ":done")) goto end
;
1038 if (!MPMUL_LIVEP(me
)) VALERR("MPMul object invalid");
1039 x
= mpmul_done(MPMUL_PY(me
));
1040 MPMUL_LIVEP(me
) = 0;
1041 return (mp_pywrap(x
));
1046 static PyObject
*mpmul_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1050 if (kw
) TYERR("keyword arguments not allowed here");
1051 mm
= (mpmul_pyobj
*)ty
->tp_alloc(ty
, 0);
1052 mpmul_init(&mm
->mm
);
1054 if (mmmeth_factor((PyObject
*)mm
, arg
) == 0) {
1058 return ((PyObject
*)mm
);
1063 static PyObject
*mmget_livep(PyObject
*me
, void *hunoz
)
1064 { return (getbool(MPMUL_LIVEP(me
))); }
1066 static PyGetSetDef mpmul_pygetset
[] = {
1067 #define GETSETNAME(op, name) mm##op##_##name
1068 GET (livep
, "MM.livep -> flag: object still valid?")
1073 static PyMethodDef mpmul_pymethods
[] = {
1074 #define METHNAME(name) mmmeth_##name
1075 METH (factor
, "MM.factor(ITERABLE) or MM.factor(I, ...)")
1076 METH (done
, "MM.done() -> PRODUCT")
1081 static PyTypeObject
*mpmul_pytype
, mpmul_pytype_skel
= {
1082 PyObject_HEAD_INIT(0) 0, /* Header */
1083 "MPMul", /* @tp_name@ */
1084 sizeof(mpmul_pyobj
), /* @tp_basicsize@ */
1085 0, /* @tp_itemsize@ */
1087 mpmul_pydealloc
, /* @tp_dealloc@ */
1089 0, /* @tp_getattr@ */
1090 0, /* @tp_setattr@ */
1091 0, /* @tp_compare@ */
1093 0, /* @tp_as_number@ */
1094 0, /* @tp_as_sequence@ */
1095 0, /* @tp_as_mapping@ */
1099 0, /* @tp_getattro@ */
1100 0, /* @tp_setattro@ */
1101 0, /* @tp_as_buffer@ */
1102 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1103 Py_TPFLAGS_BASETYPE
,
1106 "An object for multiplying many small integers.",
1108 0, /* @tp_traverse@ */
1110 0, /* @tp_richcompare@ */
1111 0, /* @tp_weaklistoffset@ */
1113 0, /* @tp_iternext@ */
1114 mpmul_pymethods
, /* @tp_methods@ */
1115 0, /* @tp_members@ */
1116 mpmul_pygetset
, /* @tp_getset@ */
1119 0, /* @tp_descr_get@ */
1120 0, /* @tp_descr_set@ */
1121 0, /* @tp_dictoffset@ */
1123 PyType_GenericAlloc
, /* @tp_alloc@ */
1124 mpmul_pynew
, /* @tp_new@ */
1129 /*----- Montgomery reduction ----------------------------------------------*/
1131 typedef struct mpmont_pyobj
{
1136 #define MPMONT_PY(o) (&((mpmont_pyobj *)(o))->mm)
1138 static PyObject
*mmmeth_int(PyObject
*me
, PyObject
*arg
)
1142 mpmont
*mm
= MPMONT_PY(me
);
1144 if (!PyArg_ParseTuple(arg
, "O&:in", convmp
, &yy
))
1146 mp_div(0, &yy
, yy
, mm
->m
);
1147 z
= mp_pywrap(mpmont_mul(mm
, MP_NEW
, yy
, mm
->r2
));
1149 if (yy
) MP_DROP(yy
);
1153 static PyObject
*mmmeth_mul(PyObject
*me
, PyObject
*arg
)
1156 mp
*yy
= 0, *zz
= 0;
1158 if (!PyArg_ParseTuple(arg
, "O&O&:mul", convmp
, &yy
, convmp
, &zz
))
1160 rc
= mp_pywrap(mpmont_mul(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1162 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1166 static PyObject
*mmmeth_exp(PyObject
*me
, PyObject
*arg
)
1169 mp
*yy
= 0, *zz
= 0;
1171 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1174 if ((yy
= mp_modinv_checked(yy
, yy
, MPMONT_PY(me
)->m
)) == 0) goto end
;
1175 zz
= mp_neg(zz
, zz
);
1177 rc
= mp_pywrap(mpmont_exp(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1179 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1183 static PyObject
*mmmeth_expr(PyObject
*me
, PyObject
*arg
)
1186 mp
*yy
= 0, *zz
= 0;
1188 if (!PyArg_ParseTuple(arg
, "O&O&:expr", convmp
, &yy
, convmp
, &zz
))
1191 yy
= mpmont_reduce(MPMONT_PY(me
), yy
, yy
);
1192 if ((yy
= mp_modinv_checked(yy
, yy
, MPMONT_PY(me
)->m
)) == 0) goto end
;
1193 yy
= mpmont_mul(MPMONT_PY(me
), yy
, yy
, MPMONT_PY(me
)->r2
);
1194 zz
= mp_neg(zz
, zz
);
1196 rc
= mp_pywrap(mpmont_expr(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1198 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1202 static PyObject
*mm_mexpr_id(PyObject
*me
)
1203 { return mp_pywrap(MP_COPY(MPMONT_PY(me
)->r
)); }
1205 static int mm_mexpr_fill(void *p
, PyObject
*me
, PyObject
*x
, PyObject
*y
)
1207 mp
*xx
= 0, *yy
= 0;
1208 mp_expfactor
*f
= p
;
1209 mpmont
*mm
= MPMONT_PY(me
);
1211 if ((xx
= getmp(x
)) == 0 || (yy
= getmp(y
)) == 0)
1214 xx
= mpmont_reduce(mm
, xx
, xx
);
1215 if ((xx
= mp_modinv_checked(xx
, xx
, yy
)) == 0)
1217 xx
= mpmont_mul(mm
, xx
, xx
, mm
->r2
);
1218 yy
= mp_neg(yy
, yy
);
1225 mp_drop(xx
); mp_drop(yy
);
1229 static PyObject
*mm_mexpr(PyObject
*me
, void *v
, int n
)
1230 { return mp_pywrap(mpmont_mexpr(MPMONT_PY(me
), MP_NEW
, v
, n
)); }
1232 static void mp_mexp_drop(void *p
)
1234 mp_expfactor
*f
= p
;
1239 static PyObject
*mmmeth_mexpr(PyObject
*me
, PyObject
*arg
)
1241 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1242 mm_mexpr_id
, mm_mexpr_fill
, mm_mexpr
, mp_mexp_drop
);
1245 static PyObject
*mp_mexp_id(PyObject
*me
)
1246 { return mp_pywrap(MP_ONE
); }
1248 static int mp_mexp_fill(void *p
, PyObject
*me
, PyObject
*x
, PyObject
*y
)
1250 mp
*xx
= 0, *yy
= 0;
1251 mp_expfactor
*f
= p
;
1253 if ((xx
= getmp(x
)) == 0 || (yy
= getmp(y
)) == 0)
1256 if ((xx
= mp_modinv_checked(xx
, xx
, yy
)) == 0)
1258 yy
= mp_neg(yy
, yy
);
1265 mp_drop(xx
); mp_drop(yy
);
1269 static PyObject
*mm_mexp(PyObject
*me
, void *v
, int n
)
1270 { return mp_pywrap(mpmont_mexp(MPMONT_PY(me
), MP_NEW
, v
, n
)); }
1272 static PyObject
*mmmeth_mexp(PyObject
*me
, PyObject
*arg
)
1274 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1275 mp_mexp_id
, mp_mexp_fill
, mm_mexp
, mp_mexp_drop
);
1278 #define mmmeth_ext mmmeth_reduce
1279 static PyObject
*mmmeth_reduce(PyObject
*me
, PyObject
*arg
)
1284 if (!PyArg_ParseTuple(arg
, "O&", convmp
, &yy
)) goto end
;
1285 z
= mp_pywrap(mpmont_reduce(MPMONT_PY(me
), MP_NEW
, yy
));
1290 static void mpmont_pydealloc(PyObject
*me
)
1292 mpmont_destroy(MPMONT_PY(me
));
1296 static PyObject
*mpmont_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1298 mpmont_pyobj
*mm
= 0;
1299 char *kwlist
[] = { "m", 0 };
1302 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1304 if (!MP_POSP(xx
) || !MP_ODDP(xx
)) VALERR("m must be positive and odd");
1305 mm
= (mpmont_pyobj
*)ty
->tp_alloc(ty
, 0);
1306 mpmont_create(&mm
->mm
, xx
);
1308 if (xx
) MP_DROP(xx
);
1309 return ((PyObject
*)mm
);
1312 static PyObject
*mmget_m(PyObject
*me
, void *hunoz
)
1313 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->m
))); }
1315 static PyObject
*mmget_r(PyObject
*me
, void *hunoz
)
1316 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->r
))); }
1318 static PyObject
*mmget_r2(PyObject
*me
, void *hunoz
)
1319 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->r2
))); }
1321 static PyGetSetDef mpmont_pygetset
[] = {
1322 #define GETSETNAME(op, name) mm##op##_##name
1323 GET (m
, "M.m -> modulus for reduction")
1324 GET (r
, "M.r -> multiplicative identity")
1325 GET (r2
, "M.r2 -> M.r^2, Montgomerization factor")
1330 static PyMethodDef mpmont_pymethods
[] = {
1331 #define METHNAME(name) mmmeth_##name
1332 METH (int, "M.int(X) -> XR")
1333 METH (mul
, "M.mul(XR, YR) -> ZR where Z = X Y")
1334 METH (expr
, "M.expr(XR, N) -> ZR where Z = X^N mod M.m")
1336 M.mexpr([(XR0, N0), (XR1, N1), ...]) = ZR where Z = X0^N0 X1^N1 ... mod M.m\n\
1337 \t(the list may be flattened if this more convenient.)")
1338 METH (reduce
, "M.reduce(XR) -> X")
1339 METH (ext
, "M.ext(XR) -> X")
1340 METH (exp
, "M.exp(X, N) -> X^N mod M.m")
1342 M.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod M.m\n\
1343 \t(the list may be flattened if this more convenient.)")
1348 static PyTypeObject
*mpmont_pytype
, mpmont_pytype_skel
= {
1349 PyObject_HEAD_INIT(0) 0, /* Header */
1350 "MPMont", /* @tp_name@ */
1351 sizeof(mpmont_pyobj
), /* @tp_basicsize@ */
1352 0, /* @tp_itemsize@ */
1354 mpmont_pydealloc
, /* @tp_dealloc@ */
1356 0, /* @tp_getattr@ */
1357 0, /* @tp_setattr@ */
1358 0, /* @tp_compare@ */
1360 0, /* @tp_as_number@ */
1361 0, /* @tp_as_sequence@ */
1362 0, /* @tp_as_mapping@ */
1366 0, /* @tp_getattro@ */
1367 0, /* @tp_setattro@ */
1368 0, /* @tp_as_buffer@ */
1369 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1370 Py_TPFLAGS_BASETYPE
,
1373 "A Montgomery reduction context.",
1375 0, /* @tp_traverse@ */
1377 0, /* @tp_richcompare@ */
1378 0, /* @tp_weaklistoffset@ */
1380 0, /* @tp_iternext@ */
1381 mpmont_pymethods
, /* @tp_methods@ */
1382 0, /* @tp_members@ */
1383 mpmont_pygetset
, /* @tp_getset@ */
1386 0, /* @tp_descr_get@ */
1387 0, /* @tp_descr_set@ */
1388 0, /* @tp_dictoffset@ */
1390 PyType_GenericAlloc
, /* @tp_alloc@ */
1391 mpmont_pynew
, /* @tp_new@ */
1396 /*----- Barrett reduction -------------------------------------------------*/
1398 typedef struct mpbarrett_pyobj
{
1403 #define MPBARRETT_PY(o) (&((mpbarrett_pyobj *)(o))->mb)
1405 static PyObject
*mbmeth_exp(PyObject
*me
, PyObject
*arg
)
1408 mp
*yy
= 0, *zz
= 0;
1410 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1413 if ((yy
= mp_modinv_checked(yy
, yy
, MPBARRETT_PY(me
)->m
)) == 0) goto end
;
1414 zz
= mp_neg(zz
, zz
);
1416 rc
= mp_pywrap(mpbarrett_exp(MPBARRETT_PY(me
), MP_NEW
, yy
, zz
));
1418 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1422 static PyObject
*mb_mexp(PyObject
*me
, void *v
, int n
)
1423 { return mp_pywrap(mpbarrett_mexp(MPBARRETT_PY(me
), MP_NEW
, v
, n
)); }
1425 static PyObject
*mbmeth_mexp(PyObject
*me
, PyObject
*arg
)
1427 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1428 mp_mexp_id
, mp_mexp_fill
, mb_mexp
, mp_mexp_drop
);
1431 static PyObject
*mbmeth_reduce(PyObject
*me
, PyObject
*arg
)
1436 if (!PyArg_ParseTuple(arg
, "O&:reduce", convmp
, &yy
))
1438 z
= mp_pywrap(mpbarrett_reduce(MPBARRETT_PY(me
), MP_NEW
, yy
));
1443 static void mpbarrett_pydealloc(PyObject
*me
)
1445 mpbarrett_destroy(MPBARRETT_PY(me
));
1449 static PyObject
*mpbarrett_pynew(PyTypeObject
*ty
,
1450 PyObject
*arg
, PyObject
*kw
)
1452 mpbarrett_pyobj
*mb
= 0;
1453 char *kwlist
[] = { "m", 0 };
1456 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1458 if (!MP_POSP(xx
)) VALERR("m must be positive");
1459 mb
= (mpbarrett_pyobj
*)ty
->tp_alloc(ty
, 0);
1460 mpbarrett_create(&mb
->mb
, xx
);
1462 if (xx
) MP_DROP(xx
);
1463 return ((PyObject
*)mb
);
1466 static PyObject
*mbget_m(PyObject
*me
, void *hunoz
)
1467 { return (mp_pywrap(MP_COPY(MPBARRETT_PY(me
)->m
))); }
1469 static PyGetSetDef mpbarrett_pygetset
[] = {
1470 #define GETSETNAME(op, name) mb##op##_##name
1471 GET (m
, "B.m -> modulus for reduction")
1476 static PyMethodDef mpbarrett_pymethods
[] = {
1477 #define METHNAME(name) mbmeth_##name
1478 METH (reduce
, "B.reduce(X) -> X mod B.m")
1479 METH (exp
, "B.exp(X, N) -> X^N mod B.m")
1481 B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod B.m\n\
1482 \t(the list may be flattened if this more convenient.)")
1487 static PyTypeObject
*mpbarrett_pytype
, mpbarrett_pytype_skel
= {
1488 PyObject_HEAD_INIT(0) 0, /* Header */
1489 "MPBarrett", /* @tp_name@ */
1490 sizeof(mpbarrett_pyobj
), /* @tp_basicsize@ */
1491 0, /* @tp_itemsize@ */
1493 mpbarrett_pydealloc
, /* @tp_dealloc@ */
1495 0, /* @tp_getattr@ */
1496 0, /* @tp_setattr@ */
1497 0, /* @tp_compare@ */
1499 0, /* @tp_as_number@ */
1500 0, /* @tp_as_sequence@ */
1501 0, /* @tp_as_mapping@ */
1505 0, /* @tp_getattro@ */
1506 0, /* @tp_setattro@ */
1507 0, /* @tp_as_buffer@ */
1508 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1509 Py_TPFLAGS_BASETYPE
,
1512 "A Barrett reduction context.",
1514 0, /* @tp_traverse@ */
1516 0, /* @tp_richcompare@ */
1517 0, /* @tp_weaklistoffset@ */
1519 0, /* @tp_iternext@ */
1520 mpbarrett_pymethods
, /* @tp_methods@ */
1521 0, /* @tp_members@ */
1522 mpbarrett_pygetset
, /* @tp_getset@ */
1525 0, /* @tp_descr_get@ */
1526 0, /* @tp_descr_set@ */
1527 0, /* @tp_dictoffset@ */
1529 PyType_GenericAlloc
, /* @tp_alloc@ */
1530 mpbarrett_pynew
, /* @tp_new@ */
1535 /*----- Nice prime reduction ----------------------------------------------*/
1537 typedef struct mpreduce_pyobj
{
1542 #define MPREDUCE_PY(o) (&((mpreduce_pyobj *)(o))->mr)
1544 static PyObject
*mrmeth_exp(PyObject
*me
, PyObject
*arg
)
1547 mp
*yy
= 0, *zz
= 0;
1549 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1552 if ((yy
= mp_modinv_checked(yy
, yy
, MPREDUCE_PY(me
)->p
)) == 0) goto end
;
1553 zz
= mp_neg(zz
, zz
);
1555 rc
= mp_pywrap(mpreduce_exp(MPREDUCE_PY(me
), MP_NEW
, yy
, zz
));
1557 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1561 static PyObject
*mrmeth_reduce(PyObject
*me
, PyObject
*arg
)
1566 if (!PyArg_ParseTuple(arg
, "O&:reduce", convmp
, &yy
)) goto end
;
1567 z
= mp_pywrap(mpreduce_do(MPREDUCE_PY(me
), MP_NEW
, yy
));
1572 static void mpreduce_pydealloc(PyObject
*me
)
1574 mpreduce_destroy(MPREDUCE_PY(me
));
1578 static PyObject
*mpreduce_pynew(PyTypeObject
*ty
,
1579 PyObject
*arg
, PyObject
*kw
)
1581 mpreduce_pyobj
*mr
= 0;
1583 char *kwlist
[] = { "m", 0 };
1586 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1588 if (!MP_POSP(xx
)) VALERR("m must be positive");
1589 if (mpreduce_create(&r
, xx
)) VALERR("bad modulus (must be 2^k - ...)");
1590 mr
= (mpreduce_pyobj
*)ty
->tp_alloc(ty
, 0);
1593 if (xx
) MP_DROP(xx
);
1594 return ((PyObject
*)mr
);
1597 static PyObject
*mrget_m(PyObject
*me
, void *hunoz
)
1598 { return (mp_pywrap(MP_COPY(MPREDUCE_PY(me
)->p
))); }
1600 static PyGetSetDef mpreduce_pygetset
[] = {
1601 #define GETSETNAME(op, name) mr##op##_##name
1602 GET (m
, "R.m -> modulus for reduction")
1607 static PyMethodDef mpreduce_pymethods
[] = {
1608 #define METHNAME(name) mrmeth_##name
1609 METH (reduce
, "R.reduce(X) -> X mod B.m")
1610 METH (exp
, "R.exp(X, N) -> X^N mod B.m")
1615 static PyTypeObject
*mpreduce_pytype
, mpreduce_pytype_skel
= {
1616 PyObject_HEAD_INIT(0) 0, /* Header */
1617 "MPReduce", /* @tp_name@ */
1618 sizeof(mpreduce_pyobj
), /* @tp_basicsize@ */
1619 0, /* @tp_itemsize@ */
1621 mpreduce_pydealloc
, /* @tp_dealloc@ */
1623 0, /* @tp_getattr@ */
1624 0, /* @tp_setattr@ */
1625 0, /* @tp_compare@ */
1627 0, /* @tp_as_number@ */
1628 0, /* @tp_as_sequence@ */
1629 0, /* @tp_as_mapping@ */
1633 0, /* @tp_getattro@ */
1634 0, /* @tp_setattro@ */
1635 0, /* @tp_as_buffer@ */
1636 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1637 Py_TPFLAGS_BASETYPE
,
1640 "A reduction context for reduction modulo primes of special form.",
1642 0, /* @tp_traverse@ */
1644 0, /* @tp_richcompare@ */
1645 0, /* @tp_weaklistoffset@ */
1647 0, /* @tp_iternext@ */
1648 mpreduce_pymethods
, /* @tp_methods@ */
1649 0, /* @tp_members@ */
1650 mpreduce_pygetset
, /* @tp_getset@ */
1653 0, /* @tp_descr_get@ */
1654 0, /* @tp_descr_set@ */
1655 0, /* @tp_dictoffset@ */
1657 PyType_GenericAlloc
, /* @tp_alloc@ */
1658 mpreduce_pynew
, /* @tp_new@ */
1663 /*----- Chinese Remainder Theorem solution --------------------------------*/
1665 typedef struct mpcrt_pyobj
{
1670 #define MPCRT_PY(o) (&((mpcrt_pyobj *)(o))->c)
1672 static PyObject
*mcmeth_solve(PyObject
*me
, PyObject
*arg
)
1674 mpcrt
*c
= MPCRT_PY(me
);
1675 PyObject
*q
= 0, *x
, *z
= 0;
1678 int i
= 0, n
= c
->k
;
1681 if (PyTuple_Size(arg
) == n
)
1683 else if (!PyArg_ParseTuple(arg
, "O:solve", &q
))
1686 if (!PySequence_Check(q
)) TYERR("want a sequence of residues");
1687 if (PySequence_Size(q
) != n
) VALERR("residue count mismatch");
1688 v
= xmalloc(n
* sizeof(*v
));
1689 for (i
= 0; i
< n
; i
++) {
1690 if ((x
= PySequence_GetItem(q
, i
)) == 0) goto end
;
1691 xx
= getmp(x
); Py_DECREF(x
); if (!xx
) goto end
;
1694 z
= mp_pywrap(mpcrt_solve(c
, MP_NEW
, v
));
1698 for (i
= 0; i
< n
; i
++)
1707 static void mpcrt_pydealloc(PyObject
*me
)
1709 mpcrt
*c
= MPCRT_PY(me
);
1714 static PyObject
*mpcrt_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1718 char *kwlist
[] = { "mv", 0 };
1719 PyObject
*q
= 0, *x
;
1723 if (PyTuple_Size(arg
) > 1)
1725 else if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O:new", kwlist
, &q
))
1728 if (!PySequence_Check(q
)) TYERR("want a sequence of moduli");
1729 n
= PySequence_Size(q
);
1730 if (PyErr_Occurred()) goto end
;
1731 if (!n
) VALERR("want at least one modulus");
1732 v
= xmalloc(n
* sizeof(*v
));
1733 for (i
= 0; i
< n
; i
++) {
1734 if ((x
= PySequence_GetItem(q
, i
)) == 0) goto end
;
1735 xx
= getmp(x
); Py_DECREF(x
); if (!xx
) goto end
;
1736 v
[i
].m
= xx
; v
[i
].n
= 0; v
[i
].ni
= 0; v
[i
].nni
= 0;
1738 c
= (mpcrt_pyobj
*)ty
->tp_alloc(ty
, 0);
1739 mpcrt_create(&c
->c
, v
, n
, 0);
1741 return ((PyObject
*)c
);
1746 for (i
= 0; i
< n
; i
++)
1754 static PyObject
*mcget_product(PyObject
*me
, void *hunoz
)
1755 { return (mp_pywrap(MP_COPY(MPCRT_PY(me
)->mb
.m
))); }
1757 static PyObject
*mcget_moduli(PyObject
*me
, void *hunoz
)
1761 mpcrt
*c
= MPCRT_PY(me
);
1763 if ((q
= PyList_New(c
->k
)) == 0) return (0);
1764 for (i
= 0; i
< c
->k
; i
++)
1765 PyList_SetItem(q
, i
, mp_pywrap(c
->v
[i
].m
));
1769 static PyGetSetDef mpcrt_pygetset
[] = {
1770 #define GETSETNAME(op, name) mc##op##_##name
1771 GET (product
, "C.product -> product of moduli")
1772 GET (moduli
, "C.moduli -> list of individual moduli")
1777 static PyMethodDef mpcrt_pymethods
[] = {
1778 #define METHNAME(name) mcmeth_##name
1779 METH (solve
, "C.solve([R0, R1]) -> X mod C.product")
1784 static PyTypeObject
*mpcrt_pytype
, mpcrt_pytype_skel
= {
1785 PyObject_HEAD_INIT(0) 0, /* Header */
1786 "MPCRT", /* @tp_name@ */
1787 sizeof(mpcrt_pyobj
), /* @tp_basicsize@ */
1788 0, /* @tp_itemsize@ */
1790 mpcrt_pydealloc
, /* @tp_dealloc@ */
1792 0, /* @tp_getattr@ */
1793 0, /* @tp_setattr@ */
1794 0, /* @tp_compare@ */
1796 0, /* @tp_as_number@ */
1797 0, /* @tp_as_sequence@ */
1798 0, /* @tp_as_mapping@ */
1802 0, /* @tp_getattro@ */
1803 0, /* @tp_setattro@ */
1804 0, /* @tp_as_buffer@ */
1805 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1806 Py_TPFLAGS_BASETYPE
,
1809 "A context for the solution of Chinese Remainder Theorem problems.",
1811 0, /* @tp_traverse@ */
1813 0, /* @tp_richcompare@ */
1814 0, /* @tp_weaklistoffset@ */
1816 0, /* @tp_iternext@ */
1817 mpcrt_pymethods
, /* @tp_methods@ */
1818 0, /* @tp_members@ */
1819 mpcrt_pygetset
, /* @tp_getset@ */
1822 0, /* @tp_descr_get@ */
1823 0, /* @tp_descr_set@ */
1824 0, /* @tp_dictoffset@ */
1826 PyType_GenericAlloc
, /* @tp_alloc@ */
1827 mpcrt_pynew
, /* @tp_new@ */
1832 /*----- Binary polynomials ------------------------------------------------*/
1834 static PyObject
*gf_pyrepr(PyObject
*o
)
1835 { return mp_topystring(MP_X(o
), 16, "GF(", "0x", "L)"); }
1837 static PyObject
*gf_pyrichcompare(PyObject
*x
, PyObject
*y
, int op
)
1843 if (gfbinop(x
, y
, &xx
, &yy
)) RETURN_NOTIMPL
;
1845 case Py_EQ
: b
= MP_EQ(xx
, yy
); break;
1846 case Py_NE
: b
= !MP_EQ(xx
, yy
); break;
1851 case Py_LT
: b
= xl
< yl
; break;
1852 case Py_LE
: b
= xl
<= yl
; break;
1853 case Py_GT
: b
= xl
> yl
; break;
1854 case Py_GE
: b
= xl
>= yl
; break;
1859 MP_DROP(xx
); MP_DROP(yy
);
1860 return (getbool(b
));
1863 static PyObject
*gf_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1869 char *kwlist
[] = { "x", "radix", 0 };
1871 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O|i:gf", kwlist
, &x
, &radix
))
1873 if (GF_PYCHECK(x
)) RETURN_OBJ(x
);
1874 if (!good_radix_p(radix
, 1)) VALERR("radix out of range");
1875 if ((z
= mp_frompyobject(x
, radix
)) == 0) {
1876 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to gf",
1877 x
->ob_type
->tp_name
);
1882 VALERR("gf cannot be negative");
1884 zz
= (mp_pyobj
*)ty
->tp_alloc(ty
, 0);
1887 return ((PyObject
*)zz
);
1890 static PyObject
*gf_pyexp(PyObject
*x
, PyObject
*y
, PyObject
*z
)
1892 mp
*xx
= 0, *yy
= 0, *zz
= 0;
1896 if ((xx
= tomp(x
)) == 0 || (yy
= tomp(y
)) == 0 ||
1897 (z
&& z
!= Py_None
&& (zz
= tomp(z
)) == 0)) {
1898 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
1901 if (!z
|| z
== Py_None
) {
1902 if (MP_NEGP(yy
)) VALERR("negative exponent");
1903 r
= gf_exp(MP_NEW
, xx
, yy
);
1906 if (MP_ZEROP(zz
)) ZDIVERR("zero modulus");
1908 if ((xx
= gf_modinv_checked(xx
, xx
, zz
)) == 0) goto end
;
1909 yy
= mp_neg(yy
, yy
);
1911 gfreduce_create(&gr
, zz
);
1912 r
= gfreduce_exp(&gr
, MP_NEW
, xx
, yy
);
1913 gfreduce_destroy(&gr
);
1917 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
1921 static PyObject
*gfmeth_sqr(PyObject
*me
, PyObject
*arg
)
1923 if (!PyArg_ParseTuple(arg
, ":sqr")) return (0);
1924 return (gf_pywrap(gf_sqr(MP_NEW
, MP_X(me
))));
1927 static PyObject
*gfmeth_gcd(PyObject
*me
, PyObject
*arg
)
1930 mp
*yy
= 0, *zz
= MP_NEW
;
1932 if (!PyArg_ParseTuple(arg
, "O&:gcd", convgf
, &yy
)) goto end
;
1933 gf_gcd(&zz
, 0, 0, MP_X(me
), yy
);
1936 if (yy
) MP_DROP(yy
);
1940 static PyObject
*gfmeth_gcdx(PyObject
*me
, PyObject
*arg
)
1943 mp
*yy
= 0, *zz
= MP_NEW
, *uu
= MP_NEW
, *vv
= MP_NEW
;
1945 if (!PyArg_ParseTuple(arg
, "O&:gcdx", convgf
, &yy
))
1947 gf_gcd(&zz
, &uu
, &vv
, MP_X(me
), yy
);
1948 z
= Py_BuildValue("(NNN)",
1949 gf_pywrap(zz
), gf_pywrap(uu
), gf_pywrap(vv
));
1951 if (yy
) MP_DROP(yy
);
1955 static PyObject
*gfmeth_modinv(PyObject
*me
, PyObject
*arg
)
1958 mp
*yy
= 0, *zz
= MP_NEW
;
1960 if (!PyArg_ParseTuple(arg
, "O&:modinv", convgf
, &yy
) ||
1961 (zz
= gf_modinv_checked(MP_NEW
, yy
, MP_X(me
))) == 0)
1965 if (yy
) MP_DROP(yy
);
1969 static PyObject
*gfmeth_irreduciblep(PyObject
*me
, PyObject
*arg
)
1971 if (!PyArg_ParseTuple(arg
, ":irreduciblep")) return (0);
1972 return getbool(gf_irreduciblep(MP_X(me
)));
1975 static PyObject
*gfget_degree(PyObject
*me
, void *hunoz
)
1976 { return (PyInt_FromLong(mp_bits(MP_X(me
)) - 1)); }
1978 static PyGetSetDef gf_pygetset
[] = {
1979 #define GETSETNAME(op, name) gf##op##_##name
1980 GET (degree
, "X.degree -> polynomial degree of X")
1982 #define GETSETNAME(op, name) mp##op##_##name
1983 GET (nbits
, "X.nbits -> bit length of X")
1984 GET (noctets
, "X.noctets -> octet length of X")
1989 static PyMethodDef gf_pymethods
[] = {
1990 #define METHNAME(func) gfmeth_##func
1991 METH (setbit
, "X.setbit(N) -> X with bit N set")
1992 METH (clearbit
, "X.clearbit(N) -> X with bit N clear")
1993 METH (testbit
, "X.testbit(N) -> true/false if bit N set/clear in X")
1994 METH (sqr
, "X.sqr() -> X^2")
1995 METH (gcd
, "X.gcd(Y) -> gcd(X, Y)")
1997 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
1998 METH (modinv
, "X.modinv(Y) -> multiplicative inverse of Y mod X")
1999 METH (irreduciblep
, "X.irreduciblep() -> true/false")
2001 #define METHNAME(func) mpmeth_##func
2002 KWMETH(tostring
, "X.tostring(radix = 10) -> STR")
2003 KWMETH(storel
, "X.storel(len = -1) -> little-endian bytes")
2004 KWMETH(storeb
, "X.storeb(len = -1) -> big-endian bytes")
2006 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
2008 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
2009 METH (tobuf
, "X.tobuf() -> buffer format")
2014 static PyNumberMethods gf_pynumber
= {
2015 gf_pyadd
, /* @nb_add@ */
2016 gf_pysub
, /* @nb_subtract@ */
2017 gf_pymul
, /* @nb_multiply@ */
2018 0, /* @nb_divide@ */
2019 gf_pymod
, /* @nb_remainder@ */
2020 gf_pydivmod
, /* @nb_divmod@ */
2021 gf_pyexp
, /* @nb_power@ */
2022 mp_pyid
, /* @nb_negative@ */
2023 mp_pyid
, /* @nb_positive@ */
2024 mp_pyid
, /* @nb_absolute@ */
2025 mp_pynonzerop
, /* @nb_nonzero@ */
2026 0 /* doesn't make any sense */, /* @nb_invert@ */
2027 gf_pylsl
, /* @nb_lshift@ */
2028 gf_pylsr
, /* @nb_rshift@ */
2029 gf_pyand
, /* @nb_and@ */
2030 gf_pyxor
, /* @nb_xor@ */
2031 gf_pyor
, /* @nb_or@ */
2032 gf_pycoerce
, /* @nb_coerce@ */
2033 mp_pyint
, /* @nb_int@ */
2034 mp_pylong
, /* @nb_long@ */
2035 0 /* doesn't make any sense */, /* @nb_float@ */
2036 mp_pyoct
, /* @nb_oct@ */
2037 mp_pyhex
, /* @nb_hex@ */
2039 0, /* @nb_inplace_add@ */
2040 0, /* @nb_inplace_subtract@ */
2041 0, /* @nb_inplace_multiply@ */
2042 0, /* @nb_inplace_divide@ */
2043 0, /* @nb_inplace_remainder@ */
2044 0, /* @nb_inplace_power@ */
2045 0, /* @nb_inplace_lshift@ */
2046 0, /* @nb_inplace_rshift@ */
2047 0, /* @nb_inplace_and@ */
2048 0, /* @nb_inplace_xor@ */
2049 0, /* @nb_inplace_or@ */
2051 gf_pydiv
, /* @nb_floor_divide@ */
2052 0, /* @nb_true_divide@ */
2053 0, /* @nb_inplace_floor_divide@ */
2054 0, /* @nb_inplace_true_divide@ */
2057 static PyTypeObject gf_pytype_skel
= {
2058 PyObject_HEAD_INIT(0) 0, /* Header */
2059 "GF", /* @tp_name@ */
2060 sizeof(mp_pyobj
), /* @tp_basicsize@ */
2061 0, /* @tp_itemsize@ */
2063 mp_pydealloc
, /* @tp_dealloc@ */
2065 0, /* @tp_getattr@ */
2066 0, /* @tp_setattr@ */
2067 0, /* @tp_compare@ */
2068 gf_pyrepr
, /* @tp_repr@ */
2069 &gf_pynumber
, /* @tp_as_number@ */
2070 0, /* @tp_as_sequence@ */
2071 0, /* @tp_as_mapping@ */
2072 mp_pyhash
, /* @tp_hash@ */
2074 mp_pyhex
, /* @tp_str@ */
2075 0, /* @tp_getattro@ */
2076 0, /* @tp_setattro@ */
2077 0, /* @tp_as_buffer@ */
2078 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2079 Py_TPFLAGS_CHECKTYPES
|
2080 Py_TPFLAGS_BASETYPE
,
2083 "Binary polynomials. Support almost all the standard arithmetic\n\
2086 Constructor gf(X, radix = R) attempts to convert X to a `gf'. If\n\
2087 X is a string, it's read in radix-R form, or we look for a prefix\n\
2088 if R = 0. Other acceptable things are ints and longs.\n\
2090 The name is hopelessly wrong from a technical point of view, but\n\
2091 but it's much easier to type than `p2' or `c2' or whatever.\n\
2095 * Use `//' for division. GFs don't have `/' division.",
2097 0, /* @tp_traverse@ */
2099 gf_pyrichcompare
, /* @tp_richcompare@ */
2100 0, /* @tp_weaklistoffset@ */
2102 0, /* @tp_iternext@ */
2103 gf_pymethods
, /* @tp_methods@ */
2104 0, /* @tp_members@ */
2105 gf_pygetset
, /* @tp_getset@ */
2108 0, /* @tp_descr_get@ */
2109 0, /* @tp_descr_set@ */
2110 0, /* @tp_dictoffset@ */
2112 PyType_GenericAlloc
, /* @tp_alloc@ */
2113 gf_pynew
, /* @tp_new@ */
2118 static PyObject
*meth__GF_fromstring(PyObject
*me
,
2119 PyObject
*arg
, PyObject
*kw
)
2126 mptext_stringctx sc
;
2127 char *kwlist
[] = { "class", "x", "radix", 0 };
2129 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "Os#|i:fromstring",
2130 kwlist
, &me
, &p
, &len
, &r
))
2132 if (!good_radix_p(r
, 1)) VALERR("bad radix");
2133 sc
.buf
= p
; sc
.lim
= p
+ len
;
2134 if ((zz
= mp_read(MP_NEW
, r
, &mptext_stringops
, &sc
)) == 0 ||
2136 if (zz
) MP_DROP(zz
);
2137 VALERR("bad binary polynomial");
2139 z
= Py_BuildValue("(Ns#)", gf_pywrap(zz
),
2140 sc
.buf
, (Py_ssize_t
)(sc
.lim
- sc
.buf
));
2145 /*----- Sparse poly reduction ---------------------------------------------*/
2147 typedef struct gfreduce_pyobj
{
2152 #define GFREDUCE_PY(o) (&((gfreduce_pyobj *)(o))->mr)
2154 static PyObject
*grmeth_exp(PyObject
*me
, PyObject
*arg
)
2157 mp
*yy
= 0, *zz
= 0;
2159 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convgf
, &yy
, convgf
, &zz
))
2162 if ((yy
= gf_modinv_checked(yy
, yy
, GFREDUCE_PY(me
)->p
)) == 0) goto end
;
2163 zz
= mp_neg(zz
, zz
);
2165 rc
= gf_pywrap(gfreduce_exp(GFREDUCE_PY(me
), MP_NEW
, yy
, zz
));
2167 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
2171 static PyObject
*grmeth_trace(PyObject
*me
, PyObject
*arg
)
2176 if (!PyArg_ParseTuple(arg
, "O&:trace", convgf
, &xx
)) goto end
;
2177 rc
= PyInt_FromLong(gfreduce_trace(GFREDUCE_PY(me
), xx
));
2179 if (xx
) MP_DROP(xx
);
2183 static PyObject
*grmeth_halftrace(PyObject
*me
, PyObject
*arg
)
2188 if (!PyArg_ParseTuple(arg
, "O&:halftrace", convgf
, &xx
)) goto end
;
2189 rc
= gf_pywrap(gfreduce_halftrace(GFREDUCE_PY(me
), MP_NEW
, xx
));
2191 if (xx
) MP_DROP(xx
);
2195 static PyObject
*grmeth_sqrt(PyObject
*me
, PyObject
*arg
)
2200 if (!PyArg_ParseTuple(arg
, "O&:sqrt", convgf
, &xx
)) goto end
;
2201 if ((yy
= gfreduce_sqrt(GFREDUCE_PY(me
), MP_NEW
, xx
)) == 0)
2202 VALERR("no modular square root");
2205 if (xx
) MP_DROP(xx
);
2209 static PyObject
*grmeth_quadsolve(PyObject
*me
, PyObject
*arg
)
2214 if (!PyArg_ParseTuple(arg
, "O&:quadsolve", convgf
, &xx
)) goto end
;
2215 if ((yy
= gfreduce_quadsolve(GFREDUCE_PY(me
), MP_NEW
, xx
)) == 0)
2216 VALERR("no solution found");
2219 if (xx
) MP_DROP(xx
);
2223 static PyObject
*grmeth_reduce(PyObject
*me
, PyObject
*arg
)
2228 if (!PyArg_ParseTuple(arg
, "O&:reduce", convgf
, &yy
)) goto end
;
2229 z
= gf_pywrap(gfreduce_do(GFREDUCE_PY(me
), MP_NEW
, yy
));
2234 static void gfreduce_pydealloc(PyObject
*me
)
2236 gfreduce_destroy(GFREDUCE_PY(me
));
2240 static PyObject
*gfreduce_pynew(PyTypeObject
*ty
,
2241 PyObject
*arg
, PyObject
*kw
)
2243 gfreduce_pyobj
*mr
= 0;
2245 char *kwlist
[] = { "m", 0 };
2248 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convgf
, &xx
))
2250 if (MP_ZEROP(xx
)) ZDIVERR("modulus is zero!");
2251 gfreduce_create(&r
, xx
);
2252 mr
= (gfreduce_pyobj
*)ty
->tp_alloc(ty
, 0);
2255 if (xx
) MP_DROP(xx
);
2256 return ((PyObject
*)mr
);
2259 static PyObject
*grget_m(PyObject
*me
, void *hunoz
)
2260 { return (gf_pywrap(MP_COPY(GFREDUCE_PY(me
)->p
))); }
2262 static PyGetSetDef gfreduce_pygetset
[] = {
2263 #define GETSETNAME(op, name) gr##op##_##name
2264 GET (m
, "R.m -> reduction polynomial")
2269 static PyMethodDef gfreduce_pymethods
[] = {
2270 #define METHNAME(name) grmeth_##name
2271 METH (reduce
, "R.reduce(X) -> X mod B.m")
2272 METH (trace
, "R.trace(X) -> Tr(X) = x + x^2 + ... + x^{2^{m - 1}}")
2273 METH (halftrace
, "R.halftrace(X) -> x + x^{2^2} + ... + x^{2^{m - 1}}")
2274 METH (sqrt
, "R.sqrt(X) -> Y where Y^2 = X mod R")
2275 METH (quadsolve
, "R.quadsolve(X) -> Y where Y^2 + Y = X mod R")
2276 METH (exp
, "R.exp(X, N) -> X^N mod B.m")
2281 static PyTypeObject
*gfreduce_pytype
, gfreduce_pytype_skel
= {
2282 PyObject_HEAD_INIT(0) 0, /* Header */
2283 "GFReduce", /* @tp_name@ */
2284 sizeof(gfreduce_pyobj
), /* @tp_basicsize@ */
2285 0, /* @tp_itemsize@ */
2287 gfreduce_pydealloc
, /* @tp_dealloc@ */
2289 0, /* @tp_getattr@ */
2290 0, /* @tp_setattr@ */
2291 0, /* @tp_compare@ */
2293 0, /* @tp_as_number@ */
2294 0, /* @tp_as_sequence@ */
2295 0, /* @tp_as_mapping@ */
2299 0, /* @tp_getattro@ */
2300 0, /* @tp_setattro@ */
2301 0, /* @tp_as_buffer@ */
2302 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2303 Py_TPFLAGS_BASETYPE
,
2306 "A reduction context for reduction modulo sparse irreducible polynomials.",
2308 0, /* @tp_traverse@ */
2310 0, /* @tp_richcompare@ */
2311 0, /* @tp_weaklistoffset@ */
2313 0, /* @tp_iternext@ */
2314 gfreduce_pymethods
, /* @tp_methods@ */
2315 0, /* @tp_members@ */
2316 gfreduce_pygetset
, /* @tp_getset@ */
2319 0, /* @tp_descr_get@ */
2320 0, /* @tp_descr_set@ */
2321 0, /* @tp_dictoffset@ */
2323 PyType_GenericAlloc
, /* @tp_alloc@ */
2324 gfreduce_pynew
, /* @tp_new@ */
2329 /*----- Normal/poly transformation ----------------------------------------*/
2331 typedef struct gfn_pyobj
{
2337 static PyTypeObject
*gfn_pytype
, gfn_pytype_skel
;
2339 #define GFN_P(o) (((gfn_pyobj *)(o))->p)
2340 #define GFN_PTON(o) (&((gfn_pyobj *)(o))->pton)
2341 #define GFN_NTOP(o) (&((gfn_pyobj *)(o))->ntop)
2343 static PyObject
*gfn_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
2345 mp
*p
= 0, *beta
= 0;
2347 char *kwlist
[] = { "p", "beta", 0 };
2349 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&O&:new", kwlist
,
2350 convgf
, &p
, convgf
, &beta
))
2352 gg
= PyObject_New(gfn_pyobj
, ty
);
2353 if (gfn_create(p
, beta
, &gg
->ntop
, &gg
->pton
)) {
2356 VALERR("can't invert transformation matrix");
2362 return ((PyObject
*)gg
);
2365 static PyObject
*gfnget_p(PyObject
*me
, void *hunoz
)
2366 { return (gf_pywrap(MP_COPY(GFN_P(me
)))); }
2368 static PyObject
*gfnget_beta(PyObject
*me
, void *hunoz
)
2370 gfn
*n
= GFN_NTOP(me
);
2371 mp
*x
= n
->r
[n
->n
- 1];
2372 return (gf_pywrap(MP_COPY(x
)));
2375 #define XFORMOP(name, NAME) \
2376 static PyObject *gfnmeth_##name(PyObject *me, PyObject *arg) \
2381 if (!PyArg_ParseTuple(arg, "O&:" #name, convgf, &xx)) goto end; \
2382 z = gfn_transform(GFN_##NAME(me), MP_NEW, xx); \
2385 if (!z) return (0); \
2386 return (mp_pywrap(z)); \
2392 static void gfn_pydealloc(PyObject
*me
)
2394 gfn_destroy(GFN_PTON(me
));
2395 gfn_destroy(GFN_NTOP(me
));
2399 static PyGetSetDef gfn_pygetset
[] = {
2400 #define GETSETNAME(op, name) gfn##op##_##name
2401 GET (p
, "X.p -> polynomial basis, as polynomial")
2402 GET (beta
, "X.beta -> normal basis element, in poly form")
2407 static PyMethodDef gfn_pymethods
[] = {
2408 #define METHNAME(name) gfnmeth_##name
2409 METH (pton
, "X.pton(A) -> normal-basis representation of A")
2410 METH (ntop
, "X.ntop(A) -> polynomial-basis representation of A")
2415 static PyTypeObject gfn_pytype_skel
= {
2416 PyObject_HEAD_INIT(0) 0, /* Header */
2417 "GFN", /* @tp_name@ */
2418 sizeof(gfn_pyobj
), /* @tp_basicsize@ */
2419 0, /* @tp_itemsize@ */
2421 gfn_pydealloc
, /* @tp_dealloc@ */
2423 0, /* @tp_getattr@ */
2424 0, /* @tp_setattr@ */
2425 0, /* @tp_compare@ */
2427 0, /* @tp_as_number@ */
2428 0, /* @tp_as_sequence@ */
2429 0, /* @tp_as_mapping@ */
2433 0, /* @tp_getattro@ */
2434 0, /* @tp_setattro@ */
2435 0, /* @tp_as_buffer@ */
2436 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2437 Py_TPFLAGS_BASETYPE
,
2440 "An object for transforming elements of binary fields between polynomial\n\
2441 and normal basis representations.",
2443 0, /* @tp_traverse@ */
2445 0, /* @tp_richcompare@ */
2446 0, /* @tp_weaklistoffset@ */
2448 0, /* @tp_iternext@ */
2449 gfn_pymethods
, /* @tp_methods@ */
2450 0, /* @tp_members@ */
2451 gfn_pygetset
, /* @tp_getset@ */
2454 0, /* @tp_descr_get@ */
2455 0, /* @tp_descr_set@ */
2456 0, /* @tp_dictoffset@ */
2458 PyType_GenericAlloc
, /* @tp_alloc@ */
2459 gfn_pynew
, /* @tp_new@ */
2464 /*----- Glue --------------------------------------------------------------*/
2466 static PyMethodDef methods
[] = {
2467 #define METHNAME(func) meth_##func
2468 KWMETH(_MP_fromstring
, "\
2469 fromstring(STR, radix = 0) -> (X, REST)\n\
2471 Parse STR as a large integer, according to radix. If radix is zero,\n\
2472 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2473 or `R_' for other radix R.")
2474 KWMETH(_GF_fromstring
, "\
2475 fromstring(STR, radix = 0) -> (X, REST)\n\
2477 Parse STR as a binary polynomial, according to radix. If radix is zero,\n\
2478 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2479 or `R_' for other radix R.")
2480 METH (_MP_factorial
, "\
2481 factorial(I) -> I!: compute factorial")
2482 METH (_MP_fibonacci
, "\
2483 fibonacci(I) -> F(I): compute Fibonacci number")
2485 loadl(STR) -> X: read little-endian bytes")
2487 loadb(STR) -> X: read big-endian bytes")
2488 METH (_MP_loadl2c
, "\
2489 loadl2c(STR) -> X: read little-endian bytes, two's complement")
2490 METH (_MP_loadb2c
, "\
2491 loadb2c(STR) -> X: read big-endian bytes, two's complement")
2492 METH (_MP_frombuf
, "\
2493 frombuf(STR) -> (X, REST): read buffer format")
2495 loadl(STR) -> X: read little-endian bytes")
2497 loadb(STR) -> X: read big-endian bytes")
2498 METH (_GF_frombuf
, "\
2499 frombuf(STR) -> (X, REST): read buffer format")
2504 void mp_pyinit(void)
2508 INITTYPE(mpmul
, root
);
2509 INITTYPE(mpmont
, root
);
2510 INITTYPE(mpbarrett
, root
);
2511 INITTYPE(mpreduce
, root
);
2512 INITTYPE(mpcrt
, root
);
2513 INITTYPE(gfreduce
, root
);
2514 INITTYPE(gfn
, root
);
2515 addmethods(methods
);
2518 void mp_pyinsert(PyObject
*mod
)
2520 INSERT("MP", mp_pytype
);
2521 INSERT("MPMul", mpmul_pytype
);
2522 INSERT("MPMont", mpmont_pytype
);
2523 INSERT("MPBarrett", mpbarrett_pytype
);
2524 INSERT("MPReduce", mpreduce_pytype
);
2525 INSERT("MPCRT", mpcrt_pytype
);
2526 INSERT("GF", gf_pytype
);
2527 INSERT("GFReduce", gfreduce_pytype
);
2528 INSERT("GFN", gfn_pytype
);
2531 /*----- That's all, folks -------------------------------------------------*/