ecpp_point_mul
Synopsis
#include <flint/ecpp.h>int ecpp_point_mul(ecpp_point_t R, const ecpp_point_t P, const fmpz_t k, const fmpz_t a, fmpz_t acc, const fmpz_mod_ctx_t ctx)sourceSets R = kP on the curve with coefficient a modulo the modulus n of ctx, for an affine point P and k \ge 0. Every quantity whose invertibility the formulas assume is multiplied into acc; the result is meaningful only if \gcd(\mathit{acc}, n) = 1 at the end, and otherwise n is composite. Returns 0 if acc became zero and 1 otherwise.
Cite this page
The FLINT team, “ecpp_point_mul (ecpp.h),” FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev, 2026. https://flintlib.org/doc/ecpp/ecpp_point_mul.html (generated 2026-10-20).
@misc{flint-doc-ecpp-ecpp-point-mul,
author = {{The FLINT team}},
title = {{ecpp\_point\_mul (ecpp.h)}},
howpublished = {FLINT: Fast Library for Number Theory, documentation, version 3.7.0-dev},
year = {2026},
url = {https://flintlib.org/doc/ecpp/ecpp_point_mul.html},
note = {Generated 2026-10-20}
}