5 By Steve Reid <steve@edmweb.com>
8 Test Vectors (from FIPS PUB 180-1)
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
17 #if !defined(LITTLE_ENDIAN) && !defined(BIG_ENDIAN)
18 #if defined(_M_IX86) || defined(_M_I86) || defined(__alpha)
21 #error "LITTLE_ENDIAN or BIG_ENDIAN must be defined"
25 /* #define SHA1HANDSOFF * Copies data before messing with it. */
27 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
29 /* blk0() and blk() perform the initial expand. */
30 /* I got the idea of expanding during the round function from SSLeay */
32 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
33 |(rol(block->l[i],8)&0x00FF00FF))
35 #define blk0(i) block->l[i]
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))
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);}
48 /* Hash a single 512-bit block. This is the core of the algorithm. */
50 void SHA1Transform(uint32 state[5], unsigned char buffer[64])
59 static unsigned char workspace[64];
60 block = (CHAR64LONG16*)workspace;
61 memcpy(block, buffer, 64);
63 block = (CHAR64LONG16*)buffer;
66 static int pos[80][5];
67 static bool pinit=false;
70 for (int I=0,P=0;I<80;I++,P=(P ? P-1:4))
81 for (int I=0;I<sizeof(s)/sizeof(s[0]);I++)
84 for (int I=0;I<16;I++)
85 R0(s[pos[I][0]],s[pos[I][1]],s[pos[I][2]],s[pos[I][3]],s[pos[I][4]],I);
86 for (int I=16;I<20;I++)
87 R1(s[pos[I][0]],s[pos[I][1]],s[pos[I][2]],s[pos[I][3]],s[pos[I][4]],I);
88 for (int I=20;I<40;I++)
89 R2(s[pos[I][0]],s[pos[I][1]],s[pos[I][2]],s[pos[I][3]],s[pos[I][4]],I);
90 for (int I=40;I<60;I++)
91 R3(s[pos[I][0]],s[pos[I][1]],s[pos[I][2]],s[pos[I][3]],s[pos[I][4]],I);
92 for (int I=60;I<80;I++)
93 R4(s[pos[I][0]],s[pos[I][1]],s[pos[I][2]],s[pos[I][3]],s[pos[I][4]],I);
95 for (int I=0;I<sizeof(s)/sizeof(s[0]);I++)
98 /* Copy context->state[] to working vars */
104 /* 4 rounds of 20 operations each. Loop unrolled. */
105 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);
106 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);
107 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);
108 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);
109 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);
110 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);
111 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);
112 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);
113 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);
114 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);
115 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);
116 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);
117 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);
118 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);
119 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);
120 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);
121 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);
122 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);
123 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);
124 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);
125 /* Add the working vars back into context.state[] */
133 a = b = c = d = e = 0;
134 memset(&a,0,sizeof(a));
139 /* Initialize new context */
141 void hash_initial(hash_context* context)
143 /* SHA1 initialization constants */
144 context->state[0] = 0x67452301;
145 context->state[1] = 0xEFCDAB89;
146 context->state[2] = 0x98BADCFE;
147 context->state[3] = 0x10325476;
148 context->state[4] = 0xC3D2E1F0;
149 context->count[0] = context->count[1] = 0;
153 /* Run your data through this. */
154 void hash_process( hash_context * context, unsigned char * data, unsigned len )
157 uint blen = ((uint)len)<<3;
159 j = (context->count[0] >> 3) & 63;
160 if ((context->count[0] += blen) < blen ) context->count[1]++;
161 context->count[1] += (len >> 29);
162 if ((j + len) > 63) {
163 memcpy(&context->buffer[j], data, (i = 64-j));
164 SHA1Transform(context->state, context->buffer);
165 for ( ; i + 63 < len; i += 64) {
166 #ifdef ALLOW_NOT_ALIGNED_INT
167 SHA1Transform(context->state, &data[i]);
169 unsigned char buffer[64];
170 memcpy(buffer,data+i,sizeof(buffer));
171 SHA1Transform(context->state, buffer);
172 memcpy(data+i,buffer,sizeof(buffer));
175 unsigned char *d=data+i;
176 for (int k=0;k<64;k+=4)
178 byte b0=d[k],b1=d[k+1];
190 memcpy(&context->buffer[j], &data[i], len - i);
194 /* Add padding and return the message digest. */
196 void hash_final( hash_context* context, uint32 digest[5] )
199 unsigned char finalcount[8];
201 for (i = 0; i < 8; i++) {
202 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
203 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
205 unsigned char ch='\200';
206 hash_process(context, &ch, 1);
207 while ((context->count[0] & 504) != 448) {
209 hash_process(context, &ch, 1);
211 hash_process(context, finalcount, 8); /* Should cause a SHA1Transform() */
212 for (i = 0; i < 5; i++) {
213 digest[i] = context->state[i] & 0xffffffff;
216 memset(&i,0,sizeof(i));
217 memset(&j,0,sizeof(j));
218 memset(context->buffer, 0, 64);
219 memset(context->state, 0, 20);
220 memset(context->count, 0, 8);
221 memset(&finalcount, 0, 8);
222 #ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */
223 SHA1Transform(context->state, context->buffer);