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