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