math/big.Int.ModInverse (method)

9 uses

	math/big (current package)
		int.go#L496: 		inverse := new(Int).ModInverse(x, m)
		int.go#L808: func (z *Int) ModInverse(g, n *Int) *Int {

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

	crypto/ecdsa
		ecdsa.go#L313: 		w = new(big.Int).ModInverse(s, N)

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

	crypto/rsa
		rsa.go#L335: 		ok := priv.D.ModInverse(e, totient)
		rsa.go#L469: 	priv.Precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
		rsa.go#L481: 		values.Coeff = new(big.Int).ModInverse(r, prime)
		rsa.go#L518: 			ok := ir.ModInverse(r, priv.N)