4 An implementation of MD4 designed for use in the samba SMB
5 authentication protocol
7 Copyright (C) 1997-1998 Andrew Tridgell
9 This program is free software; you can redistribute it and/or
10 modify it under the terms of the GNU General Public License
11 as published by the Free Software Foundation; either version 2
12 of the License, or (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
18 See the GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program; if not, write to:
23 Free Software Foundation, Inc.
24 59 Temple Place - Suite 330
25 Boston, MA 02111-1307, USA
30 #include "darkplaces.h"
34 /* NOTE: This code makes no attempt to be fast!
36 It assumes that a int is at least 32 bits long
39 #define F(X,Y,Z) (((X)&(Y)) | ((~(X))&(Z)))
40 #define G(X,Y,Z) (((X)&(Y)) | ((X)&(Z)) | ((Y)&(Z)))
41 #define H(X,Y,Z) ((X)^(Y)^(Z))
43 #define lshift(x,s) ((((x)<<(s))&0xFFFFFFFF) | (((x)>>(32-(s)))&0xFFFFFFFF))
45 #define lshift(x,s) (((x)<<(s)) | ((x)>>(32-(s))))
48 #define ROUND1(a,b,c,d,k,s) a = lshift(a + F(b,c,d) + X[k], s)
49 #define ROUND2(a,b,c,d,k,s) a = lshift(a + G(b,c,d) + X[k] + 0x5A827999,s)
50 #define ROUND3(a,b,c,d,k,s) a = lshift(a + H(b,c,d) + X[k] + 0x6ED9EBA1,s)
52 /* this applies md4 to 64 byte chunks */
53 static void mdfour64(struct mdfour_s *md, uint32 *M)
56 uint32 AA, BB, CC, DD;
63 A = md->A; B = md->B; C = md->C; D = md->D;
64 AA = A; BB = B; CC = C; DD = D;
66 ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
67 ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
68 ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
69 ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
70 ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
71 ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
72 ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
73 ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19);
75 ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5);
76 ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13);
77 ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5);
78 ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13);
79 ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5);
80 ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13);
81 ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5);
82 ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13);
84 ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9);
85 ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15);
86 ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9);
87 ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15);
88 ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9);
89 ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15);
90 ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9);
91 ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15);
93 A += AA; B += BB; C += CC; D += DD;
96 A &= 0xFFFFFFFF; B &= 0xFFFFFFFF;
97 C &= 0xFFFFFFFF; D &= 0xFFFFFFFF;
103 md->A = A; md->B = B; md->C = C; md->D = D;
106 static void copy64(uint32 *M, const unsigned char *in)
111 M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
112 (in[i*4+1]<<8) | (in[i*4+0]<<0);
115 static void copy4(unsigned char *out,uint32 x)
118 out[1] = (x>>8)&0xFF;
119 out[2] = (x>>16)&0xFF;
120 out[3] = (x>>24)&0xFF;
123 void mdfour_begin(struct mdfour_s *md)
133 static void mdfour_tail(struct mdfour_s *md, const unsigned char *in, int n)
135 unsigned char buf[128];
144 if (n) memcpy(buf, in, n);
160 void mdfour_update(struct mdfour_s *md, const unsigned char *in, int n)
164 // start of edit by Ashley Rose Hale (LadyHavoc)
165 // commented out to prevent crashing when length is 0
166 // if (n == 0) mdfour_tail(in, n);
167 // end of edit by Ashley Rose Hale (LadyHavoc)
177 mdfour_tail(md, in, n);
181 void mdfour_result(struct mdfour_s *md, unsigned char *out)
186 copy4(out+12, md->D);
190 void mdfour(unsigned char *out, const unsigned char *in, int n)
194 mdfour_update(&md, in, n);
195 mdfour_result(&md, out);
198 ///////////////////////////////////////////////////////////////
199 // MD4-based checksum utility functions
201 // Copyright (C) 2000 Jeff Teunissen <d2deek@pmail.net>
203 // Author: Jeff Teunissen <d2deek@pmail.net>
206 unsigned Com_BlockChecksum (void *buffer, int length)
211 mdfour ( (unsigned char *) digest, (unsigned char *) buffer, length );
213 val = digest[0] ^ digest[1] ^ digest[2] ^ digest[3];
218 void Com_BlockFullChecksum (void *buffer, int len, unsigned char *outbuf)
220 mdfour ( outbuf, (unsigned char *) buffer, len );