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
)
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 VALERR("mp out of range for int");
183 /*----- Python interface --------------------------------------------------*/
185 static void mp_pydealloc(PyObject
*o
)
191 static PyObject
*mp_pyrepr(PyObject
*o
)
192 { return mp_topystring(MP_X(o
), 10, "MP(", 0, "L)"); }
194 static PyObject
*mp_pystr(PyObject
*o
)
195 { return mp_topystring(MP_X(o
), 10, 0, 0, 0); }
197 mp
*tomp(PyObject
*o
)
204 else if (MP_PYCHECK(o
) || GF_PYCHECK(o
))
205 return (MP_COPY(MP_X(o
)));
206 else if (FE_PYCHECK(o
))
207 return (F_OUT(FE_F(o
), MP_NEW
, FE_X(o
)));
208 else if (PFILT_PYCHECK(o
))
209 return (MP_COPY(PFILT_F(o
)->m
));
210 else if (ECPT_PYCHECK(o
)) {
216 } else if (GE_PYCHECK(o
)) {
217 if ((x
= G_TOINT(GE_G(o
), MP_NEW
, GE_X(o
))) == 0)
220 } else if (PyInt_Check(o
))
221 return (mp_fromlong(MP_NEW
, PyInt_AS_LONG(o
)));
222 else if ((l
= PyNumber_Long(o
)) != 0) {
223 x
= mp_frompylong(l
);
232 mp
*getmp(PyObject
*o
)
236 if ((x
= tomp(o
)) == 0) {
237 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to mp",
238 o
->ob_type
->tp_name
);
243 int convmp(PyObject
*o
, void *p
)
246 if ((x
= getmp(o
)) == 0) return (0);
251 mp
*getgf(PyObject
*o
)
255 if ((x
= tomp(o
)) == 0) {
256 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to gf",
257 o
->ob_type
->tp_name
);
262 int convgf(PyObject
*o
, void *p
)
265 if ((x
= getgf(o
)) == 0) return (0);
270 static mp
*implicitmp(PyObject
*o
)
281 static mp
*implicitgf(PyObject
*o
)
292 static int mpbinop(PyObject
*x
, PyObject
*y
, mp
**xx
, mp
**yy
)
294 if ((*xx
= implicitmp(x
)) == 0)
296 if ((*yy
= implicitmp(y
)) == 0) {
303 static int gfbinop(PyObject
*x
, PyObject
*y
, mp
**xx
, mp
**yy
)
305 if ((*xx
= implicitgf(x
)) == 0)
307 if ((*yy
= implicitgf(y
)) == 0) {
314 #define gf_and mp_and
316 #define gf_xor mp_xor
317 #define BINOP(pre, name) \
318 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
320 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
321 zz = pre##_##name(MP_NEW, xx, yy); \
322 MP_DROP(xx); MP_DROP(yy); \
323 return (pre##_pywrap(zz)); \
339 static mp
*mp_abs(mp
*d
, mp
*x
)
342 return (mp_neg(d
, x
));
348 #define UNOP(pre, name) \
349 static PyObject *pre##_py##name(PyObject *x) \
350 { return mp_pywrap(pre##_##name(MP_NEW, MP_X(x))); }
356 static PyObject
*mp_pyid(PyObject
*x
) { RETURN_OBJ(x
); }
358 #define gf_lsr mp_lsr
359 #define SHIFTOP(pre, name, rname) \
360 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
364 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
365 if (mp_tolong_checked(yy, &n)) goto end; \
367 z = pre##_pywrap(mp_##rname(MP_NEW, xx, -n)); \
369 z = pre##_pywrap(mp_##name(MP_NEW, xx, n)); \
371 MP_DROP(xx); MP_DROP(yy); \
374 SHIFTOP(mp
, lsl2c
, lsr2c
)
375 SHIFTOP(mp
, lsr2c
, lsl2c
)
376 SHIFTOP(gf
, lsl
, lsr
)
377 SHIFTOP(gf
, lsr
, lsl
)
380 #define DIVOP(pre, name, qq, rr, gather) \
381 static PyObject *pre##_py##name(PyObject *x, PyObject *y) { \
384 INIT_##qq(q) INIT_##rr(r) \
385 if (pre##binop(x, y, &xx, &yy)) RETURN_NOTIMPL; \
387 ZDIVERR("division by zero"); \
388 pre##_div(ARG_##qq(q), ARG_##rr(r), xx, yy); \
391 MP_DROP(xx); MP_DROP(yy); \
394 #define INIT_YES(p) mp *p = MP_NEW;
396 #define ARG_YES(p) &p
398 DIVOP(mp
, divmod
, YES
, YES
,
399 Py_BuildValue("(NN)", mp_pywrap(q
), mp_pywrap(r
)))
400 DIVOP(mp
, div
, YES
, NO
, mp_pywrap(q
))
401 DIVOP(mp
, mod
, NO
, YES
, mp_pywrap(r
))
402 DIVOP(gf
, divmod
, YES
, YES
,
403 Py_BuildValue("(NN)", gf_pywrap(q
), gf_pywrap(r
)))
404 DIVOP(gf
, div
, YES
, NO
, gf_pywrap(q
))
405 DIVOP(gf
, mod
, NO
, YES
, gf_pywrap(r
))
412 static mp
*mp_modinv_checked(mp
*d
, mp
*x
, mp
*p
)
415 mp_gcd(&g
, 0, &d
, p
, x
);
416 if (!MP_EQ(g
, MP_ONE
)) {
417 MP_DROP(g
); MP_DROP(d
);
418 PyErr_SetString(PyExc_ZeroDivisionError
, "no modular inverse");
421 MP_DROP(g
); return (d
);
424 static PyObject
*mp_pyexp(PyObject
*x
, PyObject
*y
, PyObject
*z
)
426 mp
*xx
= 0, *yy
= 0, *zz
= 0;
430 if ((xx
= implicitmp(x
)) == 0 || (yy
= implicitmp(y
)) == 0 ||
431 (z
&& z
!= Py_None
&& (zz
= tomp(z
)) == 0)) {
432 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
435 if (!z
|| z
== Py_None
) {
436 if (MP_NEGP(yy
)) VALERR("negative exponent");
437 r
= mp_exp(MP_NEW
, xx
, yy
);
439 if (!MP_POSP(zz
)) VALERR("modulus must be positive");
441 if ((xx
= mp_modinv_checked(xx
, xx
, zz
)) == 0) goto end
;
446 mpmont_create(&mm
, zz
);
447 r
= mpmont_exp(&mm
, MP_NEW
, xx
, yy
);
451 mpbarrett_create(&mb
, zz
);
452 r
= mpbarrett_exp(&mb
, MP_NEW
, xx
, yy
);
453 mpbarrett_destroy(&mb
);
458 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
462 static mp
*gf_modinv_checked(mp
*d
, mp
*x
, mp
*p
)
465 gf_gcd(&g
, 0, &d
, p
, x
);
466 if (!MP_EQ(g
, MP_ONE
)) {
467 MP_DROP(g
); MP_DROP(d
);
468 PyErr_SetString(PyExc_ZeroDivisionError
, "no modular inverse");
471 MP_DROP(g
); return (d
);
474 #define BASEOP(name, radix, pre) \
475 static PyObject *mp_py##name(PyObject *x) \
476 { return mp_topystring(MP_X(x), radix, 0, pre, 0); }
478 BASEOP(hex
, 16, "0x");
481 static int mp_pynonzerop(PyObject
*x
) { return !MP_ZEROP(MP_X(x
)); }
483 static PyObject
*mp_pyint(PyObject
*x
)
486 if (mp_tolong_checked(MP_X(x
), &l
)) return (0);
487 return (PyInt_FromLong(l
));
489 static PyObject
*mp_pylong(PyObject
*x
)
490 { return (mp_topylong(MP_X(x
))); }
491 static PyObject
*mp_pyfloat(PyObject
*x
)
493 PyObject
*l
= mp_topylong(MP_X(x
));
494 double f
= PyLong_AsDouble(l
);
496 return (PyFloat_FromDouble(f
));
499 #define COERCE(pre, PRE) \
500 static int pre##_pycoerce(PyObject **x, PyObject **y) \
504 if (PRE##_PYCHECK(*y)) { \
505 Py_INCREF(*x); Py_INCREF(*y); \
508 if ((z = tomp(*y)) != 0) { \
510 *y = pre##_pywrap(z); \
519 static int mp_pycompare(PyObject
*x
, PyObject
*y
)
520 { return mp_cmp(MP_X(x
), MP_X(y
)); }
522 static PyObject
*mp_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
528 char *kwlist
[] = { "x", "radix", 0 };
530 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O|i:new", kwlist
, &x
, &radix
))
532 if (MP_PYCHECK(x
)) RETURN_OBJ(x
);
533 if (!good_radix_p(radix
, 1)) VALERR("bad radix");
534 if ((z
= mp_frompyobject(x
, radix
)) == 0) {
535 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to mp",
536 x
->ob_type
->tp_name
);
539 zz
= (mp_pyobj
*)ty
->tp_alloc(ty
, 0);
542 return ((PyObject
*)zz
);
545 static long mp_pyhash(PyObject
*me
)
548 PyObject
*l
= mp_topylong(MP_X(me
)); h
= PyObject_Hash(l
);
549 Py_DECREF(l
); return (h
);
552 static PyObject
*mpmeth_jacobi(PyObject
*me
, PyObject
*arg
)
557 if (!PyArg_ParseTuple(arg
, "O&:jacobi", convmp
, &y
)) goto end
;
558 z
= PyInt_FromLong(mp_jacobi(y
, MP_X(me
)));
564 #define BITOP(pre, name, c) \
565 static PyObject *pre##meth_##name(PyObject *me, PyObject *arg) \
568 if (!PyArg_ParseTuple(arg, "O&:" #name, convulong, &i)) return (0); \
569 return (pre##_pywrap(mp_##name##c(MP_NEW, MP_X(me), i))); \
571 BITOP(mp
, setbit
, 2c
);
572 BITOP(mp
, clearbit
, 2c
);
574 BITOP(gf
, clearbit
, );
577 static PyObject
*mpmeth_testbit(PyObject
*me
, PyObject
*arg
)
580 if (!PyArg_ParseTuple(arg
, "O&:testbit", convulong
, &i
)) return (0);
581 return (getbool(mp_testbit2c(MP_X(me
), i
)));
584 static PyObject
*gfmeth_testbit(PyObject
*me
, PyObject
*arg
)
587 if (!PyArg_ParseTuple(arg
, "O&:testbit", convulong
, &i
)) return (0);
588 return (getbool(mp_testbit(MP_X(me
), i
)));
591 static PyObject
*mpmeth_odd(PyObject
*me
, PyObject
*arg
)
596 if (!PyArg_ParseTuple(arg
, ":odd")) return (0);
597 t
= mp_odd(MP_NEW
, MP_X(me
), &s
);
598 return (Py_BuildValue("(lN)", (long)s
, mp_pywrap(t
)));
601 static PyObject
*mpmeth_sqr(PyObject
*me
, PyObject
*arg
)
603 if (!PyArg_ParseTuple(arg
, ":sqr")) return (0);
604 return (mp_pywrap(mp_sqr(MP_NEW
, MP_X(me
))));
607 static PyObject
*mpmeth_sqrt(PyObject
*me
, PyObject
*arg
)
609 if (!PyArg_ParseTuple(arg
, ":sqrt")) return (0);
610 if (MP_NEGP(MP_X(me
))) VALERR("negative root");
611 return (mp_pywrap(mp_sqrt(MP_NEW
, MP_X(me
))));
616 static PyObject
*mpmeth_gcd(PyObject
*me
, PyObject
*arg
)
618 mp
*y
= 0, *zz
= MP_NEW
;
621 if (!PyArg_ParseTuple(arg
, "O&:gcd", convmp
, &y
)) goto end
;
622 mp_gcd(&zz
, 0, 0, MP_X(me
), y
);
629 static PyObject
*mpmeth_gcdx(PyObject
*me
, PyObject
*arg
)
632 mp
*yy
= 0, *zz
= MP_NEW
, *uu
= MP_NEW
, *vv
= MP_NEW
;
634 if (!PyArg_ParseTuple(arg
, "O&:gcdx", convmp
, &yy
)) goto end
;
635 mp_gcd(&zz
, &uu
, &vv
, MP_X(me
), yy
);
636 z
= Py_BuildValue("(NNN)",
637 mp_pywrap(zz
), mp_pywrap(uu
), mp_pywrap(vv
));
643 static PyObject
*mpmeth_modinv(PyObject
*me
, PyObject
*arg
)
646 mp
*yy
= 0, *zz
= MP_NEW
;
648 if (!PyArg_ParseTuple(arg
, "O&:modinv", convmp
, &yy
) ||
649 (zz
= mp_modinv_checked(MP_NEW
, yy
, MP_X(me
))) == 0)
657 static PyObject
*mpmeth_tostring(PyObject
*me
, PyObject
*arg
, PyObject
*kw
)
660 char *kwlist
[] = { "radix", 0 };
661 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "|i:tostring", kwlist
, &radix
))
663 if (!good_radix_p(radix
, 0)) VALERR("bad radix");
664 return (mp_topystring(MP_X(me
), radix
, 0, 0, 0));
669 static PyObject
*mpmeth_modsqrt(PyObject
*me
, PyObject
*arg
)
672 mp
*yy
= 0, *zz
= MP_NEW
;
674 if (!PyArg_ParseTuple(arg
, "O&:modsqrt", convmp
, &yy
)) goto end
;
675 if ((zz
= mp_modsqrt(MP_NEW
, yy
, MP_X(me
))) == 0)
676 VALERR("no modular square root");
683 #define STOREOP(name, c) \
684 static PyObject *mpmeth_##name(PyObject *me, \
685 PyObject *arg, PyObject *kw) \
688 char *kwlist[] = { "len", 0 }; \
691 if (!PyArg_ParseTupleAndKeywords(arg, kw, "|l:" #name, \
695 len = mp_octets##c(MP_X(me)); \
698 rc = bytestring_pywrap(0, len); \
699 mp_##name(MP_X(me), PyString_AS_STRING(rc), len); \
705 STOREOP(storel2c
, 2c
)
706 STOREOP(storeb2c
, 2c
)
709 #define BUFOP(ty, pyty) \
710 static PyObject *meth__##pyty##_frombuf(PyObject *me, PyObject *arg) \
718 if (!PyArg_ParseTuple(arg, "Os#:frombuf", &me, &p, &sz)) goto end; \
719 buf_init(&b, p, sz); \
720 if ((x = buf_getmp(&b)) == 0) VALERR("malformed data"); \
721 rc = Py_BuildValue("(NN)", ty##_pywrap(x), \
722 bytestring_pywrapbuf(&b)); \
730 static PyObject
*mpmeth_tobuf(PyObject
*me
, PyObject
*arg
)
737 if (!PyArg_ParseTuple(arg
, ":tobuf")) return (0);
739 n
= mp_octets(x
) + 3;
740 rc
= bytestring_pywrap(0, n
);
741 buf_init(&b
, PyString_AS_STRING(rc
), n
);
744 _PyString_Resize(&rc
, BLEN(&b
));
748 static PyObject
*mpmeth_primep(PyObject
*me
, PyObject
*arg
, PyObject
*kw
)
750 grand
*r
= &rand_global
;
751 char *kwlist
[] = { "rng", 0 };
754 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "|O&", kwlist
, convgrand
, &r
))
756 rc
= getbool(pgen_primep(MP_X(me
), r
));
761 static PyObject
*mpget_nbits(PyObject
*me
, void *hunoz
)
762 { return (PyInt_FromLong(mp_bits(MP_X(me
)))); }
764 static PyObject
*mpget_noctets(PyObject
*me
, void *hunoz
)
765 { return (PyInt_FromLong(mp_octets(MP_X(me
)))); }
767 static PyObject
*mpget_noctets2c(PyObject
*me
, void *hunoz
)
768 { return (PyInt_FromLong(mp_octets2c(MP_X(me
)))); }
770 static PyGetSetDef mp_pygetset
[] = {
771 #define GETSETNAME(op, func) mp##op##_##func
772 GET (nbits
, "X.nbits -> bit length of X")
773 GET (noctets
, "X.noctets -> octet length of X")
774 GET (noctets2c
, "X.noctets2c -> two's complement octet length of X")
779 static PyMethodDef mp_pymethods
[] = {
780 #define METHNAME(func) mpmeth_##func
781 METH (jacobi
, "X.jacobi(Y) -> Jacobi symbol (Y/X) (NB inversion!)")
782 METH (setbit
, "X.setbit(N) -> X with bit N set")
783 METH (clearbit
, "X.clearbit(N) -> X with bit N clear")
784 METH (testbit
, "X.testbit(N) -> true/false if bit N set/clear in X")
785 METH (odd
, "X.odd() -> S, T where X = 2^S T with T odd")
786 METH (sqr
, "X.sqr() -> X^2")
787 METH (sqrt
, "X.sqrt() -> largest integer <= sqrt(X)")
788 METH (gcd
, "X.gcd(Y) -> gcd(X, Y)")
790 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
791 METH (modinv
, "X.modinv(Y) -> multiplicative inverse of Y mod X")
792 METH (modsqrt
, "X.modsqrt(Y) -> square root of Y mod X, if X prime")
793 KWMETH(primep
, "X.primep(rng = rand) -> true/false if X is prime")
794 KWMETH(tostring
, "X.tostring(radix = 10) -> STR")
795 KWMETH(storel
, "X.storel(len = -1) -> little-endian bytes")
796 KWMETH(storeb
, "X.storeb(len = -1) -> big-endian bytes")
798 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
800 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
801 METH (tobuf
, "X.tobuf() -> buffer format")
806 static PyNumberMethods mp_pynumber
= {
807 mp_pyadd
, /* @nb_add@ */
808 mp_pysub
, /* @nb_subtract@ */
809 mp_pymul
, /* @nb_multiply@ */
811 mp_pymod
, /* @nb_remainder@ */
812 mp_pydivmod
, /* @nb_divmod@ */
813 mp_pyexp
, /* @nb_power@ */
814 mp_pyneg
, /* @nb_negative@ */
815 mp_pyid
, /* @nb_positive@ */
816 mp_pyabs
, /* @nb_absolute@ */
817 mp_pynonzerop
, /* @nb_nonzero@ */
818 mp_pynot2c
, /* @nb_invert@ */
819 mp_pylsl2c
, /* @nb_lshift@ */
820 mp_pylsr2c
, /* @nb_rshift@ */
821 mp_pyand2c
, /* @nb_and@ */
822 mp_pyxor2c
, /* @nb_xor@ */
823 mp_pyor2c
, /* @nb_or@ */
824 mp_pycoerce
, /* @nb_coerce@ */
825 mp_pyint
, /* @nb_int@ */
826 mp_pylong
, /* @nb_long@ */
827 mp_pyfloat
, /* @nb_float@ */
828 mp_pyoct
, /* @nb_oct@ */
829 mp_pyhex
, /* @nb_hex@ */
831 0, /* @nb_inplace_add@ */
832 0, /* @nb_inplace_subtract@ */
833 0, /* @nb_inplace_multiply@ */
834 0, /* @nb_inplace_divide@ */
835 0, /* @nb_inplace_remainder@ */
836 0, /* @nb_inplace_power@ */
837 0, /* @nb_inplace_lshift@ */
838 0, /* @nb_inplace_rshift@ */
839 0, /* @nb_inplace_and@ */
840 0, /* @nb_inplace_xor@ */
841 0, /* @nb_inplace_or@ */
843 mp_pydiv
, /* @nb_floor_divide@ */
844 0, /* @nb_true_divide@ */
845 0, /* @nb_inplace_floor_divide@ */
846 0, /* @nb_inplace_true_divide@ */
849 static PyTypeObject mp_pytype_skel
= {
850 PyObject_HEAD_INIT(0) 0, /* Header */
851 "MP", /* @tp_name@ */
852 sizeof(mp_pyobj
), /* @tp_basicsize@ */
853 0, /* @tp_itemsize@ */
855 mp_pydealloc
, /* @tp_dealloc@ */
857 0, /* @tp_getattr@ */
858 0, /* @tp_setattr@ */
859 mp_pycompare
, /* @tp_compare@ */
860 mp_pyrepr
, /* @tp_repr@ */
861 &mp_pynumber
, /* @tp_as_number@ */
862 0, /* @tp_as_sequence@ */
863 0, /* @tp_as_mapping@ */
864 mp_pyhash
, /* @tp_hash@ */
866 mp_pystr
, /* @tp_str@ */
867 0, /* @tp_getattro@ */
868 0, /* @tp_setattro@ */
869 0, /* @tp_as_buffer@ */
870 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
871 Py_TPFLAGS_CHECKTYPES
|
875 "Multiprecision integers, similar to `long' but more efficient and\n\
876 versatile. Support all the standard arithmetic operations.\n\
878 Constructor mp(X, radix = R) attempts to convert X to an `mp'. If\n\
879 X is a string, it's read in radix-R form, or we look for a prefix\n\
880 if R = 0. Other acceptable things are ints and longs.\n\
884 * Use `//' for division. MPs don't have `/' division.",
886 0, /* @tp_traverse@ */
888 0, /* @tp_richcompare@ */
889 0, /* @tp_weaklistoffset@ */
891 0, /* @tp_iternext@ */
892 mp_pymethods
, /* @tp_methods@ */
893 0, /* @tp_members@ */
894 mp_pygetset
, /* @tp_getset@ */
897 0, /* @tp_descr_get@ */
898 0, /* @tp_descr_set@ */
899 0, /* @tp_dictoffset@ */
901 PyType_GenericAlloc
, /* @tp_alloc@ */
902 mp_pynew
, /* @tp_new@ */
907 static PyObject
*meth__MP_fromstring(PyObject
*me
,
908 PyObject
*arg
, PyObject
*kw
)
916 char *kwlist
[] = { "class", "x", "radix", 0 };
918 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "Os#|i:fromstring",
919 kwlist
, &me
, &p
, &len
, &r
))
921 if (!good_radix_p(r
, 1)) VALERR("bad radix");
922 sc
.buf
= p
; sc
.lim
= p
+ len
;
923 if ((zz
= mp_read(MP_NEW
, r
, &mptext_stringops
, &sc
)) == 0)
924 VALERR("bad integer");
925 z
= Py_BuildValue("(Ns#)", mp_pywrap(zz
),
926 sc
.buf
, (Py_ssize_t
)(sc
.lim
- sc
.buf
));
931 static PyObject
*meth__MP_factorial(PyObject
*me
, PyObject
*arg
)
935 if (!PyArg_ParseTuple(arg
, "OO&:factorial", &me
, convulong
, &i
))
941 static PyObject
*meth__MP_fibonacci(PyObject
*me
, PyObject
*arg
)
945 if (!PyArg_ParseTuple(arg
, "Ol:fibonacci", &me
, &i
)) return (0);
950 #define LOADOP(pre, py, name) \
951 static PyObject *meth__##py##_##name(PyObject *me, PyObject *arg) \
955 if (!PyArg_ParseTuple(arg, "Os#:" #name, &me, &p, &len)) return (0); \
956 return (pre##_pywrap(mp_##name(MP_NEW, p, len))); \
958 LOADOP(mp
, MP
, loadl
)
959 LOADOP(mp
, MP
, loadb
)
960 LOADOP(mp
, MP
, loadl2c
)
961 LOADOP(mp
, MP
, loadb2c
)
962 LOADOP(gf
, GF
, loadl
)
963 LOADOP(gf
, GF
, loadb
)
966 /*----- Products of small integers ----------------------------------------*/
968 typedef struct mpmul_pyobj
{
974 #define MPMUL_LIVEP(o) (((mpmul_pyobj *)(o))->livep)
975 #define MPMUL_PY(o) (&((mpmul_pyobj *)(o))->mm)
977 static void mpmul_pydealloc(PyObject
*me
)
980 mp_drop(mpmul_done(MPMUL_PY(me
)));
984 static PyObject
*mmmeth_factor(PyObject
*me
, PyObject
*arg
)
989 if (!MPMUL_LIVEP(me
)) VALERR("MPMul object invalid");
990 if (PyTuple_Size(arg
) != 1)
991 i
= PyObject_GetIter(arg
);
993 if ((q
= PyTuple_GetItem(arg
, 0)) == 0) goto end
;
994 if ((i
= PyObject_GetIter(q
)) == 0) {
995 PyErr_Clear(); /* that's ok */
996 i
= PyObject_GetIter(arg
);
1000 while ((q
= PyIter_Next(i
)) != 0) {
1001 x
= getmp(q
); Py_DECREF(q
); if (!x
) {
1005 mpmul_add(MPMUL_PY(me
), x
);
1014 static PyObject
*mmmeth_done(PyObject
*me
, PyObject
*arg
)
1018 if (!PyArg_ParseTuple(arg
, ":done")) goto end
;
1019 if (!MPMUL_LIVEP(me
)) VALERR("MPMul object invalid");
1020 x
= mpmul_done(MPMUL_PY(me
));
1021 MPMUL_LIVEP(me
) = 0;
1022 return (mp_pywrap(x
));
1027 static PyObject
*mpmul_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1031 if (kw
) TYERR("keyword arguments not allowed here");
1032 mm
= (mpmul_pyobj
*)ty
->tp_alloc(ty
, 0);
1033 mpmul_init(&mm
->mm
);
1035 if (mmmeth_factor((PyObject
*)mm
, arg
) == 0) {
1039 return ((PyObject
*)mm
);
1044 static PyObject
*mmget_livep(PyObject
*me
, void *hunoz
)
1045 { return (getbool(MPMUL_LIVEP(me
))); }
1047 static PyGetSetDef mpmul_pygetset
[] = {
1048 #define GETSETNAME(op, name) mm##op##_##name
1049 GET (livep
, "MM.livep -> flag: object still valid?")
1054 static PyMethodDef mpmul_pymethods
[] = {
1055 #define METHNAME(name) mmmeth_##name
1056 METH (factor
, "MM.factor(ITERABLE) or MM.factor(I, ...)")
1057 METH (done
, "MM.done() -> PRODUCT")
1062 static PyTypeObject
*mpmul_pytype
, mpmul_pytype_skel
= {
1063 PyObject_HEAD_INIT(0) 0, /* Header */
1064 "MPMul", /* @tp_name@ */
1065 sizeof(mpmul_pyobj
), /* @tp_basicsize@ */
1066 0, /* @tp_itemsize@ */
1068 mpmul_pydealloc
, /* @tp_dealloc@ */
1070 0, /* @tp_getattr@ */
1071 0, /* @tp_setattr@ */
1072 0, /* @tp_compare@ */
1074 0, /* @tp_as_number@ */
1075 0, /* @tp_as_sequence@ */
1076 0, /* @tp_as_mapping@ */
1080 0, /* @tp_getattro@ */
1081 0, /* @tp_setattro@ */
1082 0, /* @tp_as_buffer@ */
1083 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1084 Py_TPFLAGS_BASETYPE
,
1087 "An object for multiplying many small integers.",
1089 0, /* @tp_traverse@ */
1091 0, /* @tp_richcompare@ */
1092 0, /* @tp_weaklistoffset@ */
1094 0, /* @tp_iternext@ */
1095 mpmul_pymethods
, /* @tp_methods@ */
1096 0, /* @tp_members@ */
1097 mpmul_pygetset
, /* @tp_getset@ */
1100 0, /* @tp_descr_get@ */
1101 0, /* @tp_descr_set@ */
1102 0, /* @tp_dictoffset@ */
1104 PyType_GenericAlloc
, /* @tp_alloc@ */
1105 mpmul_pynew
, /* @tp_new@ */
1110 /*----- Montgomery reduction ----------------------------------------------*/
1112 typedef struct mpmont_pyobj
{
1117 #define MPMONT_PY(o) (&((mpmont_pyobj *)(o))->mm)
1119 static PyObject
*mmmeth_int(PyObject
*me
, PyObject
*arg
)
1123 mpmont
*mm
= MPMONT_PY(me
);
1125 if (!PyArg_ParseTuple(arg
, "O&:in", convmp
, &yy
))
1127 mp_div(0, &yy
, yy
, mm
->m
);
1128 z
= mp_pywrap(mpmont_mul(mm
, MP_NEW
, yy
, mm
->r2
));
1130 if (yy
) MP_DROP(yy
);
1134 static PyObject
*mmmeth_mul(PyObject
*me
, PyObject
*arg
)
1137 mp
*yy
= 0, *zz
= 0;
1139 if (!PyArg_ParseTuple(arg
, "O&O&:mul", convmp
, &yy
, convmp
, &zz
))
1141 rc
= mp_pywrap(mpmont_mul(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1143 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1147 static PyObject
*mmmeth_exp(PyObject
*me
, PyObject
*arg
)
1150 mp
*yy
= 0, *zz
= 0;
1152 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1155 if ((yy
= mp_modinv_checked(yy
, yy
, MPMONT_PY(me
)->m
)) == 0) goto end
;
1156 zz
= mp_neg(zz
, zz
);
1158 rc
= mp_pywrap(mpmont_exp(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1160 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1164 static PyObject
*mmmeth_expr(PyObject
*me
, PyObject
*arg
)
1167 mp
*yy
= 0, *zz
= 0;
1169 if (!PyArg_ParseTuple(arg
, "O&O&:expr", convmp
, &yy
, convmp
, &zz
))
1172 yy
= mpmont_reduce(MPMONT_PY(me
), yy
, yy
);
1173 if ((yy
= mp_modinv_checked(yy
, yy
, MPMONT_PY(me
)->m
)) == 0) goto end
;
1174 yy
= mpmont_mul(MPMONT_PY(me
), yy
, yy
, MPMONT_PY(me
)->r2
);
1175 zz
= mp_neg(zz
, zz
);
1177 rc
= mp_pywrap(mpmont_expr(MPMONT_PY(me
), MP_NEW
, yy
, zz
));
1179 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1183 static PyObject
*mm_mexpr_id(PyObject
*me
)
1184 { return mp_pywrap(MP_COPY(MPMONT_PY(me
)->r
)); }
1186 static int mm_mexpr_fill(void *p
, PyObject
*me
, PyObject
*x
, PyObject
*y
)
1188 mp
*xx
= 0, *yy
= 0;
1189 mp_expfactor
*f
= p
;
1190 mpmont
*mm
= MPMONT_PY(me
);
1192 if ((xx
= getmp(x
)) == 0 || (yy
= getmp(y
)) == 0)
1195 xx
= mpmont_reduce(mm
, xx
, xx
);
1196 if ((xx
= mp_modinv_checked(xx
, xx
, yy
)) == 0)
1198 xx
= mpmont_mul(mm
, xx
, xx
, mm
->r2
);
1199 yy
= mp_neg(yy
, yy
);
1206 mp_drop(xx
); mp_drop(yy
);
1210 static PyObject
*mm_mexpr(PyObject
*me
, void *v
, int n
)
1211 { return mp_pywrap(mpmont_mexpr(MPMONT_PY(me
), MP_NEW
, v
, n
)); }
1213 static void mp_mexp_drop(void *p
)
1215 mp_expfactor
*f
= p
;
1220 static PyObject
*mmmeth_mexpr(PyObject
*me
, PyObject
*arg
)
1222 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1223 mm_mexpr_id
, mm_mexpr_fill
, mm_mexpr
, mp_mexp_drop
);
1226 static PyObject
*mp_mexp_id(PyObject
*me
)
1227 { return mp_pywrap(MP_ONE
); }
1229 static int mp_mexp_fill(void *p
, PyObject
*me
, PyObject
*x
, PyObject
*y
)
1231 mp
*xx
= 0, *yy
= 0;
1232 mp_expfactor
*f
= p
;
1234 if ((xx
= getmp(x
)) == 0 || (yy
= getmp(y
)) == 0)
1237 if ((xx
= mp_modinv_checked(xx
, xx
, yy
)) == 0)
1239 yy
= mp_neg(yy
, yy
);
1246 mp_drop(xx
); mp_drop(yy
);
1250 static PyObject
*mm_mexp(PyObject
*me
, void *v
, int n
)
1251 { return mp_pywrap(mpmont_mexp(MPMONT_PY(me
), MP_NEW
, v
, n
)); }
1253 static PyObject
*mmmeth_mexp(PyObject
*me
, PyObject
*arg
)
1255 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1256 mp_mexp_id
, mp_mexp_fill
, mm_mexp
, mp_mexp_drop
);
1259 #define mmmeth_ext mmmeth_reduce
1260 static PyObject
*mmmeth_reduce(PyObject
*me
, PyObject
*arg
)
1265 if (!PyArg_ParseTuple(arg
, "O&", convmp
, &yy
)) goto end
;
1266 z
= mp_pywrap(mpmont_reduce(MPMONT_PY(me
), MP_NEW
, yy
));
1271 static void mpmont_pydealloc(PyObject
*me
)
1273 mpmont_destroy(MPMONT_PY(me
));
1277 static PyObject
*mpmont_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1279 mpmont_pyobj
*mm
= 0;
1280 char *kwlist
[] = { "m", 0 };
1283 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1285 if (!MP_POSP(xx
) || !MP_ODDP(xx
)) VALERR("m must be positive and odd");
1286 mm
= (mpmont_pyobj
*)ty
->tp_alloc(ty
, 0);
1287 mpmont_create(&mm
->mm
, xx
);
1289 if (xx
) MP_DROP(xx
);
1290 return ((PyObject
*)mm
);
1293 static PyObject
*mmget_m(PyObject
*me
, void *hunoz
)
1294 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->m
))); }
1296 static PyObject
*mmget_r(PyObject
*me
, void *hunoz
)
1297 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->r
))); }
1299 static PyObject
*mmget_r2(PyObject
*me
, void *hunoz
)
1300 { return (mp_pywrap(MP_COPY(MPMONT_PY(me
)->r2
))); }
1302 static PyGetSetDef mpmont_pygetset
[] = {
1303 #define GETSETNAME(op, name) mm##op##_##name
1304 GET (m
, "M.m -> modulus for reduction")
1305 GET (r
, "M.r -> multiplicative identity")
1306 GET (r2
, "M.r2 -> M.r^2, Montgomerization factor")
1311 static PyMethodDef mpmont_pymethods
[] = {
1312 #define METHNAME(name) mmmeth_##name
1313 METH (int, "M.int(X) -> XR")
1314 METH (mul
, "M.mul(XR, YR) -> ZR where Z = X Y")
1315 METH (expr
, "M.expr(XR, N) -> ZR where Z = X^N mod M.m")
1317 M.mexpr([(XR0, N0), (XR1, N1), ...]) = ZR where Z = X0^N0 X1^N1 ... mod M.m\n\
1318 \t(the list may be flattened if this more convenient.)")
1319 METH (reduce
, "M.reduce(XR) -> X")
1320 METH (ext
, "M.ext(XR) -> X")
1321 METH (exp
, "M.exp(X, N) -> X^N mod M.m")
1323 M.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod M.m\n\
1324 \t(the list may be flattened if this more convenient.)")
1329 static PyTypeObject
*mpmont_pytype
, mpmont_pytype_skel
= {
1330 PyObject_HEAD_INIT(0) 0, /* Header */
1331 "MPMont", /* @tp_name@ */
1332 sizeof(mpmont_pyobj
), /* @tp_basicsize@ */
1333 0, /* @tp_itemsize@ */
1335 mpmont_pydealloc
, /* @tp_dealloc@ */
1337 0, /* @tp_getattr@ */
1338 0, /* @tp_setattr@ */
1339 0, /* @tp_compare@ */
1341 0, /* @tp_as_number@ */
1342 0, /* @tp_as_sequence@ */
1343 0, /* @tp_as_mapping@ */
1347 0, /* @tp_getattro@ */
1348 0, /* @tp_setattro@ */
1349 0, /* @tp_as_buffer@ */
1350 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1351 Py_TPFLAGS_BASETYPE
,
1354 "A Montgomery reduction context.",
1356 0, /* @tp_traverse@ */
1358 0, /* @tp_richcompare@ */
1359 0, /* @tp_weaklistoffset@ */
1361 0, /* @tp_iternext@ */
1362 mpmont_pymethods
, /* @tp_methods@ */
1363 0, /* @tp_members@ */
1364 mpmont_pygetset
, /* @tp_getset@ */
1367 0, /* @tp_descr_get@ */
1368 0, /* @tp_descr_set@ */
1369 0, /* @tp_dictoffset@ */
1371 PyType_GenericAlloc
, /* @tp_alloc@ */
1372 mpmont_pynew
, /* @tp_new@ */
1377 /*----- Barrett reduction -------------------------------------------------*/
1379 typedef struct mpbarrett_pyobj
{
1384 #define MPBARRETT_PY(o) (&((mpbarrett_pyobj *)(o))->mb)
1386 static PyObject
*mbmeth_exp(PyObject
*me
, PyObject
*arg
)
1389 mp
*yy
= 0, *zz
= 0;
1391 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1394 if ((yy
= mp_modinv_checked(yy
, yy
, MPBARRETT_PY(me
)->m
)) == 0) goto end
;
1395 zz
= mp_neg(zz
, zz
);
1397 rc
= mp_pywrap(mpbarrett_exp(MPBARRETT_PY(me
), MP_NEW
, yy
, zz
));
1399 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1403 static PyObject
*mb_mexp(PyObject
*me
, void *v
, int n
)
1404 { return mp_pywrap(mpbarrett_mexp(MPBARRETT_PY(me
), MP_NEW
, v
, n
)); }
1406 static PyObject
*mbmeth_mexp(PyObject
*me
, PyObject
*arg
)
1408 return mexp_common(me
, arg
, sizeof(mp_expfactor
),
1409 mp_mexp_id
, mp_mexp_fill
, mb_mexp
, mp_mexp_drop
);
1412 static PyObject
*mbmeth_reduce(PyObject
*me
, PyObject
*arg
)
1417 if (!PyArg_ParseTuple(arg
, "O&:reduce", convmp
, &yy
))
1419 z
= mp_pywrap(mpbarrett_reduce(MPBARRETT_PY(me
), MP_NEW
, yy
));
1424 static void mpbarrett_pydealloc(PyObject
*me
)
1426 mpbarrett_destroy(MPBARRETT_PY(me
));
1430 static PyObject
*mpbarrett_pynew(PyTypeObject
*ty
,
1431 PyObject
*arg
, PyObject
*kw
)
1433 mpbarrett_pyobj
*mb
= 0;
1434 char *kwlist
[] = { "m", 0 };
1437 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1439 if (!MP_POSP(xx
)) VALERR("m must be positive");
1440 mb
= (mpbarrett_pyobj
*)ty
->tp_alloc(ty
, 0);
1441 mpbarrett_create(&mb
->mb
, xx
);
1443 if (xx
) MP_DROP(xx
);
1444 return ((PyObject
*)mb
);
1447 static PyObject
*mbget_m(PyObject
*me
, void *hunoz
)
1448 { return (mp_pywrap(MP_COPY(MPBARRETT_PY(me
)->m
))); }
1450 static PyGetSetDef mpbarrett_pygetset
[] = {
1451 #define GETSETNAME(op, name) mb##op##_##name
1452 GET (m
, "B.m -> modulus for reduction")
1457 static PyMethodDef mpbarrett_pymethods
[] = {
1458 #define METHNAME(name) mbmeth_##name
1459 METH (reduce
, "B.reduce(X) -> X mod B.m")
1460 METH (exp
, "B.exp(X, N) -> X^N mod B.m")
1462 B.mexp([(X0, N0), (X1, N1), ...]) = X0^N0 X1^N1 ... mod B.m\n\
1463 \t(the list may be flattened if this more convenient.)")
1468 static PyTypeObject
*mpbarrett_pytype
, mpbarrett_pytype_skel
= {
1469 PyObject_HEAD_INIT(0) 0, /* Header */
1470 "MPBarrett", /* @tp_name@ */
1471 sizeof(mpbarrett_pyobj
), /* @tp_basicsize@ */
1472 0, /* @tp_itemsize@ */
1474 mpbarrett_pydealloc
, /* @tp_dealloc@ */
1476 0, /* @tp_getattr@ */
1477 0, /* @tp_setattr@ */
1478 0, /* @tp_compare@ */
1480 0, /* @tp_as_number@ */
1481 0, /* @tp_as_sequence@ */
1482 0, /* @tp_as_mapping@ */
1486 0, /* @tp_getattro@ */
1487 0, /* @tp_setattro@ */
1488 0, /* @tp_as_buffer@ */
1489 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1490 Py_TPFLAGS_BASETYPE
,
1493 "A Barrett reduction context.",
1495 0, /* @tp_traverse@ */
1497 0, /* @tp_richcompare@ */
1498 0, /* @tp_weaklistoffset@ */
1500 0, /* @tp_iternext@ */
1501 mpbarrett_pymethods
, /* @tp_methods@ */
1502 0, /* @tp_members@ */
1503 mpbarrett_pygetset
, /* @tp_getset@ */
1506 0, /* @tp_descr_get@ */
1507 0, /* @tp_descr_set@ */
1508 0, /* @tp_dictoffset@ */
1510 PyType_GenericAlloc
, /* @tp_alloc@ */
1511 mpbarrett_pynew
, /* @tp_new@ */
1516 /*----- Nice prime reduction ----------------------------------------------*/
1518 typedef struct mpreduce_pyobj
{
1523 #define MPREDUCE_PY(o) (&((mpreduce_pyobj *)(o))->mr)
1525 static PyObject
*mrmeth_exp(PyObject
*me
, PyObject
*arg
)
1528 mp
*yy
= 0, *zz
= 0;
1530 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convmp
, &yy
, convmp
, &zz
))
1533 if ((yy
= mp_modinv_checked(yy
, yy
, MPREDUCE_PY(me
)->p
)) == 0) goto end
;
1534 zz
= mp_neg(zz
, zz
);
1536 rc
= mp_pywrap(mpreduce_exp(MPREDUCE_PY(me
), MP_NEW
, yy
, zz
));
1538 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
1542 static PyObject
*mrmeth_reduce(PyObject
*me
, PyObject
*arg
)
1547 if (!PyArg_ParseTuple(arg
, "O&:reduce", convmp
, &yy
)) goto end
;
1548 z
= mp_pywrap(mpreduce_do(MPREDUCE_PY(me
), MP_NEW
, yy
));
1553 static void mpreduce_pydealloc(PyObject
*me
)
1555 mpreduce_destroy(MPREDUCE_PY(me
));
1559 static PyObject
*mpreduce_pynew(PyTypeObject
*ty
,
1560 PyObject
*arg
, PyObject
*kw
)
1562 mpreduce_pyobj
*mr
= 0;
1564 char *kwlist
[] = { "m", 0 };
1567 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convmp
, &xx
))
1569 if (!MP_POSP(xx
)) VALERR("m must be positive");
1570 if (mpreduce_create(&r
, xx
)) VALERR("bad modulus (must be 2^k - ...)");
1571 mr
= (mpreduce_pyobj
*)ty
->tp_alloc(ty
, 0);
1574 if (xx
) MP_DROP(xx
);
1575 return ((PyObject
*)mr
);
1578 static PyObject
*mrget_m(PyObject
*me
, void *hunoz
)
1579 { return (mp_pywrap(MP_COPY(MPREDUCE_PY(me
)->p
))); }
1581 static PyGetSetDef mpreduce_pygetset
[] = {
1582 #define GETSETNAME(op, name) mr##op##_##name
1583 GET (m
, "R.m -> modulus for reduction")
1588 static PyMethodDef mpreduce_pymethods
[] = {
1589 #define METHNAME(name) mrmeth_##name
1590 METH (reduce
, "R.reduce(X) -> X mod B.m")
1591 METH (exp
, "R.exp(X, N) -> X^N mod B.m")
1596 static PyTypeObject
*mpreduce_pytype
, mpreduce_pytype_skel
= {
1597 PyObject_HEAD_INIT(0) 0, /* Header */
1598 "MPReduce", /* @tp_name@ */
1599 sizeof(mpreduce_pyobj
), /* @tp_basicsize@ */
1600 0, /* @tp_itemsize@ */
1602 mpreduce_pydealloc
, /* @tp_dealloc@ */
1604 0, /* @tp_getattr@ */
1605 0, /* @tp_setattr@ */
1606 0, /* @tp_compare@ */
1608 0, /* @tp_as_number@ */
1609 0, /* @tp_as_sequence@ */
1610 0, /* @tp_as_mapping@ */
1614 0, /* @tp_getattro@ */
1615 0, /* @tp_setattro@ */
1616 0, /* @tp_as_buffer@ */
1617 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1618 Py_TPFLAGS_BASETYPE
,
1621 "A reduction context for reduction modulo primes of special form.",
1623 0, /* @tp_traverse@ */
1625 0, /* @tp_richcompare@ */
1626 0, /* @tp_weaklistoffset@ */
1628 0, /* @tp_iternext@ */
1629 mpreduce_pymethods
, /* @tp_methods@ */
1630 0, /* @tp_members@ */
1631 mpreduce_pygetset
, /* @tp_getset@ */
1634 0, /* @tp_descr_get@ */
1635 0, /* @tp_descr_set@ */
1636 0, /* @tp_dictoffset@ */
1638 PyType_GenericAlloc
, /* @tp_alloc@ */
1639 mpreduce_pynew
, /* @tp_new@ */
1644 /*----- Chinese Remainder Theorem solution --------------------------------*/
1646 typedef struct mpcrt_pyobj
{
1651 #define MPCRT_PY(o) (&((mpcrt_pyobj *)(o))->c)
1653 static PyObject
*mcmeth_solve(PyObject
*me
, PyObject
*arg
)
1655 mpcrt
*c
= MPCRT_PY(me
);
1656 PyObject
*q
= 0, *x
, *z
= 0;
1659 int i
= 0, n
= c
->k
;
1662 if (PyTuple_Size(arg
) == n
)
1664 else if (!PyArg_ParseTuple(arg
, "O:solve", &q
))
1667 if (!PySequence_Check(q
)) TYERR("want a sequence of residues");
1668 if (PySequence_Size(q
) != n
) VALERR("residue count mismatch");
1669 v
= xmalloc(n
* sizeof(*v
));
1670 for (i
= 0; i
< n
; i
++) {
1671 if ((x
= PySequence_GetItem(q
, i
)) == 0) goto end
;
1672 xx
= getmp(x
); Py_DECREF(x
); if (!xx
) goto end
;
1675 z
= mp_pywrap(mpcrt_solve(c
, MP_NEW
, v
));
1679 for (i
= 0; i
< n
; i
++)
1688 static void mpcrt_pydealloc(PyObject
*me
)
1690 mpcrt
*c
= MPCRT_PY(me
);
1695 static PyObject
*mpcrt_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1699 char *kwlist
[] = { "mv", 0 };
1700 PyObject
*q
= 0, *x
;
1704 if (PyTuple_Size(arg
) > 1)
1706 else if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O:new", kwlist
, &q
))
1709 if (!PySequence_Check(q
)) TYERR("want a sequence of moduli");
1710 n
= PySequence_Size(q
);
1711 if (PyErr_Occurred()) goto end
;
1712 if (!n
) VALERR("want at least one modulus");
1713 v
= xmalloc(n
* sizeof(*v
));
1714 for (i
= 0; i
< n
; i
++) {
1715 if ((x
= PySequence_GetItem(q
, i
)) == 0) goto end
;
1716 xx
= getmp(x
); Py_DECREF(x
); if (!xx
) goto end
;
1717 v
[i
].m
= xx
; v
[i
].n
= 0; v
[i
].ni
= 0; v
[i
].nni
= 0;
1719 c
= (mpcrt_pyobj
*)ty
->tp_alloc(ty
, 0);
1720 mpcrt_create(&c
->c
, v
, n
, 0);
1722 return ((PyObject
*)c
);
1727 for (i
= 0; i
< n
; i
++)
1735 static PyObject
*mcget_product(PyObject
*me
, void *hunoz
)
1736 { return (mp_pywrap(MP_COPY(MPCRT_PY(me
)->mb
.m
))); }
1738 static PyObject
*mcget_moduli(PyObject
*me
, void *hunoz
)
1742 mpcrt
*c
= MPCRT_PY(me
);
1744 if ((q
= PyList_New(c
->k
)) == 0) return (0);
1745 for (i
= 0; i
< c
->k
; i
++)
1746 PyList_SetItem(q
, i
, mp_pywrap(c
->v
[i
].m
));
1750 static PyGetSetDef mpcrt_pygetset
[] = {
1751 #define GETSETNAME(op, name) mc##op##_##name
1752 GET (product
, "C.product -> product of moduli")
1753 GET (moduli
, "C.moduli -> list of individual moduli")
1758 static PyMethodDef mpcrt_pymethods
[] = {
1759 #define METHNAME(name) mcmeth_##name
1760 METH (solve
, "C.solve([R0, R1]) -> X mod C.product")
1765 static PyTypeObject
*mpcrt_pytype
, mpcrt_pytype_skel
= {
1766 PyObject_HEAD_INIT(0) 0, /* Header */
1767 "MPCRT", /* @tp_name@ */
1768 sizeof(mpcrt_pyobj
), /* @tp_basicsize@ */
1769 0, /* @tp_itemsize@ */
1771 mpcrt_pydealloc
, /* @tp_dealloc@ */
1773 0, /* @tp_getattr@ */
1774 0, /* @tp_setattr@ */
1775 0, /* @tp_compare@ */
1777 0, /* @tp_as_number@ */
1778 0, /* @tp_as_sequence@ */
1779 0, /* @tp_as_mapping@ */
1783 0, /* @tp_getattro@ */
1784 0, /* @tp_setattro@ */
1785 0, /* @tp_as_buffer@ */
1786 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
1787 Py_TPFLAGS_BASETYPE
,
1790 "A context for the solution of Chinese Remainder Theorem problems.",
1792 0, /* @tp_traverse@ */
1794 0, /* @tp_richcompare@ */
1795 0, /* @tp_weaklistoffset@ */
1797 0, /* @tp_iternext@ */
1798 mpcrt_pymethods
, /* @tp_methods@ */
1799 0, /* @tp_members@ */
1800 mpcrt_pygetset
, /* @tp_getset@ */
1803 0, /* @tp_descr_get@ */
1804 0, /* @tp_descr_set@ */
1805 0, /* @tp_dictoffset@ */
1807 PyType_GenericAlloc
, /* @tp_alloc@ */
1808 mpcrt_pynew
, /* @tp_new@ */
1813 /*----- Binary polynomials ------------------------------------------------*/
1815 static PyObject
*gf_pyrepr(PyObject
*o
)
1816 { return mp_topystring(MP_X(o
), 16, "GF(", "0x", "L)"); }
1818 static PyObject
*gf_pyrichcompare(PyObject
*x
, PyObject
*y
, int op
)
1824 if (gfbinop(x
, y
, &xx
, &yy
)) RETURN_NOTIMPL
;
1826 case Py_EQ
: b
= MP_EQ(xx
, yy
); break;
1827 case Py_NE
: b
= !MP_EQ(xx
, yy
); break;
1832 case Py_LT
: b
= xl
< yl
; break;
1833 case Py_LE
: b
= xl
<= yl
; break;
1834 case Py_GT
: b
= xl
> yl
; break;
1835 case Py_GE
: b
= xl
>= yl
; break;
1840 MP_DROP(xx
); MP_DROP(yy
);
1841 return (getbool(b
));
1844 static PyObject
*gf_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
1850 char *kwlist
[] = { "x", "radix", 0 };
1852 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O|i:gf", kwlist
, &x
, &radix
))
1854 if (GF_PYCHECK(x
)) RETURN_OBJ(x
);
1855 if (!good_radix_p(radix
, 1)) VALERR("radix out of range");
1856 if ((z
= mp_frompyobject(x
, radix
)) == 0) {
1857 PyErr_Format(PyExc_TypeError
, "can't convert %.100s to gf",
1858 x
->ob_type
->tp_name
);
1863 VALERR("gf cannot be negative");
1865 zz
= (mp_pyobj
*)ty
->tp_alloc(ty
, 0);
1868 return ((PyObject
*)zz
);
1871 static long gf_pyhash(PyObject
*me
)
1873 long i
= mp_tolong(MP_X(me
));
1874 i
^= 0xc7ecd67c; /* random perturbance */
1880 static PyObject
*gf_pyexp(PyObject
*x
, PyObject
*y
, PyObject
*z
)
1882 mp
*xx
= 0, *yy
= 0, *zz
= 0;
1886 if ((xx
= tomp(x
)) == 0 || (yy
= tomp(y
)) == 0 ||
1887 (z
&& z
!= Py_None
&& (zz
= tomp(z
)) == 0)) {
1888 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
1891 if (!z
|| z
== Py_None
) {
1892 if (MP_NEGP(yy
)) VALERR("negative exponent");
1893 r
= gf_exp(MP_NEW
, xx
, yy
);
1896 if (MP_ZEROP(zz
)) ZDIVERR("zero modulus");
1898 if ((xx
= gf_modinv_checked(xx
, xx
, zz
)) == 0) goto end
;
1899 yy
= mp_neg(yy
, yy
);
1901 gfreduce_create(&gr
, zz
);
1902 r
= gfreduce_exp(&gr
, MP_NEW
, xx
, yy
);
1903 gfreduce_destroy(&gr
);
1907 mp_drop(xx
); mp_drop(yy
); mp_drop(zz
);
1911 static PyObject
*gfmeth_sqr(PyObject
*me
, PyObject
*arg
)
1913 if (!PyArg_ParseTuple(arg
, ":sqr")) return (0);
1914 return (gf_pywrap(gf_sqr(MP_NEW
, MP_X(me
))));
1917 static PyObject
*gfmeth_gcd(PyObject
*me
, PyObject
*arg
)
1920 mp
*yy
= 0, *zz
= MP_NEW
;
1922 if (!PyArg_ParseTuple(arg
, "O&:gcd", convgf
, &yy
)) goto end
;
1923 gf_gcd(&zz
, 0, 0, MP_X(me
), yy
);
1926 if (yy
) MP_DROP(yy
);
1930 static PyObject
*gfmeth_gcdx(PyObject
*me
, PyObject
*arg
)
1933 mp
*yy
= 0, *zz
= MP_NEW
, *uu
= MP_NEW
, *vv
= MP_NEW
;
1935 if (!PyArg_ParseTuple(arg
, "O&:gcdx", convgf
, &yy
))
1937 gf_gcd(&zz
, &uu
, &vv
, MP_X(me
), yy
);
1938 z
= Py_BuildValue("(NNN)",
1939 gf_pywrap(zz
), gf_pywrap(uu
), gf_pywrap(vv
));
1941 if (yy
) MP_DROP(yy
);
1945 static PyObject
*gfmeth_modinv(PyObject
*me
, PyObject
*arg
)
1948 mp
*yy
= 0, *zz
= MP_NEW
;
1950 if (!PyArg_ParseTuple(arg
, "O&:modinv", convgf
, &yy
) ||
1951 (zz
= gf_modinv_checked(MP_NEW
, yy
, MP_X(me
))) == 0)
1955 if (yy
) MP_DROP(yy
);
1959 static PyObject
*gfmeth_irreduciblep(PyObject
*me
, PyObject
*arg
)
1961 if (!PyArg_ParseTuple(arg
, ":irreduciblep")) return (0);
1962 return getbool(gf_irreduciblep(MP_X(me
)));
1965 static PyObject
*gfget_degree(PyObject
*me
, void *hunoz
)
1966 { return (PyInt_FromLong(mp_bits(MP_X(me
)) - 1)); }
1968 static PyGetSetDef gf_pygetset
[] = {
1969 #define GETSETNAME(op, name) gf##op##_##name
1970 GET (degree
, "X.degree -> polynomial degree of X")
1972 #define GETSETNAME(op, name) mp##op##_##name
1973 GET (nbits
, "X.nbits -> bit length of X")
1974 GET (noctets
, "X.noctets -> octet length of X")
1979 static PyMethodDef gf_pymethods
[] = {
1980 #define METHNAME(func) gfmeth_##func
1981 METH (setbit
, "X.setbit(N) -> X with bit N set")
1982 METH (clearbit
, "X.clearbit(N) -> X with bit N clear")
1983 METH (testbit
, "X.testbit(N) -> true/false if bit N set/clear in X")
1984 METH (sqr
, "X.sqr() -> X^2")
1985 METH (gcd
, "X.gcd(Y) -> gcd(X, Y)")
1987 "X.gcdx(Y) -> (gcd(X, Y), U, V) with X U + Y V = gcd(X, Y)")
1988 METH (modinv
, "X.modinv(Y) -> multiplicative inverse of Y mod X")
1989 METH (irreduciblep
, "X.irreduciblep() -> true/false")
1991 #define METHNAME(func) mpmeth_##func
1992 KWMETH(tostring
, "X.tostring(radix = 10) -> STR")
1993 KWMETH(storel
, "X.storel(len = -1) -> little-endian bytes")
1994 KWMETH(storeb
, "X.storeb(len = -1) -> big-endian bytes")
1996 "X.storel2c(len = -1) -> little-endian bytes, two's complement")
1998 "X.storeb2c(len = -1) -> big-endian bytes, two's complement")
1999 METH (tobuf
, "X.tobuf() -> buffer format")
2004 static PyNumberMethods gf_pynumber
= {
2005 gf_pyadd
, /* @nb_add@ */
2006 gf_pysub
, /* @nb_subtract@ */
2007 gf_pymul
, /* @nb_multiply@ */
2008 0, /* @nb_divide@ */
2009 gf_pymod
, /* @nb_remainder@ */
2010 gf_pydivmod
, /* @nb_divmod@ */
2011 gf_pyexp
, /* @nb_power@ */
2012 mp_pyid
, /* @nb_negative@ */
2013 mp_pyid
, /* @nb_positive@ */
2014 mp_pyid
, /* @nb_absolute@ */
2015 mp_pynonzerop
, /* @nb_nonzero@ */
2016 0 /* doesn't make any sense */, /* @nb_invert@ */
2017 gf_pylsl
, /* @nb_lshift@ */
2018 gf_pylsr
, /* @nb_rshift@ */
2019 gf_pyand
, /* @nb_and@ */
2020 gf_pyxor
, /* @nb_xor@ */
2021 gf_pyor
, /* @nb_or@ */
2022 gf_pycoerce
, /* @nb_coerce@ */
2023 mp_pyint
, /* @nb_int@ */
2024 mp_pylong
, /* @nb_long@ */
2025 0 /* doesn't make any sense */, /* @nb_float@ */
2026 mp_pyoct
, /* @nb_oct@ */
2027 mp_pyhex
, /* @nb_hex@ */
2029 0, /* @nb_inplace_add@ */
2030 0, /* @nb_inplace_subtract@ */
2031 0, /* @nb_inplace_multiply@ */
2032 0, /* @nb_inplace_divide@ */
2033 0, /* @nb_inplace_remainder@ */
2034 0, /* @nb_inplace_power@ */
2035 0, /* @nb_inplace_lshift@ */
2036 0, /* @nb_inplace_rshift@ */
2037 0, /* @nb_inplace_and@ */
2038 0, /* @nb_inplace_xor@ */
2039 0, /* @nb_inplace_or@ */
2041 gf_pydiv
, /* @nb_floor_divide@ */
2042 0, /* @nb_true_divide@ */
2043 0, /* @nb_inplace_floor_divide@ */
2044 0, /* @nb_inplace_true_divide@ */
2047 static PyTypeObject gf_pytype_skel
= {
2048 PyObject_HEAD_INIT(0) 0, /* Header */
2049 "GF", /* @tp_name@ */
2050 sizeof(mp_pyobj
), /* @tp_basicsize@ */
2051 0, /* @tp_itemsize@ */
2053 mp_pydealloc
, /* @tp_dealloc@ */
2055 0, /* @tp_getattr@ */
2056 0, /* @tp_setattr@ */
2057 0, /* @tp_compare@ */
2058 gf_pyrepr
, /* @tp_repr@ */
2059 &gf_pynumber
, /* @tp_as_number@ */
2060 0, /* @tp_as_sequence@ */
2061 0, /* @tp_as_mapping@ */
2062 gf_pyhash
, /* @tp_hash@ */
2064 mp_pyhex
, /* @tp_str@ */
2065 0, /* @tp_getattro@ */
2066 0, /* @tp_setattro@ */
2067 0, /* @tp_as_buffer@ */
2068 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2069 Py_TPFLAGS_CHECKTYPES
|
2070 Py_TPFLAGS_BASETYPE
,
2073 "Binary polynomials. Support almost all the standard arithmetic\n\
2076 Constructor gf(X, radix = R) attempts to convert X to a `gf'. If\n\
2077 X is a string, it's read in radix-R form, or we look for a prefix\n\
2078 if R = 0. Other acceptable things are ints and longs.\n\
2080 The name is hopelessly wrong from a technical point of view, but\n\
2081 but it's much easier to type than `p2' or `c2' or whatever.\n\
2085 * Use `//' for division. GFs don't have `/' division.",
2087 0, /* @tp_traverse@ */
2089 gf_pyrichcompare
, /* @tp_richcompare@ */
2090 0, /* @tp_weaklistoffset@ */
2092 0, /* @tp_iternext@ */
2093 gf_pymethods
, /* @tp_methods@ */
2094 0, /* @tp_members@ */
2095 gf_pygetset
, /* @tp_getset@ */
2098 0, /* @tp_descr_get@ */
2099 0, /* @tp_descr_set@ */
2100 0, /* @tp_dictoffset@ */
2102 PyType_GenericAlloc
, /* @tp_alloc@ */
2103 gf_pynew
, /* @tp_new@ */
2108 static PyObject
*meth__GF_fromstring(PyObject
*me
,
2109 PyObject
*arg
, PyObject
*kw
)
2116 mptext_stringctx sc
;
2117 char *kwlist
[] = { "class", "x", "radix", 0 };
2119 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "Os#|i:fromstring",
2120 kwlist
, &me
, &p
, &len
, &r
))
2122 if (!good_radix_p(r
, 1)) VALERR("bad radix");
2123 sc
.buf
= p
; sc
.lim
= p
+ len
;
2124 if ((zz
= mp_read(MP_NEW
, r
, &mptext_stringops
, &sc
)) == 0 ||
2126 if (zz
) MP_DROP(zz
);
2127 VALERR("bad binary polynomial");
2129 z
= Py_BuildValue("(Ns#)", gf_pywrap(zz
),
2130 sc
.buf
, (Py_ssize_t
)(sc
.lim
- sc
.buf
));
2135 /*----- Sparse poly reduction ---------------------------------------------*/
2137 typedef struct gfreduce_pyobj
{
2142 #define GFREDUCE_PY(o) (&((gfreduce_pyobj *)(o))->mr)
2144 static PyObject
*grmeth_exp(PyObject
*me
, PyObject
*arg
)
2147 mp
*yy
= 0, *zz
= 0;
2149 if (!PyArg_ParseTuple(arg
, "O&O&:exp", convgf
, &yy
, convgf
, &zz
))
2152 if ((yy
= gf_modinv_checked(yy
, yy
, GFREDUCE_PY(me
)->p
)) == 0) goto end
;
2153 zz
= mp_neg(zz
, zz
);
2155 rc
= gf_pywrap(gfreduce_exp(GFREDUCE_PY(me
), MP_NEW
, yy
, zz
));
2157 if (yy
) MP_DROP(yy
); if (zz
) MP_DROP(zz
);
2161 static PyObject
*grmeth_trace(PyObject
*me
, PyObject
*arg
)
2166 if (!PyArg_ParseTuple(arg
, "O&:trace", convgf
, &xx
)) goto end
;
2167 rc
= PyInt_FromLong(gfreduce_trace(GFREDUCE_PY(me
), xx
));
2169 if (xx
) MP_DROP(xx
);
2173 static PyObject
*grmeth_halftrace(PyObject
*me
, PyObject
*arg
)
2178 if (!PyArg_ParseTuple(arg
, "O&:halftrace", convgf
, &xx
)) goto end
;
2179 rc
= gf_pywrap(gfreduce_halftrace(GFREDUCE_PY(me
), MP_NEW
, xx
));
2181 if (xx
) MP_DROP(xx
);
2185 static PyObject
*grmeth_sqrt(PyObject
*me
, PyObject
*arg
)
2190 if (!PyArg_ParseTuple(arg
, "O&:sqrt", convgf
, &xx
)) goto end
;
2191 if ((yy
= gfreduce_sqrt(GFREDUCE_PY(me
), MP_NEW
, xx
)) == 0)
2192 VALERR("no modular square root");
2195 if (xx
) MP_DROP(xx
);
2199 static PyObject
*grmeth_quadsolve(PyObject
*me
, PyObject
*arg
)
2204 if (!PyArg_ParseTuple(arg
, "O&:quadsolve", convgf
, &xx
)) goto end
;
2205 if ((yy
= gfreduce_quadsolve(GFREDUCE_PY(me
), MP_NEW
, xx
)) == 0)
2206 VALERR("no solution found");
2209 if (xx
) MP_DROP(xx
);
2213 static PyObject
*grmeth_reduce(PyObject
*me
, PyObject
*arg
)
2218 if (!PyArg_ParseTuple(arg
, "O&:reduce", convgf
, &yy
)) goto end
;
2219 z
= gf_pywrap(gfreduce_do(GFREDUCE_PY(me
), MP_NEW
, yy
));
2224 static void gfreduce_pydealloc(PyObject
*me
)
2226 gfreduce_destroy(GFREDUCE_PY(me
));
2230 static PyObject
*gfreduce_pynew(PyTypeObject
*ty
,
2231 PyObject
*arg
, PyObject
*kw
)
2233 gfreduce_pyobj
*mr
= 0;
2235 char *kwlist
[] = { "m", 0 };
2238 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&:new", kwlist
, convgf
, &xx
))
2240 if (MP_ZEROP(xx
)) ZDIVERR("modulus is zero!");
2241 gfreduce_create(&r
, xx
);
2242 mr
= (gfreduce_pyobj
*)ty
->tp_alloc(ty
, 0);
2245 if (xx
) MP_DROP(xx
);
2246 return ((PyObject
*)mr
);
2249 static PyObject
*grget_m(PyObject
*me
, void *hunoz
)
2250 { return (gf_pywrap(MP_COPY(GFREDUCE_PY(me
)->p
))); }
2252 static PyGetSetDef gfreduce_pygetset
[] = {
2253 #define GETSETNAME(op, name) gr##op##_##name
2254 GET (m
, "R.m -> reduction polynomial")
2259 static PyMethodDef gfreduce_pymethods
[] = {
2260 #define METHNAME(name) grmeth_##name
2261 METH (reduce
, "R.reduce(X) -> X mod B.m")
2262 METH (trace
, "R.trace(X) -> Tr(X) = x + x^2 + ... + x^{2^{m - 1}}")
2263 METH (halftrace
, "R.halftrace(X) -> x + x^{2^2} + ... + x^{2^{m - 1}}")
2264 METH (sqrt
, "R.sqrt(X) -> Y where Y^2 = X mod R")
2265 METH (quadsolve
, "R.quadsolve(X) -> Y where Y^2 + Y = X mod R")
2266 METH (exp
, "R.exp(X, N) -> X^N mod B.m")
2271 static PyTypeObject
*gfreduce_pytype
, gfreduce_pytype_skel
= {
2272 PyObject_HEAD_INIT(0) 0, /* Header */
2273 "GFReduce", /* @tp_name@ */
2274 sizeof(gfreduce_pyobj
), /* @tp_basicsize@ */
2275 0, /* @tp_itemsize@ */
2277 gfreduce_pydealloc
, /* @tp_dealloc@ */
2279 0, /* @tp_getattr@ */
2280 0, /* @tp_setattr@ */
2281 0, /* @tp_compare@ */
2283 0, /* @tp_as_number@ */
2284 0, /* @tp_as_sequence@ */
2285 0, /* @tp_as_mapping@ */
2289 0, /* @tp_getattro@ */
2290 0, /* @tp_setattro@ */
2291 0, /* @tp_as_buffer@ */
2292 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2293 Py_TPFLAGS_BASETYPE
,
2296 "A reduction context for reduction modulo sparse irreducible polynomials.",
2298 0, /* @tp_traverse@ */
2300 0, /* @tp_richcompare@ */
2301 0, /* @tp_weaklistoffset@ */
2303 0, /* @tp_iternext@ */
2304 gfreduce_pymethods
, /* @tp_methods@ */
2305 0, /* @tp_members@ */
2306 gfreduce_pygetset
, /* @tp_getset@ */
2309 0, /* @tp_descr_get@ */
2310 0, /* @tp_descr_set@ */
2311 0, /* @tp_dictoffset@ */
2313 PyType_GenericAlloc
, /* @tp_alloc@ */
2314 gfreduce_pynew
, /* @tp_new@ */
2319 /*----- Normal/poly transformation ----------------------------------------*/
2321 typedef struct gfn_pyobj
{
2327 static PyTypeObject
*gfn_pytype
, gfn_pytype_skel
;
2329 #define GFN_P(o) (((gfn_pyobj *)(o))->p)
2330 #define GFN_PTON(o) (&((gfn_pyobj *)(o))->pton)
2331 #define GFN_NTOP(o) (&((gfn_pyobj *)(o))->ntop)
2333 static PyObject
*gfn_pynew(PyTypeObject
*ty
, PyObject
*arg
, PyObject
*kw
)
2335 mp
*p
= 0, *beta
= 0;
2337 char *kwlist
[] = { "p", "beta", 0 };
2339 if (!PyArg_ParseTupleAndKeywords(arg
, kw
, "O&O&:new", kwlist
,
2340 convgf
, &p
, convgf
, &beta
))
2342 gg
= PyObject_New(gfn_pyobj
, ty
);
2343 if (gfn_create(p
, beta
, &gg
->ntop
, &gg
->pton
)) {
2346 VALERR("can't invert transformation matrix");
2352 return ((PyObject
*)gg
);
2355 static PyObject
*gfnget_p(PyObject
*me
, void *hunoz
)
2356 { return (gf_pywrap(MP_COPY(GFN_P(me
)))); }
2358 static PyObject
*gfnget_beta(PyObject
*me
, void *hunoz
)
2360 gfn
*n
= GFN_NTOP(me
);
2361 mp
*x
= n
->r
[n
->n
- 1];
2362 return (gf_pywrap(MP_COPY(x
)));
2365 #define XFORMOP(name, NAME) \
2366 static PyObject *gfnmeth_##name(PyObject *me, PyObject *arg) \
2371 if (!PyArg_ParseTuple(arg, "O&:" #name, convgf, &xx)) goto end; \
2372 z = gfn_transform(GFN_##NAME(me), MP_NEW, xx); \
2375 if (!z) return (0); \
2376 return (mp_pywrap(z)); \
2382 static void gfn_pydealloc(PyObject
*me
)
2384 gfn_destroy(GFN_PTON(me
));
2385 gfn_destroy(GFN_NTOP(me
));
2389 static PyGetSetDef gfn_pygetset
[] = {
2390 #define GETSETNAME(op, name) gfn##op##_##name
2391 GET (p
, "X.p -> polynomial basis, as polynomial")
2392 GET (beta
, "X.beta -> normal basis element, in poly form")
2397 static PyMethodDef gfn_pymethods
[] = {
2398 #define METHNAME(name) gfnmeth_##name
2399 METH (pton
, "X.pton(A) -> normal-basis representation of A")
2400 METH (ntop
, "X.ntop(A) -> polynomial-basis representation of A")
2405 static PyTypeObject gfn_pytype_skel
= {
2406 PyObject_HEAD_INIT(0) 0, /* Header */
2407 "GFN", /* @tp_name@ */
2408 sizeof(gfn_pyobj
), /* @tp_basicsize@ */
2409 0, /* @tp_itemsize@ */
2411 gfn_pydealloc
, /* @tp_dealloc@ */
2413 0, /* @tp_getattr@ */
2414 0, /* @tp_setattr@ */
2415 0, /* @tp_compare@ */
2417 0, /* @tp_as_number@ */
2418 0, /* @tp_as_sequence@ */
2419 0, /* @tp_as_mapping@ */
2423 0, /* @tp_getattro@ */
2424 0, /* @tp_setattro@ */
2425 0, /* @tp_as_buffer@ */
2426 Py_TPFLAGS_DEFAULT
| /* @tp_flags@ */
2427 Py_TPFLAGS_BASETYPE
,
2430 "An object for transforming elements of binary fields between polynomial\n\
2431 and normal basis representations.",
2433 0, /* @tp_traverse@ */
2435 0, /* @tp_richcompare@ */
2436 0, /* @tp_weaklistoffset@ */
2438 0, /* @tp_iternext@ */
2439 gfn_pymethods
, /* @tp_methods@ */
2440 0, /* @tp_members@ */
2441 gfn_pygetset
, /* @tp_getset@ */
2444 0, /* @tp_descr_get@ */
2445 0, /* @tp_descr_set@ */
2446 0, /* @tp_dictoffset@ */
2448 PyType_GenericAlloc
, /* @tp_alloc@ */
2449 gfn_pynew
, /* @tp_new@ */
2454 /*----- Glue --------------------------------------------------------------*/
2456 static PyMethodDef methods
[] = {
2457 #define METHNAME(func) meth_##func
2458 KWMETH(_MP_fromstring
, "\
2459 fromstring(STR, radix = 0) -> (X, REST)\n\
2461 Parse STR as a large integer, according to radix. If radix is zero,\n\
2462 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2463 or `R_' for other radix R.")
2464 KWMETH(_GF_fromstring
, "\
2465 fromstring(STR, radix = 0) -> (X, REST)\n\
2467 Parse STR as a binary polynomial, according to radix. If radix is zero,\n\
2468 read a prefix from STR to decide radix: allow `0' for octal, `0x' for hex\n\
2469 or `R_' for other radix R.")
2470 METH (_MP_factorial
, "\
2471 factorial(I) -> I!: compute factorial")
2472 METH (_MP_fibonacci
, "\
2473 fibonacci(I) -> F(I): compute Fibonacci number")
2475 loadl(STR) -> X: read little-endian bytes")
2477 loadb(STR) -> X: read big-endian bytes")
2478 METH (_MP_loadl2c
, "\
2479 loadl2c(STR) -> X: read little-endian bytes, two's complement")
2480 METH (_MP_loadb2c
, "\
2481 loadb2c(STR) -> X: read big-endian bytes, two's complement")
2482 METH (_MP_frombuf
, "\
2483 frombuf(STR) -> (X, REST): read buffer format")
2485 loadl(STR) -> X: read little-endian bytes")
2487 loadb(STR) -> X: read big-endian bytes")
2488 METH (_GF_frombuf
, "\
2489 frombuf(STR) -> (X, REST): read buffer format")
2494 void mp_pyinit(void)
2498 INITTYPE(mpmul
, root
);
2499 INITTYPE(mpmont
, root
);
2500 INITTYPE(mpbarrett
, root
);
2501 INITTYPE(mpreduce
, root
);
2502 INITTYPE(mpcrt
, root
);
2503 INITTYPE(gfreduce
, root
);
2504 INITTYPE(gfn
, root
);
2505 addmethods(methods
);
2508 void mp_pyinsert(PyObject
*mod
)
2510 INSERT("MP", mp_pytype
);
2511 INSERT("MPMul", mpmul_pytype
);
2512 INSERT("MPMont", mpmont_pytype
);
2513 INSERT("MPBarrett", mpbarrett_pytype
);
2514 INSERT("MPReduce", mpreduce_pytype
);
2515 INSERT("MPCRT", mpcrt_pytype
);
2516 INSERT("GF", gf_pytype
);
2517 INSERT("GFReduce", gfreduce_pytype
);
2518 INSERT("GFN", gfn_pytype
);
2521 /*----- That's all, folks -------------------------------------------------*/