xref: /freebsd/lib/libmd/sha0c.c (revision 7f3dea244c40159a41ab22da77a434d7c5b5e85a)
1 /* crypto/sha/sha_dgst.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3  * All rights reserved.
4  *
5  * This package is an SSL implementation written
6  * by Eric Young (eay@cryptsoft.com).
7  * The implementation was written so as to conform with Netscapes SSL.
8  *
9  * This library is free for commercial and non-commercial use as long as
10  * the following conditions are aheared to.  The following conditions
11  * apply to all code found in this distribution, be it the RC4, RSA,
12  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
13  * included with this distribution is covered by the same copyright terms
14  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15  *
16  * Copyright remains Eric Young's, and as such any Copyright notices in
17  * the code are not to be removed.
18  * If this package is used in a product, Eric Young should be given attribution
19  * as the author of the parts of the library used.
20  * This can be in the form of a textual message at program startup or
21  * in documentation (online or textual) provided with the package.
22  *
23  * Redistribution and use in source and binary forms, with or without
24  * modification, are permitted provided that the following conditions
25  * are met:
26  * 1. Redistributions of source code must retain the copyright
27  *    notice, this list of conditions and the following disclaimer.
28  * 2. Redistributions in binary form must reproduce the above copyright
29  *    notice, this list of conditions and the following disclaimer in the
30  *    documentation and/or other materials provided with the distribution.
31  * 3. All advertising materials mentioning features or use of this software
32  *    must display the following acknowledgement:
33  *    "This product includes cryptographic software written by
34  *     Eric Young (eay@cryptsoft.com)"
35  *    The word 'cryptographic' can be left out if the rouines from the library
36  *    being used are not cryptographic related :-).
37  * 4. If you include any Windows specific code (or a derivative thereof) from
38  *    the apps directory (application code) you must include an acknowledgement:
39  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40  *
41  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51  * SUCH DAMAGE.
52  *
53  * The licence and distribution terms for any publically available version or
54  * derivative of this code cannot be changed.  i.e. this code cannot simply be
55  * copied and put under another distribution licence
56  * [including the GNU Public Licence.]
57  *
58  * $FreeBSD$
59  */
60 
61 #include <sys/types.h>
62 
63 #include <stdio.h>
64 #include <string.h>
65 
66 #if 0
67 #include <machine/ansi.h>	/* we use the __ variants of bit-sized types */
68 #endif
69 #include <machine/endian.h>
70 
71 #define  SHA_0
72 #undef SHA_1
73 #include "sha.h"
74 #include "sha_locl.h"
75 
76 char *SHA_version="SHA part of SSLeay 0.9.0b 11-Oct-1998";
77 
78 /* Implemented from SHA-0 document - The Secure Hash Algorithm
79  */
80 
81 #define INIT_DATA_h0 (unsigned long)0x67452301L
82 #define INIT_DATA_h1 (unsigned long)0xefcdab89L
83 #define INIT_DATA_h2 (unsigned long)0x98badcfeL
84 #define INIT_DATA_h3 (unsigned long)0x10325476L
85 #define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L
86 
87 #define K_00_19	0x5a827999L
88 #define K_20_39 0x6ed9eba1L
89 #define K_40_59 0x8f1bbcdcL
90 #define K_60_79 0xca62c1d6L
91 
92 #ifndef NOPROTO
93    void sha_block(SHA_CTX *c, const u_int32_t *p, int num);
94 #else
95    void sha_block();
96 #endif
97 
98 #define	M_c2nl 		c2nl
99 #define	M_p_c2nl	p_c2nl
100 #define	M_c2nl_p	c2nl_p
101 #define	M_p_c2nl_p	p_c2nl_p
102 #define	M_nl2c		nl2c
103 
104 void SHA_Init(c)
105 SHA_CTX *c;
106 	{
107 	c->h0=INIT_DATA_h0;
108 	c->h1=INIT_DATA_h1;
109 	c->h2=INIT_DATA_h2;
110 	c->h3=INIT_DATA_h3;
111 	c->h4=INIT_DATA_h4;
112 	c->Nl=0;
113 	c->Nh=0;
114 	c->num=0;
115 	}
116 
117 void SHA_Update(c, data, len)
118 SHA_CTX *c;
119 const unsigned char *data;
120 size_t len;
121 	{
122 	register u_int32_t *p;
123 	int ew,ec,sw,sc;
124 	u_int32_t l;
125 
126 	if (len == 0) return;
127 
128 	l=(c->Nl+(len<<3))&0xffffffffL;
129 	if (l < c->Nl) /* overflow */
130 		c->Nh++;
131 	c->Nh+=(len>>29);
132 	c->Nl=l;
133 
134 	if (c->num != 0)
135 		{
136 		p=c->data;
137 		sw=c->num>>2;
138 		sc=c->num&0x03;
139 
140 		if ((c->num+len) >= SHA_CBLOCK)
141 			{
142 			l= p[sw];
143 			M_p_c2nl(data,l,sc);
144 			p[sw++]=l;
145 			for (; sw<SHA_LBLOCK; sw++)
146 				{
147 				M_c2nl(data,l);
148 				p[sw]=l;
149 				}
150 			len-=(SHA_CBLOCK-c->num);
151 
152 			sha_block(c,p,64);
153 			c->num=0;
154 			/* drop through and do the rest */
155 			}
156 		else
157 			{
158 			c->num+=(int)len;
159 			if ((sc+len) < 4) /* ugly, add char's to a word */
160 				{
161 				l= p[sw];
162 				M_p_c2nl_p(data,l,sc,len);
163 				p[sw]=l;
164 				}
165 			else
166 				{
167 				ew=(c->num>>2);
168 				ec=(c->num&0x03);
169 				l= p[sw];
170 				M_p_c2nl(data,l,sc);
171 				p[sw++]=l;
172 				for (; sw < ew; sw++)
173 					{ M_c2nl(data,l); p[sw]=l; }
174 				if (ec)
175 					{
176 					M_c2nl_p(data,l,ec);
177 					p[sw]=l;
178 					}
179 				}
180 			return;
181 			}
182 		}
183 	/* We can only do the following code for assember, the reason
184 	 * being that the sha_block 'C' version changes the values
185 	 * in the 'data' array.  The assember code avoids this and
186 	 * copies it to a local array.  I should be able to do this for
187 	 * the C version as well....
188 	 */
189 #if 1
190 #if BYTE_ORDER == BIG_ENDIAN || defined(SHA_ASM)
191 	if ((((unsigned int)data)%sizeof(u_int32_t)) == 0)
192 		{
193 		sw=len/SHA_CBLOCK;
194 		if (sw)
195 			{
196 			sw*=SHA_CBLOCK;
197 			sha_block(c,(u_int32_t *)data,sw);
198 			data+=sw;
199 			len-=sw;
200 			}
201 		}
202 #endif
203 #endif
204 	/* we now can process the input data in blocks of SHA_CBLOCK
205 	 * chars and save the leftovers to c->data. */
206 	p=c->data;
207 	while (len >= SHA_CBLOCK)
208 		{
209 #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
210 		if (p != (u_int32_t *)data)
211 			memcpy(p,data,SHA_CBLOCK);
212 		data+=SHA_CBLOCK;
213 #  if BYTE_ORDER == LITTLE_ENDIAN
214 #    ifndef SHA_ASM /* Will not happen */
215 		for (sw=(SHA_LBLOCK/4); sw; sw--)
216 			{
217 			Endian_Reverse32(p[0]);
218 			Endian_Reverse32(p[1]);
219 			Endian_Reverse32(p[2]);
220 			Endian_Reverse32(p[3]);
221 			p+=4;
222 			}
223 		p=c->data;
224 #    endif
225 #  endif
226 #else
227 		for (sw=(SHA_BLOCK/4); sw; sw--)
228 			{
229 			M_c2nl(data,l); *(p++)=l;
230 			M_c2nl(data,l); *(p++)=l;
231 			M_c2nl(data,l); *(p++)=l;
232 			M_c2nl(data,l); *(p++)=l;
233 			}
234 		p=c->data;
235 #endif
236 		sha_block(c,p,64);
237 		len-=SHA_CBLOCK;
238 		}
239 	ec=(int)len;
240 	c->num=ec;
241 	ew=(ec>>2);
242 	ec&=0x03;
243 
244 	for (sw=0; sw < ew; sw++)
245 		{ M_c2nl(data,l); p[sw]=l; }
246 	M_c2nl_p(data,l,ec);
247 	p[sw]=l;
248 	}
249 
250 void SHA_Transform(c,b)
251 SHA_CTX *c;
252 unsigned char *b;
253 	{
254 	u_int32_t p[16];
255 #if BYTE_ORDER == LITTLE_ENDIAN
256 	u_int32_t *q;
257 	int i;
258 #endif
259 
260 #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
261 	memcpy(p,b,64);
262 #if BYTE_ORDER == LITTLE_ENDIAN
263 	q=p;
264 	for (i=(SHA_LBLOCK/4); i; i--)
265 		{
266 		Endian_Reverse32(q[0]);
267 		Endian_Reverse32(q[1]);
268 		Endian_Reverse32(q[2]);
269 		Endian_Reverse32(q[3]);
270 		q+=4;
271 		}
272 #endif
273 #else
274 	q=p;
275 	for (i=(SHA_LBLOCK/4); i; i--)
276 		{
277 		u_int32_t l;
278 		c2nl(b,l); *(q++)=l;
279 		c2nl(b,l); *(q++)=l;
280 		c2nl(b,l); *(q++)=l;
281 		c2nl(b,l); *(q++)=l;
282 		}
283 #endif
284 	sha_block(c,p,64);
285 	}
286 
287 void sha_block(c, W, num)
288 SHA_CTX *c;
289 const u_int32_t *W;
290 int num;
291 	{
292 	register u_int32_t A,B,C,D,E,T;
293 	u_int32_t X[16];
294 
295 	A=c->h0;
296 	B=c->h1;
297 	C=c->h2;
298 	D=c->h3;
299 	E=c->h4;
300 
301 	for (;;)
302 		{
303 	BODY_00_15( 0,A,B,C,D,E,T,W);
304 	BODY_00_15( 1,T,A,B,C,D,E,W);
305 	BODY_00_15( 2,E,T,A,B,C,D,W);
306 	BODY_00_15( 3,D,E,T,A,B,C,W);
307 	BODY_00_15( 4,C,D,E,T,A,B,W);
308 	BODY_00_15( 5,B,C,D,E,T,A,W);
309 	BODY_00_15( 6,A,B,C,D,E,T,W);
310 	BODY_00_15( 7,T,A,B,C,D,E,W);
311 	BODY_00_15( 8,E,T,A,B,C,D,W);
312 	BODY_00_15( 9,D,E,T,A,B,C,W);
313 	BODY_00_15(10,C,D,E,T,A,B,W);
314 	BODY_00_15(11,B,C,D,E,T,A,W);
315 	BODY_00_15(12,A,B,C,D,E,T,W);
316 	BODY_00_15(13,T,A,B,C,D,E,W);
317 	BODY_00_15(14,E,T,A,B,C,D,W);
318 	BODY_00_15(15,D,E,T,A,B,C,W);
319 	BODY_16_19(16,C,D,E,T,A,B,W,W,W,W);
320 	BODY_16_19(17,B,C,D,E,T,A,W,W,W,W);
321 	BODY_16_19(18,A,B,C,D,E,T,W,W,W,W);
322 	BODY_16_19(19,T,A,B,C,D,E,W,W,W,X);
323 
324 	BODY_20_31(20,E,T,A,B,C,D,W,W,W,X);
325 	BODY_20_31(21,D,E,T,A,B,C,W,W,W,X);
326 	BODY_20_31(22,C,D,E,T,A,B,W,W,W,X);
327 	BODY_20_31(23,B,C,D,E,T,A,W,W,W,X);
328 	BODY_20_31(24,A,B,C,D,E,T,W,W,X,X);
329 	BODY_20_31(25,T,A,B,C,D,E,W,W,X,X);
330 	BODY_20_31(26,E,T,A,B,C,D,W,W,X,X);
331 	BODY_20_31(27,D,E,T,A,B,C,W,W,X,X);
332 	BODY_20_31(28,C,D,E,T,A,B,W,W,X,X);
333 	BODY_20_31(29,B,C,D,E,T,A,W,W,X,X);
334 	BODY_20_31(30,A,B,C,D,E,T,W,X,X,X);
335 	BODY_20_31(31,T,A,B,C,D,E,W,X,X,X);
336 	BODY_32_39(32,E,T,A,B,C,D,X);
337 	BODY_32_39(33,D,E,T,A,B,C,X);
338 	BODY_32_39(34,C,D,E,T,A,B,X);
339 	BODY_32_39(35,B,C,D,E,T,A,X);
340 	BODY_32_39(36,A,B,C,D,E,T,X);
341 	BODY_32_39(37,T,A,B,C,D,E,X);
342 	BODY_32_39(38,E,T,A,B,C,D,X);
343 	BODY_32_39(39,D,E,T,A,B,C,X);
344 
345 	BODY_40_59(40,C,D,E,T,A,B,X);
346 	BODY_40_59(41,B,C,D,E,T,A,X);
347 	BODY_40_59(42,A,B,C,D,E,T,X);
348 	BODY_40_59(43,T,A,B,C,D,E,X);
349 	BODY_40_59(44,E,T,A,B,C,D,X);
350 	BODY_40_59(45,D,E,T,A,B,C,X);
351 	BODY_40_59(46,C,D,E,T,A,B,X);
352 	BODY_40_59(47,B,C,D,E,T,A,X);
353 	BODY_40_59(48,A,B,C,D,E,T,X);
354 	BODY_40_59(49,T,A,B,C,D,E,X);
355 	BODY_40_59(50,E,T,A,B,C,D,X);
356 	BODY_40_59(51,D,E,T,A,B,C,X);
357 	BODY_40_59(52,C,D,E,T,A,B,X);
358 	BODY_40_59(53,B,C,D,E,T,A,X);
359 	BODY_40_59(54,A,B,C,D,E,T,X);
360 	BODY_40_59(55,T,A,B,C,D,E,X);
361 	BODY_40_59(56,E,T,A,B,C,D,X);
362 	BODY_40_59(57,D,E,T,A,B,C,X);
363 	BODY_40_59(58,C,D,E,T,A,B,X);
364 	BODY_40_59(59,B,C,D,E,T,A,X);
365 
366 	BODY_60_79(60,A,B,C,D,E,T,X);
367 	BODY_60_79(61,T,A,B,C,D,E,X);
368 	BODY_60_79(62,E,T,A,B,C,D,X);
369 	BODY_60_79(63,D,E,T,A,B,C,X);
370 	BODY_60_79(64,C,D,E,T,A,B,X);
371 	BODY_60_79(65,B,C,D,E,T,A,X);
372 	BODY_60_79(66,A,B,C,D,E,T,X);
373 	BODY_60_79(67,T,A,B,C,D,E,X);
374 	BODY_60_79(68,E,T,A,B,C,D,X);
375 	BODY_60_79(69,D,E,T,A,B,C,X);
376 	BODY_60_79(70,C,D,E,T,A,B,X);
377 	BODY_60_79(71,B,C,D,E,T,A,X);
378 	BODY_60_79(72,A,B,C,D,E,T,X);
379 	BODY_60_79(73,T,A,B,C,D,E,X);
380 	BODY_60_79(74,E,T,A,B,C,D,X);
381 	BODY_60_79(75,D,E,T,A,B,C,X);
382 	BODY_60_79(76,C,D,E,T,A,B,X);
383 	BODY_60_79(77,B,C,D,E,T,A,X);
384 	BODY_60_79(78,A,B,C,D,E,T,X);
385 	BODY_60_79(79,T,A,B,C,D,E,X);
386 
387 	c->h0=(c->h0+E)&0xffffffffL;
388 	c->h1=(c->h1+T)&0xffffffffL;
389 	c->h2=(c->h2+A)&0xffffffffL;
390 	c->h3=(c->h3+B)&0xffffffffL;
391 	c->h4=(c->h4+C)&0xffffffffL;
392 
393 	num-=64;
394 	if (num <= 0) break;
395 
396 	A=c->h0;
397 	B=c->h1;
398 	C=c->h2;
399 	D=c->h3;
400 	E=c->h4;
401 
402 	W+=16;
403 		}
404 	}
405 
406 void SHA_Final(md, c)
407 unsigned char *md;
408 SHA_CTX *c;
409 	{
410 	register int i,j;
411 	register u_int32_t l;
412 	register u_int32_t *p;
413 	static unsigned char end[4]={0x80,0x00,0x00,0x00};
414 	unsigned char *cp=end;
415 
416 	/* c->num should definitly have room for at least one more byte. */
417 	p=c->data;
418 	j=c->num;
419 	i=j>>2;
420 #ifdef PURIFY
421 	if ((j&0x03) == 0) p[i]=0;
422 #endif
423 	l=p[i];
424 	M_p_c2nl(cp,l,j&0x03);
425 	p[i]=l;
426 	i++;
427 	/* i is the next 'undefined word' */
428 	if (c->num >= SHA_LAST_BLOCK)
429 		{
430 		for (; i<SHA_LBLOCK; i++)
431 			p[i]=0;
432 		sha_block(c,p,64);
433 		i=0;
434 		}
435 	for (; i<(SHA_LBLOCK-2); i++)
436 		p[i]=0;
437 	p[SHA_LBLOCK-2]=c->Nh;
438 	p[SHA_LBLOCK-1]=c->Nl;
439 	sha_block(c,p,64);
440 	cp=md;
441 	l=c->h0; nl2c(l,cp);
442 	l=c->h1; nl2c(l,cp);
443 	l=c->h2; nl2c(l,cp);
444 	l=c->h3; nl2c(l,cp);
445 	l=c->h4; nl2c(l,cp);
446 
447 	/* clear stuff, sha_block may be leaving some stuff on the stack
448 	 * but I'm not worried :-) */
449 	c->num=0;
450 /*	memset((char *)&c,0,sizeof(c));*/
451 	}
452 
453