xref: /onnv-gate/usr/src/common/openssl/crypto/des/qud_cksm.c (revision 0:68f95e015346)
1*0Sstevel@tonic-gate /* crypto/des/qud_cksm.c */
2*0Sstevel@tonic-gate /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3*0Sstevel@tonic-gate  * All rights reserved.
4*0Sstevel@tonic-gate  *
5*0Sstevel@tonic-gate  * This package is an SSL implementation written
6*0Sstevel@tonic-gate  * by Eric Young (eay@cryptsoft.com).
7*0Sstevel@tonic-gate  * The implementation was written so as to conform with Netscapes SSL.
8*0Sstevel@tonic-gate  *
9*0Sstevel@tonic-gate  * This library is free for commercial and non-commercial use as long as
10*0Sstevel@tonic-gate  * the following conditions are aheared to.  The following conditions
11*0Sstevel@tonic-gate  * apply to all code found in this distribution, be it the RC4, RSA,
12*0Sstevel@tonic-gate  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
13*0Sstevel@tonic-gate  * included with this distribution is covered by the same copyright terms
14*0Sstevel@tonic-gate  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
15*0Sstevel@tonic-gate  *
16*0Sstevel@tonic-gate  * Copyright remains Eric Young's, and as such any Copyright notices in
17*0Sstevel@tonic-gate  * the code are not to be removed.
18*0Sstevel@tonic-gate  * If this package is used in a product, Eric Young should be given attribution
19*0Sstevel@tonic-gate  * as the author of the parts of the library used.
20*0Sstevel@tonic-gate  * This can be in the form of a textual message at program startup or
21*0Sstevel@tonic-gate  * in documentation (online or textual) provided with the package.
22*0Sstevel@tonic-gate  *
23*0Sstevel@tonic-gate  * Redistribution and use in source and binary forms, with or without
24*0Sstevel@tonic-gate  * modification, are permitted provided that the following conditions
25*0Sstevel@tonic-gate  * are met:
26*0Sstevel@tonic-gate  * 1. Redistributions of source code must retain the copyright
27*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer.
28*0Sstevel@tonic-gate  * 2. Redistributions in binary form must reproduce the above copyright
29*0Sstevel@tonic-gate  *    notice, this list of conditions and the following disclaimer in the
30*0Sstevel@tonic-gate  *    documentation and/or other materials provided with the distribution.
31*0Sstevel@tonic-gate  * 3. All advertising materials mentioning features or use of this software
32*0Sstevel@tonic-gate  *    must display the following acknowledgement:
33*0Sstevel@tonic-gate  *    "This product includes cryptographic software written by
34*0Sstevel@tonic-gate  *     Eric Young (eay@cryptsoft.com)"
35*0Sstevel@tonic-gate  *    The word 'cryptographic' can be left out if the rouines from the library
36*0Sstevel@tonic-gate  *    being used are not cryptographic related :-).
37*0Sstevel@tonic-gate  * 4. If you include any Windows specific code (or a derivative thereof) from
38*0Sstevel@tonic-gate  *    the apps directory (application code) you must include an acknowledgement:
39*0Sstevel@tonic-gate  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40*0Sstevel@tonic-gate  *
41*0Sstevel@tonic-gate  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
42*0Sstevel@tonic-gate  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
43*0Sstevel@tonic-gate  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44*0Sstevel@tonic-gate  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
45*0Sstevel@tonic-gate  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
46*0Sstevel@tonic-gate  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
47*0Sstevel@tonic-gate  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
48*0Sstevel@tonic-gate  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49*0Sstevel@tonic-gate  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50*0Sstevel@tonic-gate  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51*0Sstevel@tonic-gate  * SUCH DAMAGE.
52*0Sstevel@tonic-gate  *
53*0Sstevel@tonic-gate  * The licence and distribution terms for any publically available version or
54*0Sstevel@tonic-gate  * derivative of this code cannot be changed.  i.e. this code cannot simply be
55*0Sstevel@tonic-gate  * copied and put under another distribution licence
56*0Sstevel@tonic-gate  * [including the GNU Public Licence.]
57*0Sstevel@tonic-gate  */
58*0Sstevel@tonic-gate 
59*0Sstevel@tonic-gate /* From "Message Authentication"  R.R. Jueneman, S.M. Matyas, C.H. Meyer
60*0Sstevel@tonic-gate  * IEEE Communications Magazine Sept 1985 Vol. 23 No. 9 p 29-40
61*0Sstevel@tonic-gate  * This module in only based on the code in this paper and is
62*0Sstevel@tonic-gate  * almost definitely not the same as the MIT implementation.
63*0Sstevel@tonic-gate  */
64*0Sstevel@tonic-gate #include "des_locl.h"
65*0Sstevel@tonic-gate 
66*0Sstevel@tonic-gate /* bug fix for dos - 7/6/91 - Larry hughes@logos.ucs.indiana.edu */
67*0Sstevel@tonic-gate #define Q_B0(a)	(((DES_LONG)(a)))
68*0Sstevel@tonic-gate #define Q_B1(a)	(((DES_LONG)(a))<<8)
69*0Sstevel@tonic-gate #define Q_B2(a)	(((DES_LONG)(a))<<16)
70*0Sstevel@tonic-gate #define Q_B3(a)	(((DES_LONG)(a))<<24)
71*0Sstevel@tonic-gate 
72*0Sstevel@tonic-gate /* used to scramble things a bit */
73*0Sstevel@tonic-gate /* Got the value MIT uses via brute force :-) 2/10/90 eay */
74*0Sstevel@tonic-gate #define NOISE	((DES_LONG)83653421L)
75*0Sstevel@tonic-gate 
DES_quad_cksum(const unsigned char * input,DES_cblock output[],long length,int out_count,DES_cblock * seed)76*0Sstevel@tonic-gate DES_LONG DES_quad_cksum(const unsigned char *input, DES_cblock output[],
77*0Sstevel@tonic-gate 	     long length, int out_count, DES_cblock *seed)
78*0Sstevel@tonic-gate 	{
79*0Sstevel@tonic-gate 	DES_LONG z0,z1,t0,t1;
80*0Sstevel@tonic-gate 	int i;
81*0Sstevel@tonic-gate 	long l;
82*0Sstevel@tonic-gate 	const unsigned char *cp;
83*0Sstevel@tonic-gate #ifdef _CRAY
84*0Sstevel@tonic-gate 	struct lp_st { int a:32; int b:32; } *lp;
85*0Sstevel@tonic-gate #else
86*0Sstevel@tonic-gate 	DES_LONG *lp;
87*0Sstevel@tonic-gate #endif
88*0Sstevel@tonic-gate 
89*0Sstevel@tonic-gate 	if (out_count < 1) out_count=1;
90*0Sstevel@tonic-gate #ifdef _CRAY
91*0Sstevel@tonic-gate 	lp = (struct lp_st *) &(output[0])[0];
92*0Sstevel@tonic-gate #else
93*0Sstevel@tonic-gate 	lp = (DES_LONG *) &(output[0])[0];
94*0Sstevel@tonic-gate #endif
95*0Sstevel@tonic-gate 
96*0Sstevel@tonic-gate 	z0=Q_B0((*seed)[0])|Q_B1((*seed)[1])|Q_B2((*seed)[2])|Q_B3((*seed)[3]);
97*0Sstevel@tonic-gate 	z1=Q_B0((*seed)[4])|Q_B1((*seed)[5])|Q_B2((*seed)[6])|Q_B3((*seed)[7]);
98*0Sstevel@tonic-gate 
99*0Sstevel@tonic-gate 	for (i=0; ((i<4)&&(i<out_count)); i++)
100*0Sstevel@tonic-gate 		{
101*0Sstevel@tonic-gate 		cp=input;
102*0Sstevel@tonic-gate 		l=length;
103*0Sstevel@tonic-gate 		while (l > 0)
104*0Sstevel@tonic-gate 			{
105*0Sstevel@tonic-gate 			if (l > 1)
106*0Sstevel@tonic-gate 				{
107*0Sstevel@tonic-gate 				t0= (DES_LONG)(*(cp++));
108*0Sstevel@tonic-gate 				t0|=(DES_LONG)Q_B1(*(cp++));
109*0Sstevel@tonic-gate 				l--;
110*0Sstevel@tonic-gate 				}
111*0Sstevel@tonic-gate 			else
112*0Sstevel@tonic-gate 				t0= (DES_LONG)(*(cp++));
113*0Sstevel@tonic-gate 			l--;
114*0Sstevel@tonic-gate 			/* add */
115*0Sstevel@tonic-gate 			t0+=z0;
116*0Sstevel@tonic-gate 			t0&=0xffffffffL;
117*0Sstevel@tonic-gate 			t1=z1;
118*0Sstevel@tonic-gate 			/* square, well sort of square */
119*0Sstevel@tonic-gate 			z0=((((t0*t0)&0xffffffffL)+((t1*t1)&0xffffffffL))
120*0Sstevel@tonic-gate 				&0xffffffffL)%0x7fffffffL;
121*0Sstevel@tonic-gate 			z1=((t0*((t1+NOISE)&0xffffffffL))&0xffffffffL)%0x7fffffffL;
122*0Sstevel@tonic-gate 			}
123*0Sstevel@tonic-gate 		if (lp != NULL)
124*0Sstevel@tonic-gate 			{
125*0Sstevel@tonic-gate 			/* The MIT library assumes that the checksum is
126*0Sstevel@tonic-gate 			 * composed of 2*out_count 32 bit ints */
127*0Sstevel@tonic-gate #ifdef _CRAY
128*0Sstevel@tonic-gate 			(*lp).a = z0;
129*0Sstevel@tonic-gate 			(*lp).b = z1;
130*0Sstevel@tonic-gate 			lp++;
131*0Sstevel@tonic-gate #else
132*0Sstevel@tonic-gate 			*lp++ = z0;
133*0Sstevel@tonic-gate 			*lp++ = z1;
134*0Sstevel@tonic-gate #endif
135*0Sstevel@tonic-gate 			}
136*0Sstevel@tonic-gate 		}
137*0Sstevel@tonic-gate 	return(z0);
138*0Sstevel@tonic-gate 	}
139*0Sstevel@tonic-gate 
140