math/big.Int.ModInverse (method)

10 uses

	math/big (current package)
		int.go#L581: 		inverse := new(Int).ModInverse(x, m)
		int.go#L902: func (z *Int) ModInverse(g, n *Int) *Int {
		int.go#L932: 	return (&Int{abs: z}).ModInverse(&Int{abs: g}, &Int{abs: n}).abs

	crypto/dsa
		dsa.go#L287: 	w := new(big.Int).ModInverse(s, pub.Q)

	crypto/ecdsa
		ecdsa_legacy.go#L93: 			kInv = new(big.Int).ModInverse(k, N)
		ecdsa_legacy.go#L148: 	w := new(big.Int).ModInverse(s, N)

	crypto/elliptic
		params.go#L93: 	zinv := new(big.Int).ModInverse(z, curve.P)

	crypto/rsa
		rsa.go#L425: 		ok := priv.D.ModInverse(e, totient)
		rsa.go#L617: 	priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
		rsa.go#L629: 		values.Coeff = new(big.Int).ModInverse(r, prime)