1 2 /* from valgrind tests */ 3 4 /* ================ sha1.c ================ */ 5 /* 6 SHA-1 in C 7 By Steve Reid <[email protected]> 8 100% Public Domain 9 10 Test Vectors (from FIPS PUB 180-1) 11 "abc" 12 A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 13 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" 14 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 15 A million repetitions of "a" 16 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F 17 */ 18 19 /* #define LITTLE_ENDIAN * This should be #define'd already, if true. */ 20 /* #define SHA1HANDSOFF * Copies data before messing with it. */ 21 22 #define SHA1HANDSOFF 23 24 #include <stdio.h> 25 #include <string.h> 26 #include <sys/types.h> /* for u_int*_t */ 27 #if defined(__sun) 28 #include "solarisfixes.h" 29 #endif 30 #include "sha1.h" 31 #include "config.h" 32 33 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 34 35 /* blk0() and blk() perform the initial expand. */ 36 /* I got the idea of expanding during the round function from SSLeay */ 37 #if BYTE_ORDER == LITTLE_ENDIAN 38 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 39 |(rol(block->l[i],8)&0x00FF00FF)) 40 #elif BYTE_ORDER == BIG_ENDIAN 41 #define blk0(i) block->l[i] 42 #else 43 #error "Endianness not defined!" 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 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ 49 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); 50 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); 51 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); 52 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); 53 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); 54 55 56 /* Hash a single 512-bit block. This is the core of the algorithm. */ 57 58 void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64]) 59 { 60 u_int32_t a, b, c, d, e; 61 typedef union { 62 unsigned char c[64]; 63 u_int32_t l[16]; 64 } CHAR64LONG16; 65 #ifdef SHA1HANDSOFF 66 CHAR64LONG16 block[1]; /* use array to appear as a pointer */ 67 memcpy(block, buffer, 64); 68 #else 69 /* The following had better never be used because it causes the 70 * pointer-to-const buffer to be cast into a pointer to non-const. 71 * And the result is written through. I threw a "const" in, hoping 72 * this will cause a diagnostic. 73 */ 74 CHAR64LONG16* block = (const CHAR64LONG16*)buffer; 75 #endif 76 /* Copy context->state[] to working vars */ 77 a = state[0]; 78 b = state[1]; 79 c = state[2]; 80 d = state[3]; 81 e = state[4]; 82 /* 4 rounds of 20 operations each. Loop unrolled. */ 83 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); 84 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); 85 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); 86 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); 87 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); 88 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); 89 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); 90 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); 91 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); 92 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); 93 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); 94 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); 95 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); 96 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); 97 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); 98 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); 99 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); 100 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); 101 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); 102 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); 103 /* Add the working vars back into context.state[] */ 104 state[0] += a; 105 state[1] += b; 106 state[2] += c; 107 state[3] += d; 108 state[4] += e; 109 /* Wipe variables */ 110 a = b = c = d = e = 0; 111 #ifdef SHA1HANDSOFF 112 memset(block, '\0', sizeof(block)); 113 #endif 114 } 115 116 117 /* SHA1Init - Initialize new context */ 118 119 void SHA1Init(SHA1_CTX* context) 120 { 121 /* SHA1 initialization constants */ 122 context->state[0] = 0x67452301; 123 context->state[1] = 0xEFCDAB89; 124 context->state[2] = 0x98BADCFE; 125 context->state[3] = 0x10325476; 126 context->state[4] = 0xC3D2E1F0; 127 context->count[0] = context->count[1] = 0; 128 } 129 130 131 /* Run your data through this. */ 132 133 void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len) 134 { 135 u_int32_t i, j; 136 137 j = context->count[0]; 138 if ((context->count[0] += len << 3) < j) 139 context->count[1]++; 140 context->count[1] += (len>>29); 141 j = (j >> 3) & 63; 142 if ((j + len) > 63) { 143 memcpy(&context->buffer[j], data, (i = 64-j)); 144 SHA1Transform(context->state, context->buffer); 145 for ( ; i + 63 < len; i += 64) { 146 SHA1Transform(context->state, &data[i]); 147 } 148 j = 0; 149 } 150 else i = 0; 151 memcpy(&context->buffer[j], &data[i], len - i); 152 } 153 154 155 /* Add padding and return the message digest. */ 156 157 void SHA1Final(unsigned char digest[20], SHA1_CTX* context) 158 { 159 unsigned i; 160 unsigned char finalcount[8]; 161 unsigned char c; 162 163 #if 0 /* untested "improvement" by DHR */ 164 /* Convert context->count to a sequence of bytes 165 * in finalcount. Second element first, but 166 * big-endian order within element. 167 * But we do it all backwards. 168 */ 169 unsigned char *fcp = &finalcount[8]; 170 171 for (i = 0; i < 2; i++) 172 { 173 u_int32_t t = context->count[i]; 174 int j; 175 176 for (j = 0; j < 4; t >>= 8, j++) 177 *--fcp = (unsigned char) t; 178 } 179 #else 180 for (i = 0; i < 8; i++) { 181 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] 182 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ 183 } 184 #endif 185 c = 0200; 186 SHA1Update(context, &c, 1); 187 while ((context->count[0] & 504) != 448) { 188 c = 0000; 189 SHA1Update(context, &c, 1); 190 } 191 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ 192 for (i = 0; i < 20; i++) { 193 digest[i] = (unsigned char) 194 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); 195 } 196 /* Wipe variables */ 197 memset(context, '\0', sizeof(*context)); 198 memset(&finalcount, '\0', sizeof(finalcount)); 199 } 200 /* ================ end of sha1.c ================ */ 201 202 #ifdef REDIS_TEST 203 #define BUFSIZE 4096 204 205 #define UNUSED(x) (void)(x) 206 int sha1Test(int argc, char **argv) 207 { 208 SHA1_CTX ctx; 209 unsigned char hash[20], buf[BUFSIZE]; 210 int i; 211 212 UNUSED(argc); 213 UNUSED(argv); 214 215 for(i=0;i<BUFSIZE;i++) 216 buf[i] = i; 217 218 SHA1Init(&ctx); 219 for(i=0;i<1000;i++) 220 SHA1Update(&ctx, buf, BUFSIZE); 221 SHA1Final(hash, &ctx); 222 223 printf("SHA1="); 224 for(i=0;i<20;i++) 225 printf("%02x", hash[i]); 226 printf("\n"); 227 return 0; 228 } 229 #endif 230