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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
/*
+--------------------------------------------------------------------------+
| CHStone : a suite of benchmark programs for C-based High-Level Synthesis |
| ======================================================================== |
| |
| * Collected and Modified : Y. Hara, H. Tomiyama, S. Honda, |
| H. Takada and K. Ishii |
| Nagoya University, Japan |
| |
| * Remark : |
| 1. This source code is modified to unify the formats of the benchmark |
| programs in CHStone. |
| 2. Test vectors are added for CHStone. |
| 3. If "main_result" is 0 at the end of the program, the program is |
| correctly executed. |
| 4. Please follow the copyright of each benchmark program. |
+--------------------------------------------------------------------------+
*/
/* NIST Secure Hash Algorithm */
/* heavily modified by Uwe Hollerbach uh@alumni.caltech edu */
/* from Peter C. Gutmann's implementation as found in */
/* Applied Cryptography by Bruce Schneier */
/* NIST's proposed modification to SHA of 7/11/94 may be */
/* activated by defining USE_MODIFIED_SHA */
/* SHA f()-functions */
#define f1(x,y,z) ((x & y) | (~x & z))
#define f2(x,y,z) (x ^ y ^ z)
#define f3(x,y,z) ((x & y) | (x & z) | (y & z))
#define f4(x,y,z) (x ^ y ^ z)
/* SHA constants */
#define CONST1 0x5a827999L
#define CONST2 0x6ed9eba1L
#define CONST3 0x8f1bbcdcL
#define CONST4 0xca62c1d6L
/* 32-bit rotate */
#define ROT32(x,n) ((x << n) | (x >> (32 - n)))
#define FUNC(n,i) \
temp = ROT32(A,5) + f##n(B,C,D) + E + W[i] + CONST##n; \
E = D; D = C; C = ROT32(B,30); B = A; A = temp
void
local_memset (INT32 * s, int c, int n, int e)
{
INT32 uc;
INT32 *p;
int m;
m = n / 4;
uc = c;
p = (INT32 *) s;
while (e-- > 0)
{
p++;
}
while (m-- > 0)
{
*p++ = uc;
}
}
void
local_memcpy (INT32 * s1, const BYTE * s2, int n)
{
INT32 *p1;
BYTE *p2;
INT32 tmp;
int m;
m = n / 4;
p1 = (INT32 *) s1;
p2 = (BYTE *) s2;
while (m-- > 0)
{
tmp = 0;
tmp |= 0xFF & *p2++;
tmp |= (0xFF & *p2++) << 8;
tmp |= (0xFF & *p2++) << 16;
tmp |= (0xFF & *p2++) << 24;
*p1 = tmp;
p1++;
}
}
/* do SHA transformation */
static void
sha_transform ()
{
int i;
INT32 temp, A, B, C, D, E, W[80];
for (i = 0; i < 16; ++i)
{
W[i] = sha_info_data[i];
}
for (i = 16; i < 80; ++i)
{
W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];
}
A = sha_info_digest[0];
B = sha_info_digest[1];
C = sha_info_digest[2];
D = sha_info_digest[3];
E = sha_info_digest[4];
for (i = 0; i < 20; ++i)
{
FUNC (1, i);
}
for (i = 20; i < 40; ++i)
{
FUNC (2, i);
}
for (i = 40; i < 60; ++i)
{
FUNC (3, i);
}
for (i = 60; i < 80; ++i)
{
FUNC (4, i);
}
sha_info_digest[0] += A;
sha_info_digest[1] += B;
sha_info_digest[2] += C;
sha_info_digest[3] += D;
sha_info_digest[4] += E;
}
/* initialize the SHA digest */
void
sha_init ()
{
sha_info_digest[0] = 0x67452301L;
sha_info_digest[1] = 0xefcdab89L;
sha_info_digest[2] = 0x98badcfeL;
sha_info_digest[3] = 0x10325476L;
sha_info_digest[4] = 0xc3d2e1f0L;
sha_info_count_lo = 0L;
sha_info_count_hi = 0L;
}
/* update the SHA digest */
void
sha_update (const BYTE * buffer, int count)
{
if ((sha_info_count_lo + ((INT32) count << 3)) < sha_info_count_lo)
{
++sha_info_count_hi;
}
sha_info_count_lo += (INT32) count << 3;
sha_info_count_hi += (INT32) count >> 29;
while (count >= SHA_BLOCKSIZE)
{
local_memcpy (sha_info_data, buffer, SHA_BLOCKSIZE);
sha_transform ();
buffer += SHA_BLOCKSIZE;
count -= SHA_BLOCKSIZE;
}
local_memcpy (sha_info_data, buffer, count);
}
/* finish computing the SHA digest */
void
sha_final ()
{
int count;
INT32 lo_bit_count;
INT32 hi_bit_count;
lo_bit_count = sha_info_count_lo;
hi_bit_count = sha_info_count_hi;
count = (int) ((lo_bit_count >> 3) & 0x3f);
sha_info_data[count++] = 0x80;
if (count > 56)
{
local_memset (sha_info_data, 0, 64 - count, count);
sha_transform ();
local_memset (sha_info_data, 0, 56, 0);
}
else
{
local_memset (sha_info_data, 0, 56 - count, count);
}
sha_info_data[14] = hi_bit_count;
sha_info_data[15] = lo_bit_count;
sha_transform ();
}
/* compute the SHA digest of a FILE stream */
void
sha_stream ()
{
int i, j;
const BYTE *p;
sha_init ();
for (j = 0; j < VSIZE; j++)
{
i = in_i[j];
p = &indata[j][0];
sha_update (p, i);
}
sha_final ();
}
|
