/*============================================================================= 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) 2009 William Hart Copyright (C) 2011 Fredrik Johansson Copyright (C) 2012 Lina Kulakova ******************************************************************************/ #include #include #include #include "flint.h" #include "fmpz_vec.h" #include "fmpz_mod_poly.h" #include "ulong_extras.h" int main(void) { int i, result; FLINT_TEST_INIT(state); flint_printf("powmod_ui_binexp...."); fflush(stdout); /* Aliasing of res and a */ for (i = 0; i < 500; i++) { fmpz_mod_poly_t a, res1, t, f; fmpz_t p; ulong exp; fmpz_init(p); fmpz_set_ui(p, n_randtest_prime(state, 0)); exp = n_randint(state, 50); fmpz_mod_poly_init(a, p); fmpz_mod_poly_init(f, p); fmpz_mod_poly_init(res1, p); fmpz_mod_poly_init(t, p); fmpz_mod_poly_randtest(a, state, n_randint(state, 50)); fmpz_mod_poly_randtest_not_zero(f, state, n_randint(state, 50) + 1); fmpz_mod_poly_powmod_ui_binexp(res1, a, exp, f); fmpz_mod_poly_powmod_ui_binexp(a, a, exp, f); result = (fmpz_mod_poly_equal(res1, a)); if (!result) { flint_printf("FAIL:\n"); flint_printf("exp: %wu\n\n", exp); flint_printf("a:\n"); fmpz_mod_poly_print(a), flint_printf("\n\n"); flint_printf("f:\n"); fmpz_mod_poly_print(f), flint_printf("\n\n"); flint_printf("res:\n"); fmpz_mod_poly_print(res1), flint_printf("\n\n"); abort(); } fmpz_clear(p); fmpz_mod_poly_clear(a); fmpz_mod_poly_clear(f); fmpz_mod_poly_clear(res1); fmpz_mod_poly_clear(t); } /* Aliasing of res and f */ for (i = 0; i < 500; i++) { fmpz_mod_poly_t a, res1, t, f; fmpz_t p; ulong exp; fmpz_init(p); fmpz_set_ui(p, n_randtest_prime(state, 0)); exp = n_randint(state, 50); fmpz_mod_poly_init(a, p); fmpz_mod_poly_init(f, p); fmpz_mod_poly_init(res1, p); fmpz_mod_poly_init(t, p); fmpz_mod_poly_randtest(a, state, n_randint(state, 50)); fmpz_mod_poly_randtest_not_zero(f, state, n_randint(state, 50) + 1); fmpz_mod_poly_powmod_ui_binexp(res1, a, exp, f); fmpz_mod_poly_powmod_ui_binexp(f, a, exp, f); result = (fmpz_mod_poly_equal(res1, f)); if (!result) { flint_printf("FAIL:\n"); flint_printf("exp: %wu\n\n", exp); flint_printf("a:\n"); fmpz_mod_poly_print(a), flint_printf("\n\n"); flint_printf("f:\n"); fmpz_mod_poly_print(f), flint_printf("\n\n"); flint_printf("res1:\n"); fmpz_mod_poly_print(res1), flint_printf("\n\n"); abort(); } fmpz_clear(p); fmpz_mod_poly_clear(a); fmpz_mod_poly_clear(f); fmpz_mod_poly_clear(res1); fmpz_mod_poly_clear(t); } /* No aliasing */ for (i = 0; i < 1000; i++) { fmpz_mod_poly_t a, res1, res2, t, f; fmpz_t p; ulong exp; int j; fmpz_init(p); fmpz_set_ui(p, n_randtest_prime(state, 0)); exp = n_randint(state, 50); fmpz_mod_poly_init(a, p); fmpz_mod_poly_init(f, p); fmpz_mod_poly_init(res1, p); fmpz_mod_poly_init(res2, p); fmpz_mod_poly_init(t, p); fmpz_mod_poly_randtest(a, state, n_randint(state, 50)); fmpz_mod_poly_randtest_not_zero(f, state, n_randint(state, 50) + 1); fmpz_mod_poly_powmod_ui_binexp(res1, a, exp, f); fmpz_mod_poly_zero(res2); fmpz_mod_poly_set_coeff_ui(res2, 0, 1); for (j = 1; j <= exp; j++) fmpz_mod_poly_mulmod(res2, res2, a, f); result = (fmpz_mod_poly_equal(res1, res2)); if (!result) { flint_printf("FAIL:\n"); flint_printf("exp: %wu\n\n", exp); flint_printf("a:\n"); fmpz_mod_poly_print(a), flint_printf("\n\n"); flint_printf("f:\n"); fmpz_mod_poly_print(f), flint_printf("\n\n"); flint_printf("res1:\n"); fmpz_mod_poly_print(res1), flint_printf("\n\n"); flint_printf("res2:\n"); fmpz_mod_poly_print(res2), flint_printf("\n\n"); abort(); } fmpz_clear(p); fmpz_mod_poly_clear(a); fmpz_mod_poly_clear(f); fmpz_mod_poly_clear(res1); fmpz_mod_poly_clear(res2); fmpz_mod_poly_clear(t); } /* Check that a^(b+c) = a^b * a^c */ for (i = 0; i < 500; i++) { fmpz_mod_poly_t a, res1, res2, res3, res4, t, f; fmpz_t p; ulong exp1, exp2, exp3; fmpz_init(p); fmpz_set_ui(p, n_randtest_prime(state, 0)); exp1 = n_randint(state, 50); exp2 = n_randint(state, 50); fmpz_mod_poly_init(a, p); fmpz_mod_poly_init(f, p); fmpz_mod_poly_init(res1, p); fmpz_mod_poly_init(res2, p); fmpz_mod_poly_init(res3, p); fmpz_mod_poly_init(res4, p); fmpz_mod_poly_init(t, p); fmpz_mod_poly_randtest(a, state, n_randint(state, 50)); fmpz_mod_poly_randtest_not_zero(f, state, n_randint(state, 50) + 1); fmpz_mod_poly_powmod_ui_binexp(res1, a, exp1, f); fmpz_mod_poly_powmod_ui_binexp(res2, a, exp2, f); fmpz_mod_poly_mulmod(res4, res1, res2, f); exp3 = exp1 + exp2; fmpz_mod_poly_powmod_ui_binexp(res3, a, exp3, f); result = (fmpz_mod_poly_equal(res4, res3)); if (!result) { flint_printf("FAIL:\n"); flint_printf("a:\n"); fmpz_mod_poly_print(a), flint_printf("\n\n"); flint_printf("f:\n"); fmpz_mod_poly_print(f), flint_printf("\n\n"); flint_printf("res3:\n"); fmpz_mod_poly_print(res3), flint_printf("\n\n"); flint_printf("res4:\n"); fmpz_mod_poly_print(res4), flint_printf("\n\n"); abort(); } fmpz_clear(p); fmpz_mod_poly_clear(a); fmpz_mod_poly_clear(f); fmpz_mod_poly_clear(res1); fmpz_mod_poly_clear(res2); fmpz_mod_poly_clear(res3); fmpz_mod_poly_clear(res4); fmpz_mod_poly_clear(t); } FLINT_TEST_CLEANUP(state); flint_printf("PASS\n"); return 0; }