pqc/external/flint-2.4.3/nmod_poly_mat/solve_fflu_precomp.c
2014-05-24 23:16:06 +02:00

103 lines
3.0 KiB
C

/*=============================================================================
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
******************************************************************************/
#include <stdlib.h>
#include "flint.h"
#include "nmod_poly.h"
#include "nmod_poly_mat.h"
#include "perm.h"
#define XX(ii,jj) nmod_poly_mat_entry(X,(ii),(jj))
#define BB(ii,jj) nmod_poly_mat_entry(B,(ii),(jj))
#define LU(ii,jj) nmod_poly_mat_entry(FFLU,(ii),(jj))
void
nmod_poly_mat_set_perm(nmod_poly_mat_t X, const slong * perm,
const nmod_poly_mat_t B)
{
if (X == B)
{
/* Not implemented */
abort();
}
else
{
slong i, j;
if (perm == NULL)
abort();
for (i = 0; i < nmod_poly_mat_nrows(B); i++)
for (j = 0; j < nmod_poly_mat_ncols(B); j++)
nmod_poly_set(nmod_poly_mat_entry(X, i, j),
nmod_poly_mat_entry(B, perm[i], j));
}
}
void
nmod_poly_mat_solve_fflu_precomp(nmod_poly_mat_t X,
const slong * perm,
const nmod_poly_mat_t FFLU, const nmod_poly_mat_t B)
{
nmod_poly_t T;
slong i, j, k, m, n;
n = X->r;
m = X->c;
nmod_poly_init(T, nmod_poly_mat_modulus(B));
nmod_poly_mat_set_perm(X, perm, B);
for (k = 0; k < m; k++)
{
/* Fraction-free forward substitution */
for (i = 0; i < n - 1; i++)
{
for (j = i + 1; j < n; j++)
{
nmod_poly_mul(XX(j, k), XX(j, k), LU(i, i));
nmod_poly_mul(T, LU(j, i), XX(i, k));
nmod_poly_sub(XX(j, k), XX(j, k), T);
if (i > 0)
nmod_poly_div(XX(j, k), XX(j, k), LU(i-1, i-1));
}
}
/* Fraction-free back substitution */
for (i = n - 2; i >= 0; i--)
{
nmod_poly_mul(XX(i, k), XX(i, k), LU(n-1, n-1));
for (j = i + 1; j < n; j++)
{
nmod_poly_mul(T, XX(j, k), LU(i, j));
nmod_poly_sub(XX(i, k), XX(i, k), T);
}
nmod_poly_div(XX(i, k), XX(i, k), LU(i, i));
}
}
nmod_poly_clear(T);
}