mp_gf2m.h (1120B)
1 /* This Source Code Form is subject to the terms of the Mozilla Public 2 * License, v. 2.0. If a copy of the MPL was not distributed with this 3 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ 4 5 #ifndef _MP_GF2M_H_ 6 #define _MP_GF2M_H_ 7 8 #include "mpi.h" 9 10 mp_err mp_badd(const mp_int *a, const mp_int *b, mp_int *c); 11 mp_err mp_bmul(const mp_int *a, const mp_int *b, mp_int *c); 12 13 /* For modular arithmetic, the irreducible polynomial f(t) is represented 14 * as an array of int[], where f(t) is of the form: 15 * f(t) = t^p[0] + t^p[1] + ... + t^p[k] 16 * where m = p[0] > p[1] > ... > p[k] = 0. 17 */ 18 mp_err mp_bmod(const mp_int *a, const unsigned int p[], mp_int *r); 19 mp_err mp_bmulmod(const mp_int *a, const mp_int *b, const unsigned int p[], 20 mp_int *r); 21 mp_err mp_bsqrmod(const mp_int *a, const unsigned int p[], mp_int *r); 22 mp_err mp_bdivmod(const mp_int *y, const mp_int *x, const mp_int *pp, 23 const unsigned int p[], mp_int *r); 24 25 int mp_bpoly2arr(const mp_int *a, unsigned int p[], int max); 26 mp_err mp_barr2poly(const unsigned int p[], mp_int *a); 27 28 #endif /* _MP_GF2M_H_ */