_fq_nmod_poly_powmod_ui_binexp, fq_nmod_poly_powmod_ui_binexp, _fq_nmod_poly_powmod_fmpz_binexp, fq_nmod_poly_powmod_fmpz_binexp
Synopsis
#include <flint/fq_nmod_poly.h>void _fq_nmod_poly_powmod_ui_binexp(fq_nmod_struct * res, const fq_nmod_struct * poly, ulong e, const fq_nmod_struct * f, slong lenf, const fq_nmod_ctx_t ctx)void fq_nmod_poly_powmod_ui_binexp(fq_nmod_poly_t res, const fq_nmod_poly_t poly, ulong e, const fq_nmod_poly_t f, const fq_nmod_ctx_t ctx)void _fq_nmod_poly_powmod_fmpz_binexp(fq_nmod_struct * res, const fq_nmod_struct * poly, const fmpz_t e, const fq_nmod_struct * f, slong lenf, const fq_nmod_ctx_t ctx)void fq_nmod_poly_powmod_fmpz_binexp(fq_nmod_poly_t res, const fq_nmod_poly_t poly, const fmpz_t e, const fq_nmod_poly_t f, const fq_nmod_ctx_t ctx)Set res to \mathit{poly}^e \bmod f for e \ge 0, by binary exponentiation. The underscore versions require e > 0, lenf > 1, poly reduced modulo f and zero-padded to length lenf - 1, and space for lenf - 1 coefficients in res.
Generated from the same template as _fq_poly_powmod_ui_binexp, whose documentation has the details.
Cite this page
The FLINT team, “_fq_nmod_poly_powmod_ui_binexp, fq_nmod_poly_powmod_ui_binexp, _fq_nmod_poly_powmod_fmpz_binexp, fq_nmod_poly_powmod_fmpz_binexp (fq_nmod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_powmod_ui_binexp.html (generated 2026-10-20).
@misc{flint-doc-fq-nmod-poly-fq-nmod-poly-powmod-ui-binexp,
author = {{The FLINT team}},
title = {{\_fq\_nmod\_poly\_powmod\_ui\_binexp, fq\_nmod\_poly\_powmod\_ui\_binexp, \_fq\_nmod\_poly\_powmod\_fmpz\_binexp, fq\_nmod\_poly\_powmod\_fmpz\_binexp (fq\_nmod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fq_nmod_poly/_fq_nmod_poly_powmod_ui_binexp.html},
note = {Generated 2026-10-20}
}