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