sha1.c revision 57121
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 * $FreeBSD: head/sys/crypto/sha1.c 57121 2000-02-10 19:35:53Z shin $ 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#include <sys/types.h> 38#include <sys/cdefs.h> 39#include <sys/time.h> 40#include <sys/systm.h> 41 42#include <crypto/sha1.h> 43 44/* sanity check */ 45#if BYTE_ORDER != BIG_ENDIAN 46# if BYTE_ORDER != LITTLE_ENDIAN 47# define unsupported 1 48# endif 49#endif 50 51#ifndef unsupported 52 53/* constant table */ 54static u_int32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 }; 55#define K(t) _K[(t) / 20] 56 57#define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d))) 58#define F1(b, c, d) (((b) ^ (c)) ^ (d)) 59#define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d))) 60#define F3(b, c, d) (((b) ^ (c)) ^ (d)) 61 62#define S(n, x) (((x) << (n)) | ((x) >> (32 - n))) 63 64#define H(n) (ctxt->h.b32[(n)]) 65#define COUNT (ctxt->count) 66#define BCOUNT (ctxt->c.b64[0] / 8) 67#define W(n) (ctxt->m.b32[(n)]) 68 69#define PUTBYTE(x) { \ 70 ctxt->m.b8[(COUNT % 64)] = (x); \ 71 COUNT++; \ 72 COUNT %= 64; \ 73 ctxt->c.b64[0] += 8; \ 74 if (COUNT % 64 == 0) \ 75 sha1_step(ctxt); \ 76 } 77 78#define PUTPAD(x) { \ 79 ctxt->m.b8[(COUNT % 64)] = (x); \ 80 COUNT++; \ 81 COUNT %= 64; \ 82 if (COUNT % 64 == 0) \ 83 sha1_step(ctxt); \ 84 } 85 86static void sha1_step __P((struct sha1_ctxt *)); 87 88static void 89sha1_step(ctxt) 90 struct sha1_ctxt *ctxt; 91{ 92 u_int32_t a, b, c, d, e; 93 size_t t, s; 94 u_int32_t tmp; 95 96#if BYTE_ORDER == LITTLE_ENDIAN 97 struct sha1_ctxt tctxt; 98 bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64); 99 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2]; 100 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0]; 101 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6]; 102 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4]; 103 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10]; 104 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8]; 105 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14]; 106 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12]; 107 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18]; 108 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16]; 109 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22]; 110 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20]; 111 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26]; 112 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24]; 113 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30]; 114 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28]; 115 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34]; 116 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32]; 117 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38]; 118 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36]; 119 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42]; 120 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40]; 121 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46]; 122 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44]; 123 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50]; 124 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48]; 125 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54]; 126 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52]; 127 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58]; 128 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56]; 129 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62]; 130 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60]; 131#endif 132 133 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4); 134 135 for (t = 0; t < 20; t++) { 136 s = t & 0x0f; 137 if (t >= 16) { 138 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); 139 } 140 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t); 141 e = d; d = c; c = S(30, b); b = a; a = tmp; 142 } 143 for (t = 20; t < 40; t++) { 144 s = t & 0x0f; 145 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); 146 tmp = S(5, a) + F1(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 = 40; t < 60; 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) + F2(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 = 60; t < 80; 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) + F3(b, c, d) + e + W(s) + K(t); 159 e = d; d = c; c = S(30, b); b = a; a = tmp; 160 } 161 162 H(0) = H(0) + a; 163 H(1) = H(1) + b; 164 H(2) = H(2) + c; 165 H(3) = H(3) + d; 166 H(4) = H(4) + e; 167 168 bzero(&ctxt->m.b8[0], 64); 169} 170 171/*------------------------------------------------------------*/ 172 173void 174sha1_init(ctxt) 175 struct sha1_ctxt *ctxt; 176{ 177 bzero(ctxt, sizeof(struct sha1_ctxt)); 178 H(0) = 0x67452301; 179 H(1) = 0xefcdab89; 180 H(2) = 0x98badcfe; 181 H(3) = 0x10325476; 182 H(4) = 0xc3d2e1f0; 183} 184 185void 186sha1_pad(ctxt) 187 struct sha1_ctxt *ctxt; 188{ 189 size_t padlen; /*pad length in bytes*/ 190 size_t padstart; 191 192 PUTPAD(0x80); 193 194 padstart = COUNT % 64; 195 padlen = 64 - padstart; 196 if (padlen < 8) { 197 bzero(&ctxt->m.b8[padstart], padlen); 198 COUNT += padlen; 199 COUNT %= 64; 200 sha1_step(ctxt); 201 padstart = COUNT % 64; /* should be 0 */ 202 padlen = 64 - padstart; /* should be 64 */ 203 } 204 bzero(&ctxt->m.b8[padstart], padlen - 8); 205 COUNT += (padlen - 8); 206 COUNT %= 64; 207#if BYTE_ORDER == BIG_ENDIAN 208 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]); 209 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]); 210 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]); 211 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]); 212#else 213 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]); 214 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]); 215 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]); 216 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]); 217#endif 218} 219 220void 221sha1_loop(ctxt, input0, len) 222 struct sha1_ctxt *ctxt; 223 const caddr_t input0; 224 size_t len; 225{ 226 u_int8_t *input; 227 size_t gaplen; 228 size_t gapstart; 229 size_t off; 230 size_t copysiz; 231 232 input = (u_int8_t *)input0; 233 off = 0; 234 235 while (off < len) { 236 gapstart = COUNT % 64; 237 gaplen = 64 - gapstart; 238 239 copysiz = (gaplen < len - off) ? gaplen : len - off; 240 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz); 241 COUNT += copysiz; 242 COUNT %= 64; 243 ctxt->c.b64[0] += copysiz * 8; 244 if (COUNT % 64 == 0) 245 sha1_step(ctxt); 246 off += copysiz; 247 } 248} 249 250void 251sha1_result(ctxt, digest0) 252 struct sha1_ctxt *ctxt; 253 caddr_t digest0; 254{ 255 u_int8_t *digest; 256 257 digest = (u_int8_t *)digest0; 258 sha1_pad(ctxt); 259#if BYTE_ORDER == BIG_ENDIAN 260 bcopy(&ctxt->h.b8[0], digest, 20); 261#else 262 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2]; 263 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0]; 264 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6]; 265 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4]; 266 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10]; 267 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8]; 268 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14]; 269 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12]; 270 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18]; 271 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16]; 272#endif 273} 274 275#endif /*unsupported*/ 276