3 By Steve Reid <steve@edmweb.com>
7 #include "silcincludes.h"
8 #include "sha1_internal.h"
12 * SILC Hash API for SHA1
15 SILC_HASH_API_INIT(sha1)
17 SHA1Init((SHA1_CTX *)context);
20 SILC_HASH_API_UPDATE(sha1)
22 SHA1Update((SHA1_CTX *)context, data, len);
25 SILC_HASH_API_FINAL(sha1)
27 SHA1Final(digest, (SHA1_CTX *)context);
30 SILC_HASH_API_TRANSFORM(sha1)
32 SHA1Transform(state, buffer);
35 SILC_HASH_API_CONTEXT_LEN(sha1)
37 return sizeof(SHA1_CTX);
40 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
42 /* blk0() and blk() perform the initial expand. */
43 /* I got the idea of expanding during the round function from SSLeay */
45 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
46 |(rol(block->l[i],8)&0x00FF00FF))
48 #define blk0(i) block->l[i]
50 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
51 ^block->l[(i+2)&15]^block->l[i&15],1))
53 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
54 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
55 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
56 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
57 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
58 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
61 /* Hash a single 512-bit block. This is the core of the algorithm. */
63 void SHA1Transform(uint32 state[5], unsigned char buffer[64])
71 static unsigned char workspace[64];
72 block = (CHAR64LONG16*)workspace;
73 memcpy(block, buffer, 64);
74 /* Copy context->state[] to working vars */
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[] */
108 a = b = c = d = e = 0;
112 /* SHA1Init - Initialize new context */
114 void SHA1Init(SHA1_CTX* context)
116 /* SHA1 initialization constants */
117 context->state[0] = 0x67452301;
118 context->state[1] = 0xEFCDAB89;
119 context->state[2] = 0x98BADCFE;
120 context->state[3] = 0x10325476;
121 context->state[4] = 0xC3D2E1F0;
122 context->count[0] = context->count[1] = 0;
126 /* Run your data through this. */
128 void SHA1Update(SHA1_CTX* context, unsigned char* data, uint32 len)
132 j = (context->count[0] >> 3) & 63;
133 if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
134 context->count[1] += (len >> 29);
135 if ((j + len) > 63) {
136 memcpy(&context->buffer[j], data, (i = 64-j));
137 SHA1Transform(context->state, context->buffer);
138 for ( ; i + 63 < len; i += 64) {
139 SHA1Transform(context->state, &data[i]);
144 memcpy(&context->buffer[j], &data[i], len - i);
148 /* Add padding and return the message digest. */
150 void SHA1Final(unsigned char digest[20], SHA1_CTX* context)
153 unsigned char finalcount[8];
155 for (i = 0; i < 8; i++) {
156 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
157 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
159 SHA1Update(context, (unsigned char *)"\200", 1);
160 while ((context->count[0] & 504) != 448) {
161 SHA1Update(context, (unsigned char *)"\0", 1);
163 SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
164 for (i = 0; i < 20; i++) {
165 digest[i] = (unsigned char)
166 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
170 memset(context->buffer, 0, 64);
171 memset(context->state, 0, 20);
172 memset(context->count, 0, 8);
173 memset(finalcount, 0, 8);
174 SHA1Transform(context->state, context->buffer);
178 /*************************************************************/
184 int main(int argc, char** argv)
188 unsigned char digest[20], buffer[16384];
192 puts("Public domain SHA-1 implementation - by Steve Reid <steve@edmweb.com>");
193 puts("Produces the SHA-1 hash of a file, or stdin if no file is specified.");
200 if (!(file = fopen(argv[1], "rb"))) {
201 fputs("Unable to open file.", stderr);
206 while (!feof(file)) { /* note: what if ferror(file) */
207 i = fread(buffer, 1, 16384, file);
208 SHA1Update(&context, buffer, i);
210 SHA1Final(digest, &context);
212 for (i = 0; i < 5; i++) {
213 for (j = 0; j < 4; j++) {
214 printf("%02X", digest[i*4+j]);