sha1.c revision 1.1
1 /* $NetBSD: sha1.c,v 1.1 2005/12/20 20:29:40 christos Exp $ */ 2 /* $OpenBSD: sha1.c,v 1.9 1997/07/23 21:12:32 kstailey Exp $ */ 3 4 /* 5 * SHA-1 in C 6 * By Steve Reid <steve (at) edmweb.com> 7 * 100% Public Domain 8 * 9 * Test Vectors (from FIPS PUB 180-1) 10 * "abc" 11 * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 12 * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" 13 * 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 14 * A million repetitions of "a" 15 * 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F 16 */ 17 18 #define SHA1HANDSOFF /* Copies data before messing with it. */ 19 20 #if defined(_KERNEL) || defined(_STANDALONE) 21 #include <lib/libkern/libkern.h> 22 #include <sys/sha1.h> 23 #else 24 #include <sys/cdefs.h> 25 #if defined(LIBC_SCCS) && !defined(lint) 26 __RCSID("$NetBSD: sha1.c,v 1.1 2005/12/20 20:29:40 christos Exp $"); 27 #endif /* LIBC_SCCS and not lint */ 28 #include "namespace.h" 29 #include <sys/types.h> 30 #include <assert.h> 31 #include <sha1.h> 32 #include <string.h> 33 #endif 34 35 #if HAVE_NBTOOL_CONFIG_H 36 #include "nbtool_config.h" 37 #endif 38 39 #if !HAVE_SHA1_H 40 41 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 42 43 /* 44 * blk0() and blk() perform the initial expand. 45 * I got the idea of expanding during the round function from SSLeay 46 */ 47 #if BYTE_ORDER == LITTLE_ENDIAN 48 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 49 |(rol(block->l[i],8)&0x00FF00FF)) 50 #else 51 # define blk0(i) block->l[i] 52 #endif 53 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 54 ^block->l[(i+2)&15]^block->l[i&15],1)) 55 56 /* 57 * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1 58 */ 59 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); 60 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); 61 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); 62 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); 63 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); 64 65 66 #if !defined(_KERNEL) && defined(__weak_alias) 67 __weak_alias(SHA1Transform,_SHA1Transform) 68 __weak_alias(SHA1Init,_SHA1Init) 69 __weak_alias(SHA1Update,_SHA1Update) 70 __weak_alias(SHA1Final,_SHA1Final) 71 #endif 72 73 typedef union { 74 u_char c[64]; 75 u_int l[16]; 76 } CHAR64LONG16; 77 78 /* old sparc64 gcc could not compile this */ 79 #undef SPARC64_GCC_WORKAROUND 80 #if defined(__sparc64__) && defined(__GNUC__) && __GNUC__ < 3 81 #define SPARC64_GCC_WORKAROUND 82 #endif 83 84 #ifdef SPARC64_GCC_WORKAROUND 85 void do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *); 86 void do_R2(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *); 87 void do_R3(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *); 88 void do_R4(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *); 89 90 #define nR0(v,w,x,y,z,i) R0(*v,*w,*x,*y,*z,i) 91 #define nR1(v,w,x,y,z,i) R1(*v,*w,*x,*y,*z,i) 92 #define nR2(v,w,x,y,z,i) R2(*v,*w,*x,*y,*z,i) 93 #define nR3(v,w,x,y,z,i) R3(*v,*w,*x,*y,*z,i) 94 #define nR4(v,w,x,y,z,i) R4(*v,*w,*x,*y,*z,i) 95 96 void 97 do_R01(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) 98 { 99 nR0(a,b,c,d,e, 0); nR0(e,a,b,c,d, 1); nR0(d,e,a,b,c, 2); nR0(c,d,e,a,b, 3); 100 nR0(b,c,d,e,a, 4); nR0(a,b,c,d,e, 5); nR0(e,a,b,c,d, 6); nR0(d,e,a,b,c, 7); 101 nR0(c,d,e,a,b, 8); nR0(b,c,d,e,a, 9); nR0(a,b,c,d,e,10); nR0(e,a,b,c,d,11); 102 nR0(d,e,a,b,c,12); nR0(c,d,e,a,b,13); nR0(b,c,d,e,a,14); nR0(a,b,c,d,e,15); 103 nR1(e,a,b,c,d,16); nR1(d,e,a,b,c,17); nR1(c,d,e,a,b,18); nR1(b,c,d,e,a,19); 104 } 105 106 void 107 do_R2(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) 108 { 109 nR2(a,b,c,d,e,20); nR2(e,a,b,c,d,21); nR2(d,e,a,b,c,22); nR2(c,d,e,a,b,23); 110 nR2(b,c,d,e,a,24); nR2(a,b,c,d,e,25); nR2(e,a,b,c,d,26); nR2(d,e,a,b,c,27); 111 nR2(c,d,e,a,b,28); nR2(b,c,d,e,a,29); nR2(a,b,c,d,e,30); nR2(e,a,b,c,d,31); 112 nR2(d,e,a,b,c,32); nR2(c,d,e,a,b,33); nR2(b,c,d,e,a,34); nR2(a,b,c,d,e,35); 113 nR2(e,a,b,c,d,36); nR2(d,e,a,b,c,37); nR2(c,d,e,a,b,38); nR2(b,c,d,e,a,39); 114 } 115 116 void 117 do_R3(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) 118 { 119 nR3(a,b,c,d,e,40); nR3(e,a,b,c,d,41); nR3(d,e,a,b,c,42); nR3(c,d,e,a,b,43); 120 nR3(b,c,d,e,a,44); nR3(a,b,c,d,e,45); nR3(e,a,b,c,d,46); nR3(d,e,a,b,c,47); 121 nR3(c,d,e,a,b,48); nR3(b,c,d,e,a,49); nR3(a,b,c,d,e,50); nR3(e,a,b,c,d,51); 122 nR3(d,e,a,b,c,52); nR3(c,d,e,a,b,53); nR3(b,c,d,e,a,54); nR3(a,b,c,d,e,55); 123 nR3(e,a,b,c,d,56); nR3(d,e,a,b,c,57); nR3(c,d,e,a,b,58); nR3(b,c,d,e,a,59); 124 } 125 126 void 127 do_R4(u_int32_t *a, u_int32_t *b, u_int32_t *c, u_int32_t *d, u_int32_t *e, CHAR64LONG16 *block) 128 { 129 nR4(a,b,c,d,e,60); nR4(e,a,b,c,d,61); nR4(d,e,a,b,c,62); nR4(c,d,e,a,b,63); 130 nR4(b,c,d,e,a,64); nR4(a,b,c,d,e,65); nR4(e,a,b,c,d,66); nR4(d,e,a,b,c,67); 131 nR4(c,d,e,a,b,68); nR4(b,c,d,e,a,69); nR4(a,b,c,d,e,70); nR4(e,a,b,c,d,71); 132 nR4(d,e,a,b,c,72); nR4(c,d,e,a,b,73); nR4(b,c,d,e,a,74); nR4(a,b,c,d,e,75); 133 nR4(e,a,b,c,d,76); nR4(d,e,a,b,c,77); nR4(c,d,e,a,b,78); nR4(b,c,d,e,a,79); 134 } 135 #endif 136 137 /* 138 * Hash a single 512-bit block. This is the core of the algorithm. 139 */ 140 void SHA1Transform(state, buffer) 141 u_int32_t state[5]; 142 const u_char buffer[64]; 143 { 144 u_int32_t a, b, c, d, e; 145 CHAR64LONG16 *block; 146 147 #ifdef SHA1HANDSOFF 148 CHAR64LONG16 workspace; 149 #endif 150 151 _DIAGASSERT(buffer != 0); 152 _DIAGASSERT(state != 0); 153 154 #ifdef SHA1HANDSOFF 155 block = &workspace; 156 (void)memcpy(block, buffer, 64); 157 #else 158 block = (CHAR64LONG16 *)(void *)buffer; 159 #endif 160 161 /* Copy context->state[] to working vars */ 162 a = state[0]; 163 b = state[1]; 164 c = state[2]; 165 d = state[3]; 166 e = state[4]; 167 168 #ifdef SPARC64_GCC_WORKAROUND 169 do_R01(&a, &b, &c, &d, &e, block); 170 do_R2(&a, &b, &c, &d, &e, block); 171 do_R3(&a, &b, &c, &d, &e, block); 172 do_R4(&a, &b, &c, &d, &e, block); 173 #else 174 /* 4 rounds of 20 operations each. Loop unrolled. */ 175 R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3); 176 R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7); 177 R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11); 178 R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15); 179 R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19); 180 R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23); 181 R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27); 182 R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31); 183 R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35); 184 R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39); 185 R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43); 186 R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47); 187 R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51); 188 R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55); 189 R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59); 190 R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63); 191 R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67); 192 R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71); 193 R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75); 194 R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79); 195 #endif 196 197 /* Add the working vars back into context.state[] */ 198 state[0] += a; 199 state[1] += b; 200 state[2] += c; 201 state[3] += d; 202 state[4] += e; 203 204 /* Wipe variables */ 205 a = b = c = d = e = 0; 206 } 207 208 209 /* 210 * SHA1Init - Initialize new context 211 */ 212 void SHA1Init(context) 213 SHA1_CTX *context; 214 { 215 216 _DIAGASSERT(context != 0); 217 218 /* SHA1 initialization constants */ 219 context->state[0] = 0x67452301; 220 context->state[1] = 0xEFCDAB89; 221 context->state[2] = 0x98BADCFE; 222 context->state[3] = 0x10325476; 223 context->state[4] = 0xC3D2E1F0; 224 context->count[0] = context->count[1] = 0; 225 } 226 227 228 /* 229 * Run your data through this. 230 */ 231 void SHA1Update(context, data, len) 232 SHA1_CTX *context; 233 const u_char *data; 234 u_int len; 235 { 236 u_int i, j; 237 238 _DIAGASSERT(context != 0); 239 _DIAGASSERT(data != 0); 240 241 j = context->count[0]; 242 if ((context->count[0] += len << 3) < j) 243 context->count[1] += (len>>29)+1; 244 j = (j >> 3) & 63; 245 if ((j + len) > 63) { 246 (void)memcpy(&context->buffer[j], data, (i = 64-j)); 247 SHA1Transform(context->state, context->buffer); 248 for ( ; i + 63 < len; i += 64) 249 SHA1Transform(context->state, &data[i]); 250 j = 0; 251 } else { 252 i = 0; 253 } 254 (void)memcpy(&context->buffer[j], &data[i], len - i); 255 } 256 257 258 /* 259 * Add padding and return the message digest. 260 */ 261 void SHA1Final(digest, context) 262 u_char digest[20]; 263 SHA1_CTX* context; 264 { 265 u_int i; 266 u_char finalcount[8]; 267 268 _DIAGASSERT(digest != 0); 269 _DIAGASSERT(context != 0); 270 271 for (i = 0; i < 8; i++) { 272 finalcount[i] = (u_char)((context->count[(i >= 4 ? 0 : 1)] 273 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ 274 } 275 SHA1Update(context, (const u_char *)"\200", 1); 276 while ((context->count[0] & 504) != 448) 277 SHA1Update(context, (const u_char *)"\0", 1); 278 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ 279 280 if (digest) { 281 for (i = 0; i < 20; i++) 282 digest[i] = (u_char) 283 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); 284 } 285 } 286 287 #endif /* HAVE_SHA1_H */ 288
Indexes created Fri Oct 03 02:09:57 GMT 2025