- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for ModInverse (0.06 sec)
-
api/go1.txt
pkg math/big, method (*Int) Int64() int64 pkg math/big, method (*Int) Lsh(*Int, uint) *Int pkg math/big, method (*Int) Mod(*Int, *Int) *Int pkg math/big, method (*Int) ModInverse(*Int, *Int) *Int pkg math/big, method (*Int) Mul(*Int, *Int) *Int pkg math/big, method (*Int) MulRange(int64, int64) *Int pkg math/big, method (*Int) Neg(*Int) *Int pkg math/big, method (*Int) Not(*Int) *Int
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
"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) != 0") } i := new(big.Int).ModInverse(a, b) N, _ = NewModulus(b.Bytes()) A = NewNat().setBig(a).ExpandFor(N) I := NewNat().setBig(i).ExpandFor(N) one := NewNat().setBig(big.NewInt(1)).ExpandFor(N) if A.Mul(I, N).Equal(one) != 1 { t.Error("a * inv(a) mod b != 1") } } func TestMul(t *testing.T)...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)