math/big.Int.ModInverse (method)
10 uses
math/big (current package)
int.go#L576: inverse := new(Int).ModInverse(x, m)
int.go#L897: func (z *Int) ModInverse(g, n *Int) *Int {
int.go#L927: return (&Int{abs: z}).ModInverse(&Int{abs: g}, &Int{abs: n}).abs
crypto/dsa
dsa.go#L304: w := new(big.Int).ModInverse(s, pub.Q)
crypto/ecdsa
ecdsa_legacy.go#L116: kInv = new(big.Int).ModInverse(k, N)
ecdsa_legacy.go#L178: w := new(big.Int).ModInverse(s, N)
crypto/elliptic
params.go#L93: zinv := new(big.Int).ModInverse(z, curve.P)
crypto/rsa
rsa.go#L475: ok := priv.D.ModInverse(e, totient)
rsa.go#L598: precomputed.Qinv = new(big.Int).ModInverse(priv.Primes[1], priv.Primes[0])
rsa.go#L613: values.Coeff = new(big.Int).ModInverse(r, prime)