mpz_multi_invert.cc File Reference

compute a[i]^(-1) mod n, i=0..k-1 for mpz-numbers More...

#include <gmp.h>

Include dependency graph for mpz_multi_invert.cc:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
int	mpz_multi_invert (mpz_t *b, const mpz_t *a, int k, const mpz_t n)

---

Detailed Description

compute a[i]^(-1) mod n, i=0..k-1 for mpz-numbers

refer: Peter L. Montgomery, "Speeding the Pollard and Elliptic Curve Methods of Factorization", Mathematics Of Computation, Vol. 48 (177), January 1987, pages 243-264, (especially page 260)

Definition in file mpz_multi_invert.cc.

---

Function Documentation

int mpz_multi_invert	(	mpz_t *	b,
		const mpz_t *	a,
		int	k,
		const mpz_t	n
	)

Definition at line 86 of file mpz_multi_invert.cc.

References mpz_clear(), mpz_init(), mpz_invert(), mpz_mod(), mpz_mul(), and mpz_set().

Referenced by elliptic_curves::arithmetic_progression().

Here is the call graph for this function:

---