155714Skris/* crypto/des/qud_cksm.c */ 255714Skris/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 355714Skris * All rights reserved. 455714Skris * 555714Skris * This package is an SSL implementation written 655714Skris * by Eric Young (eay@cryptsoft.com). 755714Skris * The implementation was written so as to conform with Netscapes SSL. 8296341Sdelphij * 955714Skris * This library is free for commercial and non-commercial use as long as 1055714Skris * the following conditions are aheared to. The following conditions 1155714Skris * apply to all code found in this distribution, be it the RC4, RSA, 1255714Skris * lhash, DES, etc., code; not just the SSL code. The SSL documentation 1355714Skris * included with this distribution is covered by the same copyright terms 1455714Skris * except that the holder is Tim Hudson (tjh@cryptsoft.com). 15296341Sdelphij * 1655714Skris * Copyright remains Eric Young's, and as such any Copyright notices in 1755714Skris * the code are not to be removed. 1855714Skris * If this package is used in a product, Eric Young should be given attribution 1955714Skris * as the author of the parts of the library used. 2055714Skris * This can be in the form of a textual message at program startup or 2155714Skris * in documentation (online or textual) provided with the package. 22296341Sdelphij * 2355714Skris * Redistribution and use in source and binary forms, with or without 2455714Skris * modification, are permitted provided that the following conditions 2555714Skris * are met: 2655714Skris * 1. Redistributions of source code must retain the copyright 2755714Skris * notice, this list of conditions and the following disclaimer. 2855714Skris * 2. Redistributions in binary form must reproduce the above copyright 2955714Skris * notice, this list of conditions and the following disclaimer in the 3055714Skris * documentation and/or other materials provided with the distribution. 3155714Skris * 3. All advertising materials mentioning features or use of this software 3255714Skris * must display the following acknowledgement: 3355714Skris * "This product includes cryptographic software written by 3455714Skris * Eric Young (eay@cryptsoft.com)" 3555714Skris * The word 'cryptographic' can be left out if the rouines from the library 3655714Skris * being used are not cryptographic related :-). 37296341Sdelphij * 4. If you include any Windows specific code (or a derivative thereof) from 3855714Skris * the apps directory (application code) you must include an acknowledgement: 3955714Skris * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 40296341Sdelphij * 4155714Skris * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 4255714Skris * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 4355714Skris * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 4455714Skris * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 4555714Skris * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 4655714Skris * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 4755714Skris * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 4855714Skris * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 4955714Skris * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 5055714Skris * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 5155714Skris * SUCH DAMAGE. 52296341Sdelphij * 5355714Skris * The licence and distribution terms for any publically available version or 5455714Skris * derivative of this code cannot be changed. i.e. this code cannot simply be 5555714Skris * copied and put under another distribution licence 5655714Skris * [including the GNU Public Licence.] 5755714Skris */ 5855714Skris 59296341Sdelphij/* 60296341Sdelphij * From "Message Authentication" R.R. Jueneman, S.M. Matyas, C.H. Meyer IEEE 61296341Sdelphij * Communications Magazine Sept 1985 Vol. 23 No. 9 p 29-40 This module in 62296341Sdelphij * only based on the code in this paper and is almost definitely not the same 63296341Sdelphij * as the MIT implementation. 6455714Skris */ 6555714Skris#include "des_locl.h" 6655714Skris 6755714Skris/* bug fix for dos - 7/6/91 - Larry hughes@logos.ucs.indiana.edu */ 68296341Sdelphij#define Q_B0(a) (((DES_LONG)(a))) 69296341Sdelphij#define Q_B1(a) (((DES_LONG)(a))<<8) 70296341Sdelphij#define Q_B2(a) (((DES_LONG)(a))<<16) 71296341Sdelphij#define Q_B3(a) (((DES_LONG)(a))<<24) 7255714Skris 7355714Skris/* used to scramble things a bit */ 7455714Skris/* Got the value MIT uses via brute force :-) 2/10/90 eay */ 75296341Sdelphij#define NOISE ((DES_LONG)83653421L) 7655714Skris 77109998SmarkmDES_LONG DES_quad_cksum(const unsigned char *input, DES_cblock output[], 78296341Sdelphij long length, int out_count, DES_cblock *seed) 79296341Sdelphij{ 80296341Sdelphij DES_LONG z0, z1, t0, t1; 81296341Sdelphij int i; 82296341Sdelphij long l; 83296341Sdelphij const unsigned char *cp; 8459191Skris#ifdef _CRAY 85296341Sdelphij struct lp_st { 86296341Sdelphij int a:32; 87296341Sdelphij int b:32; 88296341Sdelphij } *lp; 8959191Skris#else 90296341Sdelphij DES_LONG *lp; 9159191Skris#endif 9255714Skris 93296341Sdelphij if (out_count < 1) 94296341Sdelphij out_count = 1; 9568651Skris#ifdef _CRAY 96296341Sdelphij lp = (struct lp_st *)&(output[0])[0]; 9768651Skris#else 98296341Sdelphij lp = (DES_LONG *)&(output[0])[0]; 9968651Skris#endif 10055714Skris 101296341Sdelphij z0 = Q_B0((*seed)[0]) | Q_B1((*seed)[1]) | Q_B2((*seed)[2]) | 102296341Sdelphij Q_B3((*seed)[3]); 103296341Sdelphij z1 = Q_B0((*seed)[4]) | Q_B1((*seed)[5]) | Q_B2((*seed)[6]) | 104296341Sdelphij Q_B3((*seed)[7]); 10555714Skris 106296341Sdelphij for (i = 0; ((i < 4) && (i < out_count)); i++) { 107296341Sdelphij cp = input; 108296341Sdelphij l = length; 109296341Sdelphij while (l > 0) { 110296341Sdelphij if (l > 1) { 111296341Sdelphij t0 = (DES_LONG)(*(cp++)); 112296341Sdelphij t0 |= (DES_LONG)Q_B1(*(cp++)); 113296341Sdelphij l--; 114296341Sdelphij } else 115296341Sdelphij t0 = (DES_LONG)(*(cp++)); 116296341Sdelphij l--; 117296341Sdelphij /* add */ 118296341Sdelphij t0 += z0; 119296341Sdelphij t0 &= 0xffffffffL; 120296341Sdelphij t1 = z1; 121296341Sdelphij /* square, well sort of square */ 122296341Sdelphij z0 = ((((t0 * t0) & 0xffffffffL) + ((t1 * t1) & 0xffffffffL)) 123296341Sdelphij & 0xffffffffL) % 0x7fffffffL; 124296341Sdelphij z1 = ((t0 * ((t1 + NOISE) & 0xffffffffL)) & 0xffffffffL) % 125296341Sdelphij 0x7fffffffL; 126296341Sdelphij } 127296341Sdelphij if (lp != NULL) { 128296341Sdelphij /* 129296341Sdelphij * The MIT library assumes that the checksum is composed of 130296341Sdelphij * 2*out_count 32 bit ints 131296341Sdelphij */ 13268651Skris#ifdef _CRAY 133296341Sdelphij (*lp).a = z0; 134296341Sdelphij (*lp).b = z1; 135296341Sdelphij lp++; 13668651Skris#else 137296341Sdelphij *lp++ = z0; 138296341Sdelphij *lp++ = z1; 13968651Skris#endif 140296341Sdelphij } 141296341Sdelphij } 142296341Sdelphij return (z0); 143296341Sdelphij} 144