OLD | NEW |
| (Empty) |
1 /* | |
2 * SHA-1 in C | |
3 * By Steve Reid <sreid@sea-to-sky.net> | |
4 * 100% Public Domain | |
5 * | |
6 * ----------------- | |
7 * Modified 7/98 | |
8 * By James H. Brown <jbrown@burgoyne.com> | |
9 * Still 100% Public Domain | |
10 * | |
11 * Corrected a problem which generated improper hash values on 16 bit machines | |
12 * Routine SHA1Update changed from | |
13 * void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int | |
14 * len) | |
15 * to | |
16 * void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned | |
17 * long len) | |
18 * | |
19 * The 'len' parameter was declared an int which works fine on 32 bit machines. | |
20 * However, on 16 bit machines an int is too small for the shifts being done | |
21 * against | |
22 * it. This caused the hash function to generate incorrect values if len was | |
23 * greater than 8191 (8K - 1) due to the 'len << 3' on line 3 of SHA1Update(). | |
24 * | |
25 * Since the file IO in main() reads 16K at a time, any file 8K or larger would | |
26 * be guaranteed to generate the wrong hash (e.g. Test Vector #3, a million | |
27 * "a"s). | |
28 * | |
29 * I also changed the declaration of variables i & j in SHA1Update to | |
30 * unsigned long from unsigned int for the same reason. | |
31 * | |
32 * These changes should make no difference to any 32 bit implementations since | |
33 * an | |
34 * int and a long are the same size in those environments. | |
35 * | |
36 * -- | |
37 * I also corrected a few compiler warnings generated by Borland C. | |
38 * 1. Added #include <process.h> for exit() prototype | |
39 * 2. Removed unused variable 'j' in SHA1Final | |
40 * 3. Changed exit(0) to return(0) at end of main. | |
41 * | |
42 * ALL changes I made can be located by searching for comments containing 'JHB' | |
43 * ----------------- | |
44 * Modified 8/98 | |
45 * By Steve Reid <sreid@sea-to-sky.net> | |
46 * Still 100% public domain | |
47 * | |
48 * 1- Removed #include <process.h> and used return() instead of exit() | |
49 * 2- Fixed overwriting of finalcount in SHA1Final() (discovered by Chris Hall) | |
50 * 3- Changed email address from steve@edmweb.com to sreid@sea-to-sky.net | |
51 * | |
52 * ----------------- | |
53 * Modified 4/01 | |
54 * By Saul Kravitz <Saul.Kravitz@celera.com> | |
55 * Still 100% PD | |
56 * Modified to run on Compaq Alpha hardware. | |
57 * | |
58 * ----------------- | |
59 * Modified 07/2002 | |
60 * By Ralph Giles <giles@ghostscript.com> | |
61 * Still 100% public domain | |
62 * modified for use with stdint types, autoconf | |
63 * code cleanup, removed attribution comments | |
64 * switched SHA1Final() argument order for consistency | |
65 * use SHA1_ prefix for public api | |
66 * move public api to sha1.h | |
67 * | |
68 * ----------------- | |
69 * Modified 02/2012 | |
70 * By Justin Uberti <juberti@google.com> | |
71 * Remove underscore from SHA1 prefix to avoid conflict with OpenSSL | |
72 * Remove test code | |
73 * Untabify | |
74 * | |
75 * ----------------- | |
76 * Modified 03/2012 | |
77 * By Ronghua Wu <ronghuawu@google.com> | |
78 * Change the typedef of uint32(8)_t to uint32(8). We need this because in the | |
79 * chromium android build, the stdio.h will include stdint.h which already | |
80 * defined uint32(8)_t. | |
81 * | |
82 * ----------------- | |
83 * Modified 04/2012 | |
84 * By Frank Barchard <fbarchard@google.com> | |
85 * Ported to C++, Google style, change len to size_t, enable SHA1HANDSOFF | |
86 * | |
87 * Test Vectors (from FIPS PUB 180-1) | |
88 * "abc" | |
89 * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D | |
90 * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" | |
91 * 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 | |
92 * A million repetitions of "a" | |
93 * 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F | |
94 * | |
95 * ----------------- | |
96 * Modified 05/2015 | |
97 * By Sergey Ulanov <sergeyu@chromium.org> | |
98 * Removed static buffer to make computation thread-safe. | |
99 * | |
100 * ----------------- | |
101 * Modified 10/2015 | |
102 * By Peter Boström <pbos@webrtc.org> | |
103 * Change uint32(8) back to uint32(8)_t (undoes (03/2012) change). | |
104 */ | |
105 | |
106 // Enabling SHA1HANDSOFF preserves the caller's data buffer. | |
107 // Disabling SHA1HANDSOFF the buffer will be modified (end swapped). | |
108 #define SHA1HANDSOFF | |
109 | |
110 #include "webrtc/base/sha1.h" | |
111 | |
112 #include <stdio.h> | |
113 #include <string.h> | |
114 | |
115 namespace rtc { | |
116 | |
117 namespace { | |
118 | |
119 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) | |
120 | |
121 // blk0() and blk() perform the initial expand. | |
122 // I got the idea of expanding during the round function from SSLeay | |
123 // FIXME: can we do this in an endian-proof way? | |
124 #ifdef RTC_ARCH_CPU_BIG_ENDIAN | |
125 #define blk0(i) block->l[i] | |
126 #else | |
127 #define blk0(i) (block->l[i] = (rol(block->l[i], 24) & 0xFF00FF00) | \ | |
128 (rol(block->l[i], 8) & 0x00FF00FF)) | |
129 #endif | |
130 #define blk(i) (block->l[i & 15] = rol(block->l[(i + 13) & 15] ^ \ | |
131 block->l[(i + 8) & 15] ^ block->l[(i + 2) & 15] ^ block->l[i & 15], 1)) | |
132 | |
133 // (R0+R1), R2, R3, R4 are the different operations used in SHA1. | |
134 #define R0(v, w, x, y, z, i) \ | |
135 z += ((w & (x ^ y)) ^ y) + blk0(i) + 0x5A827999 + rol(v, 5); \ | |
136 w = rol(w, 30); | |
137 #define R1(v, w, x, y, z, i) \ | |
138 z += ((w & (x ^ y)) ^ y) + blk(i) + 0x5A827999 + rol(v, 5); \ | |
139 w = rol(w, 30); | |
140 #define R2(v, w, x, y, z, i) \ | |
141 z += (w ^ x ^ y) + blk(i) + 0x6ED9EBA1 + rol(v, 5);\ | |
142 w = rol(w, 30); | |
143 #define R3(v, w, x, y, z, i) \ | |
144 z += (((w | x) & y) | (w & x)) + blk(i) + 0x8F1BBCDC + rol(v, 5); \ | |
145 w = rol(w, 30); | |
146 #define R4(v, w, x, y, z, i) \ | |
147 z += (w ^ x ^ y) + blk(i) + 0xCA62C1D6 + rol(v, 5); \ | |
148 w = rol(w, 30); | |
149 | |
150 #ifdef VERBOSE // SAK | |
151 void SHAPrintContext(SHA1_CTX *context, char *msg) { | |
152 printf("%s (%d,%d) %x %x %x %x %x\n", | |
153 msg, | |
154 context->count[0], context->count[1], | |
155 context->state[0], | |
156 context->state[1], | |
157 context->state[2], | |
158 context->state[3], | |
159 context->state[4]); | |
160 } | |
161 #endif /* VERBOSE */ | |
162 | |
163 // Hash a single 512-bit block. This is the core of the algorithm. | |
164 void SHA1Transform(uint32_t state[5], const uint8_t buffer[64]) { | |
165 union CHAR64LONG16 { | |
166 uint8_t c[64]; | |
167 uint32_t l[16]; | |
168 }; | |
169 #ifdef SHA1HANDSOFF | |
170 uint8_t workspace[64]; | |
171 memcpy(workspace, buffer, 64); | |
172 CHAR64LONG16* block = reinterpret_cast<CHAR64LONG16*>(workspace); | |
173 #else | |
174 // Note(fbarchard): This option does modify the user's data buffer. | |
175 CHAR64LONG16* block = const_cast<CHAR64LONG16*>( | |
176 reinterpret_cast<const CHAR64LONG16*>(buffer)); | |
177 #endif | |
178 | |
179 // Copy context->state[] to working vars. | |
180 uint32_t a = state[0]; | |
181 uint32_t b = state[1]; | |
182 uint32_t c = state[2]; | |
183 uint32_t d = state[3]; | |
184 uint32_t e = state[4]; | |
185 | |
186 // 4 rounds of 20 operations each. Loop unrolled. | |
187 // Note(fbarchard): The following has lint warnings for multiple ; on | |
188 // a line and no space after , but is left as-is to be similar to the | |
189 // original code. | |
190 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); | |
191 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); | |
192 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); | |
193 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); | |
194 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); | |
195 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); | |
196 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); | |
197 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); | |
198 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); | |
199 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); | |
200 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); | |
201 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); | |
202 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); | |
203 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); | |
204 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); | |
205 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); | |
206 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); | |
207 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); | |
208 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); | |
209 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); | |
210 | |
211 // Add the working vars back into context.state[]. | |
212 state[0] += a; | |
213 state[1] += b; | |
214 state[2] += c; | |
215 state[3] += d; | |
216 state[4] += e; | |
217 } | |
218 | |
219 } // namespace | |
220 | |
221 // SHA1Init - Initialize new context. | |
222 void SHA1Init(SHA1_CTX* context) { | |
223 // SHA1 initialization constants. | |
224 context->state[0] = 0x67452301; | |
225 context->state[1] = 0xEFCDAB89; | |
226 context->state[2] = 0x98BADCFE; | |
227 context->state[3] = 0x10325476; | |
228 context->state[4] = 0xC3D2E1F0; | |
229 context->count[0] = context->count[1] = 0; | |
230 } | |
231 | |
232 // Run your data through this. | |
233 void SHA1Update(SHA1_CTX* context, const uint8_t* data, size_t input_len) { | |
234 size_t i = 0; | |
235 | |
236 #ifdef VERBOSE | |
237 SHAPrintContext(context, "before"); | |
238 #endif | |
239 | |
240 // Compute number of bytes mod 64. | |
241 size_t index = (context->count[0] >> 3) & 63; | |
242 | |
243 // Update number of bits. | |
244 // TODO: Use uint64_t instead of 2 uint32_t for count. | |
245 // count[0] has low 29 bits for byte count + 3 pad 0's making 32 bits for | |
246 // bit count. | |
247 // Add bit count to low uint32_t | |
248 context->count[0] += static_cast<uint32_t>(input_len << 3); | |
249 if (context->count[0] < static_cast<uint32_t>(input_len << 3)) { | |
250 ++context->count[1]; // if overlow (carry), add one to high word | |
251 } | |
252 context->count[1] += static_cast<uint32_t>(input_len >> 29); | |
253 if ((index + input_len) > 63) { | |
254 i = 64 - index; | |
255 memcpy(&context->buffer[index], data, i); | |
256 SHA1Transform(context->state, context->buffer); | |
257 for (; i + 63 < input_len; i += 64) { | |
258 SHA1Transform(context->state, data + i); | |
259 } | |
260 index = 0; | |
261 } | |
262 memcpy(&context->buffer[index], &data[i], input_len - i); | |
263 | |
264 #ifdef VERBOSE | |
265 SHAPrintContext(context, "after "); | |
266 #endif | |
267 } | |
268 | |
269 // Add padding and return the message digest. | |
270 void SHA1Final(SHA1_CTX* context, uint8_t digest[SHA1_DIGEST_SIZE]) { | |
271 uint8_t finalcount[8]; | |
272 for (int i = 0; i < 8; ++i) { | |
273 // Endian independent | |
274 finalcount[i] = static_cast<uint8_t>( | |
275 (context->count[(i >= 4 ? 0 : 1)] >> ((3 - (i & 3)) * 8)) & 255); | |
276 } | |
277 SHA1Update(context, reinterpret_cast<const uint8_t*>("\200"), 1); | |
278 while ((context->count[0] & 504) != 448) { | |
279 SHA1Update(context, reinterpret_cast<const uint8_t*>("\0"), 1); | |
280 } | |
281 SHA1Update(context, finalcount, 8); // Should cause a SHA1Transform(). | |
282 for (int i = 0; i < SHA1_DIGEST_SIZE; ++i) { | |
283 digest[i] = static_cast<uint8_t>( | |
284 (context->state[i >> 2] >> ((3 - (i & 3)) * 8)) & 255); | |
285 } | |
286 | |
287 // Wipe variables. | |
288 memset(context->buffer, 0, 64); | |
289 memset(context->state, 0, 20); | |
290 memset(context->count, 0, 8); | |
291 memset(finalcount, 0, 8); // SWR | |
292 | |
293 #ifdef SHA1HANDSOFF // Make SHA1Transform overwrite its own static vars. | |
294 SHA1Transform(context->state, context->buffer); | |
295 #endif | |
296 } | |
297 | |
298 } // namespace rtc | |
OLD | NEW |