Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 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 | |
Patrick Gansterer | e5720a3 | 2014-02-28 00:57:19 +0100 | [diff] [blame] | 35 | #include "private-libwebsockets.h" |
| 36 | |
=?UTF-8?q?Joakim=20S=C3=B6derberg?= | cefab31 | 2015-06-24 16:46:02 +0200 | [diff] [blame] | 37 | #ifdef LWS_HAVE_SYS_TYPES_H |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 38 | #include <sys/types.h> |
Patrick Gansterer | e5720a3 | 2014-02-28 00:57:19 +0100 | [diff] [blame] | 39 | #endif |
| 40 | |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 41 | struct sha1_ctxt { |
| 42 | union { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 43 | unsigned char b8[20]; |
| 44 | unsigned int b32[5]; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 45 | } h; |
| 46 | union { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 47 | unsigned char b8[8]; |
| 48 | u_int64_t b64[1]; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 49 | } c; |
| 50 | union { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 51 | unsigned char b8[64]; |
| 52 | unsigned int b32[16]; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 53 | } m; |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 54 | unsigned char count; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 55 | }; |
| 56 | |
| 57 | /* sanity check */ |
Daniel Ludwig | f975f73 | 2014-02-14 00:17:46 +0100 | [diff] [blame] | 58 | #if !defined(BYTE_ORDER) || !defined(LITTLE_ENDIAN) || !defined(BIG_ENDIAN) |
| 59 | # define unsupported 1 |
| 60 | #elif BYTE_ORDER != BIG_ENDIAN |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 61 | # if BYTE_ORDER != LITTLE_ENDIAN |
| 62 | # define unsupported 1 |
| 63 | # endif |
| 64 | #endif |
| 65 | |
| 66 | #ifndef unsupported |
| 67 | |
| 68 | /* constant table */ |
David Galeano | d3ce131 | 2013-01-09 15:14:31 +0800 | [diff] [blame] | 69 | static const unsigned int _K[] = |
| 70 | { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 }; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 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); \ |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 92 | } |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 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); \ |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 100 | } |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 101 | |
| 102 | static void sha1_step __P((struct sha1_ctxt *)); |
| 103 | |
| 104 | static void |
| 105 | sha1_step(struct sha1_ctxt *ctxt) |
| 106 | { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 107 | unsigned int a, b, c, d, e, tmp; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 108 | size_t t, s; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 109 | |
| 110 | #if BYTE_ORDER == LITTLE_ENDIAN |
| 111 | struct sha1_ctxt tctxt; |
| 112 | |
| 113 | memcpy(&tctxt.m.b8[0], &ctxt->m.b8[0], 64); |
| 114 | ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2]; |
| 115 | ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0]; |
| 116 | ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6]; |
| 117 | ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4]; |
| 118 | ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10]; |
| 119 | ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8]; |
| 120 | ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14]; |
| 121 | ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12]; |
| 122 | ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18]; |
| 123 | ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16]; |
| 124 | ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22]; |
| 125 | ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20]; |
| 126 | ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26]; |
| 127 | ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24]; |
| 128 | ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30]; |
| 129 | ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28]; |
| 130 | ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34]; |
| 131 | ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32]; |
| 132 | ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38]; |
| 133 | ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36]; |
| 134 | ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42]; |
| 135 | ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40]; |
| 136 | ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46]; |
| 137 | ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44]; |
| 138 | ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50]; |
| 139 | ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48]; |
| 140 | ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54]; |
| 141 | ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52]; |
| 142 | ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58]; |
| 143 | ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56]; |
| 144 | ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62]; |
| 145 | ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60]; |
| 146 | #endif |
| 147 | |
| 148 | a = H(0); b = H(1); c = H(2); d = H(3); e = H(4); |
| 149 | |
| 150 | for (t = 0; t < 20; t++) { |
| 151 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 152 | if (t >= 16) |
| 153 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 154 | W((s+2) & 0x0f) ^ W(s)); |
| 155 | |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 156 | tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t); |
| 157 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 158 | } |
| 159 | for (t = 20; t < 40; t++) { |
| 160 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 161 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 162 | W((s+2) & 0x0f) ^ W(s)); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 163 | tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t); |
| 164 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 165 | } |
| 166 | for (t = 40; t < 60; t++) { |
| 167 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 168 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 169 | W((s+2) & 0x0f) ^ W(s)); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 170 | tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t); |
| 171 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 172 | } |
| 173 | for (t = 60; t < 80; t++) { |
| 174 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 175 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 176 | W((s+2) & 0x0f) ^ W(s)); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 177 | tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t); |
| 178 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 179 | } |
| 180 | |
| 181 | H(0) = H(0) + a; |
| 182 | H(1) = H(1) + b; |
| 183 | H(2) = H(2) + c; |
| 184 | H(3) = H(3) + d; |
| 185 | H(4) = H(4) + e; |
| 186 | |
| 187 | bzero(&ctxt->m.b8[0], 64); |
| 188 | } |
| 189 | |
| 190 | /*------------------------------------------------------------*/ |
| 191 | |
Joachim Bauch | d8b8542 | 2013-06-19 15:10:26 +0200 | [diff] [blame] | 192 | static void |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 193 | sha1_init(struct sha1_ctxt *ctxt) |
| 194 | { |
| 195 | bzero(ctxt, sizeof(struct sha1_ctxt)); |
| 196 | H(0) = 0x67452301; |
| 197 | H(1) = 0xefcdab89; |
| 198 | H(2) = 0x98badcfe; |
| 199 | H(3) = 0x10325476; |
| 200 | H(4) = 0xc3d2e1f0; |
| 201 | } |
| 202 | |
| 203 | void |
| 204 | sha1_pad(struct sha1_ctxt *ctxt) |
| 205 | { |
| 206 | size_t padlen; /*pad length in bytes*/ |
| 207 | size_t padstart; |
| 208 | |
| 209 | PUTPAD(0x80); |
| 210 | |
| 211 | padstart = COUNT % 64; |
| 212 | padlen = 64 - padstart; |
| 213 | if (padlen < 8) { |
| 214 | bzero(&ctxt->m.b8[padstart], padlen); |
| 215 | COUNT += padlen; |
| 216 | COUNT %= 64; |
| 217 | sha1_step(ctxt); |
| 218 | padstart = COUNT % 64; /* should be 0 */ |
| 219 | padlen = 64 - padstart; /* should be 64 */ |
| 220 | } |
| 221 | bzero(&ctxt->m.b8[padstart], padlen - 8); |
| 222 | COUNT += (padlen - 8); |
| 223 | COUNT %= 64; |
| 224 | #if BYTE_ORDER == BIG_ENDIAN |
| 225 | PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]); |
| 226 | PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]); |
| 227 | PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]); |
| 228 | PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]); |
| 229 | #else |
| 230 | PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]); |
| 231 | PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]); |
| 232 | PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]); |
| 233 | PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]); |
| 234 | #endif |
| 235 | } |
| 236 | |
| 237 | void |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 238 | sha1_loop(struct sha1_ctxt *ctxt, const unsigned char *input, size_t len) |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 239 | { |
| 240 | size_t gaplen; |
| 241 | size_t gapstart; |
| 242 | size_t off; |
| 243 | size_t copysiz; |
| 244 | |
| 245 | off = 0; |
| 246 | |
| 247 | while (off < len) { |
| 248 | gapstart = COUNT % 64; |
| 249 | gaplen = 64 - gapstart; |
| 250 | |
| 251 | copysiz = (gaplen < len - off) ? gaplen : len - off; |
| 252 | memcpy(&ctxt->m.b8[gapstart], &input[off], copysiz); |
| 253 | COUNT += copysiz; |
| 254 | COUNT %= 64; |
| 255 | ctxt->c.b64[0] += copysiz * 8; |
| 256 | if (COUNT % 64 == 0) |
| 257 | sha1_step(ctxt); |
| 258 | off += copysiz; |
| 259 | } |
| 260 | } |
| 261 | |
| 262 | void |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 263 | sha1_result(struct sha1_ctxt *ctxt, void *digest0) |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 264 | { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 265 | unsigned char *digest; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 266 | |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 267 | digest = (unsigned char *)digest0; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 268 | sha1_pad(ctxt); |
| 269 | #if BYTE_ORDER == BIG_ENDIAN |
| 270 | memcpy(digest, &ctxt->h.b8[0], 20); |
| 271 | #else |
| 272 | digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2]; |
| 273 | digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0]; |
| 274 | digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6]; |
| 275 | digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4]; |
| 276 | digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10]; |
| 277 | digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8]; |
| 278 | digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14]; |
| 279 | digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12]; |
| 280 | digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18]; |
| 281 | digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16]; |
| 282 | #endif |
| 283 | } |
| 284 | |
| 285 | /* |
| 286 | * This should look and work like the libcrypto implementation |
| 287 | */ |
| 288 | |
Andy Green | 104316e | 2014-09-26 05:56:23 +0800 | [diff] [blame] | 289 | LWS_VISIBLE unsigned char * |
Andy Green | 6230476 | 2015-12-04 08:43:54 +0800 | [diff] [blame] | 290 | lws_SHA1(const unsigned char *d, size_t n, unsigned char *md) |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 291 | { |
| 292 | struct sha1_ctxt ctx; |
| 293 | |
| 294 | sha1_init(&ctx); |
| 295 | sha1_loop(&ctx, d, n); |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 296 | sha1_result(&ctx, (void *)md); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 297 | |
| 298 | return md; |
| 299 | } |
| 300 | |
| 301 | #endif /*unsupported*/ |