pqc/external/flint-2.4.3/nmod_poly_factor.h

130 lines
4.0 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) 2007, David Howden
Copyright (C) 2010, 2011 William Hart
Copyright (C) 2011 Sebastian Pancratz
Copyright (C) 2011 Fredrik Johansson
******************************************************************************/
#ifndef NMOD_POLY_FACTOR_H
#define NMOD_POLY_FACTOR_H
#undef ulong
#define ulong ulongxx /* interferes with system includes */
#include <stdio.h>
#undef ulong
#include <gmp.h>
#define ulong mp_limb_t
#include "flint.h"
#include "nmod_vec.h"
#include "nmod_mat.h"
#include "ulong_extras.h"
#include "fmpz.h"
#ifdef __cplusplus
extern "C" {
#endif
typedef struct
{
nmod_poly_struct *p;
slong *exp;
slong num;
slong alloc;
} nmod_poly_factor_struct;
/* Factoring ****************************************************************/
typedef nmod_poly_factor_struct nmod_poly_factor_t[1];
void nmod_poly_factor_init(nmod_poly_factor_t fac);
void nmod_poly_factor_clear(nmod_poly_factor_t fac);
void nmod_poly_factor_realloc(nmod_poly_factor_t fac, slong alloc);
void nmod_poly_factor_fit_length(nmod_poly_factor_t fac, slong len);
void nmod_poly_factor_set(nmod_poly_factor_t res, const nmod_poly_factor_t fac);
void nmod_poly_factor_insert(nmod_poly_factor_t fac,
const nmod_poly_t poly, slong exp);
void nmod_poly_factor_print(const nmod_poly_factor_t fac);
void nmod_poly_factor_concat(nmod_poly_factor_t res,
const nmod_poly_factor_t fac);
void nmod_poly_factor_pow(nmod_poly_factor_t fac, slong exp);
void nmod_poly_factor_equal_deg(nmod_poly_factor_t factors,
const nmod_poly_t pol, slong d);
int nmod_poly_factor_equal_deg_prob(nmod_poly_t factor,
flint_rand_t state, const nmod_poly_t pol, slong d);
void nmod_poly_factor_distinct_deg(nmod_poly_factor_t res,
const nmod_poly_t poly, slong * const *degs);
ulong nmod_poly_remove(nmod_poly_t f, const nmod_poly_t p);
int nmod_poly_is_irreducible(const nmod_poly_t f);
int nmod_poly_is_irreducible_rabin(const nmod_poly_t f);
int nmod_poly_is_irreducible_ddf(const nmod_poly_t f);
int _nmod_poly_is_squarefree(mp_srcptr f, slong len, nmod_t mod);
int nmod_poly_is_squarefree(const nmod_poly_t f);
void nmod_poly_factor_cantor_zassenhaus(nmod_poly_factor_t res,
const nmod_poly_t f);
void nmod_poly_factor_berlekamp(nmod_poly_factor_t factors,
const nmod_poly_t f);
void nmod_poly_factor_kaltofen_shoup(nmod_poly_factor_t res,
const nmod_poly_t poly);
void nmod_poly_factor_squarefree(nmod_poly_factor_t res, const nmod_poly_t f);
mp_limb_t nmod_poly_factor_with_berlekamp(nmod_poly_factor_t result,
const nmod_poly_t input);
mp_limb_t nmod_poly_factor_with_cantor_zassenhaus(nmod_poly_factor_t result,
const nmod_poly_t input);
mp_limb_t nmod_poly_factor_with_kaltofen_shoup(nmod_poly_factor_t result,
const nmod_poly_t input);
mp_limb_t nmod_poly_factor(nmod_poly_factor_t result,
const nmod_poly_t input);
#ifdef __cplusplus
}
#endif
#endif