forked from labitat/doorduino
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sha1.c
319 lines (274 loc) · 8.65 KB
/
sha1.c
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
/*
* SHA-1 in C
* by Emil Renner Berthing <esmil@mailme.dk>
*
* Based on code in public domain by
* Steve Reid <sreid@sea-to-sky.net>
*
* Still 100% Public Domain
*/
#ifndef ALLINONE
#ifdef SHA1_TEST
#include <stdlib.h>
#include <stdio.h>
#endif
#include <string.h>
#include <inttypes.h>
#define EXPORT
#endif
#include "sha1.h"
#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
/* blk0() and blk() perform the initial expand. */
#ifdef WORDS_BIGENDIAN
#define blk0(i) block[i]
#else
#define blk0(i) (block[i] = \
(block[i]>>24) | ((block[i]<<8) & 0x00FF0000) | \
((block[i]>>8) & 0x0000FF00) | (block[i]<<24))
#endif
#define blk(i) (block[i & 15] = rol( \
block[(i - 3) & 15] ^ block[(i - 8) & 15] ^ \
block[(i - 14) & 15] ^ block[i & 15], 1))
/* transform one 512bit block. this is the core of the algorithm. */
static void
sha1_transform(uint32_t state[5], char buf[SHA1_BLOCKSIZE])
{
uint32_t a, b, c, d, e;
uint32_t *block = (uint32_t *)buf;
#ifdef SHA1_SHORTCODE
uint8_t i;
#endif
/* copy state to working vars */
a = state[0];
b = state[1];
c = state[2];
d = state[3];
e = state[4];
#ifdef SHA1_SHORTCODE
for (i = 0; i < 80; i++) {
uint32_t t;
if (i < 20)
t = ((b & (c ^ d)) ^ d) + 0x5A827999;
else if (i < 40)
t = (b ^ c ^ d) + 0x6ED9EBA1;
else if (i < 60)
t = (((b | c) & d) | (b & c)) + 0x8F1BBCDC;
else
t = (b ^ c ^ d) + 0xCA62C1D6;
t += (i < 16) ? blk0(i) : blk(i);
t += e + rol(a, 5);
e = d;
d = c;
c = rol(b, 30);
b = a;
a = t;
}
#else
/* R0 and R1, R2, R3, R4 are the different operations used in SHA1 */
#define R0(v,w,x,y,z,i) \
z += ((w&(x^y))^y) + blk0(i) + 0x5A827999 + rol(v, 5); w = rol(w, 30)
#define R1(v,w,x,y,z,i) \
z += ((w&(x^y))^y) + blk(i) + 0x5A827999 + rol(v, 5); w = rol(w, 30)
#define R2(v,w,x,y,z,i) \
z += (w^x^y) + blk(i) + 0x6ED9EBA1 + rol(v, 5); w = rol(w, 30)
#define R3(v,w,x,y,z,i) \
z += (((w|x)&y)|(w&x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); w = rol(w, 30)
#define R4(v,w,x,y,z,i) \
z += (w^x^y) + blk(i) + 0xCA62C1D6 + rol(v, 5); w = rol(w, 30)
/* 4 rounds of 20 operations each. loop unrolled. */
R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
#endif
/* add the working vars back into state */
state[0] += a;
state[1] += b;
state[2] += c;
state[3] += d;
state[4] += e;
}
/* initialize new context */
EXPORT void
sha1_init(struct sha1_context *ctx)
{
/* SHA1 initialization constants */
ctx->state[0] = 0x67452301;
ctx->state[1] = 0xEFCDAB89;
ctx->state[2] = 0x98BADCFE;
ctx->state[3] = 0x10325476;
ctx->state[4] = 0xC3D2E1F0;
ctx->length = 0;
}
/* hash more data */
EXPORT void
sha1_update(struct sha1_context *ctx, const char *data, size_t len)
{
uint8_t offset = ctx->length & (SHA1_BLOCKSIZE - 1);
ctx->length += len;
if (offset + len >= SHA1_BLOCKSIZE) {
uint8_t n = SHA1_BLOCKSIZE - offset;
memcpy(ctx->buf + offset, data, n);
sha1_transform(ctx->state, ctx->buf);
data += n;
len -= n;
while (len >= SHA1_BLOCKSIZE) {
memcpy(ctx->buf, data, SHA1_BLOCKSIZE);
sha1_transform(ctx->state, ctx->buf);
data += SHA1_BLOCKSIZE;
len -= SHA1_BLOCKSIZE;
}
memcpy(ctx->buf, data, len);
} else
memcpy(ctx->buf + offset, data, len);
}
/* end hashing and return the final hash */
EXPORT void
sha1_final(struct sha1_context *ctx, char out[SHA1_DIGEST_LENGTH])
{
uint8_t offset = ctx->length & (SHA1_BLOCKSIZE - 1);
uint8_t i;
/* append the '1' bit */
ctx->buf[offset++] = 0x80;
/* if there are less than 8 bytes of the buffer free
* for the bitsize, append zeros and transform */
if (offset > SHA1_BLOCKSIZE - 8) {
while (offset < SHA1_BLOCKSIZE)
ctx->buf[offset++] = 0;
sha1_transform(ctx->state, ctx->buf);
offset = 0;
}
/* pad with zeroes until we add the bitsize */
while (offset < SHA1_BLOCKSIZE - sizeof(ctx->length))
ctx->buf[offset++] = 0;
/* store bitsize big-endian and do the final transform */
#ifdef WORD_BIGENDIAN
memcpy(ctx->buf + offset, &ctx->length, sizeof(ctx->length));
#else
/*
ctx->buf[offset++] = (ctx->length >> 53) & 0xff;
ctx->buf[offset++] = (ctx->length >> 45) & 0xff;
ctx->buf[offset++] = (ctx->length >> 37) & 0xff;
ctx->buf[offset++] = (ctx->length >> 29) & 0xff;
ctx->buf[offset++] = (ctx->length >> 21) & 0xff;
ctx->buf[offset++] = (ctx->length >> 13) & 0xff;
*/
ctx->buf[offset++] = (ctx->length >> 5) & 0xff;
ctx->buf[offset++] = (ctx->length << 3) & 0xff;
#endif
sha1_transform(ctx->state, ctx->buf);
/* copy output */
#ifdef WORD_BIGENDAN
memcpy(out, ctx->state, SHA1_DIGEST_LENGTH);
#else
for (i = 0; i < 5; i++) {
*out++ = (ctx->state[i] >> 24) & 0xff;
*out++ = (ctx->state[i] >> 16) & 0xff;
*out++ = (ctx->state[i] >> 8) & 0xff;
*out++ = ctx->state[i] & 0xff;
}
#endif
}
#ifdef SHA1_TEST
/*************************************************************\
* Self Test *
\*************************************************************/
/*
* Test Vectors (from FIPS PUB 180-1)
*
* "abc":
* A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
*
* "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq":
* 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
*
* A million repetitions of "a":
* 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
*/
static char *test_data[] = {
"abc",
"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
"The quick brown fox jumps over the lazy dog"
};
static char *test_results[] = {
"A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D",
"84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1",
"2FD4E1C6 7A2D28FC ED849EE1 BB76E739 1B93EB12"
};
static char hex_digit[] = {
'0', '1', '2', '3', '4', '5', '6', '7',
'8', '9', 'A', 'B', 'C', 'D', 'E', 'F'
};
static void
digest_to_hex(const char digest[SHA1_DIGEST_LENGTH], char *out)
{
unsigned int i;
for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
*out++ = hex_digit[((uint8_t)digest[i]) >> 4];
*out++ = hex_digit[((uint8_t)digest[i]) & 0x0f];
if (i % 4 == 3)
*out++ = ' ';
}
*(out - 1) = '\0';
}
int
main(int argc, char *argv[])
{
unsigned int i;
struct sha1_context ctx;
char digest[SHA1_DIGEST_LENGTH];
char output[2*SHA1_DIGEST_LENGTH + 5];
/* silence gcc -Wextra */
(void)argc;
(void)argv;
printf("Verifying SHA-1 implementation... ");
fflush(stdout);
for (i = 0; i < sizeof(test_data) / sizeof(test_data[0]); i++) {
sha1_init(&ctx);
sha1_update(&ctx, test_data[i], strlen(test_data[i]));
sha1_final(&ctx, digest);
digest_to_hex(digest, output);
if (strcmp(output, test_results[i])) {
fprintf(stdout, "FAIL\n");
fprintf(stderr, "* hash of \"%s\" incorrect:\n"
"\t%s returned\n"
"\t%s is correct\n",
test_data[i], output, test_results[i]);
return EXIT_FAILURE;
}
}
/* the million 'a' vector we feed separately */
sha1_init(&ctx);
for (i = 0; i < 1000000; i++)
sha1_update(&ctx, "a", 1);
sha1_final(&ctx, digest);
digest_to_hex(digest, output);
if (strcmp(output, "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F")) {
fprintf(stdout, "FAIL\n");
fprintf(stderr, "* hash of a million a's is incorrect:\n"
"\t%s returned\n"
"\t34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F"
" is correct\n", output);
return 1;
}
printf("OK\n");
fflush(stdout);
return EXIT_SUCCESS;
}
#endif