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