MCPcopy Create free account
hub / github.com/andeya/algorithm / ModPow

Function ModPow

mathutil/mersenne/mersenne.go:258–279  ·  view source on GitHub ↗

ModPow returns b^Me % Mm. Run time grows quickly with 'e' and/or 'm' when b != 2 (then ModPow2 is used).

(b, e, m uint32)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 4

TestModPowFunction · 0.85
benchmarkModPowFunction · 0.85
TestModPow2Function · 0.85
ProbablyPrimeFunction · 0.85

Calls 3

ModPow2Function · 0.85
ModFunction · 0.85
MulMethod · 0.45

Tested by 3

TestModPowFunction · 0.68
benchmarkModPowFunction · 0.68
TestModPow2Function · 0.68