2 Unix SMB/CIFS implementation.
3 a implementation of MD4 designed for use in the SMB authentication protocol
4 Copyright (C) Andrew Tridgell 1997-1998.
6 $Id: crypt-md4.c,v 1.2 2002/12/03 15:21:28 gerald Exp $
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
30 /* NOTE: This code makes no attempt to be fast!
32 It assumes that a int is at least 32 bits long
35 static guint32 A, B, C, D;
37 static guint32 F(guint32 X, guint32 Y, guint32 Z)
39 return (X&Y) | ((~X)&Z);
42 static guint32 G(guint32 X, guint32 Y, guint32 Z)
44 return (X&Y) | (X&Z) | (Y&Z);
47 static guint32 H(guint32 X, guint32 Y, guint32 Z)
52 static guint32 lshift(guint32 x, int s)
55 return ((x<<s)&0xFFFFFFFF) | (x>>(32-s));
58 #define ROUND1(a,b,c,d,k,s) a = lshift(a + F(b,c,d) + X[k], s)
59 #define ROUND2(a,b,c,d,k,s) a = lshift(a + G(b,c,d) + X[k] + (guint32)0x5A827999,s)
60 #define ROUND3(a,b,c,d,k,s) a = lshift(a + H(b,c,d) + X[k] + (guint32)0x6ED9EBA1,s)
62 /* this applies md4 to 64 byte chunks */
63 static void mdfour64(guint32 *M)
66 guint32 AA, BB, CC, DD;
72 AA = A; BB = B; CC = C; DD = D;
74 ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
75 ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
76 ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
77 ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
78 ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
79 ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
80 ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
81 ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19);
83 ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5);
84 ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13);
85 ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5);
86 ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13);
87 ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5);
88 ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13);
89 ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5);
90 ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13);
92 ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9);
93 ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15);
94 ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9);
95 ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15);
96 ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9);
97 ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15);
98 ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9);
99 ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15);
101 A += AA; B += BB; C += CC; D += DD;
103 A &= 0xFFFFFFFF; B &= 0xFFFFFFFF;
104 C &= 0xFFFFFFFF; D &= 0xFFFFFFFF;
110 static void copy64(guint32 *M, const unsigned char *in)
115 M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
116 (in[i*4+1]<<8) | (in[i*4+0]<<0);
119 static void copy4(unsigned char *out, guint32 x)
122 out[1] = (x>>8)&0xFF;
123 out[2] = (x>>16)&0xFF;
124 out[3] = (x>>24)&0xFF;
127 /* produce a md4 message digest from data of length n bytes */
128 void crypt_md4(unsigned char *out, const unsigned char *in, int n)
130 unsigned char buf[128];