math/big.Int.Mod (method)

55 uses

	math/big (current package)
		int.go#L319: func (z *Int) Mod(x, y *Int) *Int {
		int.go#L910: 		g = g2.Mod(g, n)
		int.go#L965: 		a.Mod(&a, &b)
		int.go#L1020: 	beta.Mod(beta, p)
		int.go#L1022: 	beta.Mod(beta, p)
		int.go#L1025: 	beta.Mod(beta, p)
		int.go#L1027: 	z.Mod(beta, p)
		int.go#L1063: 			t.Mul(&t, &t).Mod(&t, p)
		int.go#L1073: 		g.Mul(&t, &t).Mod(&g, p) // g = g^(2^(r-m)) mod p
		int.go#L1074: 		y.Mul(&y, &t).Mod(&y, p)
		int.go#L1075: 		b.Mul(&b, &g).Mod(&b, p)
		int.go#L1094: 		x = new(Int).Mod(x, p)

	crypto/dsa
		dsa.go#L121: 			rem.Mod(p, q)
		dsa.go#L239: 		r.Mod(r, priv.Q)
		dsa.go#L249: 		s.Mod(s, priv.Q)
		dsa.go#L251: 		s.Mod(s, priv.Q)
		dsa.go#L299: 	u1.Mod(u1, pub.Q)
		dsa.go#L301: 	u2.Mod(u2, pub.Q)
		dsa.go#L305: 	v.Mod(v, pub.P)
		dsa.go#L306: 	v.Mod(v, pub.Q)

	crypto/ecdsa
		ecdsa_legacy.go#L96: 			r.Mod(r, N)
		ecdsa_legacy.go#L106: 		s.Mod(s, N) // N != 0
		ecdsa_legacy.go#L151: 	u1.Mod(u1, N)
		ecdsa_legacy.go#L153: 	u2.Mod(u2, N)
		ecdsa_legacy.go#L162: 	x.Mod(x, N)

	crypto/elliptic
		elliptic.go#L204: 		y.Neg(y).Mod(y, p)
		nistec.go#L203: 		s.Mod(s, curve.params.N)
		nistec_p256.go#L21: 		k = new(big.Int).Mod(k, c.params.N)
		params.go#L45: 	x3.Mod(x3, curve.P)
		params.go#L70: 	y2.Mod(y2, curve.P)
		params.go#L97: 	xOut.Mod(xOut, curve.P)
		params.go#L100: 	yOut.Mod(yOut, curve.P)
		params.go#L143: 	z1z1.Mod(z1z1, curve.P)
		params.go#L145: 	z2z2.Mod(z2z2, curve.P)
		params.go#L148: 	u1.Mod(u1, curve.P)
		params.go#L150: 	u2.Mod(u2, curve.P)
		params.go#L162: 	s1.Mod(s1, curve.P)
		params.go#L165: 	s2.Mod(s2, curve.P)
		params.go#L182: 	x3.Mod(x3, curve.P)
		params.go#L190: 	y3.Mod(y3, curve.P)
		params.go#L197: 	z3.Mod(z3, curve.P)
		params.go#L225: 	delta.Mod(delta, curve.P)
		params.go#L227: 	gamma.Mod(gamma, curve.P)
		params.go#L242: 	beta8.Mod(beta8, curve.P)
		params.go#L247: 	x3.Mod(x3, curve.P)
		params.go#L259: 	z3.Mod(z3, curve.P)
		params.go#L270: 	gamma.Mod(gamma, curve.P)
		params.go#L276: 	y3.Mod(y3, curve.P)

	crypto/rsa
		rsa.go#L258: 		congruence.Mod(de, pminus1)
		rsa.go#L612: 	priv.Precomputed.Dp.Mod(priv.D, priv.Precomputed.Dp)
		rsa.go#L615: 	priv.Precomputed.Dq.Mod(priv.D, priv.Precomputed.Dq)
		rsa.go#L626: 		values.Exp.Mod(priv.D, values.Exp)

	github.com/gotd/td/internal/crypto
		pq.go#L58: 		v = v.Mod(v, what)
		pq.go#L65: 		x = x.Mod(x, whatNext)

	github.com/gotd/td/internal/crypto/srp
		hash.go#L50: 	kv := k.Mul(k, v).Mod(k, p)