pqc/external/flint-2.4.3/nmod_poly/mulmod_preinv.c

122 lines
3.4 KiB
C
Raw Normal View History

2014-05-18 22:03:37 +00:00
/*=============================================================================
This file is part of FLINT.
FLINT is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
FLINT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with FLINT; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
=============================================================================*/
/******************************************************************************
Copyright (C) 2011 Fredrik Johansson
Copyright (C) 2013 Martin Lee
******************************************************************************/
#undef ulong
#define ulong ulongxx/* interferes with system includes */
#include <stdlib.h>
#undef ulong
#include <gmp.h>
#define ulong mp_limb_t
#include "flint.h"
#include "nmod_vec.h"
#include "nmod_poly.h"
void _nmod_poly_mulmod_preinv(mp_ptr res, mp_srcptr poly1, slong len1,
mp_srcptr poly2, slong len2, mp_srcptr f,
slong lenf, mp_srcptr finv, slong lenfinv, nmod_t mod)
{
mp_ptr T, Q;
slong lenT, lenQ;
lenT = len1 + len2 - 1;
lenQ = lenT - lenf + 1;
T = _nmod_vec_init(lenT + lenQ);
Q = T + lenT;
if (len1 >= len2)
_nmod_poly_mul(T, poly1, len1, poly2, len2, mod);
else
_nmod_poly_mul(T, poly2, len2, poly1, len1, mod);
_nmod_poly_divrem_newton_n_preinv(Q, res, T, lenT, f, lenf,
finv, lenfinv, mod);
_nmod_vec_clear(T);
}
void
nmod_poly_mulmod_preinv(nmod_poly_t res, const nmod_poly_t poly1,
const nmod_poly_t poly2, const nmod_poly_t f,
const nmod_poly_t finv)
{
slong len1, len2, lenf;
mp_ptr fcoeffs;
lenf = f->length;
len1 = poly1->length;
len2 = poly2->length;
if (lenf == 0)
{
flint_printf("Exception (nmod_poly_mulmod_preinv). Divide by zero.\n");
abort();
}
if (lenf <= len1 || lenf <= len2)
{
flint_printf("Exception (nmod_poly_mulmod_preinv). Input larger than modulus.\n");
abort();
}
if (lenf == 1 || len1 == 0 || len2 == 0)
{
nmod_poly_zero(res);
return;
}
if (len1 + len2 - lenf > 0)
{
if (f == res)
{
fcoeffs = flint_malloc(sizeof(mp_limb_t) * lenf);
_nmod_vec_set(fcoeffs, f->coeffs, lenf);
}
else
fcoeffs = f->coeffs;
nmod_poly_fit_length(res, lenf - 1);
_nmod_poly_mulmod_preinv(res->coeffs, poly1->coeffs, len1,
poly2->coeffs, len2,
fcoeffs, lenf,
finv->coeffs, finv->length,
res->mod);
if (f == res)
flint_free(fcoeffs);
res->length = lenf - 1;
_nmod_poly_normalise(res);
}
else
{
nmod_poly_mul(res, poly1, poly2);
}
}