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