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