Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/crypto/sha1.c
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /* $KAME: sha1.c,v 1.5 2000/11/08 06:13:08 itojun Exp $ */ 2 /*- 3 * SPDX-License-Identifier: BSD-3-Clause 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 /* 34 * FIPS pub 180-1: Secure Hash Algorithm (SHA-1) 35 * based on: http://csrc.nist.gov/fips/fip180-1.txt 36 * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org> 37 */ 38 39 #include <sys/cdefs.h> 40 __FBSDID("$FreeBSD$"); 41 42 #include <sys/types.h> 43 #include <sys/cdefs.h> 44 #include <sys/time.h> 45 #include <sys/systm.h> 46 47 #include <crypto/sha1.h> 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 #define H(n) (ctxt->h.b32[(n)]) 70 #define COUNT (ctxt->count) 71 #define BCOUNT (ctxt->c.b64[0] / 8) 72 #define W(n) (ctxt->m.b32[(n)]) 73 74 #define PUTBYTE(x) { \ 75 ctxt->m.b8[(COUNT % 64)] = (x); \ 76 COUNT++; \ 77 COUNT %= 64; \ 78 ctxt->c.b64[0] += 8; \ 79 if (COUNT % 64 == 0) \ 80 sha1_step(ctxt); \ 81 } 82 83 #define PUTPAD(x) { \ 84 ctxt->m.b8[(COUNT % 64)] = (x); \ 85 COUNT++; \ 86 COUNT %= 64; \ 87 if (COUNT % 64 == 0) \ 88 sha1_step(ctxt); \ 89 } 90 91 static void sha1_step(struct sha1_ctxt *); 92 93 static void 94 sha1_step(ctxt) 95 struct sha1_ctxt *ctxt; 96 { 97 u_int32_t a, b, c, d, e; 98 size_t t, s; 99 u_int32_t tmp; 100 101 #if BYTE_ORDER == LITTLE_ENDIAN 102 struct sha1_ctxt tctxt; 103 bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64); 104 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2]; 105 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0]; 106 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6]; 107 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4]; 108 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10]; 109 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8]; 110 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14]; 111 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12]; 112 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18]; 113 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16]; 114 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22]; 115 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20]; 116 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26]; 117 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24]; 118 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30]; 119 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28]; 120 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34]; 121 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32]; 122 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38]; 123 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36]; 124 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42]; 125 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40]; 126 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46]; 127 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44]; 128 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50]; 129 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48]; 130 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54]; 131 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52]; 132 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58]; 133 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56]; 134 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62]; 135 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60]; 136 #endif 137 138 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4); 139 140 for (t = 0; t < 20; t++) { 141 s = t & 0x0f; 142 if (t >= 16) { 143 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); 144 } 145 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t); 146 e = d; d = c; c = S(30, b); b = a; a = tmp; 147 } 148 for (t = 20; t < 40; t++) { 149 s = t & 0x0f; 150 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); 151 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t); 152 e = d; d = c; c = S(30, b); b = a; a = tmp; 153 } 154 for (t = 40; t < 60; t++) { 155 s = t & 0x0f; 156 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); 157 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t); 158 e = d; d = c; c = S(30, b); b = a; a = tmp; 159 } 160 for (t = 60; t < 80; t++) { 161 s = t & 0x0f; 162 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s)); 163 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t); 164 e = d; d = c; c = S(30, b); b = a; a = tmp; 165 } 166 167 H(0) = H(0) + a; 168 H(1) = H(1) + b; 169 H(2) = H(2) + c; 170 H(3) = H(3) + d; 171 H(4) = H(4) + e; 172 173 bzero(&ctxt->m.b8[0], 64); 174 } 175 176 /*------------------------------------------------------------*/ 177 178 void 179 sha1_init(ctxt) 180 struct sha1_ctxt *ctxt; 181 { 182 bzero(ctxt, sizeof(struct sha1_ctxt)); 183 H(0) = 0x67452301; 184 H(1) = 0xefcdab89; 185 H(2) = 0x98badcfe; 186 H(3) = 0x10325476; 187 H(4) = 0xc3d2e1f0; 188 } 189 190 void 191 sha1_pad(ctxt) 192 struct sha1_ctxt *ctxt; 193 { 194 size_t padlen; /*pad length in bytes*/ 195 size_t padstart; 196 197 PUTPAD(0x80); 198 199 padstart = COUNT % 64; 200 padlen = 64 - padstart; 201 if (padlen < 8) { 202 bzero(&ctxt->m.b8[padstart], padlen); 203 COUNT += padlen; 204 COUNT %= 64; 205 sha1_step(ctxt); 206 padstart = COUNT % 64; /* should be 0 */ 207 padlen = 64 - padstart; /* should be 64 */ 208 } 209 bzero(&ctxt->m.b8[padstart], padlen - 8); 210 COUNT += (padlen - 8); 211 COUNT %= 64; 212 #if BYTE_ORDER == BIG_ENDIAN 213 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]); 214 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]); 215 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]); 216 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]); 217 #else 218 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]); 219 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]); 220 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]); 221 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]); 222 #endif 223 } 224 225 void 226 sha1_loop(ctxt, input, len) 227 struct sha1_ctxt *ctxt; 228 const u_int8_t *input; 229 size_t len; 230 { 231 size_t gaplen; 232 size_t gapstart; 233 size_t off; 234 size_t copysiz; 235 236 off = 0; 237 238 while (off < len) { 239 gapstart = COUNT % 64; 240 gaplen = 64 - gapstart; 241 242 copysiz = (gaplen < len - off) ? gaplen : len - off; 243 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz); 244 COUNT += copysiz; 245 COUNT %= 64; 246 ctxt->c.b64[0] += copysiz * 8; 247 if (COUNT % 64 == 0) 248 sha1_step(ctxt); 249 off += copysiz; 250 } 251 } 252 253 void 254 sha1_result(struct sha1_ctxt *ctxt, char digest0[static SHA1_RESULTLEN]) 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, SHA1_RESULTLEN); 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*/
Cache object: c2032ed1419e2715086fc9f52a3367dc
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]