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 32 #ifndef BYTE_ORDER 33 #if (BSD >= 199103) 34 # include <machine/endian.h> 35 #else 36 #if defined(linux) || defined(__linux__) 37 # include <endian.h> 38 #else 39 #define LITTLE_ENDIAN 1234 /* least-significant byte first (vax, pc) */ 40 #define BIG_ENDIAN 4321 /* most-significant byte first (IBM, net) */ 41 #define PDP_ENDIAN 3412 /* LSB first in word, MSW first in long (pdp)*/ 42 43 #if defined(vax) || defined(ns32000) || defined(sun386) || defined(__i386__) || \ 44 defined(MIPSEL) || defined(_MIPSEL) || defined(BIT_ZERO_ON_RIGHT) || \ 45 defined(__alpha__) || defined(__alpha) 46 #define BYTE_ORDER LITTLE_ENDIAN 47 #endif 48 49 #if defined(sel) || defined(pyr) || defined(mc68000) || defined(sparc) || \ 50 defined(is68k) || defined(tahoe) || defined(ibm032) || defined(ibm370) || \ 51 defined(MIPSEB) || defined(_MIPSEB) || defined(_IBMR2) || defined(DGUX) ||\ 52 defined(apollo) || defined(__convex__) || defined(_CRAY) || \ 53 defined(__hppa) || defined(__hp9000) || \ 54 defined(__hp9000s300) || defined(__hp9000s700) || \ 55 defined (BIT_ZERO_ON_LEFT) || defined(m68k) || defined(__sparc) 56 #define BYTE_ORDER BIG_ENDIAN 57 #endif 58 #endif /* linux */ 59 #endif /* BSD */ 60 #endif /* BYTE_ORDER */ 61 62 #if defined(__BYTE_ORDER) && !defined(BYTE_ORDER) 63 #if (__BYTE_ORDER == __LITTLE_ENDIAN) 64 #define BYTE_ORDER LITTLE_ENDIAN 65 #else 66 #define BYTE_ORDER BIG_ENDIAN 67 #endif 68 #endif 69 70 #if !defined(BYTE_ORDER) || \ 71 (BYTE_ORDER != BIG_ENDIAN && BYTE_ORDER != LITTLE_ENDIAN && \ 72 BYTE_ORDER != PDP_ENDIAN) 73 /* you must determine what the correct bit order is for 74 * your compiler - the next line is an intentional error 75 * which will force your compiles to bomb until you fix 76 * the above macros. 77 */ 78 #error "Undefined or invalid BYTE_ORDER" 79 #endif 80 81 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 82 83 /* blk0() and blk() perform the initial expand. */ 84 /* I got the idea of expanding during the round function from SSLeay */ 85 #if BYTE_ORDER == LITTLE_ENDIAN 86 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 87 |(rol(block->l[i],8)&0x00FF00FF)) 88 #elif BYTE_ORDER == BIG_ENDIAN 89 #define blk0(i) block->l[i] 90 #else 91 #error "Endianness not defined!" 92 #endif 93 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 94 ^block->l[(i+2)&15]^block->l[i&15],1)) 95 96 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ 97 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); 98 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); 99 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); 100 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); 101 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); 102 103 104 /* Hash a single 512-bit block. This is the core of the algorithm. */ 105 106 void SHA1Transform(u_int32_t state[5], const unsigned char buffer[64]) 107 { 108 u_int32_t a, b, c, d, e; 109 typedef union { 110 unsigned char c[64]; 111 u_int32_t l[16]; 112 } CHAR64LONG16; 113 #ifdef SHA1HANDSOFF 114 CHAR64LONG16 block[1]; /* use array to appear as a pointer */ 115 memcpy(block, buffer, 64); 116 #else 117 /* The following had better never be used because it causes the 118 * pointer-to-const buffer to be cast into a pointer to non-const. 119 * And the result is written through. I threw a "const" in, hoping 120 * this will cause a diagnostic. 121 */ 122 CHAR64LONG16* block = (const CHAR64LONG16*)buffer; 123 #endif 124 /* Copy context->state[] to working vars */ 125 a = state[0]; 126 b = state[1]; 127 c = state[2]; 128 d = state[3]; 129 e = state[4]; 130 /* 4 rounds of 20 operations each. Loop unrolled. */ 131 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); 132 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); 133 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); 134 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); 135 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); 136 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); 137 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); 138 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); 139 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); 140 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); 141 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); 142 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); 143 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); 144 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); 145 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); 146 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); 147 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); 148 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); 149 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); 150 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); 151 /* Add the working vars back into context.state[] */ 152 state[0] += a; 153 state[1] += b; 154 state[2] += c; 155 state[3] += d; 156 state[4] += e; 157 /* Wipe variables */ 158 a = b = c = d = e = 0; 159 #ifdef SHA1HANDSOFF 160 memset(block, '\0', sizeof(block)); 161 #endif 162 } 163 164 165 /* SHA1Init - Initialize new context */ 166 167 void SHA1Init(SHA1_CTX* context) 168 { 169 /* SHA1 initialization constants */ 170 context->state[0] = 0x67452301; 171 context->state[1] = 0xEFCDAB89; 172 context->state[2] = 0x98BADCFE; 173 context->state[3] = 0x10325476; 174 context->state[4] = 0xC3D2E1F0; 175 context->count[0] = context->count[1] = 0; 176 } 177 178 179 /* Run your data through this. */ 180 181 void SHA1Update(SHA1_CTX* context, const unsigned char* data, u_int32_t len) 182 { 183 u_int32_t i; 184 u_int32_t j; 185 186 j = context->count[0]; 187 if ((context->count[0] += len << 3) < j) 188 context->count[1]++; 189 context->count[1] += (len>>29); 190 j = (j >> 3) & 63; 191 if ((j + len) > 63) { 192 memcpy(&context->buffer[j], data, (i = 64-j)); 193 SHA1Transform(context->state, context->buffer); 194 for ( ; i + 63 < len; i += 64) { 195 SHA1Transform(context->state, &data[i]); 196 } 197 j = 0; 198 } 199 else i = 0; 200 memcpy(&context->buffer[j], &data[i], len - i); 201 } 202 203 204 /* Add padding and return the message digest. */ 205 206 void SHA1Final(unsigned char digest[20], SHA1_CTX* context) 207 { 208 unsigned i; 209 unsigned char finalcount[8]; 210 unsigned char c; 211 212 #if 0 /* untested "improvement" by DHR */ 213 /* Convert context->count to a sequence of bytes 214 * in finalcount. Second element first, but 215 * big-endian order within element. 216 * But we do it all backwards. 217 */ 218 unsigned char *fcp = &finalcount[8]; 219 220 for (i = 0; i < 2; i++) 221 { 222 u_int32_t t = context->count[i]; 223 int j; 224 225 for (j = 0; j < 4; t >>= 8, j++) 226 *--fcp = (unsigned char) t 227 } 228 #else 229 for (i = 0; i < 8; i++) { 230 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] 231 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ 232 } 233 #endif 234 c = 0200; 235 SHA1Update(context, &c, 1); 236 while ((context->count[0] & 504) != 448) { 237 c = 0000; 238 SHA1Update(context, &c, 1); 239 } 240 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ 241 for (i = 0; i < 20; i++) { 242 digest[i] = (unsigned char) 243 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); 244 } 245 /* Wipe variables */ 246 memset(context, '\0', sizeof(*context)); 247 memset(&finalcount, '\0', sizeof(finalcount)); 248 } 249 /* ================ end of sha1.c ================ */ 250 251 #if 0 252 #define BUFSIZE 4096 253 254 int 255 main(int argc, char **argv) 256 { 257 SHA1_CTX ctx; 258 unsigned char hash[20], buf[BUFSIZE]; 259 int i; 260 261 for(i=0;i<BUFSIZE;i++) 262 buf[i] = i; 263 264 SHA1Init(&ctx); 265 for(i=0;i<1000;i++) 266 SHA1Update(&ctx, buf, BUFSIZE); 267 SHA1Final(hash, &ctx); 268 269 printf("SHA1="); 270 for(i=0;i<20;i++) 271 printf("%02x", hash[i]); 272 printf("\n"); 273 return 0; 274 } 275 276 #endif 277