fmpz_mod_discrete_log_pohlig_hellman_struct, fmpz_mod_discrete_log_pohlig_hellman_t, fmpz_mod_discrete_log_pohlig_hellman_entry_struct, fmpz_mod_discrete_log_pohlig_hellman_table_entry_struct
Synopsis
#include <flint/fmpz_mod.h>fmpz_mod_discrete_log_pohlig_hellman_structfmpz_mod_discrete_log_pohlig_hellman_tfmpz_mod_discrete_log_pohlig_hellman_entry_structfmpz_mod_discrete_log_pohlig_hellman_table_entry_structThe precomputed data: a context for p, p - 1, the primitive root \alpha and its inverse, and for each prime power q^e exactly dividing p - 1 an entry with the idempotent for the Chinese remainder theorem, the element \gamma = \alpha^{(p-1)/q} of order q and a sorted table of powers of \gamma for the baby-step giant-step search.
Cite this page
The FLINT team, “fmpz_mod_discrete_log_pohlig_hellman_struct, fmpz_mod_discrete_log_pohlig_hellman_t, fmpz_mod_discrete_log_pohlig_hellman_entry_struct, fmpz_mod_discrete_log_pohlig_hellman_table_entry_struct (fmpz_mod.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/fmpz_mod/fmpz_mod_discrete_log_pohlig_hellman_struct.html (generated 2026-10-20).
@misc{flint-doc-fmpz-mod-fmpz-mod-discrete-log-pohlig-hellman-struct,
author = {{The FLINT team}},
title = {{fmpz\_mod\_discrete\_log\_pohlig\_hellman\_struct, fmpz\_mod\_discrete\_log\_pohlig\_hellman\_t, fmpz\_mod\_discrete\_log\_pohlig\_hellman\_entry\_struct, fmpz\_mod\_discrete\_log\_pohlig\_hellman\_table\_entry\_struct (fmpz\_mod.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/fmpz_mod/fmpz_mod_discrete_log_pohlig_hellman_struct.html},
note = {Generated 2026-10-20}
}