5 * Multiprecision arithmetic
7 * (c) 2004 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of the Python interface to Catacomb.
14 * Catacomb/Python is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU General Public License as published by
16 * the Free Software Foundation; either version 2 of the License, or
17 * (at your option) any later version.
19 * Catacomb/Python is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU General Public License for more details.
24 * You should have received a copy of the GNU General Public License
25 * along with Catacomb/Python; if not, write to the Free Software Foundation,
26 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 /*----- Header files ------------------------------------------------------*/
31 #include "catacomb-python.h"
33 /*----- General utilities -------------------------------------------------*/
35 PyTypeObject
*mp_pytype
= 0;
36 PyTypeObject
*gf_pytype
= 0;
38 mp
*mp_frompylong(PyObject
*obj
)
41 PyLongObject
*l
= (PyLongObject
*)obj
;
52 assert(MPW_BITS
>= SHIFT
);
53 bits
= (unsigned long)sz
* SHIFT
;
54 w
= (bits
+ MPW_BITS
- 1)/MPW_BITS
;
55 x
= mp_new(w
, l
->ob_size
< 0 ? MP_NEG
: 0);
57 for (i
= 0; i
< sz
; i
++) {
58 r
|= (mpd
)l
->ob_digit
[i
] << b
;
60 while (b
>= MPW_BITS
) {
75 PyObject
*mp_topylong(mp
*x
)
77 unsigned long bits
= mp_bits(x
);
78 int sz
= (bits
+ SHIFT
- 1)/SHIFT
;
79 PyLongObject
*l
= _PyLong_New(sz
);
85 assert(MPW_BITS
>= SHIFT
);
86 while (i
< sz
&& p
< x
->vl
) {
89 while (i
< sz
&& b
>= SHIFT
) {
90 l
->ob_digit
[i
++] = r
& MASK
;
96 l
->ob_digit
[i
++] = r
& MASK
;
99 l
->ob_size
= (x
->f
& MP_NEG
) ?
-sz
: sz
;
100 return ((PyObject
*)l
);
103 mp
*mp_frompyobject(PyObject
*o
, int radix
)
107 if (PyString_Check(o
)) {
110 sc
.buf
= PyString_AS_STRING(o
);
111 sc
.lim
= sc
.buf
+ PyString_GET_SIZE(o
);
112 x
= mp_read(MP_NEW
, radix
, &mptext_stringops
, &sc
);
114 if (sc
.buf
< sc
.lim
) { MP_DROP(x
); return (0); }
117 if ((x
= tomp(o
)) != 0)
122 PyObject
*mp_topystring(mp
*x
, int radix
, const char *xpre
,
123 const char *pre
, const char *post
)
125 int len
= mptext_len(x
, radix
) + 1;
128 size_t xprelen
= xpre ?
strlen(xpre
) : 0;
129 size_t prelen
= pre ?
strlen(pre
) : 0;
130 size_t postlen
= post ?
strlen(post
) : 0;
133 o
= PyString_FromStringAndSize(0, len
+ 1 + xprelen
+ prelen
+ postlen
);
134 p
= PyString_AS_STRING(o
);
136 if (xpre
) { memcpy(sc
.buf
, xpre
, xprelen
); sc
.buf
+= xprelen
; }
137 if (MP_NEGP(x
)) { *sc
.buf
++ = '-'; x
= mp_neg(x
, x
); }
138 if (pre
) { memcpy(sc
.buf
, pre
, prelen
); sc
.buf
+= prelen
; }
139 sc
.lim
= sc
.buf
+ len
;
140 mp_write(x
, radix
, &mptext_stringops
, &sc
);
141 if (post
) { memcpy(sc
.buf
, post
, postlen
); sc
.buf
+= postlen
; }
143 _PyString_Resize(&o
, sc
.buf
- p
);
147 static int good_radix_p(int r
, int readp
)
149 return ((r
>= -255 && r
<= -2) ||
151 (r
>= 2 && r
<= 62));
154 PyObject
*mp_pywrap(mp
*x
)
156 mp_pyobj
*z
= PyObject_New(mp_pyobj
, mp_pytype
);
158 return ((PyObject
*)z
);
161 PyObject
*gf_pywrap(mp
*x
)
163 mp_pyobj
*z
= PyObject_New(mp_pyobj
, gf_pytype
);
165 return ((PyObject
*)z
);
168 int mp_tolong_checked(mp
*x
, long *l
)
170 static mp
*longmin
= 0, *longmax
= 0;
174 longmin
= mp_fromlong(MP_NEW
, LONG_MIN
);
175 longmax
= mp_fromlong(MP_NEW
, LONG_MAX
);
177 if (MP_CMP(x
, <, longmin
) || MP_CMP(x
, >, longmax
))
178 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)) 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
)) return (0);
489 return (PyInt_FromLong(l
));
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
);
547 static long mp_pyhash(PyObject
*me
)
550 PyObject
*l
= mp_topylong(MP_X(me
)); h
= PyObject_Hash(l
);
551 Py_DECREF(l
); return (h
);
554 static PyObject
*mpmeth_jacobi(PyObject
*me
, PyObject
*arg
)
559 if (!PyArg_ParseTuple(arg
, "O&:jacobi", convmp
, &y
)) goto end
;
560 if (MP_NEGP(MP_X(me
)) || MP_EVENP(MP_X(me
)))
561 VALERR("must be positive and odd");
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 #define STOREOP(name, c) \
688 static PyObject *mpmeth_##name(PyObject *me, \
689 PyObject *arg, PyObject *kw) \
692 char *kwlist[] = { "len", 0 }; \
695 if (!PyArg_ParseTupleAndKeywords(arg, kw, "|l:" #name, \
699 len = mp_octets##c(MP_X(me)); \
702 rc = bytestring_pywrap(0, len); \
703 mp_##name(MP_X(me), PyString_AS_STRING(rc), len); \
709 STOREOP(storel2c
, 2c
)
710 STOREOP(storeb2c
, 2c
)
713 #define BUFOP(ty, pyty) \
714 static PyObject *meth__##pyty##_frombuf(PyObject *me, PyObject *arg) \
722 if (!PyArg_ParseTuple(arg, "Os#:frombuf", &me, &p, &sz)) goto end; \
723 buf_init(&b, p, sz); \
724 if ((x = buf_getmp(&b)) == 0) VALERR("malformed data"); \
725 rc = Py_BuildValue("(NN)", ty##_pywrap(x), \
726 bytestring_pywrapbuf(&b)); \
734 static PyObject
*mpmeth_tobuf(PyObject
*me
, PyObject
*arg
)
741 if (!PyArg_ParseTuple(arg
, ":tobuf")) return (0);
743 n
= mp_octets(x
) + 3;
744 rc
= bytestring_pywrap(0, n
);
745 buf_init(&b
, PyString_AS_STRING(rc
), n
);
748 _PyString_Resize(&rc
, BLEN(&b
));
752 static PyObject
*mpmeth_primep(PyObject
*me
, PyObject
*arg
, PyObject
*kw
)
754 grand
*r
= &rand_global
;
755 char *kwlist
[] = { "rng", 0 };
758 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "|O&", kwlist
, convgrand
, &r
))
760 rc
= getbool(pgen_primep(MP_X(me
), r
));
765 static PyObject
*mpget_nbits(PyObject
*me
, void *hunoz
)
766 { return (PyInt_FromLong(mp_bits(MP_X(me
)))); }
768 static PyObject
*mpget_noctets(PyObject
*me
, void *hunoz
)
769 { return (PyInt_FromLong(mp_octets(MP_X(me
)))); }
771 static PyObject
*mpget_noctets2c(PyObject
*me
, void *hunoz
)
772 { return (PyInt_FromLong(mp_octets2c(MP_X(me
)))); }
774 static PyGetSetDef mp_pygetset
[] = {
775 #define GETSETNAME(op, func) mp##op##_##func
776 GET (nbits
, "X.nbits -> bit length of X")
777 GET (noctets
, "X.noctets -> octet length of X")
778 GET (noctets2c
, "X.noctets2c -> two's complement octet length of X")
783 static PyMethodDef mp_pymethods
[] = {
784 #define METHNAME(func) mpmeth_##func
785 METH (jacobi
, "X.jacobi(Y) -> Jacobi symbol (Y/X) (NB inversion!)")
786 METH (setbit
, "X.setbit(N) -> X with bit N set")
787 METH (clearbit
, "X.clearbit(N) -> X with bit N clear")
788 METH (testbit
, "X.testbit(N) -> true/false if bit N set/clear in X")
789 METH (odd
, "X.odd() -> S, T where X = 2^S T with T odd")
790 METH (sqr
, "X.sqr() -> X^2")
791 METH (sqrt
, "X.sqrt() -> largest integer <= sqrt(X)")
792 METH (gcd
, "X.gcd(Y) -> gcd(X, Y)")
794 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
795 METH (modinv
, "X.modinv(Y) -> multiplicative inverse of Y mod X")
796 METH (modsqrt
, "X.modsqrt(Y) -> square root of Y mod X, if X prime")
797 KWMETH(primep
, "X.primep(rng = rand) -> true/false if X is prime")
798 KWMETH(tostring
, "X.tostring(radix = 10) -> STR")
799 KWMETH(storel
, "X.storel(len = -1) -> little-endian bytes")
800 KWMETH(storeb
, "X.storeb(len = -1) -> big-endian bytes")
802 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
804 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
805 METH (tobuf
, "X.tobuf() -> buffer format")
810 static PyNumberMethods mp_pynumber
= {
811 mp_pyadd
, /* @nb_add@ */
812 mp_pysub
, /* @nb_subtract@ */
813 mp_pymul
, /* @nb_multiply@ */
815 mp_pymod
, /* @nb_remainder@ */
816 mp_pydivmod
, /* @nb_divmod@ */
817 mp_pyexp
, /* @nb_power@ */
818 mp_pyneg
, /* @nb_negative@ */
819 mp_pyid
, /* @nb_positive@ */
820 mp_pyabs
, /* @nb_absolute@ */
821 mp_pynonzerop
, /* @nb_nonzero@ */
822 mp_pynot2c
, /* @nb_invert@ */
823 mp_pylsl2c
, /* @nb_lshift@ */
824 mp_pylsr2c
, /* @nb_rshift@ */
825 mp_pyand2c
, /* @nb_and@ */
826 mp_pyxor2c
, /* @nb_xor@ */
827 mp_pyor2c
, /* @nb_or@ */
828 mp_pycoerce
, /* @nb_coerce@ */
829 mp_pyint
, /* @nb_int@ */
830 mp_pylong
, /* @nb_long@ */
831 mp_pyfloat
, /* @nb_float@ */
832 mp_pyoct
, /* @nb_oct@ */
833 mp_pyhex
, /* @nb_hex@ */
835 0, /* @nb_inplace_add@ */
836 0, /* @nb_inplace_subtract@ */
837 0, /* @nb_inplace_multiply@ */
838 0, /* @nb_inplace_divide@ */
839 0, /* @nb_inplace_remainder@ */
840 0, /* @nb_inplace_power@ */
841 0, /* @nb_inplace_lshift@ */
842 0, /* @nb_inplace_rshift@ */
843 0, /* @nb_inplace_and@ */
844 0, /* @nb_inplace_xor@ */
845 0, /* @nb_inplace_or@ */
847 mp_pydiv
, /* @nb_floor_divide@ */
848 0, /* @nb_true_divide@ */
849 0, /* @nb_inplace_floor_divide@ */
850 0, /* @nb_inplace_true_divide@ */
853 static PyTypeObject mp_pytype_skel
= {
854 PyObject_HEAD_INIT(0) 0, /* Header */
855 "catacomb.MP", /* @tp_name@ */
856 sizeof(mp_pyobj
), /* @tp_basicsize@ */
857 0, /* @tp_itemsize@ */
859 mp_pydealloc
, /* @tp_dealloc@ */
861 0, /* @tp_getattr@ */
862 0, /* @tp_setattr@ */
863 mp_pycompare
, /* @tp_compare@ */
864 mp_pyrepr
, /* @tp_repr@ */
865 &mp_pynumber
, /* @tp_as_number@ */
866 0, /* @tp_as_sequence@ */
867 0, /* @tp_as_mapping@ */
868 mp_pyhash
, /* @tp_hash@ */
870 mp_pystr
, /* @tp_str@ */
871 0, /* @tp_getattro@ */
872 0, /* @tp_setattro@ */
873 0, /* @tp_as_buffer@ */
874 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
875 Py_TPFLAGS_CHECKTYPES
|
879 "Multiprecision integers, similar to `long' but more efficient and\n\
880 versatile. Support all the standard arithmetic operations.\n\
882 Constructor mp(X, radix = R) attempts to convert X to an `mp'. If\n\
883 X is a string, it's read in radix-R form, or we look for a prefix\n\
884 if R = 0. Other acceptable things are ints and longs.\n\
888 * Use `//' for division. MPs don't have `/' division.",
890 0, /* @tp_traverse@ */
892 0, /* @tp_richcompare@ */
893 0, /* @tp_weaklistoffset@ */
895 0, /* @tp_iternext@ */
896 mp_pymethods
, /* @tp_methods@ */
897 0, /* @tp_members@ */
898 mp_pygetset
, /* @tp_getset@ */
901 0, /* @tp_descr_get@ */
902 0, /* @tp_descr_set@ */
903 0, /* @tp_dictoffset@ */
905 PyType_GenericAlloc
, /* @tp_alloc@ */
906 mp_pynew
, /* @tp_new@ */
911 static PyObject
*meth__MP_fromstring(PyObject
*me
,
912 PyObject
*arg
, PyObject
*kw
)
920 char *kwlist
[] = { "class", "x", "radix", 0 };
922 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "Os#|i:fromstring",
923 kwlist
, &me
, &p
, &len
, &r
))
925 if (!good_radix_p(r
, 1)) VALERR("bad radix");
926 sc
.buf
= p
; sc
.lim
= p
+ len
;
927 if ((zz
= mp_read(MP_NEW
, r
, &mptext_stringops
, &sc
)) == 0)
928 SYNERR("bad integer");
929 z
= Py_BuildValue("(Ns#)", mp_pywrap(zz
), sc
.buf
, (int)(sc
.lim
- sc
.buf
));
934 #define LOADOP(pre, py, name) \
935 static PyObject *meth__##py##_##name(PyObject *me, PyObject *arg) \
939 if (!PyArg_ParseTuple(arg, "Os#:" #name, &me, &p, &len)) return (0); \
940 return (pre##_pywrap(mp_##name(MP_NEW, p, len))); \
942 LOADOP(mp
, MP
, loadl
)
943 LOADOP(mp
, MP
, loadb
)
944 LOADOP(mp
, MP
, loadl2c
)
945 LOADOP(mp
, MP
, loadb2c
)
946 LOADOP(gf
, GF
, loadl
)
947 LOADOP(gf
, GF
, loadb
)
950 /*----- Products of small integers ----------------------------------------*/
952 typedef struct mpmul_pyobj
{
958 #define MPMUL_LIVEP(o) (((mpmul_pyobj *)(o))->livep)
959 #define MPMUL_PY(o) (&((mpmul_pyobj *)(o))->mm)
961 static void mpmul_pydealloc(PyObject
*me
)
964 mp_drop(mpmul_done(MPMUL_PY(me
)));
968 static PyObject
*mmmeth_factor(PyObject
*me
, PyObject
*arg
)
973 if (!MPMUL_LIVEP(me
)) VALERR("MPMul object invalid");
974 if (PyTuple_Size(arg
) != 1)
975 i
= PyObject_GetIter(arg
);
977 if ((q
= PyTuple_GetItem(arg
, 0)) == 0) goto end
;
978 if ((i
= PyObject_GetIter(q
)) == 0) {
979 PyErr_Clear(); /* that's ok */
980 i
= PyObject_GetIter(arg
);
984 while ((q
= PyIter_Next(i
)) != 0) {
985 x
= getmp(q
); Py_DECREF(q
); if (!x
) {
989 mpmul_add(MPMUL_PY(me
), x
);
998 static PyObject
*mmmeth_done(PyObject
*me
, PyObject
*arg
)
1002 if (!PyArg_ParseTuple(arg
, ":done")) goto end
;
1003 if (!MPMUL_LIVEP(me
)) VALERR("MPMul object invalid");
1004 x
= mpmul_done(MPMUL_PY(me
));
1005 MPMUL_LIVEP(me
) = 0;
1006 return (mp_pywrap(x
));
1011 static PyObject
*mpmul_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1015 if (kw
) TYERR("keyword arguments not allowed here");
1016 mm
= (mpmul_pyobj
*)ty
->tp_alloc(ty
, 0);
1017 mpmul_init(&mm
->mm
);
1019 if (mmmeth_factor((PyObject
*)mm
, arg
) == 0) {
1023 return ((PyObject
*)mm
);
1028 static PyObject
*mmget_livep(PyObject
*me
, void *hunoz
)
1029 { return (getbool(MPMUL_LIVEP(me
))); }
1031 static PyGetSetDef mpmul_pygetset
[] = {
1032 #define GETSETNAME(op, name) mm##op##_##name
1033 GET (livep
, "MM.livep -> flag: object still valid?")
1038 static PyMethodDef mpmul_pymethods
[] = {
1039 #define METHNAME(name) mmmeth_##name
1040 METH (factor
, "MM.factor(ITERABLE) or MM.factor(I, ...)")
1041 METH (done
, "MM.done() -> PRODUCT")
1046 static PyTypeObject
*mpmul_pytype
, mpmul_pytype_skel
= {
1047 PyObject_HEAD_INIT(0) 0, /* Header */
1048 "catacomb.MPMul", /* @tp_name@ */
1049 sizeof(mpmul_pyobj
), /* @tp_basicsize@ */
1050 0, /* @tp_itemsize@ */
1052 mpmul_pydealloc
, /* @tp_dealloc@ */
1054 0, /* @tp_getattr@ */
1055 0, /* @tp_setattr@ */
1056 0, /* @tp_compare@ */
1058 0, /* @tp_as_number@ */
1059 0, /* @tp_as_sequence@ */
1060 0, /* @tp_as_mapping@ */
1064 0, /* @tp_getattro@ */
1065 0, /* @tp_setattro@ */
1066 0, /* @tp_as_buffer@ */
1067 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1068 Py_TPFLAGS_BASETYPE
,
1071 "An object for multiplying many small integers.",
1073 0, /* @tp_traverse@ */
1075 0, /* @tp_richcompare@ */
1076 0, /* @tp_weaklistoffset@ */
1078 0, /* @tp_iternext@ */
1079 mpmul_pymethods
, /* @tp_methods@ */
1080 0, /* @tp_members@ */
1081 mpmul_pygetset
, /* @tp_getset@ */
1084 0, /* @tp_descr_get@ */
1085 0, /* @tp_descr_set@ */
1086 0, /* @tp_dictoffset@ */
1088 PyType_GenericAlloc
, /* @tp_alloc@ */
1089 mpmul_pynew
, /* @tp_new@ */
1094 /*----- Montgomery reduction ----------------------------------------------*/
1096 typedef struct mpmont_pyobj
{
1101 #define MPMONT_PY(o) (&((mpmont_pyobj *)(o))->mm)
1103 static PyObject
*mmmeth_int(PyObject
*me
, PyObject
*arg
)
1107 mpmont
*mm
= MPMONT_PY(me
);
1109 if (!PyArg_ParseTuple(arg
, "O&:in", convmp
, &yy
))
1111 mp_div(0, &yy
, yy
, mm
->m
);
1112 z
= mp_pywrap(mpmont_mul(mm
, MP_NEW
, yy
, mm
->r2
));
1114 if (yy
) MP_DROP(yy
);
1118 static PyObject
*mmmeth_mul(PyObject
*me
, PyObject
*arg
)
1121 mp
*yy
= 0, *zz
= 0;
1123 if (!PyArg_ParseTuple(arg
, "O&O&:mul", convmp
, &yy
, convmp
, &zz
))
1125 rc
= mp_pywrap(mpmont_mul(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1127 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1131 static PyObject
*mmmeth_exp(PyObject
*me
, PyObject
*arg
)
1134 mp
*yy
= 0, *zz
= 0;
1136 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1139 if ((yy
= mp_modinv_checked(yy
, yy
, MPMONT_PY(me
)->m
)) == 0) goto end
;
1140 zz
= mp_neg(zz
, zz
);
1142 rc
= mp_pywrap(mpmont_exp(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1144 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1148 static PyObject
*mmmeth_expr(PyObject
*me
, PyObject
*arg
)
1151 mp
*yy
= 0, *zz
= 0;
1153 if (!PyArg_ParseTuple(arg
, "O&O&:expr", convmp
, &yy
, convmp
, &zz
))
1156 yy
= mpmont_reduce(MPMONT_PY(me
), yy
, yy
);
1157 if ((yy
= mp_modinv_checked(yy
, yy
, MPMONT_PY(me
)->m
)) == 0) goto end
;
1158 yy
= mpmont_mul(MPMONT_PY(me
), yy
, yy
, MPMONT_PY(me
)->r2
);
1159 zz
= mp_neg(zz
, zz
);
1161 rc
= mp_pywrap(mpmont_expr(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1163 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1167 static PyObject
*mm_mexpr_id(PyObject
*me
)
1168 { return mp_pywrap(MP_COPY(MPMONT_PY(me
)->r
)); }
1170 static int mm_mexpr_fill(void *p
, PyObject
*me
, PyObject
*x
, PyObject
*y
)
1172 mp
*xx
= 0, *yy
= 0;
1173 mp_expfactor
*f
= p
;
1174 mpmont
*mm
= MPMONT_PY(me
);
1176 if ((xx
= getmp(x
)) == 0 || (yy
= getmp(y
)) == 0)
1179 xx
= mpmont_reduce(mm
, xx
, xx
);
1180 if ((xx
= mp_modinv_checked(xx
, xx
, yy
)) == 0)
1182 xx
= mpmont_mul(mm
, xx
, xx
, mm
->r2
);
1183 yy
= mp_neg(yy
, yy
);
1190 mp_drop(xx
); mp_drop(yy
);
1194 static PyObject
*mm_mexpr(PyObject
*me
, void *v
, int n
)
1195 { return mp_pywrap(mpmont_mexpr(MPMONT_PY(me
), MP_NEW
, v
, n
)); }
1197 static void mp_mexp_drop(void *p
)
1199 mp_expfactor
*f
= p
;
1204 static PyObject
*mmmeth_mexpr(PyObject
*me
, PyObject
*arg
)
1206 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1207 mm_mexpr_id
, mm_mexpr_fill
, mm_mexpr
, mp_mexp_drop
);
1210 static PyObject
*mp_mexp_id(PyObject
*me
)
1211 { return mp_pywrap(MP_ONE
); }
1213 static int mp_mexp_fill(void *p
, PyObject
*me
, PyObject
*x
, PyObject
*y
)
1215 mp
*xx
= 0, *yy
= 0;
1216 mp_expfactor
*f
= p
;
1218 if ((xx
= getmp(x
)) == 0 || (yy
= getmp(y
)) == 0)
1221 if ((xx
= mp_modinv_checked(xx
, xx
, yy
)) == 0)
1223 yy
= mp_neg(yy
, yy
);
1230 mp_drop(xx
); mp_drop(yy
);
1234 static PyObject
*mm_mexp(PyObject
*me
, void *v
, int n
)
1235 { return mp_pywrap(mpmont_mexp(MPMONT_PY(me
), MP_NEW
, v
, n
)); }
1237 static PyObject
*mmmeth_mexp(PyObject
*me
, PyObject
*arg
)
1239 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1240 mp_mexp_id
, mp_mexp_fill
, mm_mexp
, mp_mexp_drop
);
1243 #define mmmeth_ext mmmeth_reduce
1244 static PyObject
*mmmeth_reduce(PyObject
*me
, PyObject
*arg
)
1249 if (!PyArg_ParseTuple(arg
, "O&", convmp
, &yy
)) goto end
;
1250 z
= mp_pywrap(mpmont_reduce(MPMONT_PY(me
), MP_NEW
, yy
));
1255 static void mpmont_pydealloc(PyObject
*me
)
1257 mpmont_destroy(MPMONT_PY(me
));
1261 static PyObject
*mpmont_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1263 mpmont_pyobj
*mm
= 0;
1264 char *kwlist
[] = { "m", 0 };
1267 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1269 if (!MP_POSP(xx
) || !MP_ODDP(xx
)) VALERR("m must be positive and odd");
1270 mm
= (mpmont_pyobj
*)ty
->tp_alloc(ty
, 0);
1271 mpmont_create(&mm
->mm
, xx
);
1273 if (xx
) MP_DROP(xx
);
1274 return ((PyObject
*)mm
);
1277 static PyObject
*mmget_m(PyObject
*me
, void *hunoz
)
1278 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->m
))); }
1280 static PyObject
*mmget_r(PyObject
*me
, void *hunoz
)
1281 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->r
))); }
1283 static PyObject
*mmget_r2(PyObject
*me
, void *hunoz
)
1284 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->r2
))); }
1286 static PyGetSetDef mpmont_pygetset
[] = {
1287 #define GETSETNAME(op, name) mm##op##_##name
1288 GET (m
, "M.m -> modulus for reduction")
1289 GET (r
, "M.r -> multiplicative identity")
1290 GET (r2
, "M.r2 -> M.r^2, Montgomerization factor")
1295 static PyMethodDef mpmont_pymethods
[] = {
1296 #define METHNAME(name) mmmeth_##name
1297 METH (int, "M.out(X) -> XR")
1298 METH (mul
, "M.mul(XR, YR) -> ZR where Z = X Y")
1299 METH (expr
, "M.expr(XR, N) -> ZR where Z = X^N mod M.m")
1301 B.mexp([(XR0, N0), (XR1, N1), ...]) = ZR where Z = X0^N0 X1^N1 mod B.m\n\
1302 \t(the list may be flattened if this more convenient.)")
1303 METH (reduce
, "M.reduce(XR) -> X")
1304 METH (ext
, "M.ext(XR) -> X")
1305 METH (exp
, "M.exp(X, N) -> X^N mod M.m")
1307 B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 mod B.m\n\
1308 \t(the list may be flattened if this more convenient.)")
1313 static PyTypeObject
*mpmont_pytype
, mpmont_pytype_skel
= {
1314 PyObject_HEAD_INIT(0) 0, /* Header */
1315 "catacomb.MPMont", /* @tp_name@ */
1316 sizeof(mpmont_pyobj
), /* @tp_basicsize@ */
1317 0, /* @tp_itemsize@ */
1319 mpmont_pydealloc
, /* @tp_dealloc@ */
1321 0, /* @tp_getattr@ */
1322 0, /* @tp_setattr@ */
1323 0, /* @tp_compare@ */
1325 0, /* @tp_as_number@ */
1326 0, /* @tp_as_sequence@ */
1327 0, /* @tp_as_mapping@ */
1331 0, /* @tp_getattro@ */
1332 0, /* @tp_setattro@ */
1333 0, /* @tp_as_buffer@ */
1334 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1335 Py_TPFLAGS_BASETYPE
,
1338 "A Montgomery reduction context.",
1340 0, /* @tp_traverse@ */
1342 0, /* @tp_richcompare@ */
1343 0, /* @tp_weaklistoffset@ */
1345 0, /* @tp_iternext@ */
1346 mpmont_pymethods
, /* @tp_methods@ */
1347 0, /* @tp_members@ */
1348 mpmont_pygetset
, /* @tp_getset@ */
1351 0, /* @tp_descr_get@ */
1352 0, /* @tp_descr_set@ */
1353 0, /* @tp_dictoffset@ */
1355 PyType_GenericAlloc
, /* @tp_alloc@ */
1356 mpmont_pynew
, /* @tp_new@ */
1361 /*----- Barrett reduction -------------------------------------------------*/
1363 typedef struct mpbarrett_pyobj
{
1368 #define MPBARRETT_PY(o) (&((mpbarrett_pyobj *)(o))->mb)
1370 static PyObject
*mbmeth_exp(PyObject
*me
, PyObject
*arg
)
1373 mp
*yy
= 0, *zz
= 0;
1375 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1378 if ((yy
= mp_modinv_checked(yy
, yy
, MPBARRETT_PY(me
)->m
)) == 0) goto end
;
1379 zz
= mp_neg(zz
, zz
);
1381 rc
= mp_pywrap(mpbarrett_exp(MPBARRETT_PY(me
), MP_NEW
, yy
, zz
));
1383 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1387 static PyObject
*mb_mexp(PyObject
*me
, void *v
, int n
)
1388 { return mp_pywrap(mpbarrett_mexp(MPBARRETT_PY(me
), MP_NEW
, v
, n
)); }
1390 static PyObject
*mbmeth_mexp(PyObject
*me
, PyObject
*arg
)
1392 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1393 mp_mexp_id
, mp_mexp_fill
, mb_mexp
, mp_mexp_drop
);
1396 static PyObject
*mbmeth_reduce(PyObject
*me
, PyObject
*arg
)
1401 if (!PyArg_ParseTuple(arg
, "O&:reduce", convmp
, &yy
))
1403 z
= mp_pywrap(mpbarrett_reduce(MPBARRETT_PY(me
), MP_NEW
, yy
));
1408 static void mpbarrett_pydealloc(PyObject
*me
)
1410 mpbarrett_destroy(MPBARRETT_PY(me
));
1414 static PyObject
*mpbarrett_pynew(PyTypeObject
*ty
,
1415 PyObject
*arg
, PyObject
*kw
)
1417 mpbarrett_pyobj
*mb
= 0;
1418 char *kwlist
[] = { "m", 0 };
1421 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1423 if (!MP_POSP(xx
)) VALERR("m must be positive");
1424 mb
= (mpbarrett_pyobj
*)ty
->tp_alloc(ty
, 0);
1425 mpbarrett_create(&mb
->mb
, xx
);
1427 if (xx
) MP_DROP(xx
);
1428 return ((PyObject
*)mb
);
1431 static PyObject
*mbget_m(PyObject
*me
, void *hunoz
)
1432 { return (mp_pywrap(MP_COPY(MPBARRETT_PY(me
)->m
))); }
1434 static PyGetSetDef mpbarrett_pygetset
[] = {
1435 #define GETSETNAME(op, name) mb##op##_##name
1436 GET (m
, "B.m -> modulus for reduction")
1441 static PyMethodDef mpbarrett_pymethods
[] = {
1442 #define METHNAME(name) mbmeth_##name
1443 METH (reduce
, "B.reduce(X) -> X mod B.m")
1444 METH (exp
, "B.exp(X, N) -> X^N mod B.m")
1446 B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 mod B.m\n\
1447 \t(the list may be flattened if this more convenient.)")
1452 static PyTypeObject
*mpbarrett_pytype
, mpbarrett_pytype_skel
= {
1453 PyObject_HEAD_INIT(0) 0, /* Header */
1454 "catacomb.MPBarrett", /* @tp_name@ */
1455 sizeof(mpbarrett_pyobj
), /* @tp_basicsize@ */
1456 0, /* @tp_itemsize@ */
1458 mpbarrett_pydealloc
, /* @tp_dealloc@ */
1460 0, /* @tp_getattr@ */
1461 0, /* @tp_setattr@ */
1462 0, /* @tp_compare@ */
1464 0, /* @tp_as_number@ */
1465 0, /* @tp_as_sequence@ */
1466 0, /* @tp_as_mapping@ */
1470 0, /* @tp_getattro@ */
1471 0, /* @tp_setattro@ */
1472 0, /* @tp_as_buffer@ */
1473 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1474 Py_TPFLAGS_BASETYPE
,
1477 "A Barrett reduction context.",
1479 0, /* @tp_traverse@ */
1481 0, /* @tp_richcompare@ */
1482 0, /* @tp_weaklistoffset@ */
1484 0, /* @tp_iternext@ */
1485 mpbarrett_pymethods
, /* @tp_methods@ */
1486 0, /* @tp_members@ */
1487 mpbarrett_pygetset
, /* @tp_getset@ */
1490 0, /* @tp_descr_get@ */
1491 0, /* @tp_descr_set@ */
1492 0, /* @tp_dictoffset@ */
1494 PyType_GenericAlloc
, /* @tp_alloc@ */
1495 mpbarrett_pynew
, /* @tp_new@ */
1500 /*----- Nice prime reduction ----------------------------------------------*/
1502 typedef struct mpreduce_pyobj
{
1507 #define MPREDUCE_PY(o) (&((mpreduce_pyobj *)(o))->mr)
1509 static PyObject
*mrmeth_exp(PyObject
*me
, PyObject
*arg
)
1512 mp
*yy
= 0, *zz
= 0;
1514 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1517 if ((yy
= mp_modinv_checked(yy
, yy
, MPREDUCE_PY(me
)->p
)) == 0) goto end
;
1518 zz
= mp_neg(zz
, zz
);
1520 rc
= mp_pywrap(mpreduce_exp(MPREDUCE_PY(me
), MP_NEW
, yy
, zz
));
1522 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1526 static PyObject
*mrmeth_reduce(PyObject
*me
, PyObject
*arg
)
1531 if (!PyArg_ParseTuple(arg
, "O&:reduce", convmp
, &yy
)) goto end
;
1532 z
= mp_pywrap(mpreduce_do(MPREDUCE_PY(me
), MP_NEW
, yy
));
1537 static void mpreduce_pydealloc(PyObject
*me
)
1539 mpreduce_destroy(MPREDUCE_PY(me
));
1543 static PyObject
*mpreduce_pynew(PyTypeObject
*ty
,
1544 PyObject
*arg
, PyObject
*kw
)
1546 mpreduce_pyobj
*mr
= 0;
1548 char *kwlist
[] = { "m", 0 };
1551 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1553 if (!MP_POSP(xx
)) VALERR("m must be positive");
1554 if (mpreduce_create(&r
, xx
)) VALERR("bad modulus (must be 2^k - ...)");
1555 mr
= (mpreduce_pyobj
*)ty
->tp_alloc(ty
, 0);
1558 if (xx
) MP_DROP(xx
);
1559 return ((PyObject
*)mr
);
1562 static PyObject
*mrget_m(PyObject
*me
, void *hunoz
)
1563 { return (mp_pywrap(MP_COPY(MPREDUCE_PY(me
)->p
))); }
1565 static PyGetSetDef mpreduce_pygetset
[] = {
1566 #define GETSETNAME(op, name) mr##op##_##name
1567 GET (m
, "R.m -> modulus for reduction")
1572 static PyMethodDef mpreduce_pymethods
[] = {
1573 #define METHNAME(name) mrmeth_##name
1574 METH (reduce
, "R.reduce(X) -> X mod B.m")
1575 METH (exp
, "R.exp(X, N) -> X^N mod B.m")
1580 static PyTypeObject
*mpreduce_pytype
, mpreduce_pytype_skel
= {
1581 PyObject_HEAD_INIT(0) 0, /* Header */
1582 "catacomb.MPReduce", /* @tp_name@ */
1583 sizeof(mpreduce_pyobj
), /* @tp_basicsize@ */
1584 0, /* @tp_itemsize@ */
1586 mpreduce_pydealloc
, /* @tp_dealloc@ */
1588 0, /* @tp_getattr@ */
1589 0, /* @tp_setattr@ */
1590 0, /* @tp_compare@ */
1592 0, /* @tp_as_number@ */
1593 0, /* @tp_as_sequence@ */
1594 0, /* @tp_as_mapping@ */
1598 0, /* @tp_getattro@ */
1599 0, /* @tp_setattro@ */
1600 0, /* @tp_as_buffer@ */
1601 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1602 Py_TPFLAGS_BASETYPE
,
1605 "A reduction context for reduction modulo primes of special form.",
1607 0, /* @tp_traverse@ */
1609 0, /* @tp_richcompare@ */
1610 0, /* @tp_weaklistoffset@ */
1612 0, /* @tp_iternext@ */
1613 mpreduce_pymethods
, /* @tp_methods@ */
1614 0, /* @tp_members@ */
1615 mpreduce_pygetset
, /* @tp_getset@ */
1618 0, /* @tp_descr_get@ */
1619 0, /* @tp_descr_set@ */
1620 0, /* @tp_dictoffset@ */
1622 PyType_GenericAlloc
, /* @tp_alloc@ */
1623 mpreduce_pynew
, /* @tp_new@ */
1628 /*----- Chinese Remainder Theorem solution --------------------------------*/
1630 typedef struct mpcrt_pyobj
{
1635 #define MPCRT_PY(o) (&((mpcrt_pyobj *)(o))->c)
1637 static PyObject
*mcmeth_solve(PyObject
*me
, PyObject
*arg
)
1639 mpcrt
*c
= MPCRT_PY(me
);
1640 PyObject
*q
= 0, *x
, *z
= 0;
1643 int i
= 0, n
= c
->k
;
1646 if (PyTuple_Size(arg
) == n
)
1648 else if (!PyArg_ParseTuple(arg
, "O:solve", &q
))
1651 if (!PySequence_Check(q
)) TYERR("want a sequence of residues");
1652 if (PySequence_Size(q
) != n
) VALERR("residue count mismatch");
1653 v
= xmalloc(n
* sizeof(*v
));
1654 for (i
= 0; i
< n
; i
++) {
1655 if ((x
= PySequence_GetItem(q
, i
)) == 0) goto end
;
1656 xx
= getmp(x
); Py_DECREF(x
); if (!xx
) goto end
;
1659 z
= mp_pywrap(mpcrt_solve(c
, MP_NEW
, v
));
1663 for (i
= 0; i
< n
; i
++)
1672 static void mpcrt_pydealloc(PyObject
*me
)
1674 mpcrt
*c
= MPCRT_PY(me
);
1679 static PyObject
*mpcrt_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1683 char *kwlist
[] = { "mv", 0 };
1684 PyObject
*q
= 0, *x
;
1688 if (PyTuple_Size(arg
) > 1)
1690 else if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O:new", kwlist
, &q
))
1693 if (!PySequence_Check(q
)) TYERR("want a sequence of moduli");
1694 n
= PySequence_Size(q
);
1695 if (PyErr_Occurred()) goto end
;
1696 if (!n
) VALERR("want at least one modulus");
1697 v
= xmalloc(n
* sizeof(*v
));
1698 for (i
= 0; i
< n
; i
++) {
1699 if ((x
= PySequence_GetItem(q
, i
)) == 0) goto end
;
1700 xx
= getmp(x
); Py_DECREF(x
); if (!xx
) goto end
;
1701 v
[i
].m
= xx
; v
[i
].n
= 0; v
[i
].ni
= 0; v
[i
].nni
= 0;
1703 c
= (mpcrt_pyobj
*)ty
->tp_alloc(ty
, 0);
1704 mpcrt_create(&c
->c
, v
, n
, 0);
1706 return ((PyObject
*)c
);
1711 for (i
= 0; i
< n
; i
++)
1719 static PyObject
*mcget_product(PyObject
*me
, void *hunoz
)
1720 { return (mp_pywrap(MP_COPY(MPCRT_PY(me
)->mb
.m
))); }
1722 static PyObject
*mcget_moduli(PyObject
*me
, void *hunoz
)
1726 mpcrt
*c
= MPCRT_PY(me
);
1728 if ((q
= PyList_New(c
->k
)) == 0) return (0);
1729 for (i
= 0; i
< c
->k
; i
++)
1730 PyList_SetItem(q
, i
, mp_pywrap(c
->v
[i
].m
));
1734 static PyGetSetDef mpcrt_pygetset
[] = {
1735 #define GETSETNAME(op, name) mc##op##_##name
1736 GET (product
, "C.product -> product of moduli")
1737 GET (moduli
, "C.moduli -> list of individual moduli")
1742 static PyMethodDef mpcrt_pymethods
[] = {
1743 #define METHNAME(name) mcmeth_##name
1744 METH (solve
, "C.solve([R0, R1]) -> X mod C.product")
1749 static PyTypeObject
*mpcrt_pytype
, mpcrt_pytype_skel
= {
1750 PyObject_HEAD_INIT(0) 0, /* Header */
1751 "catacomb.MPCRT", /* @tp_name@ */
1752 sizeof(mpcrt_pyobj
), /* @tp_basicsize@ */
1753 0, /* @tp_itemsize@ */
1755 mpcrt_pydealloc
, /* @tp_dealloc@ */
1757 0, /* @tp_getattr@ */
1758 0, /* @tp_setattr@ */
1759 0, /* @tp_compare@ */
1761 0, /* @tp_as_number@ */
1762 0, /* @tp_as_sequence@ */
1763 0, /* @tp_as_mapping@ */
1767 0, /* @tp_getattro@ */
1768 0, /* @tp_setattro@ */
1769 0, /* @tp_as_buffer@ */
1770 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1771 Py_TPFLAGS_BASETYPE
,
1774 "A context for the solution of Chinese Remainder Theorem problems.",
1776 0, /* @tp_traverse@ */
1778 0, /* @tp_richcompare@ */
1779 0, /* @tp_weaklistoffset@ */
1781 0, /* @tp_iternext@ */
1782 mpcrt_pymethods
, /* @tp_methods@ */
1783 0, /* @tp_members@ */
1784 mpcrt_pygetset
, /* @tp_getset@ */
1787 0, /* @tp_descr_get@ */
1788 0, /* @tp_descr_set@ */
1789 0, /* @tp_dictoffset@ */
1791 PyType_GenericAlloc
, /* @tp_alloc@ */
1792 mpcrt_pynew
, /* @tp_new@ */
1797 /*----- Binary polynomials ------------------------------------------------*/
1799 static PyObject
*gf_pyrepr(PyObject
*o
)
1800 { return mp_topystring(MP_X(o
), 16, "GF(", "0x", "L)"); }
1802 static PyObject
*gf_pyrichcompare(PyObject
*x
, PyObject
*y
, int op
)
1808 if (gfbinop(x
, y
, &xx
, &yy
)) RETURN_NOTIMPL
;
1810 case Py_EQ
: b
= MP_EQ(xx
, yy
); break;
1811 case Py_NE
: b
= !MP_EQ(xx
, yy
); break;
1816 case Py_LT
: b
= xl
< yl
; break;
1817 case Py_LE
: b
= xl
<= yl
; break;
1818 case Py_GT
: b
= xl
> yl
; break;
1819 case Py_GE
: b
= xl
>= yl
; break;
1824 MP_DROP(xx
); MP_DROP(yy
);
1825 return (getbool(b
));
1828 static PyObject
*gf_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1834 char *kwlist
[] = { "x", "radix", 0 };
1836 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O|i:gf", kwlist
, &x
, &radix
))
1838 if (GF_PYCHECK(x
)) RETURN_OBJ(x
);
1839 if (!good_radix_p(radix
, 1)) VALERR("radix out of range");
1840 if ((z
= mp_frompyobject(x
, radix
)) == 0) {
1841 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to gf",
1842 x
->ob_type
->tp_name
);
1847 VALERR("gf cannot be negative");
1849 zz
= (mp_pyobj
*)ty
->tp_alloc(ty
, 0);
1852 return ((PyObject
*)zz
);
1855 static long gf_pyhash(PyObject
*me
)
1857 long i
= mp_tolong(MP_X(me
));
1858 i
^= 0xc7ecd67c; /* random perturbance */
1864 static PyObject
*gf_pyexp(PyObject
*x
, PyObject
*y
, PyObject
*z
)
1866 mp
*xx
= 0, *yy
= 0, *zz
= 0;
1870 if ((xx
= tomp(x
)) == 0 || (yy
= tomp(y
)) == 0 ||
1871 (z
&& z
!= Py_None
&& (zz
= tomp(z
)) == 0)) {
1872 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
1875 if (!z
|| z
== Py_None
) {
1876 if (MP_NEGP(yy
)) VALERR("negative exponent");
1877 r
= gf_exp(MP_NEW
, xx
, yy
);
1880 if (MP_ZEROP(zz
)) ZDIVERR("zero modulus");
1882 if ((xx
= gf_modinv_checked(xx
, xx
, zz
)) == 0) goto end
;
1883 yy
= mp_neg(yy
, yy
);
1885 gfreduce_create(&gr
, zz
);
1886 r
= gfreduce_exp(&gr
, MP_NEW
, xx
, yy
);
1887 gfreduce_destroy(&gr
);
1891 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
1895 static PyObject
*gfmeth_sqr(PyObject
*me
, PyObject
*arg
)
1897 if (!PyArg_ParseTuple(arg
, ":sqr")) return (0);
1898 return (gf_pywrap(gf_sqr(MP_NEW
, MP_X(me
))));
1901 static PyObject
*gfmeth_gcd(PyObject
*me
, PyObject
*arg
)
1904 mp
*yy
= 0, *zz
= MP_NEW
;
1906 if (!PyArg_ParseTuple(arg
, "O&:gcd", convgf
, &yy
)) goto end
;
1907 gf_gcd(&zz
, 0, 0, MP_X(me
), yy
);
1910 if (yy
) MP_DROP(yy
);
1914 static PyObject
*gfmeth_gcdx(PyObject
*me
, PyObject
*arg
)
1917 mp
*yy
= 0, *zz
= MP_NEW
, *uu
= MP_NEW
, *vv
= MP_NEW
;
1919 if (!PyArg_ParseTuple(arg
, "O&:gcdx", convgf
, &yy
))
1921 gf_gcd(&zz
, &uu
, &vv
, MP_X(me
), yy
);
1922 z
= Py_BuildValue("(NNN)",
1923 gf_pywrap(zz
), gf_pywrap(uu
), gf_pywrap(vv
));
1925 if (yy
) MP_DROP(yy
);
1929 static PyObject
*gfmeth_modinv(PyObject
*me
, PyObject
*arg
)
1932 mp
*yy
= 0, *zz
= MP_NEW
;
1934 if (!PyArg_ParseTuple(arg
, "O&:modinv", convgf
, &yy
) ||
1935 (zz
= gf_modinv_checked(MP_NEW
, yy
, MP_X(me
))) == 0)
1939 if (yy
) MP_DROP(yy
);
1943 static PyObject
*gfmeth_irreduciblep(PyObject
*me
, PyObject
*arg
)
1945 if (!PyArg_ParseTuple(arg
, ":irreduciblep")) return (0);
1946 return getbool(gf_irreduciblep(MP_X(me
)));
1949 static PyObject
*gfget_degree(PyObject
*me
, void *hunoz
)
1950 { return (PyInt_FromLong(mp_bits(MP_X(me
)) - 1)); }
1952 static PyGetSetDef gf_pygetset
[] = {
1953 #define GETSETNAME(op, name) gf##op##_##name
1954 GET (degree
, "X.degree -> polynomial degree of X")
1956 #define GETSETNAME(op, name) mp##op##_##name
1957 GET (nbits
, "X.nbits -> bit length of X")
1958 GET (noctets
, "X.noctets -> octet length of X")
1963 static PyMethodDef gf_pymethods
[] = {
1964 #define METHNAME(func) gfmeth_##func
1965 METH (setbit
, "X.setbit(N) -> X with bit N set")
1966 METH (clearbit
, "X.clearbit(N) -> X with bit N clear")
1967 METH (testbit
, "X.testbit(N) -> true/false if bit N set/clear in X")
1968 METH (sqr
, "X.sqr() -> X^2")
1969 METH (gcd
, "X.gcd(Y) -> gcd(X, Y)")
1971 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
1972 METH (modinv
, "X.modinv(Y) -> multiplicative inverse of Y mod X")
1973 METH (irreduciblep
, "X.irreduciblep() -> true/false")
1975 #define METHNAME(func) mpmeth_##func
1976 KWMETH(tostring
, "X.tostring(radix = 10) -> STR")
1977 KWMETH(storel
, "X.storel(len = -1) -> little-endian bytes")
1978 KWMETH(storeb
, "X.storeb(len = -1) -> big-endian bytes")
1980 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
1982 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
1983 METH (tobuf
, "X.tobuf() -> buffer format")
1988 static PyNumberMethods gf_pynumber
= {
1989 gf_pyadd
, /* @nb_add@ */
1990 gf_pysub
, /* @nb_subtract@ */
1991 gf_pymul
, /* @nb_multiply@ */
1992 0, /* @nb_divide@ */
1993 gf_pymod
, /* @nb_remainder@ */
1994 gf_pydivmod
, /* @nb_divmod@ */
1995 gf_pyexp
, /* @nb_power@ */
1996 mp_pyid
, /* @nb_negative@ */
1997 mp_pyid
, /* @nb_positive@ */
1998 mp_pyid
, /* @nb_absolute@ */
1999 mp_pynonzerop
, /* @nb_nonzero@ */
2000 0 /* doesn't make any sense */, /* @nb_invert@ */
2001 gf_pylsl
, /* @nb_lshift@ */
2002 gf_pylsr
, /* @nb_rshift@ */
2003 gf_pyand
, /* @nb_and@ */
2004 gf_pyxor
, /* @nb_xor@ */
2005 gf_pyor
, /* @nb_or@ */
2006 gf_pycoerce
, /* @nb_coerce@ */
2007 mp_pyint
, /* @nb_int@ */
2008 mp_pylong
, /* @nb_long@ */
2009 0 /* doesn't make any sense */, /* @nb_float@ */
2010 mp_pyoct
, /* @nb_oct@ */
2011 mp_pyhex
, /* @nb_hex@ */
2013 0, /* @nb_inplace_add@ */
2014 0, /* @nb_inplace_subtract@ */
2015 0, /* @nb_inplace_multiply@ */
2016 0, /* @nb_inplace_divide@ */
2017 0, /* @nb_inplace_remainder@ */
2018 0, /* @nb_inplace_power@ */
2019 0, /* @nb_inplace_lshift@ */
2020 0, /* @nb_inplace_rshift@ */
2021 0, /* @nb_inplace_and@ */
2022 0, /* @nb_inplace_xor@ */
2023 0, /* @nb_inplace_or@ */
2025 gf_pydiv
, /* @nb_floor_divide@ */
2026 0, /* @nb_true_divide@ */
2027 0, /* @nb_inplace_floor_divide@ */
2028 0, /* @nb_inplace_true_divide@ */
2031 static PyTypeObject gf_pytype_skel
= {
2032 PyObject_HEAD_INIT(0) 0, /* Header */
2033 "catacomb.GF", /* @tp_name@ */
2034 sizeof(mp_pyobj
), /* @tp_basicsize@ */
2035 0, /* @tp_itemsize@ */
2037 mp_pydealloc
, /* @tp_dealloc@ */
2039 0, /* @tp_getattr@ */
2040 0, /* @tp_setattr@ */
2041 0, /* @tp_compare@ */
2042 gf_pyrepr
, /* @tp_repr@ */
2043 &gf_pynumber
, /* @tp_as_number@ */
2044 0, /* @tp_as_sequence@ */
2045 0, /* @tp_as_mapping@ */
2046 gf_pyhash
, /* @tp_hash@ */
2048 mp_pyhex
, /* @tp_str@ */
2049 0, /* @tp_getattro@ */
2050 0, /* @tp_setattro@ */
2051 0, /* @tp_as_buffer@ */
2052 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2053 Py_TPFLAGS_CHECKTYPES
|
2054 Py_TPFLAGS_BASETYPE
,
2057 "Binary polynomials. Support almost all the standard arithmetic\n\
2060 Constructor gf(X, radix = R) attempts to convert X to a `gf'. If\n\
2061 X is a string, it's read in radix-R form, or we look for a prefix\n\
2062 if R = 0. Other acceptable things are ints and longs.\n\
2064 The name is hopelessly wrong from a technical point of view, but\n\
2065 but it's much easier to type than `p2' or `c2' or whatever.\n\
2069 * Use `//' for division. GFs don't have `/' division.",
2071 0, /* @tp_traverse@ */
2073 gf_pyrichcompare
, /* @tp_richcompare@ */
2074 0, /* @tp_weaklistoffset@ */
2076 0, /* @tp_iternext@ */
2077 gf_pymethods
, /* @tp_methods@ */
2078 0, /* @tp_members@ */
2079 gf_pygetset
, /* @tp_getset@ */
2082 0, /* @tp_descr_get@ */
2083 0, /* @tp_descr_set@ */
2084 0, /* @tp_dictoffset@ */
2086 PyType_GenericAlloc
, /* @tp_alloc@ */
2087 gf_pynew
, /* @tp_new@ */
2092 static PyObject
*meth__GF_fromstring(PyObject
*me
,
2093 PyObject
*arg
, PyObject
*kw
)
2100 mptext_stringctx sc
;
2101 char *kwlist
[] = { "class", "x", "radix", 0 };
2103 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "Os#|i:fromstring",
2104 kwlist
, &me
, &p
, &len
, &r
))
2106 if (!good_radix_p(r
, 1)) VALERR("bad radix");
2107 sc
.buf
= p
; sc
.lim
= p
+ len
;
2108 if ((zz
= mp_read(MP_NEW
, r
, &mptext_stringops
, &sc
)) == 0 ||
2110 if (zz
) MP_DROP(zz
);
2111 SYNERR("bad binary polynomial");
2113 z
= Py_BuildValue("(Ns#)", gf_pywrap(zz
), sc
.buf
, (int)(sc
.lim
- sc
.buf
));
2118 /*----- Sparse poly reduction ---------------------------------------------*/
2120 typedef struct gfreduce_pyobj
{
2125 #define GFREDUCE_PY(o) (&((gfreduce_pyobj *)(o))->mr)
2127 static PyObject
*grmeth_exp(PyObject
*me
, PyObject
*arg
)
2130 mp
*yy
= 0, *zz
= 0;
2132 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convgf
, &yy
, convgf
, &zz
))
2135 if ((yy
= gf_modinv_checked(yy
, yy
, GFREDUCE_PY(me
)->p
)) == 0) goto end
;
2136 zz
= mp_neg(zz
, zz
);
2138 rc
= gf_pywrap(gfreduce_exp(GFREDUCE_PY(me
), MP_NEW
, yy
, zz
));
2140 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
2144 static PyObject
*grmeth_trace(PyObject
*me
, PyObject
*arg
)
2149 if (!PyArg_ParseTuple(arg
, "O&:trace", convgf
, &xx
)) goto end
;
2150 rc
= PyInt_FromLong(gfreduce_trace(GFREDUCE_PY(me
), xx
));
2152 if (xx
) MP_DROP(xx
);
2156 static PyObject
*grmeth_halftrace(PyObject
*me
, PyObject
*arg
)
2161 if (!PyArg_ParseTuple(arg
, "O&:halftrace", convgf
, &xx
)) goto end
;
2162 rc
= gf_pywrap(gfreduce_halftrace(GFREDUCE_PY(me
), MP_NEW
, xx
));
2164 if (xx
) MP_DROP(xx
);
2168 static PyObject
*grmeth_sqrt(PyObject
*me
, PyObject
*arg
)
2173 if (!PyArg_ParseTuple(arg
, "O&:sqrt", convgf
, &xx
)) goto end
;
2174 if ((yy
= gfreduce_sqrt(GFREDUCE_PY(me
), MP_NEW
, xx
)) == 0)
2175 VALERR("no modular square root");
2178 if (xx
) MP_DROP(xx
);
2182 static PyObject
*grmeth_quadsolve(PyObject
*me
, PyObject
*arg
)
2187 if (!PyArg_ParseTuple(arg
, "O&:quadsolve", convgf
, &xx
)) goto end
;
2188 if ((yy
= gfreduce_quadsolve(GFREDUCE_PY(me
), MP_NEW
, xx
)) == 0)
2189 VALERR("no solution found");
2192 if (xx
) MP_DROP(xx
);
2196 static PyObject
*grmeth_reduce(PyObject
*me
, PyObject
*arg
)
2201 if (!PyArg_ParseTuple(arg
, "O&:reduce", convgf
, &yy
)) goto end
;
2202 z
= gf_pywrap(gfreduce_do(GFREDUCE_PY(me
), MP_NEW
, yy
));
2207 static void gfreduce_pydealloc(PyObject
*me
)
2209 gfreduce_destroy(GFREDUCE_PY(me
));
2213 static PyObject
*gfreduce_pynew(PyTypeObject
*ty
,
2214 PyObject
*arg
, PyObject
*kw
)
2216 gfreduce_pyobj
*mr
= 0;
2218 char *kwlist
[] = { "m", 0 };
2221 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convgf
, &xx
))
2223 if (MP_ZEROP(xx
)) ZDIVERR("modulus is zero!");
2224 gfreduce_create(&r
, xx
);
2225 mr
= (gfreduce_pyobj
*)ty
->tp_alloc(ty
, 0);
2228 if (xx
) MP_DROP(xx
);
2229 return ((PyObject
*)mr
);
2232 static PyObject
*grget_m(PyObject
*me
, void *hunoz
)
2233 { return (gf_pywrap(MP_COPY(GFREDUCE_PY(me
)->p
))); }
2235 static PyGetSetDef gfreduce_pygetset
[] = {
2236 #define GETSETNAME(op, name) gr##op##_##name
2237 GET (m
, "R.m -> reduction polynomial")
2242 static PyMethodDef gfreduce_pymethods
[] = {
2243 #define METHNAME(name) grmeth_##name
2244 METH (reduce
, "R.reduce(X) -> X mod B.m")
2245 METH (trace
, "R.trace(X) -> Tr(X) = x + x^2 + ... + x^{2^{m - 1}}")
2246 METH (halftrace
, "R.halftrace(X) -> x + x^{2^2} + ... + x^{2^{m - 1}}")
2247 METH (sqrt
, "R.sqrt(X) -> Y where Y^2 = X mod R")
2248 METH (quadsolve
, "R.quadsolve(X) -> Y where Y^2 + Y = X mod R")
2249 METH (exp
, "R.exp(X, N) -> X^N mod B.m")
2254 static PyTypeObject
*gfreduce_pytype
, gfreduce_pytype_skel
= {
2255 PyObject_HEAD_INIT(0) 0, /* Header */
2256 "catacomb.GFReduce", /* @tp_name@ */
2257 sizeof(gfreduce_pyobj
), /* @tp_basicsize@ */
2258 0, /* @tp_itemsize@ */
2260 gfreduce_pydealloc
, /* @tp_dealloc@ */
2262 0, /* @tp_getattr@ */
2263 0, /* @tp_setattr@ */
2264 0, /* @tp_compare@ */
2266 0, /* @tp_as_number@ */
2267 0, /* @tp_as_sequence@ */
2268 0, /* @tp_as_mapping@ */
2272 0, /* @tp_getattro@ */
2273 0, /* @tp_setattro@ */
2274 0, /* @tp_as_buffer@ */
2275 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2276 Py_TPFLAGS_BASETYPE
,
2279 "A reduction context for reduction modulo sparse irreducible polynomials.",
2281 0, /* @tp_traverse@ */
2283 0, /* @tp_richcompare@ */
2284 0, /* @tp_weaklistoffset@ */
2286 0, /* @tp_iternext@ */
2287 gfreduce_pymethods
, /* @tp_methods@ */
2288 0, /* @tp_members@ */
2289 gfreduce_pygetset
, /* @tp_getset@ */
2292 0, /* @tp_descr_get@ */
2293 0, /* @tp_descr_set@ */
2294 0, /* @tp_dictoffset@ */
2296 PyType_GenericAlloc
, /* @tp_alloc@ */
2297 gfreduce_pynew
, /* @tp_new@ */
2302 /*----- Normal/poly transformation ----------------------------------------*/
2304 typedef struct gfn_pyobj
{
2310 static PyTypeObject
*gfn_pytype
, gfn_pytype_skel
;
2312 #define GFN_P(o) (((gfn_pyobj *)(o))->p)
2313 #define GFN_PTON(o) (&((gfn_pyobj *)(o))->pton)
2314 #define GFN_NTOP(o) (&((gfn_pyobj *)(o))->ntop)
2316 static PyObject
*gfn_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
2318 mp
*p
= 0, *beta
= 0;
2320 char *kwlist
[] = { "p", "beta", 0 };
2322 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&O&:new", kwlist
,
2323 convgf
, &p
, convgf
, &beta
))
2325 gg
= PyObject_New(gfn_pyobj
, ty
);
2326 if (gfn_create(p
, beta
, &gg
->ntop
, &gg
->pton
)) {
2329 VALERR("can't invert transformation matrix");
2335 return ((PyObject
*)gg
);
2338 static PyObject
*gfnget_p(PyObject
*me
, void *hunoz
)
2339 { return (gf_pywrap(MP_COPY(GFN_P(me
)))); }
2341 static PyObject
*gfnget_beta(PyObject
*me
, void *hunoz
)
2343 gfn
*n
= GFN_NTOP(me
);
2344 mp
*x
= n
->r
[n
->n
- 1];
2345 return (gf_pywrap(MP_COPY(x
)));
2348 #define XFORMOP(name, NAME) \
2349 static PyObject *gfnmeth_##name(PyObject *me, PyObject *arg) \
2354 if (!PyArg_ParseTuple(arg, "O&:" #name, convgf, &xx)) goto end; \
2355 z = gfn_transform(GFN_##NAME(me), MP_NEW, xx); \
2358 if (!z) return (0); \
2359 return (mp_pywrap(z)); \
2365 static void gfn_pydealloc(PyObject
*me
)
2367 gfn_destroy(GFN_PTON(me
));
2368 gfn_destroy(GFN_NTOP(me
));
2372 static PyGetSetDef gfn_pygetset
[] = {
2373 #define GETSETNAME(op, name) gfn##op##_##name
2374 GET (p
, "X.p -> polynomial basis, as polynomial")
2375 GET (beta
, "X.beta -> normal basis element, in poly form")
2380 static PyMethodDef gfn_pymethods
[] = {
2381 #define METHNAME(name) gfnmeth_##name
2382 METH (pton
, "X.pton(A) -> normal-basis representation of A")
2383 METH (ntop
, "X.ntop(A) -> polynomial-basis representation of A")
2388 static PyTypeObject gfn_pytype_skel
= {
2389 PyObject_HEAD_INIT(0) 0, /* Header */
2390 "catacomb.GFN", /* @tp_name@ */
2391 sizeof(gfn_pyobj
), /* @tp_basicsize@ */
2392 0, /* @tp_itemsize@ */
2394 gfn_pydealloc
, /* @tp_dealloc@ */
2396 0, /* @tp_getattr@ */
2397 0, /* @tp_setattr@ */
2398 0, /* @tp_compare@ */
2400 0, /* @tp_as_number@ */
2401 0, /* @tp_as_sequence@ */
2402 0, /* @tp_as_mapping@ */
2406 0, /* @tp_getattro@ */
2407 0, /* @tp_setattro@ */
2408 0, /* @tp_as_buffer@ */
2409 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2410 Py_TPFLAGS_BASETYPE
,
2413 "An object for transforming elements of binary fields between polynomial\n\
2414 and normal basis representations.",
2416 0, /* @tp_traverse@ */
2418 0, /* @tp_richcompare@ */
2419 0, /* @tp_weaklistoffset@ */
2421 0, /* @tp_iternext@ */
2422 gfn_pymethods
, /* @tp_methods@ */
2423 0, /* @tp_members@ */
2424 gfn_pygetset
, /* @tp_getset@ */
2427 0, /* @tp_descr_get@ */
2428 0, /* @tp_descr_set@ */
2429 0, /* @tp_dictoffset@ */
2431 PyType_GenericAlloc
, /* @tp_alloc@ */
2432 gfn_pynew
, /* @tp_new@ */
2437 /*----- Glue --------------------------------------------------------------*/
2439 static PyMethodDef methods
[] = {
2440 #define METHNAME(func) meth_##func
2441 KWMETH(_MP_fromstring
, "\
2442 fromstring(STR, radix = 0) -> (X, REST)\n\
2444 Parse STR as a large integer, according to radix. If radix is zero,\n\
2445 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2446 or `R_' for other radix R.")
2447 KWMETH(_GF_fromstring
, "\
2448 fromstring(STR, radix = 0) -> (X, REST)\n\
2450 Parse STR as a binary polynomial, according to radix. If radix is zero,\n\
2451 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2452 or `R_' for other radix R.")
2454 loadl(STR) -> X: read little-endian bytes")
2456 loadb(STR) -> X: read big-endian bytes")
2457 METH (_MP_loadl2c
, "\
2458 loadl2c(STR) -> X: read little-endian bytes, two's complement")
2459 METH (_MP_loadb2c
, "\
2460 loadb2c(STR) -> X: read big-endian bytes, two's complement")
2461 METH (_MP_frombuf
, "\
2462 frombuf(STR) -> (X, REST): read buffer format")
2464 loadl(STR) -> X: read little-endian bytes")
2466 loadb(STR) -> X: read big-endian bytes")
2467 METH (_GF_frombuf
, "\
2468 frombuf(STR) -> (X, REST): read buffer format")
2473 void mp_pyinit(void)
2477 INITTYPE(mpmul
, root
);
2478 INITTYPE(mpmont
, root
);
2479 INITTYPE(mpbarrett
, root
);
2480 INITTYPE(mpreduce
, root
);
2481 INITTYPE(mpcrt
, root
);
2482 INITTYPE(gfreduce
, root
);
2483 INITTYPE(gfn
, root
);
2484 addmethods(methods
);
2487 void mp_pyinsert(PyObject
*mod
)
2489 INSERT("MP", mp_pytype
);
2490 INSERT("MPMul", mpmul_pytype
);
2491 INSERT("MPMont", mpmont_pytype
);
2492 INSERT("MPBarrett", mpbarrett_pytype
);
2493 INSERT("MPReduce", mpreduce_pytype
);
2494 INSERT("MPCRT", mpcrt_pytype
);
2495 INSERT("GF", gf_pytype
);
2496 INSERT("GFReduce", gfreduce_pytype
);
2497 INSERT("GFN", gfn_pytype
);
2500 /*----- That's all, folks -------------------------------------------------*/