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