modulus. Some Montgomery algorithms don't and need extra care to // return correct results. See https://go.dev/issue/13907. func TestMulReductions(t *testing.T) { // Two short but multi-limb primes. a, _ := new(big.Int).SetString("77360896267765123085", 10) b, _ := new(big.Int).SetString("18069282361036845195", 10) n := new(big.Int).Mul(a, b) N, _ := NewModulus(n.Bytes()) A := NewNat().setBig(a).ExpandFor(N) B := NewNat().setBig(b).ExpandFor(N) if A.Mul(B, N).IsZero() != 1 { t.Error("a * b mod (a * b)...

pkg math/big, method (*Int) SetBits([]Word) *Int
pkg math/big, method (*Int) SetBytes([]uint8) *Int
pkg math/big, method (*Int) SetInt64(int64) *Int
pkg math/big, method (*Int) SetString(string, int) (*Int, bool)
pkg math/big, method (*Int) Sign() int
pkg math/big, method (*Int) String() string
pkg math/big, method (*Int) Sub(*Int, *Int) *Int
pkg math/big, method (*Int) Xor(*Int, *Int) *Int

modulus. Some Montgomery algorithms don't and need extra care to // return correct results. See https://go.dev/issue/13907. func TestMulReductions(t *testing.T) { // Two short but multi-limb primes. a, _ := new(big.Int).SetString("77360896267765123085", 10) b, _ := new(big.Int).SetString("18069282361036845195", 10) n := new(big.Int).Mul(a, b) N, _ := NewModulus(n.Bytes()) A := NewNat().setBig(a).ExpandFor(N) B := NewNat().setBig(b).ExpandFor(N) if A.Mul(B, N).IsZero() != 1 { t.Error("a * b mod (a * b)...