pqc/external/flint-2.4.3/fq_zech/test/t-ctx_init.c

122 lines
3.7 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) 2013 Mike Hansen
******************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include "fq_zech.h"
#include "ulong_extras.h"
#include "long_extras.h"
int
main(void)
{
slong primes[10] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 };
slong exponents[10] = { 16, 10, 6, 5, 4, 4, 3, 3, 3, 3 };
int i, j;
slong d;
fmpz_t p, e;
fq_nmod_ctx_t fq_nmod_ctx;
fq_nmod_t lhs, rhs, one;
fq_zech_ctx_t ctx;
FLINT_TEST_INIT(state);
flint_printf("ctx_init... ");
fflush(stdout);
fmpz_init(p);
fmpz_init(e);
for (i = 0; i < 10; i++)
{
fmpz_set_ui(p, primes[i]);
for (d = 2; d < exponents[i]; d++)
{
fq_nmod_ctx_init_conway(fq_nmod_ctx, p, d, "a");
fq_zech_ctx_init_fq_nmod_ctx(ctx, fq_nmod_ctx);
fq_nmod_init(lhs, fq_nmod_ctx);
fq_nmod_init(rhs, fq_nmod_ctx);
fq_nmod_init(one, fq_nmod_ctx);
fq_nmod_one(one, fq_nmod_ctx);
for (j = 0; j < ctx->qm1; j++)
{
/* Skip the cases where a^j + 1 == 0 */
if (primes[i] == 2 && i == 0)
{
continue;
}
if (j == ctx->qm1 / 2)
{
continue;
}
/* lhs = a^Z(j) */
fmpz_set_ui(e, ctx->zech_log_table[j]);
fq_nmod_gen(lhs, fq_nmod_ctx);
fq_nmod_pow(lhs, lhs, e, fq_nmod_ctx);
/* rhs = a^j + 1 */
fmpz_set_ui(e, j);
fq_nmod_gen(rhs, fq_nmod_ctx);
fq_nmod_pow(rhs, rhs, e, fq_nmod_ctx);
fq_nmod_add(rhs, rhs, one, fq_nmod_ctx);
if (!fq_nmod_equal(lhs, rhs, fq_nmod_ctx))
{
flint_printf("FAIL:\n\n");
flint_printf("K = GF(%wd^%wd)\n", primes[i], d);
flint_printf("Z(%d) = %wd\n", j, ctx->zech_log_table[j]);
flint_printf("LHS: ");
fq_nmod_print_pretty(lhs, fq_nmod_ctx);
flint_printf("\n");
flint_printf("RHS: ");
fq_nmod_print_pretty(rhs, fq_nmod_ctx);
flint_printf("\n");
abort();
}
}
fq_nmod_clear(lhs, fq_nmod_ctx);
fq_nmod_clear(rhs, fq_nmod_ctx);
fq_nmod_clear(one, fq_nmod_ctx);
fq_zech_ctx_clear(ctx);
fq_nmod_ctx_clear(fq_nmod_ctx);
}
}
fmpz_clear(p);
fmpz_clear(e);
FLINT_TEST_CLEANUP(state);
flint_printf("PASS\n");
return EXIT_SUCCESS;
}