1 /*
2 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the project nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29 /*
30 * FIPS pub 180-1: Secure Hash Algorithm (SHA-1)
31 * based on: http://csrc.nist.gov/fips/fip180-1.txt
32 * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org>
33 */
34
35 #include "private-lib-core.h"
36
37 #ifdef LWS_HAVE_SYS_TYPES_H
38 #include <sys/types.h>
39 #endif
40
41 struct sha1_ctxt {
42 union {
43 unsigned char b8[20];
44 unsigned int b32[5];
45 } h;
46 union {
47 unsigned char b8[8];
48 uint64_t b64[1];
49 } c;
50 union {
51 unsigned char b8[64];
52 unsigned int b32[16];
53 } m;
54 unsigned char count;
55 };
56
57 /* sanity check */
58 #if !defined(BYTE_ORDER) || !defined(LITTLE_ENDIAN) || !defined(BIG_ENDIAN)
59 # define unsupported 1
60 #elif BYTE_ORDER != BIG_ENDIAN
61 # if BYTE_ORDER != LITTLE_ENDIAN
62 # define unsupported 1
63 # endif
64 #endif
65
66 #ifndef unsupported
67
68 /* constant table */
69 static const unsigned int _K[] =
70 { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
71 #define K(t) _K[(t) / 20]
72
73 #define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d)))
74 #define F1(b, c, d) (((b) ^ (c)) ^ (d))
75 #define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
76 #define F3(b, c, d) (((b) ^ (c)) ^ (d))
77
78 #define S(n, x) (((x) << (n)) | ((x) >> (32 - n)))
79
80 #define H(n) (ctxt->h.b32[(n)])
81 #define COUNT (ctxt->count)
82 #define BCOUNT (ctxt->c.b64[0] / 8)
83 #define W(n) (ctxt->m.b32[(n)])
84
85 #define PUTBYTE(x) { \
86 ctxt->m.b8[(COUNT % 64)] = (x); \
87 COUNT++; \
88 COUNT %= 64; \
89 ctxt->c.b64[0] += 8; \
90 if (COUNT % 64 == 0) \
91 sha1_step(ctxt); \
92 }
93
94 #define PUTPAD(x) { \
95 ctxt->m.b8[(COUNT % 64)] = (x); \
96 COUNT++; \
97 COUNT %= 64; \
98 if (COUNT % 64 == 0) \
99 sha1_step(ctxt); \
100 }
101
102
103 static void
sha1_step(struct sha1_ctxt * ctxt)104 sha1_step(struct sha1_ctxt *ctxt)
105 {
106 unsigned int a, b, c, d, e, tmp;
107 size_t t, s;
108
109 #if BYTE_ORDER == LITTLE_ENDIAN
110 struct sha1_ctxt tctxt;
111
112 memcpy(&tctxt.m.b8[0], &ctxt->m.b8[0], 64);
113 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
114 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
115 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
116 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
117 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
118 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
119 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
120 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
121 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
122 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
123 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
124 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
125 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
126 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
127 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
128 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
129 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
130 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
131 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
132 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
133 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
134 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
135 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
136 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
137 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
138 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
139 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
140 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
141 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
142 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
143 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
144 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
145 #endif
146
147 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
148
149 for (t = 0; t < 20; t++) {
150 s = t & 0x0f;
151 if (t >= 16)
152 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^
153 W((s+2) & 0x0f) ^ W(s));
154
155 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
156 e = d; d = c; c = S(30, b); b = a; a = tmp;
157 }
158 for (t = 20; t < 40; t++) {
159 s = t & 0x0f;
160 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^
161 W((s+2) & 0x0f) ^ W(s));
162 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
163 e = d; d = c; c = S(30, b); b = a; a = tmp;
164 }
165 for (t = 40; t < 60; t++) {
166 s = t & 0x0f;
167 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^
168 W((s+2) & 0x0f) ^ W(s));
169 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
170 e = d; d = c; c = S(30, b); b = a; a = tmp;
171 }
172 for (t = 60; t < 80; t++) {
173 s = t & 0x0f;
174 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^
175 W((s+2) & 0x0f) ^ W(s));
176 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
177 e = d; d = c; c = S(30, b); b = a; a = tmp;
178 }
179
180 H(0) = H(0) + a;
181 H(1) = H(1) + b;
182 H(2) = H(2) + c;
183 H(3) = H(3) + d;
184 H(4) = H(4) + e;
185
186 memset(&ctxt->m.b8[0], 0, 64);
187 }
188
189 /*------------------------------------------------------------*/
190
191 static void
_sha1_init(struct sha1_ctxt * ctxt)192 _sha1_init(struct sha1_ctxt *ctxt)
193 {
194 memset(ctxt, 0, sizeof(struct sha1_ctxt));
195 H(0) = 0x67452301;
196 H(1) = 0xefcdab89;
197 H(2) = 0x98badcfe;
198 H(3) = 0x10325476;
199 H(4) = 0xc3d2e1f0;
200 }
201
202 void
sha1_pad(struct sha1_ctxt * ctxt)203 sha1_pad(struct sha1_ctxt *ctxt)
204 {
205 size_t padlen; /*pad length in bytes*/
206 size_t padstart;
207
208 PUTPAD(0x80);
209
210 padstart = COUNT % 64;
211 padlen = 64 - padstart;
212 if (padlen < 8) {
213 memset(&ctxt->m.b8[padstart], 0, padlen);
214 COUNT = (unsigned char)(COUNT + padlen);
215 COUNT %= 64;
216 sha1_step(ctxt);
217 padstart = COUNT % 64; /* should be 0 */
218 padlen = 64 - padstart; /* should be 64 */
219 }
220 memset(&ctxt->m.b8[padstart], 0, padlen - 8);
221 COUNT = (unsigned char)(COUNT + (padlen - 8));
222 COUNT %= 64;
223 #if BYTE_ORDER == BIG_ENDIAN
224 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
225 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
226 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
227 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
228 #else
229 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
230 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
231 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
232 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
233 #endif
234 }
235
236 void
sha1_loop(struct sha1_ctxt * ctxt,const unsigned char * input,size_t len)237 sha1_loop(struct sha1_ctxt *ctxt, const unsigned char *input, size_t len)
238 {
239 size_t off;
240
241 off = 0;
242
243 while (off < len) {
244 size_t gapstart = COUNT % 64, gaplen = 64 - gapstart,
245 copysiz = (gaplen < len - off) ? gaplen : len - off;
246
247 memcpy(&ctxt->m.b8[gapstart], &input[off], copysiz);
248 COUNT = (unsigned char)(COUNT + copysiz);
249 COUNT %= 64;
250 ctxt->c.b64[0] += copysiz * 8;
251 if (COUNT % 64 == 0)
252 sha1_step(ctxt);
253 off += copysiz;
254 }
255 }
256
257 void
sha1_result(struct sha1_ctxt * ctxt,void * digest0)258 sha1_result(struct sha1_ctxt *ctxt, void *digest0)
259 {
260 unsigned char *digest;
261
262 digest = (unsigned char *)digest0;
263 sha1_pad(ctxt);
264 #if BYTE_ORDER == BIG_ENDIAN
265 memcpy(digest, &ctxt->h.b8[0], 20);
266 #else
267 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
268 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
269 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
270 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
271 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
272 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
273 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
274 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
275 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
276 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
277 #endif
278 }
279
280 /*
281 * This should look and work like the libcrypto implementation
282 */
283
284 unsigned char *
lws_SHA1(const unsigned char * d,size_t n,unsigned char * md)285 lws_SHA1(const unsigned char *d, size_t n, unsigned char *md)
286 {
287 struct sha1_ctxt ctx;
288
289 _sha1_init(&ctx);
290 sha1_loop(&ctx, d, n);
291 sha1_result(&ctx, (void *)md);
292
293 return md;
294 }
295
296 #endif /*unsupported*/
297