1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
2 * All rights reserved.
3 *
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
7 *
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
14 *
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
21 *
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
24 * are met:
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
39 *
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
50 * SUCH DAMAGE.
51 *
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.] */
56
57 #include <openssl/sha.h>
58
59 #include <string.h>
60
61 #include <openssl/mem.h>
62
63 #include "internal.h"
64 #include "../../internal.h"
65
66
SHA1_Init(SHA_CTX * sha)67 int SHA1_Init(SHA_CTX *sha) {
68 OPENSSL_memset(sha, 0, sizeof(SHA_CTX));
69 sha->h[0] = 0x67452301UL;
70 sha->h[1] = 0xefcdab89UL;
71 sha->h[2] = 0x98badcfeUL;
72 sha->h[3] = 0x10325476UL;
73 sha->h[4] = 0xc3d2e1f0UL;
74 return 1;
75 }
76
SHA1(const uint8_t * data,size_t len,uint8_t * out)77 uint8_t *SHA1(const uint8_t *data, size_t len, uint8_t *out) {
78 SHA_CTX ctx;
79 SHA1_Init(&ctx);
80 SHA1_Update(&ctx, data, len);
81 SHA1_Final(out, &ctx);
82 OPENSSL_cleanse(&ctx, sizeof(ctx));
83 return out;
84 }
85
86 #define DATA_ORDER_IS_BIG_ENDIAN
87
88 #define HASH_CTX SHA_CTX
89 #define HASH_CBLOCK 64
90 #define HASH_MAKE_STRING(c, s) \
91 do { \
92 uint32_t ll; \
93 ll = (c)->h[0]; \
94 HOST_l2c(ll, (s)); \
95 ll = (c)->h[1]; \
96 HOST_l2c(ll, (s)); \
97 ll = (c)->h[2]; \
98 HOST_l2c(ll, (s)); \
99 ll = (c)->h[3]; \
100 HOST_l2c(ll, (s)); \
101 ll = (c)->h[4]; \
102 HOST_l2c(ll, (s)); \
103 } while (0)
104
105 #define HASH_UPDATE SHA1_Update
106 #define HASH_TRANSFORM SHA1_Transform
107 #define HASH_FINAL SHA1_Final
108 #define HASH_BLOCK_DATA_ORDER sha1_block_data_order
109 #define ROTATE(a, n) (((a) << (n)) | ((a) >> (32 - (n))))
110 #define Xupdate(a, ix, ia, ib, ic, id) \
111 do { \
112 (a) = ((ia) ^ (ib) ^ (ic) ^ (id)); \
113 (ix) = (a) = ROTATE((a), 1); \
114 } while (0)
115
116 #ifndef SHA1_ASM
117 static void sha1_block_data_order(uint32_t *state, const uint8_t *data,
118 size_t num);
119 #endif
120
121 #include "../digest/md32_common.h"
122
123 #define K_00_19 0x5a827999UL
124 #define K_20_39 0x6ed9eba1UL
125 #define K_40_59 0x8f1bbcdcUL
126 #define K_60_79 0xca62c1d6UL
127
128 // As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be simplified
129 // to the code in F_00_19. Wei attributes these optimisations to Peter
130 // Gutmann's SHS code, and he attributes it to Rich Schroeppel. #define
131 // F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) I've just become aware of another
132 // tweak to be made, again from Wei Dai, in F_40_59, (x&a)|(y&a) -> (x|y)&a
133 #define F_00_19(b, c, d) ((((c) ^ (d)) & (b)) ^ (d))
134 #define F_20_39(b, c, d) ((b) ^ (c) ^ (d))
135 #define F_40_59(b, c, d) (((b) & (c)) | (((b) | (c)) & (d)))
136 #define F_60_79(b, c, d) F_20_39(b, c, d)
137
138 #define BODY_00_15(i, a, b, c, d, e, f, xi) \
139 do { \
140 (f) = (xi) + (e) + K_00_19 + ROTATE((a), 5) + F_00_19((b), (c), (d)); \
141 (b) = ROTATE((b), 30); \
142 } while (0)
143
144 #define BODY_16_19(i, a, b, c, d, e, f, xi, xa, xb, xc, xd) \
145 do { \
146 Xupdate(f, xi, xa, xb, xc, xd); \
147 (f) += (e) + K_00_19 + ROTATE((a), 5) + F_00_19((b), (c), (d)); \
148 (b) = ROTATE((b), 30); \
149 } while (0)
150
151 #define BODY_20_31(i, a, b, c, d, e, f, xi, xa, xb, xc, xd) \
152 do { \
153 Xupdate(f, xi, xa, xb, xc, xd); \
154 (f) += (e) + K_20_39 + ROTATE((a), 5) + F_20_39((b), (c), (d)); \
155 (b) = ROTATE((b), 30); \
156 } while (0)
157
158 #define BODY_32_39(i, a, b, c, d, e, f, xa, xb, xc, xd) \
159 do { \
160 Xupdate(f, xa, xa, xb, xc, xd); \
161 (f) += (e) + K_20_39 + ROTATE((a), 5) + F_20_39((b), (c), (d)); \
162 (b) = ROTATE((b), 30); \
163 } while (0)
164
165 #define BODY_40_59(i, a, b, c, d, e, f, xa, xb, xc, xd) \
166 do { \
167 Xupdate(f, xa, xa, xb, xc, xd); \
168 (f) += (e) + K_40_59 + ROTATE((a), 5) + F_40_59((b), (c), (d)); \
169 (b) = ROTATE((b), 30); \
170 } while (0)
171
172 #define BODY_60_79(i, a, b, c, d, e, f, xa, xb, xc, xd) \
173 do { \
174 Xupdate(f, xa, xa, xb, xc, xd); \
175 (f) = (xa) + (e) + K_60_79 + ROTATE((a), 5) + F_60_79((b), (c), (d)); \
176 (b) = ROTATE((b), 30); \
177 } while (0)
178
179 #ifdef X
180 #undef X
181 #endif
182
183 /* Originally X was an array. As it's automatic it's natural
184 * to expect RISC compiler to accomodate at least part of it in
185 * the register bank, isn't it? Unfortunately not all compilers
186 * "find" this expectation reasonable:-( On order to make such
187 * compilers generate better code I replace X[] with a bunch of
188 * X0, X1, etc. See the function body below...
189 * <appro@fy.chalmers.se> */
190 #define X(i) XX##i
191
192 #if !defined(SHA1_ASM)
sha1_block_data_order(uint32_t * state,const uint8_t * data,size_t num)193 static void sha1_block_data_order(uint32_t *state, const uint8_t *data,
194 size_t num) {
195 register uint32_t A, B, C, D, E, T, l;
196 uint32_t XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, XX8, XX9, XX10,
197 XX11, XX12, XX13, XX14, XX15;
198
199 A = state[0];
200 B = state[1];
201 C = state[2];
202 D = state[3];
203 E = state[4];
204
205 for (;;) {
206 HOST_c2l(data, l);
207 X(0) = l;
208 HOST_c2l(data, l);
209 X(1) = l;
210 BODY_00_15(0, A, B, C, D, E, T, X(0));
211 HOST_c2l(data, l);
212 X(2) = l;
213 BODY_00_15(1, T, A, B, C, D, E, X(1));
214 HOST_c2l(data, l);
215 X(3) = l;
216 BODY_00_15(2, E, T, A, B, C, D, X(2));
217 HOST_c2l(data, l);
218 X(4) = l;
219 BODY_00_15(3, D, E, T, A, B, C, X(3));
220 HOST_c2l(data, l);
221 X(5) = l;
222 BODY_00_15(4, C, D, E, T, A, B, X(4));
223 HOST_c2l(data, l);
224 X(6) = l;
225 BODY_00_15(5, B, C, D, E, T, A, X(5));
226 HOST_c2l(data, l);
227 X(7) = l;
228 BODY_00_15(6, A, B, C, D, E, T, X(6));
229 HOST_c2l(data, l);
230 X(8) = l;
231 BODY_00_15(7, T, A, B, C, D, E, X(7));
232 HOST_c2l(data, l);
233 X(9) = l;
234 BODY_00_15(8, E, T, A, B, C, D, X(8));
235 HOST_c2l(data, l);
236 X(10) = l;
237 BODY_00_15(9, D, E, T, A, B, C, X(9));
238 HOST_c2l(data, l);
239 X(11) = l;
240 BODY_00_15(10, C, D, E, T, A, B, X(10));
241 HOST_c2l(data, l);
242 X(12) = l;
243 BODY_00_15(11, B, C, D, E, T, A, X(11));
244 HOST_c2l(data, l);
245 X(13) = l;
246 BODY_00_15(12, A, B, C, D, E, T, X(12));
247 HOST_c2l(data, l);
248 X(14) = l;
249 BODY_00_15(13, T, A, B, C, D, E, X(13));
250 HOST_c2l(data, l);
251 X(15) = l;
252 BODY_00_15(14, E, T, A, B, C, D, X(14));
253 BODY_00_15(15, D, E, T, A, B, C, X(15));
254
255 BODY_16_19(16, C, D, E, T, A, B, X(0), X(0), X(2), X(8), X(13));
256 BODY_16_19(17, B, C, D, E, T, A, X(1), X(1), X(3), X(9), X(14));
257 BODY_16_19(18, A, B, C, D, E, T, X(2), X(2), X(4), X(10), X(15));
258 BODY_16_19(19, T, A, B, C, D, E, X(3), X(3), X(5), X(11), X(0));
259
260 BODY_20_31(20, E, T, A, B, C, D, X(4), X(4), X(6), X(12), X(1));
261 BODY_20_31(21, D, E, T, A, B, C, X(5), X(5), X(7), X(13), X(2));
262 BODY_20_31(22, C, D, E, T, A, B, X(6), X(6), X(8), X(14), X(3));
263 BODY_20_31(23, B, C, D, E, T, A, X(7), X(7), X(9), X(15), X(4));
264 BODY_20_31(24, A, B, C, D, E, T, X(8), X(8), X(10), X(0), X(5));
265 BODY_20_31(25, T, A, B, C, D, E, X(9), X(9), X(11), X(1), X(6));
266 BODY_20_31(26, E, T, A, B, C, D, X(10), X(10), X(12), X(2), X(7));
267 BODY_20_31(27, D, E, T, A, B, C, X(11), X(11), X(13), X(3), X(8));
268 BODY_20_31(28, C, D, E, T, A, B, X(12), X(12), X(14), X(4), X(9));
269 BODY_20_31(29, B, C, D, E, T, A, X(13), X(13), X(15), X(5), X(10));
270 BODY_20_31(30, A, B, C, D, E, T, X(14), X(14), X(0), X(6), X(11));
271 BODY_20_31(31, T, A, B, C, D, E, X(15), X(15), X(1), X(7), X(12));
272
273 BODY_32_39(32, E, T, A, B, C, D, X(0), X(2), X(8), X(13));
274 BODY_32_39(33, D, E, T, A, B, C, X(1), X(3), X(9), X(14));
275 BODY_32_39(34, C, D, E, T, A, B, X(2), X(4), X(10), X(15));
276 BODY_32_39(35, B, C, D, E, T, A, X(3), X(5), X(11), X(0));
277 BODY_32_39(36, A, B, C, D, E, T, X(4), X(6), X(12), X(1));
278 BODY_32_39(37, T, A, B, C, D, E, X(5), X(7), X(13), X(2));
279 BODY_32_39(38, E, T, A, B, C, D, X(6), X(8), X(14), X(3));
280 BODY_32_39(39, D, E, T, A, B, C, X(7), X(9), X(15), X(4));
281
282 BODY_40_59(40, C, D, E, T, A, B, X(8), X(10), X(0), X(5));
283 BODY_40_59(41, B, C, D, E, T, A, X(9), X(11), X(1), X(6));
284 BODY_40_59(42, A, B, C, D, E, T, X(10), X(12), X(2), X(7));
285 BODY_40_59(43, T, A, B, C, D, E, X(11), X(13), X(3), X(8));
286 BODY_40_59(44, E, T, A, B, C, D, X(12), X(14), X(4), X(9));
287 BODY_40_59(45, D, E, T, A, B, C, X(13), X(15), X(5), X(10));
288 BODY_40_59(46, C, D, E, T, A, B, X(14), X(0), X(6), X(11));
289 BODY_40_59(47, B, C, D, E, T, A, X(15), X(1), X(7), X(12));
290 BODY_40_59(48, A, B, C, D, E, T, X(0), X(2), X(8), X(13));
291 BODY_40_59(49, T, A, B, C, D, E, X(1), X(3), X(9), X(14));
292 BODY_40_59(50, E, T, A, B, C, D, X(2), X(4), X(10), X(15));
293 BODY_40_59(51, D, E, T, A, B, C, X(3), X(5), X(11), X(0));
294 BODY_40_59(52, C, D, E, T, A, B, X(4), X(6), X(12), X(1));
295 BODY_40_59(53, B, C, D, E, T, A, X(5), X(7), X(13), X(2));
296 BODY_40_59(54, A, B, C, D, E, T, X(6), X(8), X(14), X(3));
297 BODY_40_59(55, T, A, B, C, D, E, X(7), X(9), X(15), X(4));
298 BODY_40_59(56, E, T, A, B, C, D, X(8), X(10), X(0), X(5));
299 BODY_40_59(57, D, E, T, A, B, C, X(9), X(11), X(1), X(6));
300 BODY_40_59(58, C, D, E, T, A, B, X(10), X(12), X(2), X(7));
301 BODY_40_59(59, B, C, D, E, T, A, X(11), X(13), X(3), X(8));
302
303 BODY_60_79(60, A, B, C, D, E, T, X(12), X(14), X(4), X(9));
304 BODY_60_79(61, T, A, B, C, D, E, X(13), X(15), X(5), X(10));
305 BODY_60_79(62, E, T, A, B, C, D, X(14), X(0), X(6), X(11));
306 BODY_60_79(63, D, E, T, A, B, C, X(15), X(1), X(7), X(12));
307 BODY_60_79(64, C, D, E, T, A, B, X(0), X(2), X(8), X(13));
308 BODY_60_79(65, B, C, D, E, T, A, X(1), X(3), X(9), X(14));
309 BODY_60_79(66, A, B, C, D, E, T, X(2), X(4), X(10), X(15));
310 BODY_60_79(67, T, A, B, C, D, E, X(3), X(5), X(11), X(0));
311 BODY_60_79(68, E, T, A, B, C, D, X(4), X(6), X(12), X(1));
312 BODY_60_79(69, D, E, T, A, B, C, X(5), X(7), X(13), X(2));
313 BODY_60_79(70, C, D, E, T, A, B, X(6), X(8), X(14), X(3));
314 BODY_60_79(71, B, C, D, E, T, A, X(7), X(9), X(15), X(4));
315 BODY_60_79(72, A, B, C, D, E, T, X(8), X(10), X(0), X(5));
316 BODY_60_79(73, T, A, B, C, D, E, X(9), X(11), X(1), X(6));
317 BODY_60_79(74, E, T, A, B, C, D, X(10), X(12), X(2), X(7));
318 BODY_60_79(75, D, E, T, A, B, C, X(11), X(13), X(3), X(8));
319 BODY_60_79(76, C, D, E, T, A, B, X(12), X(14), X(4), X(9));
320 BODY_60_79(77, B, C, D, E, T, A, X(13), X(15), X(5), X(10));
321 BODY_60_79(78, A, B, C, D, E, T, X(14), X(0), X(6), X(11));
322 BODY_60_79(79, T, A, B, C, D, E, X(15), X(1), X(7), X(12));
323
324 state[0] = (state[0] + E) & 0xffffffffL;
325 state[1] = (state[1] + T) & 0xffffffffL;
326 state[2] = (state[2] + A) & 0xffffffffL;
327 state[3] = (state[3] + B) & 0xffffffffL;
328 state[4] = (state[4] + C) & 0xffffffffL;
329
330 if (--num == 0) {
331 break;
332 }
333
334 A = state[0];
335 B = state[1];
336 C = state[2];
337 D = state[3];
338 E = state[4];
339 }
340 }
341 #endif
342
343 #undef DATA_ORDER_IS_BIG_ENDIAN
344 #undef HASH_CTX
345 #undef HASH_CBLOCK
346 #undef HASH_MAKE_STRING
347 #undef HASH_UPDATE
348 #undef HASH_TRANSFORM
349 #undef HASH_FINAL
350 #undef HASH_BLOCK_DATA_ORDER
351 #undef ROTATE
352 #undef Xupdate
353 #undef K_00_19
354 #undef K_20_39
355 #undef K_40_59
356 #undef K_60_79
357 #undef F_00_19
358 #undef F_20_39
359 #undef F_40_59
360 #undef F_60_79
361 #undef BODY_00_15
362 #undef BODY_16_19
363 #undef BODY_20_31
364 #undef BODY_32_39
365 #undef BODY_40_59
366 #undef BODY_60_79
367 #undef X
368 #undef HOST_c2l
369 #undef HOST_l2c
370