_fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv, fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv
Synopsis
#include <flint/fmpz_mod_poly.h>void _fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv(fmpz * res, const fmpz * poly1, slong len1, const fmpz_mat_t A, const fmpz * poly3, slong len3, const fmpz * poly3inv, slong len3inv, const fmpz_mod_ctx_t ctx)sourcevoid fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv(fmpz_mod_poly_t res, const fmpz_mod_poly_t poly1, const fmpz_mat_t A, const fmpz_mod_poly_t poly3, const fmpz_mod_poly_t poly3inv, const fmpz_mod_ctx_t ctx)sourceSet res to for = poly1 with , = poly3, given the matrix of powers of computed by fmpz_mod_poly_precompute_matrix and the inverse poly3inv of the reversal of . Only the matrix product and the giant steps remain, which makes repeated compositions with the same , such as the Frobenius iterations in factorisation, cheaper.
Cite this page
The FLINT team, “_fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv, fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv (fmpz_mod_poly.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv.html (generated 2026-11-02).
@misc{flint-doc-fmpz-mod-poly-fmpz-mod-poly-compose-mod-brent-kung-precomp-preinv,
author = {{The FLINT team}},
title = {{\_fmpz\_mod\_poly\_compose\_mod\_brent\_kung\_precomp\_preinv, fmpz\_mod\_poly\_compose\_mod\_brent\_kung\_precomp\_preinv (fmpz\_mod\_poly.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod_poly/_fmpz_mod_poly_compose_mod_brent_kung_precomp_preinv.html},
note = {Generated 2026-11-02}
}