File:  [DragonFly] / src / lib / libmd / sha1c.c
Revision 1.1: download - view: text, annotated - select for diffs
Tue Jun 17 02:51:31 2003 UTC (11 years, 3 months ago) by dillon
Branches: MAIN
CVS tags: HEAD, FREEBSD_4_FORK
import from FreeBSD RELENG_4 1.2

    1: /* crypto/sha/sha1dgst.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: 
   59: #include <sys/types.h>
   60: 
   61: #include <stdio.h>
   62: #include <string.h>
   63: 
   64: #if 0
   65: #include <machine/ansi.h>	/* we use the __ variants of bit-sized types */
   66: #endif
   67: #include <machine/endian.h>
   68: 
   69: #undef  SHA_0
   70: #define SHA_1
   71: #include "sha.h"
   72: #include "sha_locl.h"
   73: 
   74: /*
   75:  * The assembly-language code is not position-independent, so don't
   76:  * try to use it in a shared library.
   77:  */
   78: #ifdef PIC
   79: #undef SHA1_ASM
   80: #endif
   81: 
   82: char *SHA1_version="SHA1 part of SSLeay 0.9.0b 11-Oct-1998";
   83: 
   84: /* Implemented from SHA-1 document - The Secure Hash Algorithm
   85:  */
   86: 
   87: #define INIT_DATA_h0 (unsigned long)0x67452301L
   88: #define INIT_DATA_h1 (unsigned long)0xefcdab89L
   89: #define INIT_DATA_h2 (unsigned long)0x98badcfeL
   90: #define INIT_DATA_h3 (unsigned long)0x10325476L
   91: #define INIT_DATA_h4 (unsigned long)0xc3d2e1f0L
   92: 
   93: #define K_00_19	0x5a827999L
   94: #define K_20_39 0x6ed9eba1L
   95: #define K_40_59 0x8f1bbcdcL
   96: #define K_60_79 0xca62c1d6L
   97: 
   98: #ifndef NOPROTO
   99: #  ifdef SHA1_ASM
  100:      void sha1_block_x86(SHA_CTX *c, const u_int32_t *p, int num);
  101: #    define sha1_block sha1_block_x86
  102: #  else
  103:      void sha1_block(SHA_CTX *c, const u_int32_t *p, int num);
  104: #  endif
  105: #else
  106: #  ifdef SHA1_ASM
  107:      void sha1_block_x86();
  108: #    define sha1_block sha1_block_x86
  109: #  else
  110:      void sha1_block();
  111: #  endif
  112: #endif
  113: 
  114: 
  115: #if BYTE_ORDER == LITTLE_ENDIAN && defined(SHA1_ASM)
  116: #  define	M_c2nl 		c2l
  117: #  define	M_p_c2nl 	p_c2l
  118: #  define	M_c2nl_p	c2l_p
  119: #  define	M_p_c2nl_p	p_c2l_p
  120: #  define	M_nl2c		l2c
  121: #else
  122: #  define	M_c2nl 		c2nl
  123: #  define	M_p_c2nl	p_c2nl
  124: #  define	M_c2nl_p	c2nl_p
  125: #  define	M_p_c2nl_p	p_c2nl_p
  126: #  define	M_nl2c		nl2c
  127: #endif
  128: 
  129: void SHA1_Init(c)
  130: SHA_CTX *c;
  131: 	{
  132: 	c->h0=INIT_DATA_h0;
  133: 	c->h1=INIT_DATA_h1;
  134: 	c->h2=INIT_DATA_h2;
  135: 	c->h3=INIT_DATA_h3;
  136: 	c->h4=INIT_DATA_h4;
  137: 	c->Nl=0;
  138: 	c->Nh=0;
  139: 	c->num=0;
  140: 	}
  141: 
  142: void
  143: SHA1_Update(c, data, len)
  144: 	SHA_CTX *c;
  145: 	const unsigned char *data;
  146: 	size_t len;
  147: {
  148: 	register u_int32_t *p;
  149: 	int ew,ec,sw,sc;
  150: 	u_int32_t l;
  151: 
  152: 	if (len == 0) return;
  153: 
  154: 	l=(c->Nl+(len<<3))&0xffffffffL;
  155: 	if (l < c->Nl) /* overflow */
  156: 		c->Nh++;
  157: 	c->Nh+=(len>>29);
  158: 	c->Nl=l;
  159: 
  160: 	if (c->num != 0)
  161: 		{
  162: 		p=c->data;
  163: 		sw=c->num>>2;
  164: 		sc=c->num&0x03;
  165: 
  166: 		if ((c->num+len) >= SHA_CBLOCK)
  167: 			{
  168: 			l= p[sw];
  169: 			M_p_c2nl(data,l,sc);
  170: 			p[sw++]=l;
  171: 			for (; sw<SHA_LBLOCK; sw++)
  172: 				{
  173: 				M_c2nl(data,l);
  174: 				p[sw]=l;
  175: 				}
  176: 			len-=(SHA_CBLOCK-c->num);
  177: 
  178: 			sha1_block(c,p,64);
  179: 			c->num=0;
  180: 			/* drop through and do the rest */
  181: 			}
  182: 		else
  183: 			{
  184: 			c->num+=(int)len;
  185: 			if ((sc+len) < 4) /* ugly, add char's to a word */
  186: 				{
  187: 				l= p[sw];
  188: 				M_p_c2nl_p(data,l,sc,len);
  189: 				p[sw]=l;
  190: 				}
  191: 			else
  192: 				{
  193: 				ew=(c->num>>2);
  194: 				ec=(c->num&0x03);
  195: 				l= p[sw];
  196: 				M_p_c2nl(data,l,sc);
  197: 				p[sw++]=l;
  198: 				for (; sw < ew; sw++)
  199: 					{ M_c2nl(data,l); p[sw]=l; }
  200: 				if (ec)
  201: 					{
  202: 					M_c2nl_p(data,l,ec);
  203: 					p[sw]=l;
  204: 					}
  205: 				}
  206: 			return;
  207: 			}
  208: 		}
  209: 	/* We can only do the following code for assember, the reason
  210: 	 * being that the sha1_block 'C' version changes the values
  211: 	 * in the 'data' array.  The assember code avoids this and
  212: 	 * copies it to a local array.  I should be able to do this for
  213: 	 * the C version as well....
  214: 	 */
  215: #if 1
  216: #if BYTE_ORDER == BIG_ENDIAN || defined(SHA1_ASM)
  217: 	if ((((unsigned int)data)%sizeof(u_int32_t)) == 0)
  218: 		{
  219: 		sw=len/SHA_CBLOCK;
  220: 		if (sw)
  221: 			{
  222: 			sw*=SHA_CBLOCK;
  223: 			sha1_block(c,(u_int32_t *)data,sw);
  224: 			data+=sw;
  225: 			len-=sw;
  226: 			}
  227: 		}
  228: #endif
  229: #endif
  230: 	/* we now can process the input data in blocks of SHA_CBLOCK
  231: 	 * chars and save the leftovers to c->data. */
  232: 	p=c->data;
  233: 	while (len >= SHA_CBLOCK)
  234: 		{
  235: #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
  236: 		if (p != (u_int32_t *)data)
  237: 			memcpy(p,data,SHA_CBLOCK);
  238: 		data+=SHA_CBLOCK;
  239: #  if BYTE_ORDER == LITTLE_ENDIAN
  240: #    ifndef SHA1_ASM /* Will not happen */
  241: 		for (sw=(SHA_LBLOCK/4); sw; sw--)
  242: 			{
  243: 			Endian_Reverse32(p[0]);
  244: 			Endian_Reverse32(p[1]);
  245: 			Endian_Reverse32(p[2]);
  246: 			Endian_Reverse32(p[3]);
  247: 			p+=4;
  248: 			}
  249: 		p=c->data;
  250: #    endif
  251: #  endif
  252: #else
  253: 		for (sw=(SHA_BLOCK/4); sw; sw--)
  254: 			{
  255: 			M_c2nl(data,l); *(p++)=l;
  256: 			M_c2nl(data,l); *(p++)=l;
  257: 			M_c2nl(data,l); *(p++)=l;
  258: 			M_c2nl(data,l); *(p++)=l;
  259: 			}
  260: 		p=c->data;
  261: #endif
  262: 		sha1_block(c,p,64);
  263: 		len-=SHA_CBLOCK;
  264: 		}
  265: 	ec=(int)len;
  266: 	c->num=ec;
  267: 	ew=(ec>>2);
  268: 	ec&=0x03;
  269: 
  270: 	for (sw=0; sw < ew; sw++)
  271: 		{ M_c2nl(data,l); p[sw]=l; }
  272: 	M_c2nl_p(data,l,ec);
  273: 	p[sw]=l;
  274: 	}
  275: 
  276: void SHA1_Transform(c,b)
  277: SHA_CTX *c;
  278: unsigned char *b;
  279: 	{
  280: 	u_int32_t p[16];
  281: #if BYTE_ORDER != BIG_ENDIAN
  282: 	u_int32_t *q;
  283: 	int i;
  284: #endif
  285: 
  286: #if BYTE_ORDER == BIG_ENDIAN || BYTE_ORDER == LITTLE_ENDIAN
  287: 	memcpy(p,b,64);
  288: #if BYTE_ORDER == LITTLE_ENDIAN
  289: 	q=p;
  290: 	for (i=(SHA_LBLOCK/4); i; i--)
  291: 		{
  292: 		Endian_Reverse32(q[0]);
  293: 		Endian_Reverse32(q[1]);
  294: 		Endian_Reverse32(q[2]);
  295: 		Endian_Reverse32(q[3]);
  296: 		q+=4;
  297: 		}
  298: #endif
  299: #else
  300: 	q=p;
  301: 	for (i=(SHA_LBLOCK/4); i; i--)
  302: 		{
  303: 		u_int32_t l;
  304: 		c2nl(b,l); *(q++)=l;
  305: 		c2nl(b,l); *(q++)=l;
  306: 		c2nl(b,l); *(q++)=l;
  307: 		c2nl(b,l); *(q++)=l; 
  308: 		} 
  309: #endif
  310: 	sha1_block(c,p,64);
  311: 	}
  312: 
  313: #ifndef SHA1_ASM
  314: 
  315: void 
  316: sha1_block(c, W, num)
  317: 	SHA_CTX *c;
  318: 	const u_int32_t *W;
  319: 	int num;
  320: {
  321: 	register u_int32_t A,B,C,D,E,T;
  322: 	u_int32_t X[16];
  323: 
  324: 	A=c->h0;
  325: 	B=c->h1;
  326: 	C=c->h2;
  327: 	D=c->h3;
  328: 	E=c->h4;
  329: 
  330: 	for (;;)
  331: 		{
  332: 	BODY_00_15( 0,A,B,C,D,E,T,W);
  333: 	BODY_00_15( 1,T,A,B,C,D,E,W);
  334: 	BODY_00_15( 2,E,T,A,B,C,D,W);
  335: 	BODY_00_15( 3,D,E,T,A,B,C,W);
  336: 	BODY_00_15( 4,C,D,E,T,A,B,W);
  337: 	BODY_00_15( 5,B,C,D,E,T,A,W);
  338: 	BODY_00_15( 6,A,B,C,D,E,T,W);
  339: 	BODY_00_15( 7,T,A,B,C,D,E,W);
  340: 	BODY_00_15( 8,E,T,A,B,C,D,W);
  341: 	BODY_00_15( 9,D,E,T,A,B,C,W);
  342: 	BODY_00_15(10,C,D,E,T,A,B,W);
  343: 	BODY_00_15(11,B,C,D,E,T,A,W);
  344: 	BODY_00_15(12,A,B,C,D,E,T,W);
  345: 	BODY_00_15(13,T,A,B,C,D,E,W);
  346: 	BODY_00_15(14,E,T,A,B,C,D,W);
  347: 	BODY_00_15(15,D,E,T,A,B,C,W);
  348: 	BODY_16_19(16,C,D,E,T,A,B,W,W,W,W);
  349: 	BODY_16_19(17,B,C,D,E,T,A,W,W,W,W);
  350: 	BODY_16_19(18,A,B,C,D,E,T,W,W,W,W);
  351: 	BODY_16_19(19,T,A,B,C,D,E,W,W,W,X);
  352: 
  353: 	BODY_20_31(20,E,T,A,B,C,D,W,W,W,X);
  354: 	BODY_20_31(21,D,E,T,A,B,C,W,W,W,X);
  355: 	BODY_20_31(22,C,D,E,T,A,B,W,W,W,X);
  356: 	BODY_20_31(23,B,C,D,E,T,A,W,W,W,X);
  357: 	BODY_20_31(24,A,B,C,D,E,T,W,W,X,X);
  358: 	BODY_20_31(25,T,A,B,C,D,E,W,W,X,X);
  359: 	BODY_20_31(26,E,T,A,B,C,D,W,W,X,X);
  360: 	BODY_20_31(27,D,E,T,A,B,C,W,W,X,X);
  361: 	BODY_20_31(28,C,D,E,T,A,B,W,W,X,X);
  362: 	BODY_20_31(29,B,C,D,E,T,A,W,W,X,X);
  363: 	BODY_20_31(30,A,B,C,D,E,T,W,X,X,X);
  364: 	BODY_20_31(31,T,A,B,C,D,E,W,X,X,X);
  365: 	BODY_32_39(32,E,T,A,B,C,D,X);
  366: 	BODY_32_39(33,D,E,T,A,B,C,X);
  367: 	BODY_32_39(34,C,D,E,T,A,B,X);
  368: 	BODY_32_39(35,B,C,D,E,T,A,X);
  369: 	BODY_32_39(36,A,B,C,D,E,T,X);
  370: 	BODY_32_39(37,T,A,B,C,D,E,X);
  371: 	BODY_32_39(38,E,T,A,B,C,D,X);
  372: 	BODY_32_39(39,D,E,T,A,B,C,X);
  373: 
  374: 	BODY_40_59(40,C,D,E,T,A,B,X);
  375: 	BODY_40_59(41,B,C,D,E,T,A,X);
  376: 	BODY_40_59(42,A,B,C,D,E,T,X);
  377: 	BODY_40_59(43,T,A,B,C,D,E,X);
  378: 	BODY_40_59(44,E,T,A,B,C,D,X);
  379: 	BODY_40_59(45,D,E,T,A,B,C,X);
  380: 	BODY_40_59(46,C,D,E,T,A,B,X);
  381: 	BODY_40_59(47,B,C,D,E,T,A,X);
  382: 	BODY_40_59(48,A,B,C,D,E,T,X);
  383: 	BODY_40_59(49,T,A,B,C,D,E,X);
  384: 	BODY_40_59(50,E,T,A,B,C,D,X);
  385: 	BODY_40_59(51,D,E,T,A,B,C,X);
  386: 	BODY_40_59(52,C,D,E,T,A,B,X);
  387: 	BODY_40_59(53,B,C,D,E,T,A,X);
  388: 	BODY_40_59(54,A,B,C,D,E,T,X);
  389: 	BODY_40_59(55,T,A,B,C,D,E,X);
  390: 	BODY_40_59(56,E,T,A,B,C,D,X);
  391: 	BODY_40_59(57,D,E,T,A,B,C,X);
  392: 	BODY_40_59(58,C,D,E,T,A,B,X);
  393: 	BODY_40_59(59,B,C,D,E,T,A,X);
  394: 
  395: 	BODY_60_79(60,A,B,C,D,E,T,X);
  396: 	BODY_60_79(61,T,A,B,C,D,E,X);
  397: 	BODY_60_79(62,E,T,A,B,C,D,X);
  398: 	BODY_60_79(63,D,E,T,A,B,C,X);
  399: 	BODY_60_79(64,C,D,E,T,A,B,X);
  400: 	BODY_60_79(65,B,C,D,E,T,A,X);
  401: 	BODY_60_79(66,A,B,C,D,E,T,X);
  402: 	BODY_60_79(67,T,A,B,C,D,E,X);
  403: 	BODY_60_79(68,E,T,A,B,C,D,X);
  404: 	BODY_60_79(69,D,E,T,A,B,C,X);
  405: 	BODY_60_79(70,C,D,E,T,A,B,X);
  406: 	BODY_60_79(71,B,C,D,E,T,A,X);
  407: 	BODY_60_79(72,A,B,C,D,E,T,X);
  408: 	BODY_60_79(73,T,A,B,C,D,E,X);
  409: 	BODY_60_79(74,E,T,A,B,C,D,X);
  410: 	BODY_60_79(75,D,E,T,A,B,C,X);
  411: 	BODY_60_79(76,C,D,E,T,A,B,X);
  412: 	BODY_60_79(77,B,C,D,E,T,A,X);
  413: 	BODY_60_79(78,A,B,C,D,E,T,X);
  414: 	BODY_60_79(79,T,A,B,C,D,E,X);
  415: 	
  416: 	c->h0=(c->h0+E)&0xffffffffL; 
  417: 	c->h1=(c->h1+T)&0xffffffffL;
  418: 	c->h2=(c->h2+A)&0xffffffffL;
  419: 	c->h3=(c->h3+B)&0xffffffffL;
  420: 	c->h4=(c->h4+C)&0xffffffffL;
  421: 
  422: 	num-=64;
  423: 	if (num <= 0) break;
  424: 
  425: 	A=c->h0;
  426: 	B=c->h1;
  427: 	C=c->h2;
  428: 	D=c->h3;
  429: 	E=c->h4;
  430: 
  431: 	W+=16;
  432: 		}
  433: 	}
  434: #endif
  435: 
  436: void SHA1_Final(md, c)
  437: unsigned char *md;
  438: SHA_CTX *c;
  439: 	{
  440: 	register int i,j;
  441: 	register u_int32_t l;
  442: 	register u_int32_t *p;
  443: 	static unsigned char end[4]={0x80,0x00,0x00,0x00};
  444: 	unsigned char *cp=end;
  445: 
  446: 	/* c->num should definitly have room for at least one more byte. */
  447: 	p=c->data;
  448: 	j=c->num;
  449: 	i=j>>2;
  450: #ifdef PURIFY
  451: 	if ((j&0x03) == 0) p[i]=0;
  452: #endif
  453: 	l=p[i];
  454: 	M_p_c2nl(cp,l,j&0x03);
  455: 	p[i]=l;
  456: 	i++;
  457: 	/* i is the next 'undefined word' */
  458: 	if (c->num >= SHA_LAST_BLOCK)
  459: 		{
  460: 		for (; i<SHA_LBLOCK; i++)
  461: 			p[i]=0;
  462: 		sha1_block(c,p,64);
  463: 		i=0;
  464: 		}
  465: 	for (; i<(SHA_LBLOCK-2); i++)
  466: 		p[i]=0;
  467: 	p[SHA_LBLOCK-2]=c->Nh;
  468: 	p[SHA_LBLOCK-1]=c->Nl;
  469: #if BYTE_ORDER == LITTLE_ENDIAN && defined(SHA1_ASM)
  470: 	Endian_Reverse32(p[SHA_LBLOCK-2]);
  471: 	Endian_Reverse32(p[SHA_LBLOCK-1]);
  472: #endif
  473: 	sha1_block(c,p,64);
  474: 	cp=md;
  475: 	l=c->h0; nl2c(l,cp);
  476: 	l=c->h1; nl2c(l,cp);
  477: 	l=c->h2; nl2c(l,cp);
  478: 	l=c->h3; nl2c(l,cp);
  479: 	l=c->h4; nl2c(l,cp);
  480: 
  481: 	/* clear stuff, sha1_block may be leaving some stuff on the stack
  482: 	 * but I'm not worried :-) */
  483: 	c->num=0;
  484: /*	memset((char *)&c,0,sizeof(c));*/
  485: 	}
  486: