1 /* 2 SHA-1 in C 3 By Steve Reid <steve@edmweb.com> 4 100% Public Domain 5 6 Test Vectors (from FIPS PUB 180-1) 7 "abc" 8 A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D 9 "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" 10 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 11 A million repetitions of "a" 12 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F 13 */ 14 15 /* #define LITTLE_ENDIAN * This should be #define'd if true. */ 16 /* #define SHA1HANDSOFF * Copies data before messing with it. */ 17 18 #include "compat.h" 19 20 #define SHA1HANDSOFF 1 21 #ifdef HAVE_STDIO_H 22 #include <stdio.h> 23 #endif 24 #ifdef HAVE_STRING_H 25 #include <string.h> 26 #endif 27 28 #include "sha1.h" 29 30 #ifndef __BIG_ENDIAN 31 #define __BIG_ENDIAN 4321 32 #endif 33 #ifndef __LITTLE_ENDIAN 34 #define __LITTLE_ENDIAN 1234 35 #endif 36 37 #ifndef __BYTE_ORDER 38 #ifdef WORDS_BIGENDIAN 39 #define __BYTE_ORDER __BIG_ENDIAN 40 #else 41 #define __BYTE_ORDER __LITTLE_ENDIAN 42 #endif 43 #endif 44 45 #if __BYTE_ORDER == __BIG_ENDIAN 46 #ifndef BIG_ENDIAN 47 #define BIG_ENDIAN 1 48 #endif 49 #undef LITTLE_ENDIAN 50 #else 51 #ifndef LITTLE_ENDIAN 52 #define LITTLE_ENDIAN 1 53 #endif 54 #undef BIG_ENDIAN 55 #endif 56 57 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 58 59 /* blk0() and blk() perform the initial expand. */ 60 /* I got the idea of expanding during the round function from SSLeay */ 61 #ifdef LITTLE_ENDIAN 62 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 63 |(rol(block->l[i],8)&0x00FF00FF)) 64 #else 65 #define blk0(i) block->l[i] 66 #endif 67 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 68 ^block->l[(i+2)&15]^block->l[i&15],1)) 69 70 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ 71 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); 72 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); 73 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); 74 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); 75 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); 76 77 78 /* Hash a single 512-bit block. This is the core of the algorithm. */ 79 80 void SHA1Transform(unsigned long state[5], unsigned char buffer[64]) 81 { 82 unsigned long a, b, c, d, e; 83 typedef union { 84 unsigned char c[64]; 85 unsigned long l[16]; 86 } CHAR64LONG16; 87 CHAR64LONG16* block; 88 #ifdef SHA1HANDSOFF 89 static unsigned char workspace[64]; 90 block = (CHAR64LONG16*)workspace; 91 memcpy(block, buffer, 64); 92 #else 93 block = (CHAR64LONG16*)buffer; 94 #endif 95 /* Copy context->state[] to working vars */ 96 a = state[0]; 97 b = state[1]; 98 c = state[2]; 99 d = state[3]; 100 e = state[4]; 101 /* 4 rounds of 20 operations each. Loop unrolled. */ 102 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); 103 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); 104 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); 105 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); 106 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); 107 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); 108 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); 109 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); 110 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); 111 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); 112 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); 113 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); 114 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); 115 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); 116 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); 117 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); 118 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); 119 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); 120 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); 121 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); 122 /* Add the working vars back into context.state[] */ 123 state[0] += a; 124 state[1] += b; 125 state[2] += c; 126 state[3] += d; 127 state[4] += e; 128 /* Wipe variables */ 129 a = b = c = d = e = 0; 130 } 131 132 133 /* SHA1Init - Initialize new context */ 134 135 void SHA1Init(SHA1_CTX* context) 136 { 137 /* SHA1 initialization constants */ 138 context->state[0] = 0x67452301; 139 context->state[1] = 0xEFCDAB89; 140 context->state[2] = 0x98BADCFE; 141 context->state[3] = 0x10325476; 142 context->state[4] = 0xC3D2E1F0; 143 context->count[0] = context->count[1] = 0; 144 } 145 146 147 /* Run your data through this. */ 148 149 void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len) 150 { 151 unsigned int i, j; 152 153 j = (context->count[0] >> 3) & 63; 154 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++; 155 context->count[1] += (len >> 29); 156 if ((j + len) > 63) { 157 memcpy(&context->buffer[j], data, (i = 64-j)); 158 SHA1Transform(context->state, context->buffer); 159 for ( ; i + 63 < len; i += 64) { 160 SHA1Transform(context->state, &data[i]); 161 } 162 j = 0; 163 } 164 else i = 0; 165 memcpy(&context->buffer[j], &data[i], len - i); 166 } 167 168 169 /* Add padding and return the message digest. */ 170 171 void SHA1Final(unsigned char digest[20], SHA1_CTX* context) 172 { 173 unsigned long i, j; 174 unsigned char finalcount[8]; 175 176 for (i = 0; i < 8; i++) { 177 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] 178 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ 179 } 180 SHA1Update(context, (unsigned char *)"\200", 1); 181 while ((context->count[0] & 504) != 448) { 182 SHA1Update(context, (unsigned char *)"\0", 1); 183 } 184 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ 185 for (i = 0; i < 20; i++) { 186 digest[i] = (unsigned char) 187 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); 188 } 189 /* Wipe variables */ 190 i = j = 0; 191 memset(context->buffer, 0, 64); 192 memset(context->state, 0, 20); 193 memset(context->count, 0, 8); 194 memset(&finalcount, 0, 8); 195 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */ 196 SHA1Transform(context->state, context->buffer); 197 #endif 198 } |