59 lines
1.3 KiB
C
59 lines
1.3 KiB
C
|
/* LibTomPoly, Polynomial Basis Math -- Tom St Denis
|
||
|
|
*
|
||
|
|
* LibTomPoly is a public domain library that provides
|
||
|
|
* polynomial basis arithmetic support. It relies on
|
||
|
|
* LibTomMath for large integer support.
|
||
|
|
*
|
||
|
|
* This library is free for all purposes without any
|
||
|
|
* express guarantee that it works.
|
||
|
|
*
|
||
|
|
* Tom St Denis, tomstdenis@iahu.ca, http://poly.libtomcrypt.org
|
||
|
|
*/
|
||
|
|
#include <tompoly.h>
|
||
|
|
|
||
|
|
/* initialize a */
|
||
|
|
int pb_init_size(pb_poly *a, mp_int *characteristic, int size)
|
||
|
|
{
|
||
|
|
int x, y, err;
|
||
|
|
|
||
|
|
/* enforce a minimum size */
|
||
|
|
if (size < 1) {
|
||
|
|
size = 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* pad size upwards */
|
||
|
|
size += (PB_TERMS - (size % PB_TERMS));
|
||
|
|
|
||
|
|
|
||
|
|
/* init characteristic */
|
||
|
|
if ((err = mp_init_copy(&(a->characteristic), characteristic)) != MP_OKAY) {
|
||
|
|
return err;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* now allocate an array of mp_ints */
|
||
|
|
if ((a->terms = calloc(size, sizeof(mp_int))) == NULL) {
|
||
|
|
mp_clear(&(a->characteristic));
|
||
|
|
return MP_MEM;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* now initialize them all */
|
||
|
|
for (x = 0; x < size; x++) {
|
||
|
|
if ((err = mp_init(&(a->terms[x]))) != MP_OKAY) {
|
||
|
|
/* free stuff */
|
||
|
|
for (y = 0; y < x; y++) {
|
||
|
|
mp_clear(&(a->terms[y]));
|
||
|
|
}
|
||
|
|
free(a->terms);
|
||
|
|
mp_clear(&(a->characteristic));
|
||
|
|
return err;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/* set our parameters */
|
||
|
|
a->used = 0;
|
||
|
|
a->alloc = size;
|
||
|
|
return MP_OKAY;
|
||
|
|
}
|
||
|
|
|
||
|
|
|