1 /* 2 SHA-1 in C 3 By Steve Reid <sreid@sea-to-sky.net> 4 100% Public Domain 5 6 ----------------- 7 Modified 7/98 8 By James H. Brown <jbrown@burgoyne.com> 9 Still 100% Public Domain 10 11 Corrected a problem which generated improper hash values on 16 bit machines 12 Routine SHA1Update changed from 13 void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int 14 len) 15 to 16 void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned 17 long len) 18 19 The 'len' parameter was declared an int which works fine on 32 bit machines. 20 However, on 16 bit machines an int is too small for the shifts being done 21 against 22 it. This caused the hash function to generate incorrect values if len was 23 greater than 8191 (8K - 1) due to the 'len << 3' on line 3 of SHA1Update(). 24 25 Since the file IO in main() reads 16K at a time, any file 8K or larger would 26 be guaranteed to generate the wrong hash (e.g. Test Vector #3, a million 27 "a"s). 28 29 I also changed the declaration of variables i & j in SHA1Update to 30 unsigned long from unsigned int for the same reason. 31 32 These changes should make no difference to any 32 bit implementations since 33 an 34 int and a long are the same size in those environments. 35 36 -- 37 I also corrected a few compiler warnings generated by Borland C. 38 1. Added #include <process.h> for exit() prototype 39 2. Removed unused variable 'j' in SHA1Final 40 3. Changed exit(0) to return(0) at end of main. 41 42 ALL changes I made can be located by searching for comments containing 'JHB' 43 ----------------- 44 Modified 8/98 45 By Steve Reid <sreid@sea-to-sky.net> 46 Still 100% public domain 47 48 1- Removed #include <process.h> and used return() instead of exit() 49 2- Fixed overwriting of finalcount in SHA1Final() (discovered by Chris Hall) 50 3- Changed email address from steve@edmweb.com to sreid@sea-to-sky.net 51 52 ----------------- 53 Modified 4/01 54 By Saul Kravitz <Saul.Kravitz@celera.com> 55 Still 100% PD 56 Modified to run on Compaq Alpha hardware. 57 58 ----------------- 59 Modified 07/2002 60 By Ralph Giles <giles@ghostscript.com> 61 Still 100% public domain 62 modified for use with stdint types, autoconf 63 code cleanup, removed attribution comments 64 switched SHA1Final() argument order for consistency 65 use SHA1_ prefix for public api 66 move public api to sha1.h 67 */ 68 69 /* 70 Test Vectors (from FIPS PUB 180-1) 71 "abc" 72 A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 73 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" 74 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 75 A million repetitions of "a" 76 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F 77 */ 78 79 #include <stdio.h> 80 #include <string.h> 81 #include "sha1.h" 82 83 84 static void SHA1_Transform(uint32_t state[5], const uint8_t buffer[64]); 85 86 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 87 88 /* blk0() and blk() perform the initial expand. */ 89 /* I got the idea of expanding during the round function from SSLeay */ 90 /* FIXME: can we do this in an endian-proof way? */ 91 #ifdef WORDS_BIGENDIAN 92 #define blk0(i) block.l[i] 93 #else 94 #define blk0(i) (block.l[i] = (rol(block.l[i],24)&0xFF00FF00) \ 95 |(rol(block.l[i],8)&0x00FF00FF)) 96 #endif 97 #define blk(i) (block.l[i&15] = rol(block.l[(i+13)&15]^block.l[(i+8)&15] \ 98 ^block.l[(i+2)&15]^block.l[i&15],1)) 99 100 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ 101 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); 102 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); 103 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); 104 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); 105 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); 106 107 108 /* Hash a single 512-bit block. This is the core of the algorithm. */ 109 static void SHA1_Transform(uint32_t state[5], const uint8_t buffer[64]) 110 { 111 uint32_t a, b, c, d, e; 112 typedef union { 113 uint8_t c[64]; 114 uint32_t l[16]; 115 } CHAR64LONG16; 116 CHAR64LONG16 block; 117 118 memcpy(&block, buffer, 64); 119 120 /* Copy context->state[] to working vars */ 121 a = state[0]; 122 b = state[1]; 123 c = state[2]; 124 d = state[3]; 125 e = state[4]; 126 127 /* 4 rounds of 20 operations each. Loop unrolled. */ 128 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); 129 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); 130 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); 131 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); 132 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); 133 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); 134 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); 135 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); 136 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); 137 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); 138 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); 139 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); 140 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); 141 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); 142 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); 143 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); 144 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); 145 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); 146 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); 147 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); 148 149 /* Add the working vars back into context.state[] */ 150 state[0] += a; 151 state[1] += b; 152 state[2] += c; 153 state[3] += d; 154 state[4] += e; 155 156 /* Wipe variables */ 157 a = b = c = d = e = 0; 158 } 159 160 161 /* SHA1Init - Initialize new context */ 162 void solv_SHA1_Init(SHA1_CTX* context) 163 { 164 /* SHA1 initialization constants */ 165 context->state[0] = 0x67452301; 166 context->state[1] = 0xEFCDAB89; 167 context->state[2] = 0x98BADCFE; 168 context->state[3] = 0x10325476; 169 context->state[4] = 0xC3D2E1F0; 170 context->count[0] = context->count[1] = 0; 171 } 172 173 174 /* Run your data through this. */ 175 void solv_SHA1_Update(SHA1_CTX* context, const uint8_t* data, const size_t len) 176 { 177 size_t i, j; 178 179 #ifdef VERBOSE 180 SHAPrintContext(context, "before"); 181 #endif 182 183 j = (context->count[0] >> 3) & 63; 184 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++; 185 context->count[1] += (len >> 29); 186 if ((j + len) > 63) { 187 memcpy(&context->buffer[j], data, (i = 64-j)); 188 SHA1_Transform(context->state, context->buffer); 189 for ( ; i + 63 < len; i += 64) { 190 SHA1_Transform(context->state, data + i); 191 } 192 j = 0; 193 } 194 else i = 0; 195 memcpy(&context->buffer[j], &data[i], len - i); 196 197 #ifdef VERBOSE 198 SHAPrintContext(context, "after "); 199 #endif 200 } 201 202 203 /* Add padding and return the message digest. */ 204 void solv_SHA1_Final(SHA1_CTX* context, uint8_t digest[SHA1_DIGEST_SIZE]) 205 { 206 uint32_t i; 207 uint8_t finalcount[8]; 208 209 for (i = 0; i < 8; i++) { 210 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] 211 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ 212 } 213 solv_SHA1_Update(context, (uint8_t *)"\200", 1); 214 while ((context->count[0] & 504) != 448) { 215 solv_SHA1_Update(context, (uint8_t *)"\0", 1); 216 } 217 solv_SHA1_Update(context, finalcount, 8); /* Should cause a SHA1_Transform() */ 218 for (i = 0; i < SHA1_DIGEST_SIZE; i++) { 219 digest[i] = (uint8_t) 220 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); 221 } 222 223 /* Wipe variables */ 224 i = 0; 225 memset(context->buffer, 0, 64); 226 memset(context->state, 0, 20); 227 memset(context->count, 0, 8); 228 memset(finalcount, 0, 8); /* SWR */ 229 } 230