1 /* crypto/des/qud_cksm.c */
\r/* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au)
\r * All rights reserved.
\r *
\r * This package is an SSL implementation written
\r * by Eric Young (eay@mincom.oz.au).
\r * The implementation was written so as to conform with Netscapes SSL.
\r *
\r * This library is free for commercial and non-commercial use as long as
\r * the following conditions are aheared to. The following conditions
\r * apply to all code found in this distribution, be it the RC4, RSA,
\r * lhash, DES, etc., code; not just the SSL code. The SSL documentation
\r * included with this distribution is covered by the same copyright terms
\r * except that the holder is Tim Hudson (tjh@mincom.oz.au).
\r *
\r * Copyright remains Eric Young's, and as such any Copyright notices in
\r * the code are not to be removed.
\r * If this package is used in a product, Eric Young should be given attribution
\r * as the author of the parts of the library used.
\r * This can be in the form of a textual message at program startup or
\r * in documentation (online or textual) provided with the package.
\r *
\r * Redistribution and use in source and binary forms, with or without
\r * modification, are permitted provided that the following conditions
\r * are met:
\r * 1. Redistributions of source code must retain the copyright
\r * notice, this list of conditions and the following disclaimer.
\r * 2. Redistributions in binary form must reproduce the above copyright
\r * notice, this list of conditions and the following disclaimer in the
\r * documentation and/or other materials provided with the distribution.
\r * 3. All advertising materials mentioning features or use of this software
\r * must display the following acknowledgement:
\r * "This product includes cryptographic software written by
\r * Eric Young (eay@mincom.oz.au)"
\r * The word 'cryptographic' can be left out if the rouines from the library
\r * being used are not cryptographic related :-).
\r * 4. If you include any Windows specific code (or a derivative thereof) from
\r * the apps directory (application code) you must include an acknowledgement:
\r * "This product includes software written by Tim Hudson (tjh@mincom.oz.au)"
\r *
\r * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
\r * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
\r * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
\r * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
\r * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
\r * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
\r * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
\r * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
\r * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
\r * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
\r * SUCH DAMAGE.
\r *
\r * The licence and distribution terms for any publically available version or
\r * derivative of this code cannot be changed. i.e. this code cannot simply be
\r * copied and put under another distribution licence
\r * [including the GNU Public Licence.]
\r */
\r\r/* From "Message Authentication" R.R. Jueneman, S.M. Matyas, C.H. Meyer
\r * IEEE Communications Magazine Sept 1985 Vol. 23 No. 9 p 29-40
\r * This module in only based on the code in this paper and is
\r * almost definitely not the same as the MIT implementation.
\r */
\r#include "des_locl.h"
\r\r/* bug fix for dos - 7/6/91 - Larry hughes@logos.ucs.indiana.edu */
\r#define Q_B0(a) (((DES_LONG)(a)))
\r#define Q_B1(a) (((DES_LONG)(a))<<8)
\r#define Q_B2(a) (((DES_LONG)(a))<<16)
\r#define Q_B3(a) (((DES_LONG)(a))<<24)
\r\r/* used to scramble things a bit */
\r/* Got the value MIT uses via brute force :-) 2/10/90 eay */
\r#define NOISE ((DES_LONG)83653421L)
\r\rDES_LONG des_quad_cksum(input, output, length, out_count, seed)
\r des_cblock (*input);
\r des_cblock (*output);
\r long length;
\r int out_count;
\r des_cblock (*seed);
\r{
\r DES_LONG z0,z1,t0,t1;
\r int i;
\r long l;
\r#ifdef _CRAY
\r typedef struct {
\r unsigned int a:32;
\r unsigned int b:32;
\r } XXX;
\r#else
\r typedef DES_LONG XXX;
\r#endif
\r unsigned char *cp;
\r XXX *lp;
\r\r if (out_count < 1) out_count=1;
\r lp=(XXX*)output;
\r\r z0=Q_B0((*seed)[0])|Q_B1((*seed)[1])|Q_B2((*seed)[2])|Q_B3((*seed)[3]);
\r z1=Q_B0((*seed)[4])|Q_B1((*seed)[5])|Q_B2((*seed)[6])|Q_B3((*seed)[7]);
\r\r for (i=0; ((i<4)&&(i<out_count)); i++)
\r {
\r cp=(unsigned char *)input;
\r l=length;
\r while (l > 0)
\r {
\r if (l > 1)
\r {
\r t0= (DES_LONG)(*(cp++));
\r t0|=(DES_LONG)Q_B1(*(cp++));
\r l--;
\r }
\r else
\r t0= (DES_LONG)(*(cp++));
\r l--;
\r /* add */
\r t0+=z0;
\r t0&=0xffffffffL;
\r t1=z1;
\r /* square, well sort of square */
\r z0=((((t0*t0)&0xffffffffL)+((t1*t1)&0xffffffffL))
\r &0xffffffffL)%0x7fffffffL;
\r z1=((t0*((t1+NOISE)&0xffffffffL))&0xffffffffL)%0x7fffffffL;
\r }
\r if (lp != NULL)
\r {
\r /* The MIT library assumes that the checksum is
\r * composed of 2*out_count 32 bit ints */
\r#ifdef _CRAY
\r lp->a = z0;
\r lp->b = z1;
\r lp++;
\r#else
\r *lp++ = (XXX)z0;
\r *lp++ = (XXX)z1;
\r#endif
\r }
\r }
\r return(z0);
\r}
\r\r