1
2 /*
3 * Copyright (C) Maxim Dounin
4 * Copyright (C) NGINX, Inc.
5 *
6 * An internal SHA1 implementation.
7 */
8
9
10 #include <nxt_main.h>
11 #include <nxt_sha1.h>
12
13
14 static const u_char *nxt_sha1_body(nxt_sha1_t *ctx, const u_char *data,
15 size_t size);
16
17
18 void
nxt_sha1_init(nxt_sha1_t * ctx)19 nxt_sha1_init(nxt_sha1_t *ctx)
20 {
21 ctx->a = 0x67452301;
22 ctx->b = 0xefcdab89;
23 ctx->c = 0x98badcfe;
24 ctx->d = 0x10325476;
25 ctx->e = 0xc3d2e1f0;
26
27 ctx->bytes = 0;
28 }
29
30
31 void
nxt_sha1_update(nxt_sha1_t * ctx,const void * data,size_t size)32 nxt_sha1_update(nxt_sha1_t *ctx, const void *data, size_t size)
33 {
34 size_t used, free;
35
36 used = (size_t) (ctx->bytes & 0x3f);
37 ctx->bytes += size;
38
39 if (used) {
40 free = 64 - used;
41
42 if (size < free) {
43 memcpy(&ctx->buffer[used], data, size);
44 return;
45 }
46
47 memcpy(&ctx->buffer[used], data, free);
48 data = (u_char *) data + free;
49 size -= free;
50 (void) nxt_sha1_body(ctx, ctx->buffer, 64);
51 }
52
53 if (size >= 64) {
54 data = nxt_sha1_body(ctx, data, size & ~(size_t) 0x3f);
55 size &= 0x3f;
56 }
57
58 memcpy(ctx->buffer, data, size);
59 }
60
61
62 void
nxt_sha1_final(u_char result[20],nxt_sha1_t * ctx)63 nxt_sha1_final(u_char result[20], nxt_sha1_t *ctx)
64 {
65 size_t used, free;
66
67 used = (size_t) (ctx->bytes & 0x3f);
68
69 ctx->buffer[used++] = 0x80;
70
71 free = 64 - used;
72
73 if (free < 8) {
74 nxt_memzero(&ctx->buffer[used], free);
75 (void) nxt_sha1_body(ctx, ctx->buffer, 64);
76 used = 0;
77 free = 64;
78 }
79
80 nxt_memzero(&ctx->buffer[used], free - 8);
81
82 ctx->bytes <<= 3;
83 ctx->buffer[56] = (u_char) (ctx->bytes >> 56);
84 ctx->buffer[57] = (u_char) (ctx->bytes >> 48);
85 ctx->buffer[58] = (u_char) (ctx->bytes >> 40);
86 ctx->buffer[59] = (u_char) (ctx->bytes >> 32);
87 ctx->buffer[60] = (u_char) (ctx->bytes >> 24);
88 ctx->buffer[61] = (u_char) (ctx->bytes >> 16);
89 ctx->buffer[62] = (u_char) (ctx->bytes >> 8);
90 ctx->buffer[63] = (u_char) ctx->bytes;
91
92 (void) nxt_sha1_body(ctx, ctx->buffer, 64);
93
94 result[0] = (u_char) (ctx->a >> 24);
95 result[1] = (u_char) (ctx->a >> 16);
96 result[2] = (u_char) (ctx->a >> 8);
97 result[3] = (u_char) ctx->a;
98 result[4] = (u_char) (ctx->b >> 24);
99 result[5] = (u_char) (ctx->b >> 16);
100 result[6] = (u_char) (ctx->b >> 8);
101 result[7] = (u_char) ctx->b;
102 result[8] = (u_char) (ctx->c >> 24);
103 result[9] = (u_char) (ctx->c >> 16);
104 result[10] = (u_char) (ctx->c >> 8);
105 result[11] = (u_char) ctx->c;
106 result[12] = (u_char) (ctx->d >> 24);
107 result[13] = (u_char) (ctx->d >> 16);
108 result[14] = (u_char) (ctx->d >> 8);
109 result[15] = (u_char) ctx->d;
110 result[16] = (u_char) (ctx->e >> 24);
111 result[17] = (u_char) (ctx->e >> 16);
112 result[18] = (u_char) (ctx->e >> 8);
113 result[19] = (u_char) ctx->e;
114
115 nxt_memzero(ctx, sizeof(*ctx));
116 }
117
118
119 /*
120 * Helper functions.
121 */
122
123 #define ROTATE(bits, word) (((word) << (bits)) | ((word) >> (32 - (bits))))
124
125 #define F1(b, c, d) (((b) & (c)) | ((~(b)) & (d)))
126 #define F2(b, c, d) ((b) ^ (c) ^ (d))
127 #define F3(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
128
129 #define STEP(f, a, b, c, d, e, w, t) \
130 temp = ROTATE(5, (a)) + f((b), (c), (d)) + (e) + (w) + (t); \
131 (e) = (d); \
132 (d) = (c); \
133 (c) = ROTATE(30, (b)); \
134 (b) = (a); \
135 (a) = temp;
136
137
138 /*
139 * GET() reads 4 input bytes in big-endian byte order and returns
140 * them as uint32_t.
141 */
142
143 #define GET(n) \
144 ( ((uint32_t) p[n * 4 + 3]) \
145 | ((uint32_t) p[n * 4 + 2] << 8) \
146 | ((uint32_t) p[n * 4 + 1] << 16) \
147 | ((uint32_t) p[n * 4] << 24))
148
149
150 /*
151 * This processes one or more 64-byte data blocks, but does not update
152 * the bit counters. There are no alignment requirements.
153 */
154
155 static const u_char *
nxt_sha1_body(nxt_sha1_t * ctx,const u_char * data,size_t size)156 nxt_sha1_body(nxt_sha1_t *ctx, const u_char *data, size_t size)
157 {
158 uint32_t a, b, c, d, e, temp;
159 uint32_t saved_a, saved_b, saved_c, saved_d, saved_e;
160 uint32_t words[80];
161 nxt_uint_t i;
162 const u_char *p;
163
164 p = data;
165
166 a = ctx->a;
167 b = ctx->b;
168 c = ctx->c;
169 d = ctx->d;
170 e = ctx->e;
171
172 do {
173 saved_a = a;
174 saved_b = b;
175 saved_c = c;
176 saved_d = d;
177 saved_e = e;
178
179 /* Load data block into the words array */
180
181 for (i = 0; i < 16; i++) {
182 words[i] = GET(i);
183 }
184
185 for (i = 16; i < 80; i++) {
186 words[i] = ROTATE(1, words[i - 3]
187 ^ words[i - 8]
188 ^ words[i - 14]
189 ^ words[i - 16]);
190 }
191
192 /* Transformations */
193
194 STEP(F1, a, b, c, d, e, words[0], 0x5a827999);
195 STEP(F1, a, b, c, d, e, words[1], 0x5a827999);
196 STEP(F1, a, b, c, d, e, words[2], 0x5a827999);
197 STEP(F1, a, b, c, d, e, words[3], 0x5a827999);
198 STEP(F1, a, b, c, d, e, words[4], 0x5a827999);
199 STEP(F1, a, b, c, d, e, words[5], 0x5a827999);
200 STEP(F1, a, b, c, d, e, words[6], 0x5a827999);
201 STEP(F1, a, b, c, d, e, words[7], 0x5a827999);
202 STEP(F1, a, b, c, d, e, words[8], 0x5a827999);
203 STEP(F1, a, b, c, d, e, words[9], 0x5a827999);
204 STEP(F1, a, b, c, d, e, words[10], 0x5a827999);
205 STEP(F1, a, b, c, d, e, words[11], 0x5a827999);
206 STEP(F1, a, b, c, d, e, words[12], 0x5a827999);
207 STEP(F1, a, b, c, d, e, words[13], 0x5a827999);
208 STEP(F1, a, b, c, d, e, words[14], 0x5a827999);
209 STEP(F1, a, b, c, d, e, words[15], 0x5a827999);
210 STEP(F1, a, b, c, d, e, words[16], 0x5a827999);
211 STEP(F1, a, b, c, d, e, words[17], 0x5a827999);
212 STEP(F1, a, b, c, d, e, words[18], 0x5a827999);
213 STEP(F1, a, b, c, d, e, words[19], 0x5a827999);
214
215 STEP(F2, a, b, c, d, e, words[20], 0x6ed9eba1);
216 STEP(F2, a, b, c, d, e, words[21], 0x6ed9eba1);
217 STEP(F2, a, b, c, d, e, words[22], 0x6ed9eba1);
218 STEP(F2, a, b, c, d, e, words[23], 0x6ed9eba1);
219 STEP(F2, a, b, c, d, e, words[24], 0x6ed9eba1);
220 STEP(F2, a, b, c, d, e, words[25], 0x6ed9eba1);
221 STEP(F2, a, b, c, d, e, words[26], 0x6ed9eba1);
222 STEP(F2, a, b, c, d, e, words[27], 0x6ed9eba1);
223 STEP(F2, a, b, c, d, e, words[28], 0x6ed9eba1);
224 STEP(F2, a, b, c, d, e, words[29], 0x6ed9eba1);
225 STEP(F2, a, b, c, d, e, words[30], 0x6ed9eba1);
226 STEP(F2, a, b, c, d, e, words[31], 0x6ed9eba1);
227 STEP(F2, a, b, c, d, e, words[32], 0x6ed9eba1);
228 STEP(F2, a, b, c, d, e, words[33], 0x6ed9eba1);
229 STEP(F2, a, b, c, d, e, words[34], 0x6ed9eba1);
230 STEP(F2, a, b, c, d, e, words[35], 0x6ed9eba1);
231 STEP(F2, a, b, c, d, e, words[36], 0x6ed9eba1);
232 STEP(F2, a, b, c, d, e, words[37], 0x6ed9eba1);
233 STEP(F2, a, b, c, d, e, words[38], 0x6ed9eba1);
234 STEP(F2, a, b, c, d, e, words[39], 0x6ed9eba1);
235
236 STEP(F3, a, b, c, d, e, words[40], 0x8f1bbcdc);
237 STEP(F3, a, b, c, d, e, words[41], 0x8f1bbcdc);
238 STEP(F3, a, b, c, d, e, words[42], 0x8f1bbcdc);
239 STEP(F3, a, b, c, d, e, words[43], 0x8f1bbcdc);
240 STEP(F3, a, b, c, d, e, words[44], 0x8f1bbcdc);
241 STEP(F3, a, b, c, d, e, words[45], 0x8f1bbcdc);
242 STEP(F3, a, b, c, d, e, words[46], 0x8f1bbcdc);
243 STEP(F3, a, b, c, d, e, words[47], 0x8f1bbcdc);
244 STEP(F3, a, b, c, d, e, words[48], 0x8f1bbcdc);
245 STEP(F3, a, b, c, d, e, words[49], 0x8f1bbcdc);
246 STEP(F3, a, b, c, d, e, words[50], 0x8f1bbcdc);
247 STEP(F3, a, b, c, d, e, words[51], 0x8f1bbcdc);
248 STEP(F3, a, b, c, d, e, words[52], 0x8f1bbcdc);
249 STEP(F3, a, b, c, d, e, words[53], 0x8f1bbcdc);
250 STEP(F3, a, b, c, d, e, words[54], 0x8f1bbcdc);
251 STEP(F3, a, b, c, d, e, words[55], 0x8f1bbcdc);
252 STEP(F3, a, b, c, d, e, words[56], 0x8f1bbcdc);
253 STEP(F3, a, b, c, d, e, words[57], 0x8f1bbcdc);
254 STEP(F3, a, b, c, d, e, words[58], 0x8f1bbcdc);
255 STEP(F3, a, b, c, d, e, words[59], 0x8f1bbcdc);
256
257 STEP(F2, a, b, c, d, e, words[60], 0xca62c1d6);
258 STEP(F2, a, b, c, d, e, words[61], 0xca62c1d6);
259 STEP(F2, a, b, c, d, e, words[62], 0xca62c1d6);
260 STEP(F2, a, b, c, d, e, words[63], 0xca62c1d6);
261 STEP(F2, a, b, c, d, e, words[64], 0xca62c1d6);
262 STEP(F2, a, b, c, d, e, words[65], 0xca62c1d6);
263 STEP(F2, a, b, c, d, e, words[66], 0xca62c1d6);
264 STEP(F2, a, b, c, d, e, words[67], 0xca62c1d6);
265 STEP(F2, a, b, c, d, e, words[68], 0xca62c1d6);
266 STEP(F2, a, b, c, d, e, words[69], 0xca62c1d6);
267 STEP(F2, a, b, c, d, e, words[70], 0xca62c1d6);
268 STEP(F2, a, b, c, d, e, words[71], 0xca62c1d6);
269 STEP(F2, a, b, c, d, e, words[72], 0xca62c1d6);
270 STEP(F2, a, b, c, d, e, words[73], 0xca62c1d6);
271 STEP(F2, a, b, c, d, e, words[74], 0xca62c1d6);
272 STEP(F2, a, b, c, d, e, words[75], 0xca62c1d6);
273 STEP(F2, a, b, c, d, e, words[76], 0xca62c1d6);
274 STEP(F2, a, b, c, d, e, words[77], 0xca62c1d6);
275 STEP(F2, a, b, c, d, e, words[78], 0xca62c1d6);
276 STEP(F2, a, b, c, d, e, words[79], 0xca62c1d6);
277
278 a += saved_a;
279 b += saved_b;
280 c += saved_c;
281 d += saved_d;
282 e += saved_e;
283
284 p += 64;
285
286 } while (size -= 64);
287
288 ctx->a = a;
289 ctx->b = b;
290 ctx->c = c;
291 ctx->d = d;
292 ctx->e = e;
293
294 return p;
295 }
296