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 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
58 *
59 * This file contains Original Code and/or Modifications of Original Code
60 * as defined in and that are subject to the Apple Public Source License
61 * Version 2.0 (the 'License'). You may not use this file except in
62 * compliance with the License. The rights granted to you under the License
63 * may not be used to create, or enable the creation or redistribution of,
64 * unlawful or unlicensed copies of an Apple operating system, or to
65 * circumvent, violate, or enable the circumvention or violation of, any
66 * terms of an Apple operating system software license agreement.
67 *
68 * Please obtain a copy of the License at
69 * http://www.opensource.apple.com/apsl/ and read it before using this file.
70 *
71 * The Original Code and all software distributed under the License are
72 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
73 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
74 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
75 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
76 * Please see the License for the specific language governing rights and
77 * limitations under the License.
78 *
79 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
80 */
81
82
83#include <corecrypto/ccsha1.h>
84#include "ccsha1_internal.h"
85#include <corecrypto/cc_priv.h>
86#include <corecrypto/ccdigest_priv.h>
87#include "ccdigest_internal.h"
88
89
90#ifndef SHA_LONG_LOG2
91#define SHA_LONG_LOG2 2 /* default to 32 bits */
92#endif
93
94
95#define ROTATE(b, n) CC_ROLc(b, n)
96
97#define Xupdate(a,ix,ia,ib,ic,id) ( (a)=(ia^ib^ic^id), \
98 ix=(a)=ROTATE((a),1) \
99 )
100
101#define MD32_REG_T uint32_t
102
103#define HOST_c2l(data, l) CC_LOAD32_BE(l, data); data+=4;
104
105#define K_00_19 0x5a827999
106#define K_20_39 0x6ed9eba1
107#define K_40_59 0x8f1bbcdc
108#define K_60_79 0xca62c1d6
109
110/* As pointed out by Wei Dai <weidai@eskimo.com>, F() below can be
111 * simplified to the code in F_00_19. Wei attributes these optimisations
112 * to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
113 * #define F(x,y,z) (((x) & (y)) | ((~(x)) & (z)))
114 * I've just become aware of another tweak to be made, again from Wei Dai,
115 * in F_40_59, (x&a)|(y&a) -> (x|y)&a
116 */
117#define F_00_19(b,c,d) ((((c) ^ (d)) & (b)) ^ (d))
118#define F_20_39(b,c,d) ((b) ^ (c) ^ (d))
119#define F_40_59(b,c,d) (((b) & (c)) | (((b)|(c)) & (d)))
120#define F_60_79(b,c,d) F_20_39(b,c,d)
121
122#define BODY_00_15(i,a,b,c,d,e,f,xi) \
123 (f)=xi+(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
124 (b)=ROTATE((b),30);
125
126#define BODY_16_19(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
127 Xupdate(f,xi,xa,xb,xc,xd); \
128 (f)+=(e)+K_00_19+ROTATE((a),5)+F_00_19((b),(c),(d)); \
129 (b)=ROTATE((b),30);
130
131#define BODY_20_31(i,a,b,c,d,e,f,xi,xa,xb,xc,xd) \
132 Xupdate(f,xi,xa,xb,xc,xd); \
133 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
134 (b)=ROTATE((b),30);
135
136#define BODY_32_39(i,a,b,c,d,e,f,xa,xb,xc,xd) \
137 Xupdate(f,xa,xa,xb,xc,xd); \
138 (f)+=(e)+K_20_39+ROTATE((a),5)+F_20_39((b),(c),(d)); \
139 (b)=ROTATE((b),30);
140
141#define BODY_40_59(i,a,b,c,d,e,f,xa,xb,xc,xd) \
142 Xupdate(f,xa,xa,xb,xc,xd); \
143 (f)+=(e)+K_40_59+ROTATE((a),5)+F_40_59((b),(c),(d)); \
144 (b)=ROTATE((b),30);
145
146#define BODY_60_79(i,a,b,c,d,e,f,xa,xb,xc,xd) \
147 Xupdate(f,xa,xa,xb,xc,xd); \
148 (f)=xa+(e)+K_60_79+ROTATE((a),5)+F_60_79((b),(c),(d)); \
149 (b)=ROTATE((b),30);
150
151#ifdef X
152#undef X
153#endif
154
155#ifndef MD32_XARRAY
156 /*
157 * Originally X was an array. As it's automatic it's natural
158 * to expect RISC compiler to accomodate at least part of it in
159 * the register bank, isn't it? Unfortunately not all compilers
160 * "find" this expectation reasonable:-( On order to make such
161 * compilers generate better code I replace X[] with a bunch of
162 * X0, X1, etc. See the function body below...
163 * <appro@fy.chalmers.se>
164 */
165# define X(i) XX##i
166#else
167 /*
168 * However! Some compilers (most notably HP C) get overwhelmed by
169 * that many local variables so that we have to have the way to
170 * fall down to the original behavior.
171 */
172# define X(i) XX[i]
173#endif
174
175static void sha1_compress(ccdigest_state_t s, size_t num, const void *buf)
176{
177 const unsigned char *data=buf;
178 register uint32_t A,B,C,D,E,T,l;
179#ifndef MD32_XARRAY
180 uint32_t XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7,
181 XX8, XX9,XX10,XX11,XX12,XX13,XX14,XX15;
182#else
183 uint32_t XX[16];
184#endif
185 uint32_t *state=ccdigest_u32(s);
186
187 A=state[0];
188 B=state[1];
189 C=state[2];
190 D=state[3];
191 E=state[4];
192
193 for (;;)
194 {
195
196 HOST_c2l(data,l); X( 0)=l; HOST_c2l(data,l); X( 1)=l;
197 BODY_00_15( 0,A,B,C,D,E,T,X( 0)); HOST_c2l(data,l); X( 2)=l;
198 BODY_00_15( 1,T,A,B,C,D,E,X( 1)); HOST_c2l(data,l); X( 3)=l;
199 BODY_00_15( 2,E,T,A,B,C,D,X( 2)); HOST_c2l(data,l); X( 4)=l;
200 BODY_00_15( 3,D,E,T,A,B,C,X( 3)); HOST_c2l(data,l); X( 5)=l;
201 BODY_00_15( 4,C,D,E,T,A,B,X( 4)); HOST_c2l(data,l); X( 6)=l;
202 BODY_00_15( 5,B,C,D,E,T,A,X( 5)); HOST_c2l(data,l); X( 7)=l;
203 BODY_00_15( 6,A,B,C,D,E,T,X( 6)); HOST_c2l(data,l); X( 8)=l;
204 BODY_00_15( 7,T,A,B,C,D,E,X( 7)); HOST_c2l(data,l); X( 9)=l;
205 BODY_00_15( 8,E,T,A,B,C,D,X( 8)); HOST_c2l(data,l); X(10)=l;
206 BODY_00_15( 9,D,E,T,A,B,C,X( 9)); HOST_c2l(data,l); X(11)=l;
207 BODY_00_15(10,C,D,E,T,A,B,X(10)); HOST_c2l(data,l); X(12)=l;
208 BODY_00_15(11,B,C,D,E,T,A,X(11)); HOST_c2l(data,l); X(13)=l;
209 BODY_00_15(12,A,B,C,D,E,T,X(12)); HOST_c2l(data,l); X(14)=l;
210 BODY_00_15(13,T,A,B,C,D,E,X(13)); HOST_c2l(data,l); X(15)=l;
211 BODY_00_15(14,E,T,A,B,C,D,X(14));
212 BODY_00_15(15,D,E,T,A,B,C,X(15));
213
214 BODY_16_19(16,C,D,E,T,A,B,X( 0),X( 0),X( 2),X( 8),X(13));
215 BODY_16_19(17,B,C,D,E,T,A,X( 1),X( 1),X( 3),X( 9),X(14));
216 BODY_16_19(18,A,B,C,D,E,T,X( 2),X( 2),X( 4),X(10),X(15));
217 BODY_16_19(19,T,A,B,C,D,E,X( 3),X( 3),X( 5),X(11),X( 0));
218
219 BODY_20_31(20,E,T,A,B,C,D,X( 4),X( 4),X( 6),X(12),X( 1));
220 BODY_20_31(21,D,E,T,A,B,C,X( 5),X( 5),X( 7),X(13),X( 2));
221 BODY_20_31(22,C,D,E,T,A,B,X( 6),X( 6),X( 8),X(14),X( 3));
222 BODY_20_31(23,B,C,D,E,T,A,X( 7),X( 7),X( 9),X(15),X( 4));
223 BODY_20_31(24,A,B,C,D,E,T,X( 8),X( 8),X(10),X( 0),X( 5));
224 BODY_20_31(25,T,A,B,C,D,E,X( 9),X( 9),X(11),X( 1),X( 6));
225 BODY_20_31(26,E,T,A,B,C,D,X(10),X(10),X(12),X( 2),X( 7));
226 BODY_20_31(27,D,E,T,A,B,C,X(11),X(11),X(13),X( 3),X( 8));
227 BODY_20_31(28,C,D,E,T,A,B,X(12),X(12),X(14),X( 4),X( 9));
228 BODY_20_31(29,B,C,D,E,T,A,X(13),X(13),X(15),X( 5),X(10));
229 BODY_20_31(30,A,B,C,D,E,T,X(14),X(14),X( 0),X( 6),X(11));
230 BODY_20_31(31,T,A,B,C,D,E,X(15),X(15),X( 1),X( 7),X(12));
231
232 BODY_32_39(32,E,T,A,B,C,D,X( 0),X( 2),X( 8),X(13));
233 BODY_32_39(33,D,E,T,A,B,C,X( 1),X( 3),X( 9),X(14));
234 BODY_32_39(34,C,D,E,T,A,B,X( 2),X( 4),X(10),X(15));
235 BODY_32_39(35,B,C,D,E,T,A,X( 3),X( 5),X(11),X( 0));
236 BODY_32_39(36,A,B,C,D,E,T,X( 4),X( 6),X(12),X( 1));
237 BODY_32_39(37,T,A,B,C,D,E,X( 5),X( 7),X(13),X( 2));
238 BODY_32_39(38,E,T,A,B,C,D,X( 6),X( 8),X(14),X( 3));
239 BODY_32_39(39,D,E,T,A,B,C,X( 7),X( 9),X(15),X( 4));
240
241 BODY_40_59(40,C,D,E,T,A,B,X( 8),X(10),X( 0),X( 5));
242 BODY_40_59(41,B,C,D,E,T,A,X( 9),X(11),X( 1),X( 6));
243 BODY_40_59(42,A,B,C,D,E,T,X(10),X(12),X( 2),X( 7));
244 BODY_40_59(43,T,A,B,C,D,E,X(11),X(13),X( 3),X( 8));
245 BODY_40_59(44,E,T,A,B,C,D,X(12),X(14),X( 4),X( 9));
246 BODY_40_59(45,D,E,T,A,B,C,X(13),X(15),X( 5),X(10));
247 BODY_40_59(46,C,D,E,T,A,B,X(14),X( 0),X( 6),X(11));
248 BODY_40_59(47,B,C,D,E,T,A,X(15),X( 1),X( 7),X(12));
249 BODY_40_59(48,A,B,C,D,E,T,X( 0),X( 2),X( 8),X(13));
250 BODY_40_59(49,T,A,B,C,D,E,X( 1),X( 3),X( 9),X(14));
251 BODY_40_59(50,E,T,A,B,C,D,X( 2),X( 4),X(10),X(15));
252 BODY_40_59(51,D,E,T,A,B,C,X( 3),X( 5),X(11),X( 0));
253 BODY_40_59(52,C,D,E,T,A,B,X( 4),X( 6),X(12),X( 1));
254 BODY_40_59(53,B,C,D,E,T,A,X( 5),X( 7),X(13),X( 2));
255 BODY_40_59(54,A,B,C,D,E,T,X( 6),X( 8),X(14),X( 3));
256 BODY_40_59(55,T,A,B,C,D,E,X( 7),X( 9),X(15),X( 4));
257 BODY_40_59(56,E,T,A,B,C,D,X( 8),X(10),X( 0),X( 5));
258 BODY_40_59(57,D,E,T,A,B,C,X( 9),X(11),X( 1),X( 6));
259 BODY_40_59(58,C,D,E,T,A,B,X(10),X(12),X( 2),X( 7));
260 BODY_40_59(59,B,C,D,E,T,A,X(11),X(13),X( 3),X( 8));
261
262 BODY_60_79(60,A,B,C,D,E,T,X(12),X(14),X( 4),X( 9));
263 BODY_60_79(61,T,A,B,C,D,E,X(13),X(15),X( 5),X(10));
264 BODY_60_79(62,E,T,A,B,C,D,X(14),X( 0),X( 6),X(11));
265 BODY_60_79(63,D,E,T,A,B,C,X(15),X( 1),X( 7),X(12));
266 BODY_60_79(64,C,D,E,T,A,B,X( 0),X( 2),X( 8),X(13));
267 BODY_60_79(65,B,C,D,E,T,A,X( 1),X( 3),X( 9),X(14));
268 BODY_60_79(66,A,B,C,D,E,T,X( 2),X( 4),X(10),X(15));
269 BODY_60_79(67,T,A,B,C,D,E,X( 3),X( 5),X(11),X( 0));
270 BODY_60_79(68,E,T,A,B,C,D,X( 4),X( 6),X(12),X( 1));
271 BODY_60_79(69,D,E,T,A,B,C,X( 5),X( 7),X(13),X( 2));
272 BODY_60_79(70,C,D,E,T,A,B,X( 6),X( 8),X(14),X( 3));
273 BODY_60_79(71,B,C,D,E,T,A,X( 7),X( 9),X(15),X( 4));
274 BODY_60_79(72,A,B,C,D,E,T,X( 8),X(10),X( 0),X( 5));
275 BODY_60_79(73,T,A,B,C,D,E,X( 9),X(11),X( 1),X( 6));
276 BODY_60_79(74,E,T,A,B,C,D,X(10),X(12),X( 2),X( 7));
277 BODY_60_79(75,D,E,T,A,B,C,X(11),X(13),X( 3),X( 8));
278 BODY_60_79(76,C,D,E,T,A,B,X(12),X(14),X( 4),X( 9));
279 BODY_60_79(77,B,C,D,E,T,A,X(13),X(15),X( 5),X(10));
280 BODY_60_79(78,A,B,C,D,E,T,X(14),X( 0),X( 6),X(11));
281 BODY_60_79(79,T,A,B,C,D,E,X(15),X( 1),X( 7),X(12));
282
283 state[0]=(state[0]+E)&0xffffffff;
284 state[1]=(state[1]+T)&0xffffffff;
285 state[2]=(state[2]+A)&0xffffffff;
286 state[3]=(state[3]+B)&0xffffffff;
287 state[4]=(state[4]+C)&0xffffffff;
288
289 if (--num <= 0) break;
290
291 A=state[0];
292 B=state[1];
293 C=state[2];
294 D=state[3];
295 E=state[4];
296
297 }
298}
299
300const struct ccdigest_info ccsha1_eay_di = {
301 .output_size = CCSHA1_OUTPUT_SIZE,
302 .state_size = CCSHA1_STATE_SIZE,
303 .block_size = CCSHA1_BLOCK_SIZE,
304 .oid_size = ccoid_sha1_len,
305 .oid = CC_DIGEST_OID_SHA1,
306 .initial_state = ccsha1_initial_state,
307 .compress = sha1_compress,
308 .final = ccdigest_final_64be,
309};
310