package mimc7
|
|
|
|
import (
|
|
"errors"
|
|
"math/big"
|
|
|
|
"github.com/ethereum/go-ethereum/crypto"
|
|
_constants "github.com/iden3/go-iden3-crypto/constants"
|
|
"github.com/iden3/go-iden3-crypto/ff"
|
|
"github.com/iden3/go-iden3-crypto/utils"
|
|
)
|
|
|
|
const SEED = "mimc"
|
|
|
|
var constants = generateConstantsData()
|
|
|
|
type constantsData struct {
|
|
seedHash *big.Int
|
|
iv *big.Int
|
|
nRounds int
|
|
cts []*ff.Element
|
|
}
|
|
|
|
func generateConstantsData() constantsData {
|
|
var constants constantsData
|
|
|
|
constants.seedHash = new(big.Int).SetBytes(crypto.Keccak256([]byte(SEED)))
|
|
c := new(big.Int).SetBytes(crypto.Keccak256([]byte(SEED + "_iv")))
|
|
constants.iv = new(big.Int).Mod(c, _constants.Q)
|
|
|
|
constants.nRounds = 91
|
|
cts := getConstants(SEED, constants.nRounds)
|
|
constants.cts = cts
|
|
return constants
|
|
}
|
|
|
|
func getConstants(seed string, nRounds int) []*ff.Element {
|
|
cts := make([]*ff.Element, nRounds)
|
|
cts[0] = ff.NewElement()
|
|
c := new(big.Int).SetBytes(crypto.Keccak256([]byte(SEED)))
|
|
for i := 1; i < nRounds; i++ {
|
|
c = new(big.Int).SetBytes(crypto.Keccak256(c.Bytes()))
|
|
|
|
n := new(big.Int).Mod(c, _constants.Q)
|
|
cts[i] = ff.NewElement().SetBigInt(n)
|
|
}
|
|
return cts
|
|
}
|
|
|
|
// MIMC7HashGeneric performs the MIMC7 hash over a *big.Int, in a generic way, where it can be specified the Finite Field over R, and the number of rounds
|
|
func MIMC7HashGeneric(xInBI, kBI *big.Int, nRounds int) *big.Int {
|
|
xIn := ff.NewElement().SetBigInt(xInBI)
|
|
k := ff.NewElement().SetBigInt(kBI)
|
|
|
|
cts := getConstants(SEED, nRounds)
|
|
var r *ff.Element
|
|
for i := 0; i < nRounds; i++ {
|
|
var t *ff.Element
|
|
if i == 0 {
|
|
t = ff.NewElement().Add(xIn, k)
|
|
} else {
|
|
t = ff.NewElement().Add(ff.NewElement().Add(r, k), cts[i])
|
|
}
|
|
t2 := ff.NewElement().Square(t)
|
|
t4 := ff.NewElement().Square(t2)
|
|
r = ff.NewElement().Mul(ff.NewElement().Mul(t4, t2), t)
|
|
}
|
|
rE := ff.NewElement().Add(r, k)
|
|
|
|
res := big.NewInt(0)
|
|
rE.ToBigIntRegular(res)
|
|
return res
|
|
}
|
|
|
|
// HashGeneric performs the MIMC7 hash over a *big.Int array, in a generic way, where it can be specified the Finite Field over R, and the number of rounds
|
|
func HashGeneric(iv *big.Int, arr []*big.Int, nRounds int) (*big.Int, error) {
|
|
if !utils.CheckBigIntArrayInField(arr) {
|
|
return nil, errors.New("inputs values not inside Finite Field")
|
|
}
|
|
r := iv
|
|
var err error
|
|
for i := 0; i < len(arr); i++ {
|
|
r = MIMC7HashGeneric(r, arr[i], nRounds)
|
|
if err != nil {
|
|
return r, err
|
|
}
|
|
}
|
|
return r, nil
|
|
}
|
|
|
|
// MIMC7Hash performs the MIMC7 hash over a *big.Int, using the Finite Field over R and the number of rounds setted in the `constants` variable
|
|
func MIMC7Hash(xInBI, kBI *big.Int) *big.Int {
|
|
xIn := ff.NewElement().SetBigInt(xInBI)
|
|
k := ff.NewElement().SetBigInt(kBI)
|
|
|
|
var r *ff.Element
|
|
for i := 0; i < constants.nRounds; i++ {
|
|
var t *ff.Element
|
|
if i == 0 {
|
|
t = ff.NewElement().Add(xIn, k)
|
|
} else {
|
|
t = ff.NewElement().Add(ff.NewElement().Add(r, k), constants.cts[i])
|
|
}
|
|
t2 := ff.NewElement().Square(t)
|
|
t4 := ff.NewElement().Square(t2)
|
|
r = ff.NewElement().Mul(ff.NewElement().Mul(t4, t2), t)
|
|
}
|
|
rE := ff.NewElement().Add(r, k)
|
|
|
|
res := big.NewInt(0)
|
|
rE.ToBigIntRegular(res)
|
|
return res
|
|
}
|
|
|
|
// Hash performs the MIMC7 hash over a *big.Int array
|
|
func Hash(arr []*big.Int, key *big.Int) (*big.Int, error) {
|
|
if !utils.CheckBigIntArrayInField(arr) {
|
|
return nil, errors.New("inputs values not inside Finite Field")
|
|
}
|
|
var r *big.Int
|
|
if key == nil {
|
|
r = big.NewInt(0)
|
|
} else {
|
|
r = key
|
|
}
|
|
for i := 0; i < len(arr); i++ {
|
|
r = new(big.Int).Add(
|
|
new(big.Int).Add(
|
|
r,
|
|
arr[i],
|
|
),
|
|
MIMC7Hash(arr[i], r))
|
|
r = new(big.Int).Mod(r, _constants.Q)
|
|
}
|
|
return r, nil
|
|
}
|
|
|
|
// HashBytes hashes a msg byte slice by blocks of 31 bytes encoded as
|
|
// little-endian
|
|
func HashBytes(b []byte) *big.Int {
|
|
n := 31
|
|
bElems := make([]*big.Int, 0, len(b)/n+1)
|
|
for i := 0; i < len(b)/n; i++ {
|
|
v := new(big.Int)
|
|
utils.SetBigIntFromLEBytes(v, b[n*i:n*(i+1)])
|
|
bElems = append(bElems, v)
|
|
}
|
|
if len(b)%n != 0 {
|
|
v := new(big.Int)
|
|
utils.SetBigIntFromLEBytes(v, b[(len(b)/n)*n:])
|
|
bElems = append(bElems, v)
|
|
}
|
|
h, err := Hash(bElems, nil)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
return h
|
|
}
|