dlog_vec_sieve, dlog_vec_sieve_add
Synopsis
#include <flint/dlog.h>void dlog_vec_sieve(ulong * v, ulong nv, ulong a, ulong va, nmod_t mod, ulong na, nmod_t order)sourcevoid dlog_vec_sieve_add(ulong * v, ulong nv, ulong a, ulong va, nmod_t mod, ulong na, nmod_t order)sourceAs dlog_vec and dlog_vec_add, by computing the logarithms of the primes p < \min(\mathit{nv}, m) and extending them to all k by complete multiplicativity. The logarithms of the primes are computed with a precomputation for 50 queries, except that for primes large enough a relation with smaller numbers is searched first (dlog_vec_pindex_factorgcd). The full index calculus method is not implemented.
Cite this page
The FLINT team, “dlog_vec_sieve, dlog_vec_sieve_add (dlog.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/dlog/dlog_vec_sieve.html (generated 2026-10-20).
@misc{flint-doc-dlog-dlog-vec-sieve,
author = {{The FLINT team}},
title = {{dlog\_vec\_sieve, dlog\_vec\_sieve\_add (dlog.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/dlog/dlog_vec_sieve.html},
note = {Generated 2026-10-20}
}