-
Notifications
You must be signed in to change notification settings - Fork 19
/
Copy pathmaurers_universal.go
90 lines (79 loc) · 2.4 KB
/
maurers_universal.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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
// Copyright (c) 2021 Quan guanyu
// randomness is licensed under Mulan PSL v2.
// You can use this software according to the terms and conditions of the Mulan PSL v2.
// You may obtain a copy of Mulan PSL v2 at:
// http://license.coscl.org.cn/MulanPSL2
// THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
// EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
// MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
// See the Mulan PSL v2 for more details.
package randomness
import (
"math"
)
func mutFactorC(L, K int) float64 {
var v float64
v = 0.7
v -= 0.8 / float64(L)
v += (4.0 + 32.0/float64(L)) * (math.Pow(float64(K), -3.0/float64(L)) / 15.0)
return v
}
// MaurerUniversal Maurer通用统计检测方法
func MaurerUniversal(data []byte) *TestResult {
p, q := MaurerUniversalTestBytes(data)
return &TestResult{Name: "Maurer通用统计检测方法", P: p, Q: q, Pass: p >= Alpha}
}
// MaurerUniversalTestBytes Maurer通用统计检测方法
func MaurerUniversalTestBytes(data []byte) (float64, float64) {
return MaurerUniversalTest(B2bitArr(data))
}
// MaurerUniversalTest Maurer通用统计检测方法
func MaurerUniversalTest(bits []bool) (float64, float64) {
n := len(bits)
if n == 0 {
panic("please provide test bits")
}
L := 7
Q := 1280
T := make([]int, 1<<uint(L))
mask := (1 << uint(L)) - 1
var K int = n/L - Q
//var n_disc int = n % L;
var sum float64 = 0.0
var V float64 = 0
var P float64 = 0
var sigma float64 = 0
expected_value := []float64{0, 0, 0, 0, 0, 0, 5.2177052, 6.1962507, 7.1836656,
8.1764248, 9.1723243, 10.170032, 11.168765,
12.168070, 13.167693, 14.167488, 15.167379}
variance := []float64{0, 0, 0, 0, 0, 0, 2.954, 3.125, 3.238, 3.311, 3.356, 3.384,
3.401, 3.410, 3.416, 3.419, 3.421}
var tmp int = 0
var b bool
for i := 1; i <= Q; i++ {
for j := 0; j < L; j++ {
tmp <<= 1
b, bits = bits[0], bits[1:]
if b {
tmp++
}
}
T[tmp&mask] = i
}
for i := Q + 1; i <= Q+K; i++ {
for j := 0; j < L; j++ {
tmp <<= 1
b, bits = bits[0], bits[1:]
if b {
tmp++
}
}
sum += math.Log(float64(i)-float64(T[tmp&mask])) / math.Log(2.0)
T[tmp&mask] = i
}
sigma = math.Sqrt(variance[L]/float64(K)) * mutFactorC(L, K)
V = (sum/float64(K) - expected_value[L]) / (sigma * math.Sqrt(2.0)) // 避免求p q时V再除以math.Sqrt(2.0)
P = math.Erfc(math.Abs(V))
q := math.Erfc(V) / 2
return P, q
}