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
65
66 #if !defined(OPENSSL_NO_ASM) && \
67 (defined(OPENSSL_X86) || defined(OPENSSL_X86_64) || \
68 defined(OPENSSL_ARM) || defined(OPENSSL_AARCH64) || \
69 defined(OPENSSL_PPC64LE))
70 #define SHA1_ASM
71 #endif
72
SHA1_Init(SHA_CTX * sha)73 int SHA1_Init(SHA_CTX *sha) {
74 OPENSSL_memset(sha, 0, sizeof(SHA_CTX));
75 sha->h[0] = 0x67452301UL;
76 sha->h[1] = 0xefcdab89UL;
77 sha->h[2] = 0x98badcfeUL;
78 sha->h[3] = 0x10325476UL;
79 sha->h[4] = 0xc3d2e1f0UL;
80 return 1;
81 }
82
SHA1(const uint8_t * data,size_t len,uint8_t * out)83 uint8_t *SHA1(const uint8_t *data, size_t len, uint8_t *out) {
84 SHA_CTX ctx;
85 static uint8_t buf[SHA_DIGEST_LENGTH];
86
87 /* TODO(fork): remove this static buffer. */
88 if (out == NULL) {
89 out = buf;
90 }
91 if (!SHA1_Init(&ctx)) {
92 return NULL;
93 }
94 SHA1_Update(&ctx, data, len);
95 SHA1_Final(out, &ctx);
96 OPENSSL_cleanse(&ctx, sizeof(ctx));
97 return out;
98 }
99
100 #define DATA_ORDER_IS_BIG_ENDIAN
101
102 #define HASH_CTX SHA_CTX
103 #define HASH_CBLOCK 64
104 #define HASH_MAKE_STRING(c, s) \
105 do { \
106 uint32_t ll; \
107 ll = (c)->h[0]; \
108 HOST_l2c(ll, (s)); \
109 ll = (c)->h[1]; \
110 HOST_l2c(ll, (s)); \
111 ll = (c)->h[2]; \
112 HOST_l2c(ll, (s)); \
113 ll = (c)->h[3]; \
114 HOST_l2c(ll, (s)); \
115 ll = (c)->h[4]; \
116 HOST_l2c(ll, (s)); \
117 } while (0)
118
119 #define HASH_UPDATE SHA1_Update
120 #define HASH_TRANSFORM SHA1_Transform
121 #define HASH_FINAL SHA1_Final
122 #define HASH_BLOCK_DATA_ORDER sha1_block_data_order
123 #define ROTATE(a, n) (((a) << (n)) | ((a) >> (32 - (n))))
124 #define Xupdate(a, ix, ia, ib, ic, id) \
125 do { \
126 (a) = ((ia) ^ (ib) ^ (ic) ^ (id)); \
127 (ix) = (a) = ROTATE((a), 1); \
128 } while (0)
129
130 #ifndef SHA1_ASM
131 static
132 #endif
133 void sha1_block_data_order(uint32_t *state, const uint8_t *data, size_t num);
134
135 #include "../digest/md32_common.h"
136
137 #define K_00_19 0x5a827999UL
138 #define K_20_39 0x6ed9eba1UL
139 #define K_40_59 0x8f1bbcdcUL
140 #define K_60_79 0xca62c1d6UL
141
142 /* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be simplified
143 * to the code in F_00_19. Wei attributes these optimisations to Peter
144 * Gutmann's SHS code, and he attributes it to Rich Schroeppel. #define
145 * F(x,y,z) (((x) & (y)) | ((~(x)) & (z))) I've just become aware of another
146 * tweak to be made, again from Wei Dai, in F_40_59, (x&a)|(y&a) -> (x|y)&a */
147 #define F_00_19(b, c, d) ((((c) ^ (d)) & (b)) ^ (d))
148 #define F_20_39(b, c, d) ((b) ^ (c) ^ (d))
149 #define F_40_59(b, c, d) (((b) & (c)) | (((b) | (c)) & (d)))
150 #define F_60_79(b, c, d) F_20_39(b, c, d)
151
152 #define BODY_00_15(i, a, b, c, d, e, f, xi) \
153 do { \
154 (f) = (xi) + (e) + K_00_19 + ROTATE((a), 5) + F_00_19((b), (c), (d)); \
155 (b) = ROTATE((b), 30); \
156 } while (0)
157
158 #define BODY_16_19(i, a, b, c, d, e, f, xi, xa, xb, xc, xd) \
159 do { \
160 Xupdate(f, xi, xa, xb, xc, xd); \
161 (f) += (e) + K_00_19 + ROTATE((a), 5) + F_00_19((b), (c), (d)); \
162 (b) = ROTATE((b), 30); \
163 } while (0)
164
165 #define BODY_20_31(i, a, b, c, d, e, f, xi, xa, xb, xc, xd) \
166 do { \
167 Xupdate(f, xi, xa, xb, xc, xd); \
168 (f) += (e) + K_20_39 + ROTATE((a), 5) + F_20_39((b), (c), (d)); \
169 (b) = ROTATE((b), 30); \
170 } while (0)
171
172 #define BODY_32_39(i, a, b, c, d, e, f, xa, xb, xc, xd) \
173 do { \
174 Xupdate(f, xa, xa, xb, xc, xd); \
175 (f) += (e) + K_20_39 + ROTATE((a), 5) + F_20_39((b), (c), (d)); \
176 (b) = ROTATE((b), 30); \
177 } while (0)
178
179 #define BODY_40_59(i, a, b, c, d, e, f, xa, xb, xc, xd) \
180 do { \
181 Xupdate(f, xa, xa, xb, xc, xd); \
182 (f) += (e) + K_40_59 + ROTATE((a), 5) + F_40_59((b), (c), (d)); \
183 (b) = ROTATE((b), 30); \
184 } while (0)
185
186 #define BODY_60_79(i, a, b, c, d, e, f, xa, xb, xc, xd) \
187 do { \
188 Xupdate(f, xa, xa, xb, xc, xd); \
189 (f) = (xa) + (e) + K_60_79 + ROTATE((a), 5) + F_60_79((b), (c), (d)); \
190 (b) = ROTATE((b), 30); \
191 } while (0)
192
193 #ifdef X
194 #undef X
195 #endif
196
197 /* Originally X was an array. As it's automatic it's natural
198 * to expect RISC compiler to accomodate at least part of it in
199 * the register bank, isn't it? Unfortunately not all compilers
200 * "find" this expectation reasonable:-( On order to make such
201 * compilers generate better code I replace X[] with a bunch of
202 * X0, X1, etc. See the function body below...
203 * <appro@fy.chalmers.se> */
204 #define X(i) XX##i
205
206 #if !defined(SHA1_ASM)
sha1_block_data_order(uint32_t * state,const uint8_t * data,size_t num)207 static void sha1_block_data_order(uint32_t *state, const uint8_t *data,
208 size_t num) {
209 register uint32_t A, B, C, D, E, T, l;
210 uint32_t XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, XX8, XX9, XX10,
211 XX11, XX12, XX13, XX14, XX15;
212
213 A = state[0];
214 B = state[1];
215 C = state[2];
216 D = state[3];
217 E = state[4];
218
219 for (;;) {
220 HOST_c2l(data, l);
221 X(0) = l;
222 HOST_c2l(data, l);
223 X(1) = l;
224 BODY_00_15(0, A, B, C, D, E, T, X(0));
225 HOST_c2l(data, l);
226 X(2) = l;
227 BODY_00_15(1, T, A, B, C, D, E, X(1));
228 HOST_c2l(data, l);
229 X(3) = l;
230 BODY_00_15(2, E, T, A, B, C, D, X(2));
231 HOST_c2l(data, l);
232 X(4) = l;
233 BODY_00_15(3, D, E, T, A, B, C, X(3));
234 HOST_c2l(data, l);
235 X(5) = l;
236 BODY_00_15(4, C, D, E, T, A, B, X(4));
237 HOST_c2l(data, l);
238 X(6) = l;
239 BODY_00_15(5, B, C, D, E, T, A, X(5));
240 HOST_c2l(data, l);
241 X(7) = l;
242 BODY_00_15(6, A, B, C, D, E, T, X(6));
243 HOST_c2l(data, l);
244 X(8) = l;
245 BODY_00_15(7, T, A, B, C, D, E, X(7));
246 HOST_c2l(data, l);
247 X(9) = l;
248 BODY_00_15(8, E, T, A, B, C, D, X(8));
249 HOST_c2l(data, l);
250 X(10) = l;
251 BODY_00_15(9, D, E, T, A, B, C, X(9));
252 HOST_c2l(data, l);
253 X(11) = l;
254 BODY_00_15(10, C, D, E, T, A, B, X(10));
255 HOST_c2l(data, l);
256 X(12) = l;
257 BODY_00_15(11, B, C, D, E, T, A, X(11));
258 HOST_c2l(data, l);
259 X(13) = l;
260 BODY_00_15(12, A, B, C, D, E, T, X(12));
261 HOST_c2l(data, l);
262 X(14) = l;
263 BODY_00_15(13, T, A, B, C, D, E, X(13));
264 HOST_c2l(data, l);
265 X(15) = l;
266 BODY_00_15(14, E, T, A, B, C, D, X(14));
267 BODY_00_15(15, D, E, T, A, B, C, X(15));
268
269 BODY_16_19(16, C, D, E, T, A, B, X(0), X(0), X(2), X(8), X(13));
270 BODY_16_19(17, B, C, D, E, T, A, X(1), X(1), X(3), X(9), X(14));
271 BODY_16_19(18, A, B, C, D, E, T, X(2), X(2), X(4), X(10), X(15));
272 BODY_16_19(19, T, A, B, C, D, E, X(3), X(3), X(5), X(11), X(0));
273
274 BODY_20_31(20, E, T, A, B, C, D, X(4), X(4), X(6), X(12), X(1));
275 BODY_20_31(21, D, E, T, A, B, C, X(5), X(5), X(7), X(13), X(2));
276 BODY_20_31(22, C, D, E, T, A, B, X(6), X(6), X(8), X(14), X(3));
277 BODY_20_31(23, B, C, D, E, T, A, X(7), X(7), X(9), X(15), X(4));
278 BODY_20_31(24, A, B, C, D, E, T, X(8), X(8), X(10), X(0), X(5));
279 BODY_20_31(25, T, A, B, C, D, E, X(9), X(9), X(11), X(1), X(6));
280 BODY_20_31(26, E, T, A, B, C, D, X(10), X(10), X(12), X(2), X(7));
281 BODY_20_31(27, D, E, T, A, B, C, X(11), X(11), X(13), X(3), X(8));
282 BODY_20_31(28, C, D, E, T, A, B, X(12), X(12), X(14), X(4), X(9));
283 BODY_20_31(29, B, C, D, E, T, A, X(13), X(13), X(15), X(5), X(10));
284 BODY_20_31(30, A, B, C, D, E, T, X(14), X(14), X(0), X(6), X(11));
285 BODY_20_31(31, T, A, B, C, D, E, X(15), X(15), X(1), X(7), X(12));
286
287 BODY_32_39(32, E, T, A, B, C, D, X(0), X(2), X(8), X(13));
288 BODY_32_39(33, D, E, T, A, B, C, X(1), X(3), X(9), X(14));
289 BODY_32_39(34, C, D, E, T, A, B, X(2), X(4), X(10), X(15));
290 BODY_32_39(35, B, C, D, E, T, A, X(3), X(5), X(11), X(0));
291 BODY_32_39(36, A, B, C, D, E, T, X(4), X(6), X(12), X(1));
292 BODY_32_39(37, T, A, B, C, D, E, X(5), X(7), X(13), X(2));
293 BODY_32_39(38, E, T, A, B, C, D, X(6), X(8), X(14), X(3));
294 BODY_32_39(39, D, E, T, A, B, C, X(7), X(9), X(15), X(4));
295
296 BODY_40_59(40, C, D, E, T, A, B, X(8), X(10), X(0), X(5));
297 BODY_40_59(41, B, C, D, E, T, A, X(9), X(11), X(1), X(6));
298 BODY_40_59(42, A, B, C, D, E, T, X(10), X(12), X(2), X(7));
299 BODY_40_59(43, T, A, B, C, D, E, X(11), X(13), X(3), X(8));
300 BODY_40_59(44, E, T, A, B, C, D, X(12), X(14), X(4), X(9));
301 BODY_40_59(45, D, E, T, A, B, C, X(13), X(15), X(5), X(10));
302 BODY_40_59(46, C, D, E, T, A, B, X(14), X(0), X(6), X(11));
303 BODY_40_59(47, B, C, D, E, T, A, X(15), X(1), X(7), X(12));
304 BODY_40_59(48, A, B, C, D, E, T, X(0), X(2), X(8), X(13));
305 BODY_40_59(49, T, A, B, C, D, E, X(1), X(3), X(9), X(14));
306 BODY_40_59(50, E, T, A, B, C, D, X(2), X(4), X(10), X(15));
307 BODY_40_59(51, D, E, T, A, B, C, X(3), X(5), X(11), X(0));
308 BODY_40_59(52, C, D, E, T, A, B, X(4), X(6), X(12), X(1));
309 BODY_40_59(53, B, C, D, E, T, A, X(5), X(7), X(13), X(2));
310 BODY_40_59(54, A, B, C, D, E, T, X(6), X(8), X(14), X(3));
311 BODY_40_59(55, T, A, B, C, D, E, X(7), X(9), X(15), X(4));
312 BODY_40_59(56, E, T, A, B, C, D, X(8), X(10), X(0), X(5));
313 BODY_40_59(57, D, E, T, A, B, C, X(9), X(11), X(1), X(6));
314 BODY_40_59(58, C, D, E, T, A, B, X(10), X(12), X(2), X(7));
315 BODY_40_59(59, B, C, D, E, T, A, X(11), X(13), X(3), X(8));
316
317 BODY_60_79(60, A, B, C, D, E, T, X(12), X(14), X(4), X(9));
318 BODY_60_79(61, T, A, B, C, D, E, X(13), X(15), X(5), X(10));
319 BODY_60_79(62, E, T, A, B, C, D, X(14), X(0), X(6), X(11));
320 BODY_60_79(63, D, E, T, A, B, C, X(15), X(1), X(7), X(12));
321 BODY_60_79(64, C, D, E, T, A, B, X(0), X(2), X(8), X(13));
322 BODY_60_79(65, B, C, D, E, T, A, X(1), X(3), X(9), X(14));
323 BODY_60_79(66, A, B, C, D, E, T, X(2), X(4), X(10), X(15));
324 BODY_60_79(67, T, A, B, C, D, E, X(3), X(5), X(11), X(0));
325 BODY_60_79(68, E, T, A, B, C, D, X(4), X(6), X(12), X(1));
326 BODY_60_79(69, D, E, T, A, B, C, X(5), X(7), X(13), X(2));
327 BODY_60_79(70, C, D, E, T, A, B, X(6), X(8), X(14), X(3));
328 BODY_60_79(71, B, C, D, E, T, A, X(7), X(9), X(15), X(4));
329 BODY_60_79(72, A, B, C, D, E, T, X(8), X(10), X(0), X(5));
330 BODY_60_79(73, T, A, B, C, D, E, X(9), X(11), X(1), X(6));
331 BODY_60_79(74, E, T, A, B, C, D, X(10), X(12), X(2), X(7));
332 BODY_60_79(75, D, E, T, A, B, C, X(11), X(13), X(3), X(8));
333 BODY_60_79(76, C, D, E, T, A, B, X(12), X(14), X(4), X(9));
334 BODY_60_79(77, B, C, D, E, T, A, X(13), X(15), X(5), X(10));
335 BODY_60_79(78, A, B, C, D, E, T, X(14), X(0), X(6), X(11));
336 BODY_60_79(79, T, A, B, C, D, E, X(15), X(1), X(7), X(12));
337
338 state[0] = (state[0] + E) & 0xffffffffL;
339 state[1] = (state[1] + T) & 0xffffffffL;
340 state[2] = (state[2] + A) & 0xffffffffL;
341 state[3] = (state[3] + B) & 0xffffffffL;
342 state[4] = (state[4] + C) & 0xffffffffL;
343
344 if (--num == 0) {
345 break;
346 }
347
348 A = state[0];
349 B = state[1];
350 C = state[2];
351 D = state[3];
352 E = state[4];
353 }
354 }
355 #endif
356