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

Function ModPowBigInt

mathutil/mathutil.go:323–337  ·  view source on GitHub ↗

ModPowBigInt computes (b^e)%m. Returns nil for e < 0. It panics for m == 0 || b == e == 0.

(b, e, m *big.Int)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 4

TestModPowBigIntFunction · 0.85
BenchmarkModPowBigIntFunction · 0.85
ProbablyPrimeBigInt_32Function · 0.85
ProbablyPrimeBigIntFunction · 0.85

Calls 3

modPowBigIntFunction · 0.85
CmpMethod · 0.80
SetMethod · 0.65

Tested by 2

TestModPowBigIntFunction · 0.68
BenchmarkModPowBigIntFunction · 0.68