nexmon – Blame information for rev 1

Subversion Repositories:
Rev:
Rev Author Line No. Line
1 office 1 /*
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.
5  
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
10  
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15  
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
19 */
20  
21 #include "config.h"
22  
23 #include <glib.h>
24 #include <string.h>
25  
26 #include "md4.h"
27  
28 /* NOTE: This code makes no attempt to be fast!
29  
30 It assumes that a int is at least 32 bits long
31 */
32  
33 static guint32 A, B, C, D;
34  
35 static guint32 F(guint32 X, guint32 Y, guint32 Z)
36 {
37 return (X&Y) | ((~X)&Z);
38 }
39  
40 static guint32 G(guint32 X, guint32 Y, guint32 Z)
41 {
42 return (X&Y) | (X&Z) | (Y&Z);
43 }
44  
45 static guint32 H(guint32 X, guint32 Y, guint32 Z)
46 {
47 return X^Y^Z;
48 }
49  
50 static guint32 lshift(guint32 x, int s)
51 {
52 x &= 0xFFFFFFFF;
53 return ((x<<s)&0xFFFFFFFF) | (x>>(32-s));
54 }
55  
56 #define ROUND1(a,b,c,d,k,s) a = lshift(a + F(b,c,d) + X[k], s)
57 #define ROUND2(a,b,c,d,k,s) a = lshift(a + G(b,c,d) + X[k] + (guint32)0x5A827999,s)
58 #define ROUND3(a,b,c,d,k,s) a = lshift(a + H(b,c,d) + X[k] + (guint32)0x6ED9EBA1,s)
59  
60 /* this applies md4 to 64 byte chunks */
61 static void mdfour64(guint32 *M)
62 {
63 int j;
64 guint32 AA, BB, CC, DD;
65 guint32 X[16];
66  
67 for (j=0;j<16;j++)
68 X[j] = M[j];
69  
70 AA = A; BB = B; CC = C; DD = D;
71  
72 ROUND1(A,B,C,D, 0, 3); ROUND1(D,A,B,C, 1, 7);
73 ROUND1(C,D,A,B, 2, 11); ROUND1(B,C,D,A, 3, 19);
74 ROUND1(A,B,C,D, 4, 3); ROUND1(D,A,B,C, 5, 7);
75 ROUND1(C,D,A,B, 6, 11); ROUND1(B,C,D,A, 7, 19);
76 ROUND1(A,B,C,D, 8, 3); ROUND1(D,A,B,C, 9, 7);
77 ROUND1(C,D,A,B, 10, 11); ROUND1(B,C,D,A, 11, 19);
78 ROUND1(A,B,C,D, 12, 3); ROUND1(D,A,B,C, 13, 7);
79 ROUND1(C,D,A,B, 14, 11); ROUND1(B,C,D,A, 15, 19);
80  
81 ROUND2(A,B,C,D, 0, 3); ROUND2(D,A,B,C, 4, 5);
82 ROUND2(C,D,A,B, 8, 9); ROUND2(B,C,D,A, 12, 13);
83 ROUND2(A,B,C,D, 1, 3); ROUND2(D,A,B,C, 5, 5);
84 ROUND2(C,D,A,B, 9, 9); ROUND2(B,C,D,A, 13, 13);
85 ROUND2(A,B,C,D, 2, 3); ROUND2(D,A,B,C, 6, 5);
86 ROUND2(C,D,A,B, 10, 9); ROUND2(B,C,D,A, 14, 13);
87 ROUND2(A,B,C,D, 3, 3); ROUND2(D,A,B,C, 7, 5);
88 ROUND2(C,D,A,B, 11, 9); ROUND2(B,C,D,A, 15, 13);
89  
90 ROUND3(A,B,C,D, 0, 3); ROUND3(D,A,B,C, 8, 9);
91 ROUND3(C,D,A,B, 4, 11); ROUND3(B,C,D,A, 12, 15);
92 ROUND3(A,B,C,D, 2, 3); ROUND3(D,A,B,C, 10, 9);
93 ROUND3(C,D,A,B, 6, 11); ROUND3(B,C,D,A, 14, 15);
94 ROUND3(A,B,C,D, 1, 3); ROUND3(D,A,B,C, 9, 9);
95 ROUND3(C,D,A,B, 5, 11); ROUND3(B,C,D,A, 13, 15);
96 ROUND3(A,B,C,D, 3, 3); ROUND3(D,A,B,C, 11, 9);
97 ROUND3(C,D,A,B, 7, 11); ROUND3(B,C,D,A, 15, 15);
98  
99 A += AA; B += BB; C += CC; D += DD;
100  
101 A &= 0xFFFFFFFF; B &= 0xFFFFFFFF;
102 C &= 0xFFFFFFFF; D &= 0xFFFFFFFF;
103  
104 for (j=0;j<16;j++)
105 X[j] = 0;
106 }
107  
108 static void copy64(guint32 *M, const unsigned char *in)
109 {
110 int i;
111  
112 for (i=0;i<16;i++)
113 M[i] = (in[i*4+3]<<24) | (in[i*4+2]<<16) |
114 (in[i*4+1]<<8) | (in[i*4+0]<<0);
115 }
116  
117 static void copy4(unsigned char *out, guint32 x)
118 {
119 out[0] = x&0xFF;
120 out[1] = (x>>8)&0xFF;
121 out[2] = (x>>16)&0xFF;
122 out[3] = (x>>24)&0xFF;
123 }
124  
125 /* produce a md4 message digest from data of length n bytes */
126 void crypt_md4(unsigned char *out, const unsigned char *in, size_t n)
127 {
128 unsigned char buf[128];
129 guint32 M[16];
130 guint32 b = (guint32)(n * 8);
131 int i;
132  
133 A = 0x67452301;
134 B = 0xefcdab89;
135 C = 0x98badcfe;
136 D = 0x10325476;
137  
138 while (n > 64) {
139 copy64(M, in);
140 mdfour64(M);
141 in += 64;
142 n -= 64;
143 }
144  
145 for (i=0;i<128;i++)
146 buf[i] = 0;
147 memcpy(buf, in, n);
148 buf[n] = 0x80;
149  
150 if (n <= 55) {
151 copy4(buf+56, b);
152 copy64(M, buf);
153 mdfour64(M);
154 } else {
155 copy4(buf+120, b);
156 copy64(M, buf);
157 mdfour64(M);
158 copy64(M, buf+64);
159 mdfour64(M);
160 }
161  
162 for (i=0;i<128;i++)
163 buf[i] = 0;
164 copy64(M, buf);
165  
166 copy4(out, A);
167 copy4(out+4, B);
168 copy4(out+8, C);
169 copy4(out+12, D);
170  
171 A = B = C = D = 0;
172 }
173  
174 /*
175 * Editor modelines - http://www.wireshark.org/tools/modelines.html
176 *
177 * Local variables:
178 * c-basic-offset: 8
179 * tab-width: 8
180 * indent-tabs-mode: t
181 * End:
182 *
183 * vi: set shiftwidth=8 tabstop=8 noexpandtab:
184 * :indentSize=8:tabSize=8:noTabs=false:
185 */