1 /* $OpenBSD: sha1.c,v 1.2 2000/06/04 16:37:02 deraadt 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 LITTLE_ENDIAN * This should be #define'd already, if true. */ 18 /* #define SHA1HANDSOFF * Copies data before messing with it. */ 19 20 #define SHA1HANDSOFF 21 22 #include <sys/param.h> 23 #include <sys/systm.h> 24 25 #include <crypto/sha1.h> 26 27 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) 28 29 /* blk0() and blk() perform the initial expand. */ 30 /* I got the idea of expanding during the round function from SSLeay */ 31 #if BYTE_ORDER == LITTLE_ENDIAN 32 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ 33 |(rol(block->l[i],8)&0x00FF00FF)) 34 #else 35 #define blk0(i) block->l[i] 36 #endif 37 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ 38 ^block->l[(i+2)&15]^block->l[i&15],1)) 39 40 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ 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 /* Hash a single 512-bit block. This is the core of the algorithm. */ 49 50 void SHA1Transform(u_int32_t state[5], unsigned char buffer[64]) 51 { 52 u_int32_t a, b, c, d, e; 53 typedef union { 54 unsigned char c[64]; 55 unsigned int l[16]; 56 } CHAR64LONG16; 57 CHAR64LONG16* block; 58 #ifdef SHA1HANDSOFF 59 static unsigned char workspace[64]; 60 61 block = (CHAR64LONG16 *)workspace; 62 bcopy(buffer, block, 64); 63 #else 64 block = (CHAR64LONG16 *)buffer; 65 #endif 66 /* Copy context->state[] to working vars */ 67 a = state[0]; 68 b = state[1]; 69 c = state[2]; 70 d = state[3]; 71 e = state[4]; 72 /* 4 rounds of 20 operations each. Loop unrolled. */ 73 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); 74 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); 75 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); 76 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); 77 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); 78 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); 79 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); 80 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); 81 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); 82 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); 83 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); 84 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); 85 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); 86 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); 87 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); 88 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); 89 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); 90 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); 91 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); 92 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); 93 /* Add the working vars back into context.state[] */ 94 state[0] += a; 95 state[1] += b; 96 state[2] += c; 97 state[3] += d; 98 state[4] += e; 99 /* Wipe variables */ 100 a = b = c = d = e = 0; 101 } 102 103 104 /* SHA1Init - Initialize new context */ 105 106 void SHA1Init(SHA1_CTX *context) 107 { 108 /* SHA1 initialization constants */ 109 context->state[0] = 0x67452301; 110 context->state[1] = 0xEFCDAB89; 111 context->state[2] = 0x98BADCFE; 112 context->state[3] = 0x10325476; 113 context->state[4] = 0xC3D2E1F0; 114 context->count[0] = context->count[1] = 0; 115 } 116 117 118 /* Run your data through this. */ 119 120 void SHA1Update(SHA1_CTX *context, unsigned char *data, unsigned int len) 121 { 122 unsigned int i; 123 unsigned int j; 124 125 j = context->count[0]; 126 if ((context->count[0] += len << 3) < j) context->count[1] += (len>>29)+1; 127 j = (j >> 3) & 63; 128 if ((j + len) > 63) { 129 bcopy(data, &context->buffer[j], (i = 64-j)); 130 SHA1Transform(context->state, context->buffer); 131 for ( ; i + 63 < len; i += 64) { 132 SHA1Transform(context->state, &data[i]); 133 } 134 j = 0; 135 } 136 else i = 0; 137 bcopy(&data[i], &context->buffer[j], len - i); 138 } 139 140 141 /* Add padding and return the message digest. */ 142 143 void SHA1Final(unsigned char digest[20], SHA1_CTX *context) 144 { 145 unsigned int i; 146 unsigned char finalcount[8]; 147 148 for (i = 0; i < 8; i++) { 149 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] 150 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ 151 } 152 SHA1Update(context, (unsigned char *)"\200", 1); 153 while ((context->count[0] & 504) != 448) { 154 SHA1Update(context, (unsigned char *)"\0", 1); 155 } 156 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ 157 158 if (digest) 159 for (i = 0; i < 20; i++) { 160 digest[i] = (unsigned char) 161 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); 162 } 163 #if 0 /* We want to use this for "keyfill" */ 164 /* Wipe variables */ 165 i = 0; 166 bzero(context->buffer, 64); 167 bzero(context->state, 20); 168 bzero(context->count, 8); 169 bzero(&finalcount, 8); 170 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */ 171 SHA1Transform(context->state, context->buffer); 172 #endif 173 #endif 174 } 175