-
Notifications
You must be signed in to change notification settings - Fork 44
/
sp800_22_random_excursion_test.py
131 lines (116 loc) · 4.03 KB
/
sp800_22_random_excursion_test.py
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#!/usr/bin/env python
# sp800_22_random_excursion_test.py
#
# Copyright (C) 2017 David Johnston
# This program is distributed under the terms of the GNU General Public License.
#
# This file is part of sp800_22_tests.
#
# sp800_22_tests is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# sp800_22_tests is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with sp800_22_tests. If not, see <http://www.gnu.org/licenses/>.
from __future__ import print_function
import math
#from scipy.special import gamma, gammainc, gammaincc
from gamma_functions import *
# RANDOM EXCURSION TEST
def random_excursion_test(bits):
n = len(bits)
x = list() # Convert to +1,-1
for bit in bits:
#if bit == 0:
x.append((bit*2)-1)
#print "x=",x
# Build the partial sums
pos = 0
s = list()
for e in x:
pos = pos+e
s.append(pos)
sprime = [0]+s+[0] # Add 0 on each end
#print "sprime=",sprime
# Build the list of cycles
pos = 1
cycles = list()
while (pos < len(sprime)):
cycle = list()
cycle.append(0)
while sprime[pos]!=0:
cycle.append(sprime[pos])
pos += 1
cycle.append(0)
cycles.append(cycle)
pos = pos + 1
J = len(cycles)
print("J="+str(J))
vxk = [['a','b','c','d','e','f'] for y in [-4,-3,-2,-1,1,2,3,4] ]
# Count Occurances
for k in range(6):
for index in range(8):
mapping = [-4,-3,-2,-1,1,2,3,4]
x = mapping[index]
cyclecount = 0
#count how many cycles in which x occurs k times
for cycle in cycles:
oc = 0
#Count how many times x occurs in the current cycle
for pos in cycle:
if (pos == x):
oc += 1
# If x occurs k times, increment the cycle count
if (k < 5):
if oc == k:
cyclecount += 1
else:
if k == 5:
if oc >=5:
cyclecount += 1
vxk[index][k] = cyclecount
# Table for reference random probabilities
pixk=[[0.5 ,0.25 ,0.125 ,0.0625 ,0.0312 ,0.0312],
[0.75 ,0.0625 ,0.0469 ,0.0352 ,0.0264 ,0.0791],
[0.8333 ,0.0278 ,0.0231 ,0.0193 ,0.0161 ,0.0804],
[0.875 ,0.0156 ,0.0137 ,0.012 ,0.0105 ,0.0733],
[0.9 ,0.01 ,0.009 ,0.0081 ,0.0073 ,0.0656],
[0.9167 ,0.0069 ,0.0064 ,0.0058 ,0.0053 ,0.0588],
[0.9286 ,0.0051 ,0.0047 ,0.0044 ,0.0041 ,0.0531]]
success = True
plist = list()
for index in range(8):
mapping = [-4,-3,-2,-1,1,2,3,4]
x = mapping[index]
chisq = 0.0
for k in range(6):
top = float(vxk[index][k]) - (float(J) * (pixk[abs(x)-1][k]))
top = top*top
bottom = J * pixk[abs(x)-1][k]
chisq += top/bottom
p = gammaincc(5.0/2.0,chisq/2.0)
plist.append(p)
if p < 0.01:
err = " Not Random"
success = False
else:
err = ""
print("x = %1.0f\tchisq = %f\tp = %f %s" % (x,chisq,p,err))
if (J < 500):
print("J too small (J < 500) for result to be reliable")
elif success:
print("PASS")
else:
print("FAIL: Data not random")
return (success, None, plist)
if __name__ == "__main__":
bits = [0,1,1,0,1,1,0,1,0,1]
success, _, plist = random_excursion_test(bits)
print("success =",success)
print("plist = ",plist)