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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
package qndleq_test
import (
"crypto/rand"
"math/big"
"testing"
"github.com/cloudflare/circl/internal/test"
"github.com/cloudflare/circl/zk/qndleq"
)
func TestProve(t *testing.T) {
const testTimes = 1 << 8
const SecParam = 128
one := big.NewInt(1)
max := new(big.Int).Lsh(one, 256)
for i := 0; i < testTimes; i++ {
N, _ := rand.Int(rand.Reader, max)
if N.Bit(0) == 0 {
N.Add(N, one)
}
x, _ := rand.Int(rand.Reader, N)
g, err := qndleq.SampleQn(rand.Reader, N)
test.CheckNoErr(t, err, "failed to sampleQn")
h, err := qndleq.SampleQn(rand.Reader, N)
test.CheckNoErr(t, err, "failed to sampleQn")
gx := new(big.Int).Exp(g, x, N)
hx := new(big.Int).Exp(h, x, N)
proof, err := qndleq.Prove(rand.Reader, x, g, gx, h, hx, N, SecParam)
test.CheckNoErr(t, err, "failed to generate proof")
test.CheckOk(proof.Verify(g, gx, h, hx, N), "failed to verify", t)
}
}
func TestSampleQn(t *testing.T) {
const testTimes = 1 << 7
one := big.NewInt(1)
max := new(big.Int).Lsh(one, 256)
for i := 0; i < testTimes; i++ {
N, _ := rand.Int(rand.Reader, max)
if N.Bit(0) == 0 {
N.Add(N, one)
}
a, err := qndleq.SampleQn(rand.Reader, N)
test.CheckNoErr(t, err, "failed to sampleQn")
jac := big.Jacobi(a, N)
test.CheckOk(jac == 1, "Jacoby symbol should be one", t)
gcd := new(big.Int).GCD(nil, nil, a, N)
test.CheckOk(gcd.Cmp(one) == 0, "should be coprime to N", t)
}
}
func Benchmark_qndleq(b *testing.B) {
const SecParam = 128
one := big.NewInt(1)
max := new(big.Int).Lsh(one, 256)
N, _ := rand.Int(rand.Reader, max)
if N.Bit(0) == 0 {
N.Add(N, one)
}
x, _ := rand.Int(rand.Reader, N)
g, _ := qndleq.SampleQn(rand.Reader, N)
h, _ := qndleq.SampleQn(rand.Reader, N)
gx := new(big.Int).Exp(g, x, N)
hx := new(big.Int).Exp(h, x, N)
proof, _ := qndleq.Prove(rand.Reader, x, g, gx, h, hx, N, SecParam)
b.Run("Prove", func(b *testing.B) {
for i := 0; i < b.N; i++ {
_, _ = qndleq.Prove(rand.Reader, x, g, gx, h, hx, N, SecParam)
}
})
b.Run("Verify", func(b *testing.B) {
for i := 0; i < b.N; i++ {
_ = proof.Verify(g, gx, h, hx, N)
}
})
}
|
