remove RSA's md4.c, replace by DP's
git-svn-id: svn://svn.icculus.org/netradiant/trunk@23 61c419a2-8eb2-4b30-bcec-8cead039b335
This commit is contained in:
rpolzer
parent
bd60cad453
commit
eb6185a0cf
|
|
@ -1,297 +1,227 @@
|
||||||
/*
|
/*
|
||||||
Copyright (C) 1999-2006 Id Software, Inc. and contributors.
|
mdfour.c
|
||||||
For a list of contributors, see the accompanying CONTRIBUTORS file.
|
|
||||||
|
|
||||||
This file is part of GtkRadiant.
|
An implementation of MD4 designed for use in the samba SMB
|
||||||
|
authentication protocol
|
||||||
|
|
||||||
GtkRadiant is free software; you can redistribute it and/or modify
|
Copyright (C) 1997-1998 Andrew Tridgell
|
||||||
it under the terms of the GNU General Public License as published by
|
|
||||||
the Free Software Foundation; either version 2 of the License, or
|
|
||||||
(at your option) any later version.
|
|
||||||
|
|
||||||
GtkRadiant is distributed in the hope that it will be useful,
|
This program is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU General Public License
|
||||||
|
as published by the Free Software Foundation; either version 2
|
||||||
|
of the License, or (at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
||||||
GNU General Public License for more details.
|
|
||||||
|
See the GNU General Public License for more details.
|
||||||
|
|
||||||
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
||||||
along with GtkRadiant; if not, write to the Free Software
|
along with this program; if not, write to:
|
||||||
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
||||||
|
Free Software Foundation, Inc.
|
||||||
|
59 Temple Place - Suite 330
|
||||||
|
Boston, MA 02111-1307, USA
|
||||||
|
|
||||||
|
$Id: mdfour.c 7689 2007-11-12 14:28:40Z divverent $
|
||||||
*/
|
*/
|
||||||
/* GLOBAL.H - RSAREF types and constants */
|
|
||||||
|
|
||||||
#include <string.h>
|
#include <string.h> /* XoXus: needed for memset call */
|
||||||
|
#include "md4.h"
|
||||||
|
|
||||||
/* POINTER defines a generic pointer type */
|
/* NOTE: This code makes no attempt to be fast!
|
||||||
typedef unsigned char *POINTER;
|
|
||||||
|
|
||||||
/* UINT2 defines a two byte word */
|
It assumes that a int is at least 32 bits long
|
||||||
typedef unsigned short int UINT2;
|
*/
|
||||||
|
|
||||||
/* UINT4 defines a four byte word */
|
static struct mdfour *m;
|
||||||
typedef unsigned long int UINT4;
|
|
||||||
|
|
||||||
|
#define F(X,Y,Z) (((X)&(Y)) | ((~(X))&(Z)))
|
||||||
|
#define G(X,Y,Z) (((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z)))
|
||||||
|
#define H(X,Y,Z) ((X)^(Y)^(Z))
|
||||||
|
#ifdef LARGE_INT32
|
||||||
|
#define lshift(x,s) ((((x)<<(s))&0xFFFFFFFF) | (((x)>>(32-(s)))&0xFFFFFFFF))
|
||||||
|
#else
|
||||||
|
#define lshift(x,s) (((x)<<(s)) | ((x)>>(32-(s))))
|
||||||
|
#endif
|
||||||
|
|
||||||
/* MD4.H - header file for MD4C.C */
|
#define ROUND1(a,b,c,d,k,s) a = lshift(a + F(b,c,d) + X[k], s)
|
||||||
|
#define ROUND2(a,b,c,d,k,s) a = lshift(a + G(b,c,d) + X[k] + 0x5A827999,s)
|
||||||
|
#define ROUND3(a,b,c,d,k,s) a = lshift(a + H(b,c,d) + X[k] + 0x6ED9EBA1,s)
|
||||||
|
|
||||||
/* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991.
|
/* this applies md4 to 64 byte chunks */
|
||||||
|
static void mdfour64(uint32 *M)
|
||||||
All rights reserved.
|
|
||||||
|
|
||||||
License to copy and use this software is granted provided that it is identified as the RSA Data Security, Inc. MD4 Message-Digest Algorithm in all material mentioning or referencing this software or this function.
|
|
||||||
License is also granted to make and use derivative works provided that such works are identified as derived from the RSA Data Security, Inc. MD4 Message-Digest Algorithm in all material mentioning or referencing the derived work.
|
|
||||||
RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided as is without express or implied warranty of any kind.
|
|
||||||
|
|
||||||
These notices must be retained in any copies of any part of this documentation and/or software. */
|
|
||||||
|
|
||||||
/* MD4 context. */
|
|
||||||
typedef struct {
|
|
||||||
UINT4 state[4]; /* state (ABCD) */
|
|
||||||
UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */
|
|
||||||
unsigned char buffer[64]; /* input buffer */
|
|
||||||
} MD4_CTX;
|
|
||||||
|
|
||||||
void MD4Init (MD4_CTX *);
|
|
||||||
void MD4Update (MD4_CTX *, unsigned char *, unsigned int);
|
|
||||||
void MD4Final (unsigned char [16], MD4_CTX *);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* MD4C.C - RSA Data Security, Inc., MD4 message-digest algorithm */
|
|
||||||
/* Copyright (C) 1990-2, RSA Data Security, Inc. All rights reserved.
|
|
||||||
|
|
||||||
License to copy and use this software is granted provided that it is identified as the
|
|
||||||
RSA Data Security, Inc. MD4 Message-Digest Algorithm
|
|
||||||
in all material mentioning or referencing this software or this function.
|
|
||||||
License is also granted to make and use derivative works provided that such works are identified as
|
|
||||||
derived from the RSA Data Security, Inc. MD4 Message-Digest Algorithm
|
|
||||||
in all material mentioning or referencing the derived work.
|
|
||||||
RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided
|
|
||||||
as is without express or implied warranty of any kind.
|
|
||||||
|
|
||||||
These notices must be retained in any copies of any part of this documentation and/or software. */
|
|
||||||
|
|
||||||
/* Constants for MD4Transform routine. */
|
|
||||||
#define S11 3
|
|
||||||
#define S12 7
|
|
||||||
#define S13 11
|
|
||||||
#define S14 19
|
|
||||||
#define S21 3
|
|
||||||
#define S22 5
|
|
||||||
#define S23 9
|
|
||||||
#define S24 13
|
|
||||||
#define S31 3
|
|
||||||
#define S32 9
|
|
||||||
#define S33 11
|
|
||||||
#define S34 15
|
|
||||||
|
|
||||||
static void MD4Transform (UINT4 [4], unsigned char [64]);
|
|
||||||
static void Encode (unsigned char *, UINT4 *, unsigned int);
|
|
||||||
static void Decode (UINT4 *, unsigned char *, unsigned int);
|
|
||||||
static void MD4_memcpy (POINTER, POINTER, unsigned int);
|
|
||||||
static void MD4_memset (POINTER, int, unsigned int);
|
|
||||||
|
|
||||||
static unsigned char PADDING[64] = {
|
|
||||||
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
|
|
||||||
};
|
|
||||||
|
|
||||||
/* F, G and H are basic MD4 functions. */
|
|
||||||
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
|
|
||||||
#define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
|
|
||||||
#define H(x, y, z) ((x) ^ (y) ^ (z))
|
|
||||||
|
|
||||||
/* ROTATE_LEFT rotates x left n bits. */
|
|
||||||
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
|
|
||||||
|
|
||||||
/* FF, GG and HH are transformations for rounds 1, 2 and 3 */
|
|
||||||
/* Rotation is separate from addition to prevent recomputation */
|
|
||||||
#define FF(a, b, c, d, x, s) {(a) += F ((b), (c), (d)) + (x); (a) = ROTATE_LEFT ((a), (s));}
|
|
||||||
|
|
||||||
#define GG(a, b, c, d, x, s) {(a) += G ((b), (c), (d)) + (x) + (UINT4)0x5a827999; (a) = ROTATE_LEFT ((a), (s));}
|
|
||||||
|
|
||||||
#define HH(a, b, c, d, x, s) {(a) += H ((b), (c), (d)) + (x) + (UINT4)0x6ed9eba1; (a) = \
|
|
||||||
ROTATE_LEFT ((a), (s)); }
|
|
||||||
|
|
||||||
|
|
||||||
/* MD4 initialization. Begins an MD4 operation, writing a new context. */
|
|
||||||
void MD4Init (MD4_CTX *context)
|
|
||||||
{
|
{
|
||||||
context->count[0] = context->count[1] = 0;
|
int j;
|
||||||
|
uint32 AA, BB, CC, DD;
|
||||||
|
uint32 X[16];
|
||||||
|
uint32 A,B,C,D;
|
||||||
|
|
||||||
/* Load magic initialization constants.*/
|
for (j=0;j<16;j++)
|
||||||
context->state[0] = 0x67452301;
|
X[j] = M[j];
|
||||||
context->state[1] = 0xefcdab89;
|
|
||||||
context->state[2] = 0x98badcfe;
|
A = m->A; B = m->B; C = m->C; D = m->D;
|
||||||
context->state[3] = 0x10325476;
|
AA = A; BB = B; CC = C; DD = D;
|
||||||
|
|
||||||
|
ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
|
||||||
|
ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
|
||||||
|
ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
|
||||||
|
ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
|
||||||
|
ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
|
||||||
|
ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
|
||||||
|
ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
|
||||||
|
ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19);
|
||||||
|
|
||||||
|
ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5);
|
||||||
|
ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13);
|
||||||
|
ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5);
|
||||||
|
ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13);
|
||||||
|
ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5);
|
||||||
|
ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13);
|
||||||
|
ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5);
|
||||||
|
ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13);
|
||||||
|
|
||||||
|
ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9);
|
||||||
|
ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15);
|
||||||
|
ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9);
|
||||||
|
ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15);
|
||||||
|
ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9);
|
||||||
|
ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15);
|
||||||
|
ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9);
|
||||||
|
ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15);
|
||||||
|
|
||||||
|
A += AA; B += BB; C += CC; D += DD;
|
||||||
|
|
||||||
|
#ifdef LARGE_INT32
|
||||||
|
A &= 0xFFFFFFFF; B &= 0xFFFFFFFF;
|
||||||
|
C &= 0xFFFFFFFF; D &= 0xFFFFFFFF;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
for (j=0;j<16;j++)
|
||||||
|
X[j] = 0;
|
||||||
|
|
||||||
|
m->A = A; m->B = B; m->C = C; m->D = D;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* MD4 block update operation. Continues an MD4 message-digest operation, processing another message block, and updating the context. */
|
static void copy64(uint32 *M, unsigned char *in)
|
||||||
void MD4Update (MD4_CTX *context, unsigned char *input, unsigned int inputLen)
|
|
||||||
{
|
{
|
||||||
unsigned int i, index, partLen;
|
int i;
|
||||||
|
|
||||||
/* Compute number of bytes mod 64 */
|
for (i=0;i<16;i++)
|
||||||
index = (unsigned int)((context->count[0] >> 3) & 0x3F);
|
M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
|
||||||
|
(in[i*4+1]<<8) | (in[i*4+0]<<0);
|
||||||
|
}
|
||||||
|
|
||||||
/* Update number of bits */
|
static void copy4(unsigned char *out,uint32 x)
|
||||||
if ((context->count[0] += ((UINT4)inputLen << 3))< ((UINT4)inputLen << 3))
|
|
||||||
context->count[1]++;
|
|
||||||
|
|
||||||
context->count[1] += ((UINT4)inputLen >> 29);
|
|
||||||
|
|
||||||
partLen = 64 - index;
|
|
||||||
|
|
||||||
/* Transform as many times as possible.*/
|
|
||||||
if (inputLen >= partLen)
|
|
||||||
{
|
{
|
||||||
memcpy((POINTER)&context->buffer[index], (POINTER)input, partLen);
|
out[0] = x&0xFF;
|
||||||
MD4Transform (context->state, context->buffer);
|
out[1] = (x>>8)&0xFF;
|
||||||
|
out[2] = (x>>16)&0xFF;
|
||||||
for (i = partLen; i + 63 < inputLen; i += 64)
|
out[3] = (x>>24)&0xFF;
|
||||||
MD4Transform (context->state, &input[i]);
|
|
||||||
|
|
||||||
index = 0;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
i = 0;
|
|
||||||
|
|
||||||
/* Buffer remaining input */
|
|
||||||
memcpy ((POINTER)&context->buffer[index], (POINTER)&input[i], inputLen-i);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void mdfour_begin(struct mdfour *md)
|
||||||
/* MD4 finalization. Ends an MD4 message-digest operation, writing the the message digest and zeroizing the context. */
|
|
||||||
void MD4Final (unsigned char digest[16], MD4_CTX *context)
|
|
||||||
{
|
{
|
||||||
unsigned char bits[8];
|
md->A = 0x67452301;
|
||||||
unsigned int index, padLen;
|
md->B = 0xefcdab89;
|
||||||
|
md->C = 0x98badcfe;
|
||||||
/* Save number of bits */
|
md->D = 0x10325476;
|
||||||
Encode (bits, context->count, 8);
|
md->totalN = 0;
|
||||||
|
|
||||||
/* Pad out to 56 mod 64.*/
|
|
||||||
index = (unsigned int)((context->count[0] >> 3) & 0x3f);
|
|
||||||
padLen = (index < 56) ? (56 - index) : (120 - index);
|
|
||||||
MD4Update (context, PADDING, padLen);
|
|
||||||
|
|
||||||
/* Append length (before padding) */
|
|
||||||
MD4Update (context, bits, 8);
|
|
||||||
|
|
||||||
/* Store state in digest */
|
|
||||||
Encode (digest, context->state, 16);
|
|
||||||
|
|
||||||
/* Zeroize sensitive information.*/
|
|
||||||
memset ((POINTER)context, 0, sizeof (*context));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/* MD4 basic transformation. Transforms state based on block. */
|
static void mdfour_tail(unsigned char *in, int n)
|
||||||
static void MD4Transform (UINT4 state[4], unsigned char block[64])
|
|
||||||
{
|
{
|
||||||
UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
|
unsigned char buf[128];
|
||||||
|
uint32 M[16];
|
||||||
|
uint32 b;
|
||||||
|
|
||||||
Decode (x, block, 64);
|
m->totalN += n;
|
||||||
|
|
||||||
/* Round 1 */
|
b = m->totalN * 8;
|
||||||
FF (a, b, c, d, x[ 0], S11); /* 1 */
|
|
||||||
FF (d, a, b, c, x[ 1], S12); /* 2 */
|
|
||||||
FF (c, d, a, b, x[ 2], S13); /* 3 */
|
|
||||||
FF (b, c, d, a, x[ 3], S14); /* 4 */
|
|
||||||
FF (a, b, c, d, x[ 4], S11); /* 5 */
|
|
||||||
FF (d, a, b, c, x[ 5], S12); /* 6 */
|
|
||||||
FF (c, d, a, b, x[ 6], S13); /* 7 */
|
|
||||||
FF (b, c, d, a, x[ 7], S14); /* 8 */
|
|
||||||
FF (a, b, c, d, x[ 8], S11); /* 9 */
|
|
||||||
FF (d, a, b, c, x[ 9], S12); /* 10 */
|
|
||||||
FF (c, d, a, b, x[10], S13); /* 11 */
|
|
||||||
FF (b, c, d, a, x[11], S14); /* 12 */
|
|
||||||
FF (a, b, c, d, x[12], S11); /* 13 */
|
|
||||||
FF (d, a, b, c, x[13], S12); /* 14 */
|
|
||||||
FF (c, d, a, b, x[14], S13); /* 15 */
|
|
||||||
FF (b, c, d, a, x[15], S14); /* 16 */
|
|
||||||
|
|
||||||
/* Round 2 */
|
memset(buf, 0, 128);
|
||||||
GG (a, b, c, d, x[ 0], S21); /* 17 */
|
if (n) memcpy(buf, in, n);
|
||||||
GG (d, a, b, c, x[ 4], S22); /* 18 */
|
buf[n] = 0x80;
|
||||||
GG (c, d, a, b, x[ 8], S23); /* 19 */
|
|
||||||
GG (b, c, d, a, x[12], S24); /* 20 */
|
|
||||||
GG (a, b, c, d, x[ 1], S21); /* 21 */
|
|
||||||
GG (d, a, b, c, x[ 5], S22); /* 22 */
|
|
||||||
GG (c, d, a, b, x[ 9], S23); /* 23 */
|
|
||||||
GG (b, c, d, a, x[13], S24); /* 24 */
|
|
||||||
GG (a, b, c, d, x[ 2], S21); /* 25 */
|
|
||||||
GG (d, a, b, c, x[ 6], S22); /* 26 */
|
|
||||||
GG (c, d, a, b, x[10], S23); /* 27 */
|
|
||||||
GG (b, c, d, a, x[14], S24); /* 28 */
|
|
||||||
GG (a, b, c, d, x[ 3], S21); /* 29 */
|
|
||||||
GG (d, a, b, c, x[ 7], S22); /* 30 */
|
|
||||||
GG (c, d, a, b, x[11], S23); /* 31 */
|
|
||||||
GG (b, c, d, a, x[15], S24); /* 32 */
|
|
||||||
|
|
||||||
/* Round 3 */
|
if (n <= 55) {
|
||||||
HH (a, b, c, d, x[ 0], S31); /* 33 */
|
copy4(buf+56, b);
|
||||||
HH (d, a, b, c, x[ 8], S32); /* 34 */
|
copy64(M, buf);
|
||||||
HH (c, d, a, b, x[ 4], S33); /* 35 */
|
mdfour64(M);
|
||||||
HH (b, c, d, a, x[12], S34); /* 36 */
|
} else {
|
||||||
HH (a, b, c, d, x[ 2], S31); /* 37 */
|
copy4(buf+120, b);
|
||||||
HH (d, a, b, c, x[10], S32); /* 38 */
|
copy64(M, buf);
|
||||||
HH (c, d, a, b, x[ 6], S33); /* 39 */
|
mdfour64(M);
|
||||||
HH (b, c, d, a, x[14], S34); /* 40 */
|
copy64(M, buf+64);
|
||||||
HH (a, b, c, d, x[ 1], S31); /* 41 */
|
mdfour64(M);
|
||||||
HH (d, a, b, c, x[ 9], S32); /* 42 */
|
}
|
||||||
HH (c, d, a, b, x[ 5], S33); /* 43 */
|
|
||||||
HH (b, c, d, a, x[13], S34); /* 44 */
|
|
||||||
HH (a, b, c, d, x[ 3], S31); /* 45 */
|
|
||||||
HH (d, a, b, c, x[11], S32); /* 46 */
|
|
||||||
HH (c, d, a, b, x[ 7], S33); /* 47 */
|
|
||||||
HH (b, c, d, a, x[15], S34); /* 48 */
|
|
||||||
|
|
||||||
state[0] += a;
|
|
||||||
state[1] += b;
|
|
||||||
state[2] += c;
|
|
||||||
state[3] += d;
|
|
||||||
|
|
||||||
/* Zeroize sensitive information.*/
|
|
||||||
memset ((POINTER)x, 0, sizeof (x));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void mdfour_update(struct mdfour *md, unsigned char *in, int n)
|
||||||
/* Encodes input (UINT4) into output (unsigned char). Assumes len is a multiple of 4. */
|
|
||||||
static void Encode (unsigned char *output, UINT4 *input, unsigned int len)
|
|
||||||
{
|
{
|
||||||
unsigned int i, j;
|
uint32 M[16];
|
||||||
|
|
||||||
for (i = 0, j = 0; j < len; i++, j += 4) {
|
// start of edit by Forest 'LordHavoc' Hale
|
||||||
output[j] = (unsigned char)(input[i] & 0xff);
|
// commented out to prevent crashing when length is 0
|
||||||
output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
|
// if (n == 0) mdfour_tail(in, n);
|
||||||
output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
|
// end of edit by Forest 'LordHavoc' Hale
|
||||||
output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
|
|
||||||
|
m = md;
|
||||||
|
|
||||||
|
while (n >= 64) {
|
||||||
|
copy64(M, in);
|
||||||
|
mdfour64(M);
|
||||||
|
in += 64;
|
||||||
|
n -= 64;
|
||||||
|
m->totalN += 64;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
mdfour_tail(in, n);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/* Decodes input (unsigned char) into output (UINT4). Assumes len is a multiple of 4. */
|
void mdfour_result(struct mdfour *md, unsigned char *out)
|
||||||
static void Decode (UINT4 *output, unsigned char *input, unsigned int len)
|
|
||||||
{
|
{
|
||||||
unsigned int i, j;
|
m = md;
|
||||||
|
|
||||||
for (i = 0, j = 0; j < len; i++, j += 4)
|
copy4(out, m->A);
|
||||||
output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) | (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
|
copy4(out+4, m->B);
|
||||||
|
copy4(out+8, m->C);
|
||||||
|
copy4(out+12, m->D);
|
||||||
}
|
}
|
||||||
|
|
||||||
//===================================================================
|
|
||||||
|
void mdfour(unsigned char *out, unsigned char *in, int n)
|
||||||
|
{
|
||||||
|
struct mdfour md;
|
||||||
|
mdfour_begin(&md);
|
||||||
|
mdfour_update(&md, in, n);
|
||||||
|
mdfour_result(&md, out);
|
||||||
|
}
|
||||||
|
|
||||||
|
///////////////////////////////////////////////////////////////
|
||||||
|
// MD4-based checksum utility functions
|
||||||
|
//
|
||||||
|
// Copyright (C) 2000 Jeff Teunissen <d2deek@pmail.net>
|
||||||
|
//
|
||||||
|
// Author: Jeff Teunissen <d2deek@pmail.net>
|
||||||
|
// Date: 01 Jan 2000
|
||||||
|
|
||||||
unsigned Com_BlockChecksum (void *buffer, int length)
|
unsigned Com_BlockChecksum (void *buffer, int length)
|
||||||
{
|
{
|
||||||
int digest[4];
|
int digest[4];
|
||||||
unsigned val;
|
unsigned val;
|
||||||
MD4_CTX ctx;
|
|
||||||
|
|
||||||
MD4Init (&ctx);
|
mdfour ( (unsigned char *) digest, (unsigned char *) buffer, length );
|
||||||
MD4Update (&ctx, (unsigned char *)buffer, length);
|
|
||||||
MD4Final ( (unsigned char *)digest, &ctx);
|
|
||||||
|
|
||||||
val = digest[0] ^ digest[1] ^ digest[2] ^ digest[3];
|
val = digest[0] ^ digest[1] ^ digest[2] ^ digest[3];
|
||||||
|
|
||||||
return val;
|
return val;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void Com_BlockFullChecksum (void *buffer, int len, unsigned char *outbuf)
|
||||||
|
{
|
||||||
|
mdfour ( outbuf, (unsigned char *) buffer, len );
|
||||||
|
}
|
||||||
|
|
||||||
|
|
|
||||||
57
tools/quake2/common/md4.h
Normal file
57
tools/quake2/common/md4.h
Normal file
|
|
@ -0,0 +1,57 @@
|
||||||
|
/*
|
||||||
|
mdfour.h
|
||||||
|
|
||||||
|
an implementation of MD4 designed for use in the SMB authentication
|
||||||
|
protocol
|
||||||
|
|
||||||
|
Copyright (C) Andrew Tridgell 1997-1998
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU General Public License
|
||||||
|
as published by the Free Software Foundation; either version 2
|
||||||
|
of the License, or (at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
||||||
|
|
||||||
|
See the GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program; if not, write to:
|
||||||
|
|
||||||
|
Free Software Foundation, Inc.
|
||||||
|
59 Temple Place - Suite 330
|
||||||
|
Boston, MA 02111-1307, USA
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _MDFOUR_H
|
||||||
|
#define _MDFOUR_H
|
||||||
|
|
||||||
|
#ifndef int32
|
||||||
|
#define int32 int
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if SIZEOF_INT > 4
|
||||||
|
#define LARGE_INT32
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef uint32
|
||||||
|
#define uint32 unsigned int32
|
||||||
|
#endif
|
||||||
|
|
||||||
|
struct mdfour {
|
||||||
|
uint32 A, B, C, D;
|
||||||
|
uint32 totalN;
|
||||||
|
};
|
||||||
|
|
||||||
|
void mdfour_begin(struct mdfour *md); // old: MD4Init
|
||||||
|
void mdfour_update(struct mdfour *md, unsigned char *in, int n); //old: MD4Update
|
||||||
|
void mdfour_result(struct mdfour *md, unsigned char *out); // old: MD4Final
|
||||||
|
void mdfour(unsigned char *out, unsigned char *in, int n);
|
||||||
|
|
||||||
|
unsigned Com_BlockChecksum (void *buffer, int length);
|
||||||
|
void Com_BlockFullChecksum (void *buffer, int len, unsigned char *outbuf);
|
||||||
|
|
||||||
|
#endif // _MDFOUR_H
|
||||||
|
|
||||||
|
|
@ -21,6 +21,7 @@ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||||
|
|
||||||
#include "qdata.h"
|
#include "qdata.h"
|
||||||
#include "inout.h"
|
#include "inout.h"
|
||||||
|
#include "md4.h"
|
||||||
|
|
||||||
qboolean g_compress_pak;
|
qboolean g_compress_pak;
|
||||||
qboolean g_release; // don't grab, copy output data to new tree
|
qboolean g_release; // don't grab, copy output data to new tree
|
||||||
|
|
@ -47,8 +48,6 @@ void InitPaths( int *argc, char **argv );
|
||||||
=======================================================
|
=======================================================
|
||||||
*/
|
*/
|
||||||
|
|
||||||
unsigned Com_BlockChecksum (void *buffer, int length);
|
|
||||||
|
|
||||||
typedef struct
|
typedef struct
|
||||||
{
|
{
|
||||||
char name[56];
|
char name[56];
|
||||||
|
|
|
||||||
|
|
@ -1,298 +1,227 @@
|
||||||
/*
|
/*
|
||||||
Copyright (C) 1999-2006 Id Software, Inc. and contributors.
|
mdfour.c
|
||||||
For a list of contributors, see the accompanying CONTRIBUTORS file.
|
|
||||||
|
|
||||||
This file is part of GtkRadiant.
|
An implementation of MD4 designed for use in the samba SMB
|
||||||
|
authentication protocol
|
||||||
|
|
||||||
GtkRadiant is free software; you can redistribute it and/or modify
|
Copyright (C) 1997-1998 Andrew Tridgell
|
||||||
it under the terms of the GNU General Public License as published by
|
|
||||||
the Free Software Foundation; either version 2 of the License, or
|
|
||||||
(at your option) any later version.
|
|
||||||
|
|
||||||
GtkRadiant is distributed in the hope that it will be useful,
|
This program is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU General Public License
|
||||||
|
as published by the Free Software Foundation; either version 2
|
||||||
|
of the License, or (at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
||||||
GNU General Public License for more details.
|
|
||||||
|
See the GNU General Public License for more details.
|
||||||
|
|
||||||
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
||||||
along with GtkRadiant; if not, write to the Free Software
|
along with this program; if not, write to:
|
||||||
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
||||||
|
Free Software Foundation, Inc.
|
||||||
|
59 Temple Place - Suite 330
|
||||||
|
Boston, MA 02111-1307, USA
|
||||||
|
|
||||||
|
$Id: mdfour.c 7689 2007-11-12 14:28:40Z divverent $
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* GLOBAL.H - RSAREF types and constants */
|
#include <string.h> /* XoXus: needed for memset call */
|
||||||
|
#include "md4.h"
|
||||||
|
|
||||||
#include <string.h>
|
/* NOTE: This code makes no attempt to be fast!
|
||||||
|
|
||||||
/* POINTER defines a generic pointer type */
|
It assumes that a int is at least 32 bits long
|
||||||
typedef unsigned char *POINTER;
|
*/
|
||||||
|
|
||||||
/* UINT2 defines a two byte word */
|
static struct mdfour *m;
|
||||||
typedef unsigned short int UINT2;
|
|
||||||
|
|
||||||
/* UINT4 defines a four byte word */
|
#define F(X,Y,Z) (((X)&(Y)) | ((~(X))&(Z)))
|
||||||
typedef unsigned long int UINT4;
|
#define G(X,Y,Z) (((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z)))
|
||||||
|
#define H(X,Y,Z) ((X)^(Y)^(Z))
|
||||||
|
#ifdef LARGE_INT32
|
||||||
|
#define lshift(x,s) ((((x)<<(s))&0xFFFFFFFF) | (((x)>>(32-(s)))&0xFFFFFFFF))
|
||||||
|
#else
|
||||||
|
#define lshift(x,s) (((x)<<(s)) | ((x)>>(32-(s))))
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#define ROUND1(a,b,c,d,k,s) a = lshift(a + F(b,c,d) + X[k], s)
|
||||||
|
#define ROUND2(a,b,c,d,k,s) a = lshift(a + G(b,c,d) + X[k] + 0x5A827999,s)
|
||||||
|
#define ROUND3(a,b,c,d,k,s) a = lshift(a + H(b,c,d) + X[k] + 0x6ED9EBA1,s)
|
||||||
|
|
||||||
/* MD4.H - header file for MD4C.C */
|
/* this applies md4 to 64 byte chunks */
|
||||||
|
static void mdfour64(uint32 *M)
|
||||||
/* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991.
|
|
||||||
|
|
||||||
All rights reserved.
|
|
||||||
|
|
||||||
License to copy and use this software is granted provided that it is identified as the “RSA Data Security, Inc. MD4 Message-Digest Algorithm” in all material mentioning or referencing this software or this function.
|
|
||||||
License is also granted to make and use derivative works provided that such works are identified as “derived from the RSA Data Security, Inc. MD4 Message-Digest Algorithm” in all material mentioning or referencing the derived work.
|
|
||||||
RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided “as is” without express or implied warranty of any kind.
|
|
||||||
|
|
||||||
These notices must be retained in any copies of any part of this documentation and/or software. */
|
|
||||||
|
|
||||||
/* MD4 context. */
|
|
||||||
typedef struct {
|
|
||||||
UINT4 state[4]; /* state (ABCD) */
|
|
||||||
UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */
|
|
||||||
unsigned char buffer[64]; /* input buffer */
|
|
||||||
} MD4_CTX;
|
|
||||||
|
|
||||||
void MD4Init (MD4_CTX *);
|
|
||||||
void MD4Update (MD4_CTX *, unsigned char *, unsigned int);
|
|
||||||
void MD4Final (unsigned char [16], MD4_CTX *);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* MD4C.C - RSA Data Security, Inc., MD4 message-digest algorithm */
|
|
||||||
/* Copyright (C) 1990-2, RSA Data Security, Inc. All rights reserved.
|
|
||||||
|
|
||||||
License to copy and use this software is granted provided that it is identified as the
|
|
||||||
RSA Data Security, Inc. MD4 Message-Digest Algorithm
|
|
||||||
in all material mentioning or referencing this software or this function.
|
|
||||||
License is also granted to make and use derivative works provided that such works are identified as
|
|
||||||
derived from the RSA Data Security, Inc. MD4 Message-Digest Algorithm
|
|
||||||
in all material mentioning or referencing the derived work.
|
|
||||||
RSA Data Security, Inc. makes no representations concerning either the merchantability of this software or the suitability of this software for any particular purpose. It is provided
|
|
||||||
as is without express or implied warranty of any kind.
|
|
||||||
|
|
||||||
These notices must be retained in any copies of any part of this documentation and/or software. */
|
|
||||||
|
|
||||||
/* Constants for MD4Transform routine. */
|
|
||||||
#define S11 3
|
|
||||||
#define S12 7
|
|
||||||
#define S13 11
|
|
||||||
#define S14 19
|
|
||||||
#define S21 3
|
|
||||||
#define S22 5
|
|
||||||
#define S23 9
|
|
||||||
#define S24 13
|
|
||||||
#define S31 3
|
|
||||||
#define S32 9
|
|
||||||
#define S33 11
|
|
||||||
#define S34 15
|
|
||||||
|
|
||||||
static void MD4Transform (UINT4 [4], unsigned char [64]);
|
|
||||||
static void Encode (unsigned char *, UINT4 *, unsigned int);
|
|
||||||
static void Decode (UINT4 *, unsigned char *, unsigned int);
|
|
||||||
static void MD4_memcpy (POINTER, POINTER, unsigned int);
|
|
||||||
static void MD4_memset (POINTER, int, unsigned int);
|
|
||||||
|
|
||||||
static unsigned char PADDING[64] = {
|
|
||||||
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
|
|
||||||
};
|
|
||||||
|
|
||||||
/* F, G and H are basic MD4 functions. */
|
|
||||||
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
|
|
||||||
#define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
|
|
||||||
#define H(x, y, z) ((x) ^ (y) ^ (z))
|
|
||||||
|
|
||||||
/* ROTATE_LEFT rotates x left n bits. */
|
|
||||||
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
|
|
||||||
|
|
||||||
/* FF, GG and HH are transformations for rounds 1, 2 and 3 */
|
|
||||||
/* Rotation is separate from addition to prevent recomputation */
|
|
||||||
#define FF(a, b, c, d, x, s) {(a) += F ((b), (c), (d)) + (x); (a) = ROTATE_LEFT ((a), (s));}
|
|
||||||
|
|
||||||
#define GG(a, b, c, d, x, s) {(a) += G ((b), (c), (d)) + (x) + (UINT4)0x5a827999; (a) = ROTATE_LEFT ((a), (s));}
|
|
||||||
|
|
||||||
#define HH(a, b, c, d, x, s) {(a) += H ((b), (c), (d)) + (x) + (UINT4)0x6ed9eba1; (a) = \
|
|
||||||
ROTATE_LEFT ((a), (s)); }
|
|
||||||
|
|
||||||
|
|
||||||
/* MD4 initialization. Begins an MD4 operation, writing a new context. */
|
|
||||||
void MD4Init (MD4_CTX *context)
|
|
||||||
{
|
{
|
||||||
context->count[0] = context->count[1] = 0;
|
int j;
|
||||||
|
uint32 AA, BB, CC, DD;
|
||||||
|
uint32 X[16];
|
||||||
|
uint32 A,B,C,D;
|
||||||
|
|
||||||
/* Load magic initialization constants.*/
|
for (j=0;j<16;j++)
|
||||||
context->state[0] = 0x67452301;
|
X[j] = M[j];
|
||||||
context->state[1] = 0xefcdab89;
|
|
||||||
context->state[2] = 0x98badcfe;
|
A = m->A; B = m->B; C = m->C; D = m->D;
|
||||||
context->state[3] = 0x10325476;
|
AA = A; BB = B; CC = C; DD = D;
|
||||||
|
|
||||||
|
ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
|
||||||
|
ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
|
||||||
|
ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
|
||||||
|
ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
|
||||||
|
ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
|
||||||
|
ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
|
||||||
|
ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
|
||||||
|
ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19);
|
||||||
|
|
||||||
|
ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5);
|
||||||
|
ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13);
|
||||||
|
ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5);
|
||||||
|
ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13);
|
||||||
|
ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5);
|
||||||
|
ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13);
|
||||||
|
ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5);
|
||||||
|
ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13);
|
||||||
|
|
||||||
|
ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9);
|
||||||
|
ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15);
|
||||||
|
ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9);
|
||||||
|
ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15);
|
||||||
|
ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9);
|
||||||
|
ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15);
|
||||||
|
ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9);
|
||||||
|
ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15);
|
||||||
|
|
||||||
|
A += AA; B += BB; C += CC; D += DD;
|
||||||
|
|
||||||
|
#ifdef LARGE_INT32
|
||||||
|
A &= 0xFFFFFFFF; B &= 0xFFFFFFFF;
|
||||||
|
C &= 0xFFFFFFFF; D &= 0xFFFFFFFF;
|
||||||
|
#endif
|
||||||
|
|
||||||
|
for (j=0;j<16;j++)
|
||||||
|
X[j] = 0;
|
||||||
|
|
||||||
|
m->A = A; m->B = B; m->C = C; m->D = D;
|
||||||
}
|
}
|
||||||
|
|
||||||
/* MD4 block update operation. Continues an MD4 message-digest operation, processing another message block, and updating the context. */
|
static void copy64(uint32 *M, unsigned char *in)
|
||||||
void MD4Update (MD4_CTX *context, unsigned char *input, unsigned int inputLen)
|
|
||||||
{
|
{
|
||||||
unsigned int i, index, partLen;
|
int i;
|
||||||
|
|
||||||
/* Compute number of bytes mod 64 */
|
for (i=0;i<16;i++)
|
||||||
index = (unsigned int)((context->count[0] >> 3) & 0x3F);
|
M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
|
||||||
|
(in[i*4+1]<<8) | (in[i*4+0]<<0);
|
||||||
|
}
|
||||||
|
|
||||||
/* Update number of bits */
|
static void copy4(unsigned char *out,uint32 x)
|
||||||
if ((context->count[0] += ((UINT4)inputLen << 3))< ((UINT4)inputLen << 3))
|
|
||||||
context->count[1]++;
|
|
||||||
|
|
||||||
context->count[1] += ((UINT4)inputLen >> 29);
|
|
||||||
|
|
||||||
partLen = 64 - index;
|
|
||||||
|
|
||||||
/* Transform as many times as possible.*/
|
|
||||||
if (inputLen >= partLen)
|
|
||||||
{
|
{
|
||||||
memcpy((POINTER)&context->buffer[index], (POINTER)input, partLen);
|
out[0] = x&0xFF;
|
||||||
MD4Transform (context->state, context->buffer);
|
out[1] = (x>>8)&0xFF;
|
||||||
|
out[2] = (x>>16)&0xFF;
|
||||||
for (i = partLen; i + 63 < inputLen; i += 64)
|
out[3] = (x>>24)&0xFF;
|
||||||
MD4Transform (context->state, &input[i]);
|
|
||||||
|
|
||||||
index = 0;
|
|
||||||
}
|
|
||||||
else
|
|
||||||
i = 0;
|
|
||||||
|
|
||||||
/* Buffer remaining input */
|
|
||||||
memcpy ((POINTER)&context->buffer[index], (POINTER)&input[i], inputLen-i);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void mdfour_begin(struct mdfour *md)
|
||||||
/* MD4 finalization. Ends an MD4 message-digest operation, writing the the message digest and zeroizing the context. */
|
|
||||||
void MD4Final (unsigned char digest[16], MD4_CTX *context)
|
|
||||||
{
|
{
|
||||||
unsigned char bits[8];
|
md->A = 0x67452301;
|
||||||
unsigned int index, padLen;
|
md->B = 0xefcdab89;
|
||||||
|
md->C = 0x98badcfe;
|
||||||
/* Save number of bits */
|
md->D = 0x10325476;
|
||||||
Encode (bits, context->count, 8);
|
md->totalN = 0;
|
||||||
|
|
||||||
/* Pad out to 56 mod 64.*/
|
|
||||||
index = (unsigned int)((context->count[0] >> 3) & 0x3f);
|
|
||||||
padLen = (index < 56) ? (56 - index) : (120 - index);
|
|
||||||
MD4Update (context, PADDING, padLen);
|
|
||||||
|
|
||||||
/* Append length (before padding) */
|
|
||||||
MD4Update (context, bits, 8);
|
|
||||||
|
|
||||||
/* Store state in digest */
|
|
||||||
Encode (digest, context->state, 16);
|
|
||||||
|
|
||||||
/* Zeroize sensitive information.*/
|
|
||||||
memset ((POINTER)context, 0, sizeof (*context));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/* MD4 basic transformation. Transforms state based on block. */
|
static void mdfour_tail(unsigned char *in, int n)
|
||||||
static void MD4Transform (UINT4 state[4], unsigned char block[64])
|
|
||||||
{
|
{
|
||||||
UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
|
unsigned char buf[128];
|
||||||
|
uint32 M[16];
|
||||||
|
uint32 b;
|
||||||
|
|
||||||
Decode (x, block, 64);
|
m->totalN += n;
|
||||||
|
|
||||||
/* Round 1 */
|
b = m->totalN * 8;
|
||||||
FF (a, b, c, d, x[ 0], S11); /* 1 */
|
|
||||||
FF (d, a, b, c, x[ 1], S12); /* 2 */
|
|
||||||
FF (c, d, a, b, x[ 2], S13); /* 3 */
|
|
||||||
FF (b, c, d, a, x[ 3], S14); /* 4 */
|
|
||||||
FF (a, b, c, d, x[ 4], S11); /* 5 */
|
|
||||||
FF (d, a, b, c, x[ 5], S12); /* 6 */
|
|
||||||
FF (c, d, a, b, x[ 6], S13); /* 7 */
|
|
||||||
FF (b, c, d, a, x[ 7], S14); /* 8 */
|
|
||||||
FF (a, b, c, d, x[ 8], S11); /* 9 */
|
|
||||||
FF (d, a, b, c, x[ 9], S12); /* 10 */
|
|
||||||
FF (c, d, a, b, x[10], S13); /* 11 */
|
|
||||||
FF (b, c, d, a, x[11], S14); /* 12 */
|
|
||||||
FF (a, b, c, d, x[12], S11); /* 13 */
|
|
||||||
FF (d, a, b, c, x[13], S12); /* 14 */
|
|
||||||
FF (c, d, a, b, x[14], S13); /* 15 */
|
|
||||||
FF (b, c, d, a, x[15], S14); /* 16 */
|
|
||||||
|
|
||||||
/* Round 2 */
|
memset(buf, 0, 128);
|
||||||
GG (a, b, c, d, x[ 0], S21); /* 17 */
|
if (n) memcpy(buf, in, n);
|
||||||
GG (d, a, b, c, x[ 4], S22); /* 18 */
|
buf[n] = 0x80;
|
||||||
GG (c, d, a, b, x[ 8], S23); /* 19 */
|
|
||||||
GG (b, c, d, a, x[12], S24); /* 20 */
|
|
||||||
GG (a, b, c, d, x[ 1], S21); /* 21 */
|
|
||||||
GG (d, a, b, c, x[ 5], S22); /* 22 */
|
|
||||||
GG (c, d, a, b, x[ 9], S23); /* 23 */
|
|
||||||
GG (b, c, d, a, x[13], S24); /* 24 */
|
|
||||||
GG (a, b, c, d, x[ 2], S21); /* 25 */
|
|
||||||
GG (d, a, b, c, x[ 6], S22); /* 26 */
|
|
||||||
GG (c, d, a, b, x[10], S23); /* 27 */
|
|
||||||
GG (b, c, d, a, x[14], S24); /* 28 */
|
|
||||||
GG (a, b, c, d, x[ 3], S21); /* 29 */
|
|
||||||
GG (d, a, b, c, x[ 7], S22); /* 30 */
|
|
||||||
GG (c, d, a, b, x[11], S23); /* 31 */
|
|
||||||
GG (b, c, d, a, x[15], S24); /* 32 */
|
|
||||||
|
|
||||||
/* Round 3 */
|
if (n <= 55) {
|
||||||
HH (a, b, c, d, x[ 0], S31); /* 33 */
|
copy4(buf+56, b);
|
||||||
HH (d, a, b, c, x[ 8], S32); /* 34 */
|
copy64(M, buf);
|
||||||
HH (c, d, a, b, x[ 4], S33); /* 35 */
|
mdfour64(M);
|
||||||
HH (b, c, d, a, x[12], S34); /* 36 */
|
} else {
|
||||||
HH (a, b, c, d, x[ 2], S31); /* 37 */
|
copy4(buf+120, b);
|
||||||
HH (d, a, b, c, x[10], S32); /* 38 */
|
copy64(M, buf);
|
||||||
HH (c, d, a, b, x[ 6], S33); /* 39 */
|
mdfour64(M);
|
||||||
HH (b, c, d, a, x[14], S34); /* 40 */
|
copy64(M, buf+64);
|
||||||
HH (a, b, c, d, x[ 1], S31); /* 41 */
|
mdfour64(M);
|
||||||
HH (d, a, b, c, x[ 9], S32); /* 42 */
|
}
|
||||||
HH (c, d, a, b, x[ 5], S33); /* 43 */
|
|
||||||
HH (b, c, d, a, x[13], S34); /* 44 */
|
|
||||||
HH (a, b, c, d, x[ 3], S31); /* 45 */
|
|
||||||
HH (d, a, b, c, x[11], S32); /* 46 */
|
|
||||||
HH (c, d, a, b, x[ 7], S33); /* 47 */
|
|
||||||
HH (b, c, d, a, x[15], S34); /* 48 */
|
|
||||||
|
|
||||||
state[0] += a;
|
|
||||||
state[1] += b;
|
|
||||||
state[2] += c;
|
|
||||||
state[3] += d;
|
|
||||||
|
|
||||||
/* Zeroize sensitive information.*/
|
|
||||||
memset ((POINTER)x, 0, sizeof (x));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void mdfour_update(struct mdfour *md, unsigned char *in, int n)
|
||||||
/* Encodes input (UINT4) into output (unsigned char). Assumes len is a multiple of 4. */
|
|
||||||
static void Encode (unsigned char *output, UINT4 *input, unsigned int len)
|
|
||||||
{
|
{
|
||||||
unsigned int i, j;
|
uint32 M[16];
|
||||||
|
|
||||||
for (i = 0, j = 0; j < len; i++, j += 4) {
|
// start of edit by Forest 'LordHavoc' Hale
|
||||||
output[j] = (unsigned char)(input[i] & 0xff);
|
// commented out to prevent crashing when length is 0
|
||||||
output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
|
// if (n == 0) mdfour_tail(in, n);
|
||||||
output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
|
// end of edit by Forest 'LordHavoc' Hale
|
||||||
output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
|
|
||||||
|
m = md;
|
||||||
|
|
||||||
|
while (n >= 64) {
|
||||||
|
copy64(M, in);
|
||||||
|
mdfour64(M);
|
||||||
|
in += 64;
|
||||||
|
n -= 64;
|
||||||
|
m->totalN += 64;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
mdfour_tail(in, n);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
/* Decodes input (unsigned char) into output (UINT4). Assumes len is a multiple of 4. */
|
void mdfour_result(struct mdfour *md, unsigned char *out)
|
||||||
static void Decode (UINT4 *output, unsigned char *input, unsigned int len)
|
|
||||||
{
|
{
|
||||||
unsigned int i, j;
|
m = md;
|
||||||
|
|
||||||
for (i = 0, j = 0; j < len; i++, j += 4)
|
copy4(out, m->A);
|
||||||
output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) | (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
|
copy4(out+4, m->B);
|
||||||
|
copy4(out+8, m->C);
|
||||||
|
copy4(out+12, m->D);
|
||||||
}
|
}
|
||||||
|
|
||||||
//===================================================================
|
|
||||||
|
void mdfour(unsigned char *out, unsigned char *in, int n)
|
||||||
|
{
|
||||||
|
struct mdfour md;
|
||||||
|
mdfour_begin(&md);
|
||||||
|
mdfour_update(&md, in, n);
|
||||||
|
mdfour_result(&md, out);
|
||||||
|
}
|
||||||
|
|
||||||
|
///////////////////////////////////////////////////////////////
|
||||||
|
// MD4-based checksum utility functions
|
||||||
|
//
|
||||||
|
// Copyright (C) 2000 Jeff Teunissen <d2deek@pmail.net>
|
||||||
|
//
|
||||||
|
// Author: Jeff Teunissen <d2deek@pmail.net>
|
||||||
|
// Date: 01 Jan 2000
|
||||||
|
|
||||||
unsigned Com_BlockChecksum (void *buffer, int length)
|
unsigned Com_BlockChecksum (void *buffer, int length)
|
||||||
{
|
{
|
||||||
int digest[4];
|
int digest[4];
|
||||||
unsigned val;
|
unsigned val;
|
||||||
MD4_CTX ctx;
|
|
||||||
|
|
||||||
MD4Init (&ctx);
|
mdfour ( (unsigned char *) digest, (unsigned char *) buffer, length );
|
||||||
MD4Update (&ctx, (unsigned char *)buffer, length);
|
|
||||||
MD4Final ( (unsigned char *)digest, &ctx);
|
|
||||||
|
|
||||||
val = digest[0] ^ digest[1] ^ digest[2] ^ digest[3];
|
val = digest[0] ^ digest[1] ^ digest[2] ^ digest[3];
|
||||||
|
|
||||||
return val;
|
return val;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
void Com_BlockFullChecksum (void *buffer, int len, unsigned char *outbuf)
|
||||||
|
{
|
||||||
|
mdfour ( outbuf, (unsigned char *) buffer, len );
|
||||||
|
}
|
||||||
|
|
||||||
|
|
|
||||||
57
tools/quake2/qdata_heretic2/common/md4.h
Normal file
57
tools/quake2/qdata_heretic2/common/md4.h
Normal file
|
|
@ -0,0 +1,57 @@
|
||||||
|
/*
|
||||||
|
mdfour.h
|
||||||
|
|
||||||
|
an implementation of MD4 designed for use in the SMB authentication
|
||||||
|
protocol
|
||||||
|
|
||||||
|
Copyright (C) Andrew Tridgell 1997-1998
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU General Public License
|
||||||
|
as published by the Free Software Foundation; either version 2
|
||||||
|
of the License, or (at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
|
||||||
|
|
||||||
|
See the GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program; if not, write to:
|
||||||
|
|
||||||
|
Free Software Foundation, Inc.
|
||||||
|
59 Temple Place - Suite 330
|
||||||
|
Boston, MA 02111-1307, USA
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef _MDFOUR_H
|
||||||
|
#define _MDFOUR_H
|
||||||
|
|
||||||
|
#ifndef int32
|
||||||
|
#define int32 int
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if SIZEOF_INT > 4
|
||||||
|
#define LARGE_INT32
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#ifndef uint32
|
||||||
|
#define uint32 unsigned int32
|
||||||
|
#endif
|
||||||
|
|
||||||
|
struct mdfour {
|
||||||
|
uint32 A, B, C, D;
|
||||||
|
uint32 totalN;
|
||||||
|
};
|
||||||
|
|
||||||
|
void mdfour_begin(struct mdfour *md); // old: MD4Init
|
||||||
|
void mdfour_update(struct mdfour *md, unsigned char *in, int n); //old: MD4Update
|
||||||
|
void mdfour_result(struct mdfour *md, unsigned char *out); // old: MD4Final
|
||||||
|
void mdfour(unsigned char *out, unsigned char *in, int n);
|
||||||
|
|
||||||
|
unsigned Com_BlockChecksum (void *buffer, int length);
|
||||||
|
void Com_BlockFullChecksum (void *buffer, int len, unsigned char *outbuf);
|
||||||
|
|
||||||
|
#endif // _MDFOUR_H
|
||||||
|
|
||||||
|
|
@ -20,6 +20,7 @@ Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||||
*/
|
*/
|
||||||
|
|
||||||
#include "qdata.h"
|
#include "qdata.h"
|
||||||
|
#include "md4.h"
|
||||||
|
|
||||||
void TK_Init();
|
void TK_Init();
|
||||||
|
|
||||||
|
|
@ -55,8 +56,6 @@ extern qboolean g_nomkdir;
|
||||||
=======================================================
|
=======================================================
|
||||||
*/
|
*/
|
||||||
|
|
||||||
unsigned Com_BlockChecksum (void *buffer, int length);
|
|
||||||
|
|
||||||
typedef struct
|
typedef struct
|
||||||
{
|
{
|
||||||
char name[56];
|
char name[56];
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue
Block a user