- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for BenchmarkModInverse (0.21 sec)
-
src/math/big/int_test.go
(&inverse).Mod(&inverse, &modulus) if (&inverse).Cmp(one) != 0 { t.Errorf("ModInverse(%d,%d)*%d%%%d=%d, not 1", &element, &modulus, &element, &modulus, &inverse) } } } } func BenchmarkModInverse(b *testing.B) { p := new(Int).SetInt64(1) // Mersenne prime 2**1279 -1 p.abs = p.abs.shl(p.abs, 1279) p.Sub(p, intOne) x := new(Int).Sub(p, intOne) z := new(Int) for i := 0; i < b.N; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 58.5K bytes - Viewed (0)