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 | |
| 35 | #include <sys/types.h> |
Peter Hinz | 56885f3 | 2011-03-02 22:03:47 +0000 | [diff] [blame] | 36 | #ifdef WIN32 |
| 37 | |
David Galeano | 08d60f1 | 2011-10-03 19:30:27 +0800 | [diff] [blame] | 38 | #ifndef BIG_ENDIAN |
| 39 | #define BIG_ENDIAN 4321 /* to show byte order (taken from gcc) */ |
| 40 | #endif |
| 41 | #ifndef LITTLE_ENDIAN |
| 42 | #define LITTLE_ENDIAN 1234 |
| 43 | #endif |
| 44 | #ifndef BYTE_ORDER |
| 45 | #define BYTE_ORDER LITTLE_ENDIAN |
| 46 | #endif |
| 47 | |
Peter Hinz | 56885f3 | 2011-03-02 22:03:47 +0000 | [diff] [blame] | 48 | typedef unsigned __int64 u_int64_t; |
Peter Hinz | 56885f3 | 2011-03-02 22:03:47 +0000 | [diff] [blame] | 49 | |
| 50 | #undef __P |
| 51 | #ifndef __P |
| 52 | #if __STDC__ |
| 53 | #define __P(protos) protos |
| 54 | #else |
| 55 | #define __P(protos) () |
| 56 | #endif |
| 57 | #endif |
| 58 | |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 59 | #define bzero(b, len) (memset((b), '\0', (len)), (void) 0) |
Peter Hinz | 56885f3 | 2011-03-02 22:03:47 +0000 | [diff] [blame] | 60 | |
| 61 | #else |
Peter Hillier | 05c66f7 | 2012-05-02 06:09:45 +0800 | [diff] [blame] | 62 | #include <sys/stat.h> |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 63 | #include <sys/cdefs.h> |
| 64 | #include <sys/time.h> |
Peter Hinz | 56885f3 | 2011-03-02 22:03:47 +0000 | [diff] [blame] | 65 | #endif |
| 66 | |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 67 | #include <string.h> |
| 68 | |
| 69 | struct sha1_ctxt { |
| 70 | union { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 71 | unsigned char b8[20]; |
| 72 | unsigned int b32[5]; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 73 | } h; |
| 74 | union { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 75 | unsigned char b8[8]; |
| 76 | u_int64_t b64[1]; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 77 | } c; |
| 78 | union { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 79 | unsigned char b8[64]; |
| 80 | unsigned int b32[16]; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 81 | } m; |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 82 | unsigned char count; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 83 | }; |
| 84 | |
| 85 | /* sanity check */ |
| 86 | #if BYTE_ORDER != BIG_ENDIAN |
| 87 | # if BYTE_ORDER != LITTLE_ENDIAN |
| 88 | # define unsupported 1 |
| 89 | # endif |
| 90 | #endif |
| 91 | |
| 92 | #ifndef unsupported |
| 93 | |
| 94 | /* constant table */ |
David Galeano | d3ce131 | 2013-01-09 15:14:31 +0800 | [diff] [blame] | 95 | static const unsigned int _K[] = |
| 96 | { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 }; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 97 | #define K(t) _K[(t) / 20] |
| 98 | |
| 99 | #define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d))) |
| 100 | #define F1(b, c, d) (((b) ^ (c)) ^ (d)) |
| 101 | #define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d))) |
| 102 | #define F3(b, c, d) (((b) ^ (c)) ^ (d)) |
| 103 | |
| 104 | #define S(n, x) (((x) << (n)) | ((x) >> (32 - n))) |
| 105 | |
| 106 | #define H(n) (ctxt->h.b32[(n)]) |
| 107 | #define COUNT (ctxt->count) |
| 108 | #define BCOUNT (ctxt->c.b64[0] / 8) |
| 109 | #define W(n) (ctxt->m.b32[(n)]) |
| 110 | |
| 111 | #define PUTBYTE(x) { \ |
| 112 | ctxt->m.b8[(COUNT % 64)] = (x); \ |
| 113 | COUNT++; \ |
| 114 | COUNT %= 64; \ |
| 115 | ctxt->c.b64[0] += 8; \ |
| 116 | if (COUNT % 64 == 0) \ |
| 117 | sha1_step(ctxt); \ |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 118 | } |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 119 | |
| 120 | #define PUTPAD(x) { \ |
| 121 | ctxt->m.b8[(COUNT % 64)] = (x); \ |
| 122 | COUNT++; \ |
| 123 | COUNT %= 64; \ |
| 124 | if (COUNT % 64 == 0) \ |
| 125 | sha1_step(ctxt); \ |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 126 | } |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 127 | |
| 128 | static void sha1_step __P((struct sha1_ctxt *)); |
| 129 | |
| 130 | static void |
| 131 | sha1_step(struct sha1_ctxt *ctxt) |
| 132 | { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 133 | unsigned int a, b, c, d, e, tmp; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 134 | size_t t, s; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 135 | |
| 136 | #if BYTE_ORDER == LITTLE_ENDIAN |
| 137 | struct sha1_ctxt tctxt; |
| 138 | |
| 139 | memcpy(&tctxt.m.b8[0], &ctxt->m.b8[0], 64); |
| 140 | ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2]; |
| 141 | ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0]; |
| 142 | ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6]; |
| 143 | ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4]; |
| 144 | ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10]; |
| 145 | ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8]; |
| 146 | ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14]; |
| 147 | ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12]; |
| 148 | ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18]; |
| 149 | ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16]; |
| 150 | ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22]; |
| 151 | ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20]; |
| 152 | ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26]; |
| 153 | ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24]; |
| 154 | ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30]; |
| 155 | ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28]; |
| 156 | ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34]; |
| 157 | ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32]; |
| 158 | ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38]; |
| 159 | ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36]; |
| 160 | ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42]; |
| 161 | ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40]; |
| 162 | ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46]; |
| 163 | ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44]; |
| 164 | ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50]; |
| 165 | ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48]; |
| 166 | ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54]; |
| 167 | ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52]; |
| 168 | ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58]; |
| 169 | ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56]; |
| 170 | ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62]; |
| 171 | ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60]; |
| 172 | #endif |
| 173 | |
| 174 | a = H(0); b = H(1); c = H(2); d = H(3); e = H(4); |
| 175 | |
| 176 | for (t = 0; t < 20; t++) { |
| 177 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 178 | if (t >= 16) |
| 179 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 180 | W((s+2) & 0x0f) ^ W(s)); |
| 181 | |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 182 | tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t); |
| 183 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 184 | } |
| 185 | for (t = 20; t < 40; t++) { |
| 186 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 187 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 188 | W((s+2) & 0x0f) ^ W(s)); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 189 | tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t); |
| 190 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 191 | } |
| 192 | for (t = 40; t < 60; t++) { |
| 193 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 194 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 195 | W((s+2) & 0x0f) ^ W(s)); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 196 | tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t); |
| 197 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 198 | } |
| 199 | for (t = 60; t < 80; t++) { |
| 200 | s = t & 0x0f; |
Andy Green | 90c7cbc | 2011-01-27 06:26:52 +0000 | [diff] [blame] | 201 | W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ |
| 202 | W((s+2) & 0x0f) ^ W(s)); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 203 | tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t); |
| 204 | e = d; d = c; c = S(30, b); b = a; a = tmp; |
| 205 | } |
| 206 | |
| 207 | H(0) = H(0) + a; |
| 208 | H(1) = H(1) + b; |
| 209 | H(2) = H(2) + c; |
| 210 | H(3) = H(3) + d; |
| 211 | H(4) = H(4) + e; |
| 212 | |
| 213 | bzero(&ctxt->m.b8[0], 64); |
| 214 | } |
| 215 | |
| 216 | /*------------------------------------------------------------*/ |
| 217 | |
| 218 | void |
| 219 | sha1_init(struct sha1_ctxt *ctxt) |
| 220 | { |
| 221 | bzero(ctxt, sizeof(struct sha1_ctxt)); |
| 222 | H(0) = 0x67452301; |
| 223 | H(1) = 0xefcdab89; |
| 224 | H(2) = 0x98badcfe; |
| 225 | H(3) = 0x10325476; |
| 226 | H(4) = 0xc3d2e1f0; |
| 227 | } |
| 228 | |
| 229 | void |
| 230 | sha1_pad(struct sha1_ctxt *ctxt) |
| 231 | { |
| 232 | size_t padlen; /*pad length in bytes*/ |
| 233 | size_t padstart; |
| 234 | |
| 235 | PUTPAD(0x80); |
| 236 | |
| 237 | padstart = COUNT % 64; |
| 238 | padlen = 64 - padstart; |
| 239 | if (padlen < 8) { |
| 240 | bzero(&ctxt->m.b8[padstart], padlen); |
| 241 | COUNT += padlen; |
| 242 | COUNT %= 64; |
| 243 | sha1_step(ctxt); |
| 244 | padstart = COUNT % 64; /* should be 0 */ |
| 245 | padlen = 64 - padstart; /* should be 64 */ |
| 246 | } |
| 247 | bzero(&ctxt->m.b8[padstart], padlen - 8); |
| 248 | COUNT += (padlen - 8); |
| 249 | COUNT %= 64; |
| 250 | #if BYTE_ORDER == BIG_ENDIAN |
| 251 | PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]); |
| 252 | PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]); |
| 253 | PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]); |
| 254 | PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]); |
| 255 | #else |
| 256 | PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]); |
| 257 | PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]); |
| 258 | PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]); |
| 259 | PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]); |
| 260 | #endif |
| 261 | } |
| 262 | |
| 263 | void |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 264 | 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] | 265 | { |
| 266 | size_t gaplen; |
| 267 | size_t gapstart; |
| 268 | size_t off; |
| 269 | size_t copysiz; |
| 270 | |
| 271 | off = 0; |
| 272 | |
| 273 | while (off < len) { |
| 274 | gapstart = COUNT % 64; |
| 275 | gaplen = 64 - gapstart; |
| 276 | |
| 277 | copysiz = (gaplen < len - off) ? gaplen : len - off; |
| 278 | memcpy(&ctxt->m.b8[gapstart], &input[off], copysiz); |
| 279 | COUNT += copysiz; |
| 280 | COUNT %= 64; |
| 281 | ctxt->c.b64[0] += copysiz * 8; |
| 282 | if (COUNT % 64 == 0) |
| 283 | sha1_step(ctxt); |
| 284 | off += copysiz; |
| 285 | } |
| 286 | } |
| 287 | |
| 288 | void |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 289 | sha1_result(struct sha1_ctxt *ctxt, void *digest0) |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 290 | { |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 291 | unsigned char *digest; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 292 | |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 293 | digest = (unsigned char *)digest0; |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 294 | sha1_pad(ctxt); |
| 295 | #if BYTE_ORDER == BIG_ENDIAN |
| 296 | memcpy(digest, &ctxt->h.b8[0], 20); |
| 297 | #else |
| 298 | digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2]; |
| 299 | digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0]; |
| 300 | digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6]; |
| 301 | digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4]; |
| 302 | digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10]; |
| 303 | digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8]; |
| 304 | digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14]; |
| 305 | digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12]; |
| 306 | digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18]; |
| 307 | digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16]; |
| 308 | #endif |
| 309 | } |
| 310 | |
| 311 | /* |
| 312 | * This should look and work like the libcrypto implementation |
| 313 | */ |
| 314 | |
| 315 | unsigned char * |
| 316 | SHA1(const unsigned char *d, size_t n, unsigned char *md) |
| 317 | { |
| 318 | struct sha1_ctxt ctx; |
| 319 | |
| 320 | sha1_init(&ctx); |
| 321 | sha1_loop(&ctx, d, n); |
Andy Green | 6ee372f | 2012-04-09 15:09:01 +0800 | [diff] [blame] | 322 | sha1_result(&ctx, (void *)md); |
Andy Green | 7619c47 | 2011-01-23 17:47:08 +0000 | [diff] [blame] | 323 | |
| 324 | return md; |
| 325 | } |
| 326 | |
| 327 | #endif /*unsupported*/ |