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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
#include "KeysetTest.h"
#include "Random.h"
//-----------------------------------------------------------------------------
// This should hopefully be a thorough and uambiguous test of whether a hash
// is correctly implemented on a given platform
bool VerificationTest ( pfHash hash, const int hashbits, uint32_t expected, bool verbose )
{
const int hashbytes = hashbits / 8;
uint8_t * key = new uint8_t[256];
uint8_t * hashes = new uint8_t[hashbytes * 256];
uint8_t * final = new uint8_t[hashbytes];
memset(key,0,256);
memset(hashes,0,hashbytes*256);
memset(final,0,hashbytes);
for(int i = 0; i < 256; i++)
{
key[i] = (uint8_t)i;
hash(key,i,0,&hashes[i*hashbytes]);
}
//----------
hash(hashes,hashbytes*256,0,final);
uint32_t verification = (final[0] << 0) | (final[1] << 8) | (final[2] << 16) | (final[3] << 24);
delete [] key;
delete [] hashes;
delete [] final;
//----------
if(expected != verification)
{
if(verbose) printf("Verification value 0x%08X : Failed! (Expected 0x%08x)\n",verification,expected);
return false;
}
else
{
if(verbose) printf("Verification value 0x%08X : Passed!\n",verification);
return true;
}
}
//----------------------------------------------------------------------------
// Basic sanity checks -
// A hash function should not be reading outside the bounds of the key.
// Flipping a bit of a key should, with overwhelmingly high probability,
// result in a different hash.
// Hashing the same key twice should always produce the same result.
// The memory alignment of the key should not affect the hash result.
bool SanityTest ( pfHash hash, const int hashbits )
{
printf("Running sanity check 1");
bool result = true;
const int hashbytes = hashbits/8;
const int reps = 10;
const int keymax = 128;
const int pad = 16;
const int buflen = keymax + pad*3;
uint8_t * buffer1 = new uint8_t[buflen];
uint8_t * buffer2 = new uint8_t[buflen];
uint8_t * hash1 = new uint8_t[hashbytes];
uint8_t * hash2 = new uint8_t[hashbytes];
//----------
for(int irep = 0; irep < reps; irep++)
{
if(irep % (reps/10) == 0) printf(".");
for(int len = 4; len <= keymax; len++)
{
for(int offset = pad; offset < pad*2; offset++)
{
uint8_t * key1 = &buffer1[pad];
uint8_t * key2 = &buffer2[pad+offset];
rand_p(buffer1,buflen);
rand_p(buffer2,buflen);
memcpy(key2,key1,len);
hash(key1,len,0,hash1);
for(int bit = 0; bit < (len * 8); bit++)
{
// Flip a bit, hash the key -> we should get a different result.
flipbit(key2,len,bit);
hash(key2,len,0,hash2);
if(memcmp(hash1,hash2,hashbytes) == 0)
{
result = false;
}
// Flip it back, hash again -> we should get the original result.
flipbit(key2,len,bit);
hash(key2,len,0,hash2);
if(memcmp(hash1,hash2,hashbytes) != 0)
{
result = false;
}
}
}
}
}
if(result == false)
{
printf("*********FAIL*********\n");
}
else
{
printf("PASS\n");
}
delete [] hash1;
delete [] hash2;
return result;
}
//----------------------------------------------------------------------------
// Appending zero bytes to a key should always cause it to produce a different
// hash value
void AppendedZeroesTest ( pfHash hash, const int hashbits )
{
printf("Running sanity check 2");
const int hashbytes = hashbits/8;
for(int rep = 0; rep < 100; rep++)
{
if(rep % 10 == 0) printf(".");
unsigned char key[256];
memset(key,0,sizeof(key));
rand_p(key,32);
uint32_t h1[16];
uint32_t h2[16];
memset(h1,0,hashbytes);
memset(h2,0,hashbytes);
for(int i = 0; i < 32; i++)
{
hash(key,32+i,0,h1);
if(memcmp(h1,h2,hashbytes) == 0)
{
printf("\n*********FAIL*********\n");
return;
}
memcpy(h2,h1,hashbytes);
}
}
printf("PASS\n");
}
//-----------------------------------------------------------------------------
|
