-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgf.go
62 lines (49 loc) · 1.04 KB
/
gf.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
package swu
import (
"math/big"
"sync"
)
type GF struct {
P *big.Int
}
var (
One = big.NewInt(1)
Two = big.NewInt(2)
Three = big.NewInt(3)
Four = big.NewInt(4)
pool = sync.Pool{New: func() interface{} {
return new(big.Int)
}}
)
func (g *GF) Neg(a *big.Int) *big.Int {
return new(big.Int).Sub(g.P, a)
}
func (g *GF) Square(a *big.Int) *big.Int {
return new(big.Int).Exp(a, Two, g.P)
}
func (g *GF) Cube(a *big.Int) *big.Int {
return new(big.Int).Exp(a, Three, g.P)
}
func (g *GF) Pow(a, b *big.Int) *big.Int {
return new(big.Int).Exp(a, b, g.P)
}
func (g *GF) Inv(a *big.Int) *big.Int {
return new(big.Int).ModInverse(a, g.P)
}
func (g *GF) Add(a, b *big.Int) *big.Int {
add := new(big.Int).Add(a, b)
return add.Mod(add, g.P)
}
func (g *GF) Sub(a, b *big.Int) *big.Int {
negB := new(big.Int).Sub(a, b)
return negB.Mod(negB, g.P)
}
func (g *GF) Mul(a, b *big.Int) *big.Int {
mul := new(big.Int).Mul(a, b)
return mul.Mod(mul, g.P)
}
func (g *GF) Div(a, b *big.Int) *big.Int {
invB := g.Inv(b)
t := g.Mul(a, invB)
return t
}