1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
|
//
// MD4Managed.cs - Message Digest 4 Managed Implementation
//
// Author:
// Sebastien Pouliot (sebastien@ximian.com)
//
// (C) 2003 Motus Technologies Inc. (http://www.motus.com)
// (C) 2004 Novell (http://www.novell.com)
//
using System;
namespace Mono.Security.Cryptography {
// References:
// a. RFC1320: The MD4 Message-Digest Algorithm
// http://www.ietf.org/rfc/rfc1320.txt
public class MD4Managed : MD4 {
private uint[] state;
private byte[] buffer;
private uint[] count;
private uint[] x;
private const int S11 = 3;
private const int S12 = 7;
private const int S13 = 11;
private const int S14 = 19;
private const int S21 = 3;
private const int S22 = 5;
private const int S23 = 9;
private const int S24 = 13;
private const int S31 = 3;
private const int S32 = 9;
private const int S33 = 11;
private const int S34 = 15;
private byte[] digest;
//--- constructor -----------------------------------------------------------
public MD4Managed () : base ()
{
// we allocate the context memory
state = new uint [4];
count = new uint [2];
buffer = new byte [64];
digest = new byte [16];
// the initialize our context
Initialize ();
}
public override void Initialize ()
{
count [0] = 0;
count [1] = 0;
state [0] = 0x67452301;
state [1] = 0xefcdab89;
state [2] = 0x98badcfe;
state [3] = 0x10325476;
// temporary buffer in MD4Transform that we don't want to keep allocate on each iteration
x = new uint [16];
Array.Clear (buffer, 0, 64);
}
protected override void HashCore (byte[] array, int ibStart, int cbSize)
{
/* Compute number of bytes mod 64 */
int index = (int) ((count [0] >> 3) & 0x3F);
/* Update number of bits */
count [0] += (uint) (cbSize << 3);
if (count [0] < (cbSize << 3))
count [1]++;
count [1] += (uint) (cbSize >> 29);
int partLen = 64 - index;
int i = 0;
/* Transform as many times as possible. */
if (cbSize >= partLen) {
//MD4_memcpy((POINTER)&context->buffer[index], (POINTER)input, partLen);
Buffer.BlockCopy (array, ibStart, buffer, index, partLen);
MD4Transform (state, buffer, 0);
for (i = partLen; i + 63 < cbSize; i += 64) {
// MD4Transform (context->state, &input[i]);
MD4Transform (state, array, i);
}
index = 0;
}
/* Buffer remaining input */
//MD4_memcpy ((POINTER)&context->buffer[index], (POINTER)&input[i], inputLen-i);
Buffer.BlockCopy (array, ibStart + i, buffer, index, (cbSize-i));
}
protected override byte[] HashFinal ()
{
/* Save number of bits */
byte[] bits = new byte [8];
Encode (bits, count);
/* Pad out to 56 mod 64. */
uint index = ((count [0] >> 3) & 0x3f);
int padLen = (int) ((index < 56) ? (56 - index) : (120 - index));
HashCore (Padding (padLen), 0, padLen);
/* Append length (before padding) */
HashCore (bits, 0, 8);
/* Store state in digest */
Encode (digest, state);
// Zeroize sensitive information.
Initialize ();
return digest;
}
//--- private methods ---------------------------------------------------
private byte[] Padding (int nLength)
{
if (nLength > 0) {
byte[] padding = new byte [nLength];
padding [0] = 0x80;
return padding;
}
return null;
}
/* F, G and H are basic MD4 functions. */
private uint F (uint x, uint y, uint z)
{
return (uint) (((x) & (y)) | ((~x) & (z)));
}
private uint G (uint x, uint y, uint z)
{
return (uint) (((x) & (y)) | ((x) & (z)) | ((y) & (z)));
}
private uint H (uint x, uint y, uint z)
{
return (uint) ((x) ^ (y) ^ (z));
}
/* ROTATE_LEFT rotates x left n bits. */
private uint ROL (uint x, byte n)
{
return (uint) (((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 */
private void FF (ref uint a, uint b, uint c, uint d, uint x, byte s)
{
a += F (b, c, d) + x;
a = ROL (a, s);
}
private void GG (ref uint a, uint b, uint c, uint d, uint x, byte s)
{
a += G (b, c, d) + x + 0x5a827999;
a = ROL (a, s);
}
private void HH (ref uint a, uint b, uint c, uint d, uint x, byte s)
{
a += H (b, c, d) + x + 0x6ed9eba1;
a = ROL (a, s);
}
private void Encode (byte[] output, uint[] input)
{
for (int i = 0, j = 0; j < output.Length; i++, j += 4) {
output [j] = (byte)(input [i] & 0xff);
output [j+1] = (byte)((input [i] >> 8) & 0xff);
output [j+2] = (byte)((input [i] >> 16) & 0xff);
output [j+3] = (byte)(input [i] >> 24);
}
}
private void Decode (uint[] output, byte[] input, int index)
{
for (int i = 0, j = index; i < output.Length; i++, j += 4) {
output [i] = (uint) ((input [j]) | (input [j+1] << 8) | (input [j+2] << 16) | (input [j+3] << 24));
}
}
private void MD4Transform (uint[] state, byte[] block, int index)
{
uint a = state [0];
uint b = state [1];
uint c = state [2];
uint d = state [3];
Decode (x, block, index);
/* Round 1 */
FF (ref a, b, c, d, x[ 0], S11); /* 1 */
FF (ref d, a, b, c, x[ 1], S12); /* 2 */
FF (ref c, d, a, b, x[ 2], S13); /* 3 */
FF (ref b, c, d, a, x[ 3], S14); /* 4 */
FF (ref a, b, c, d, x[ 4], S11); /* 5 */
FF (ref d, a, b, c, x[ 5], S12); /* 6 */
FF (ref c, d, a, b, x[ 6], S13); /* 7 */
FF (ref b, c, d, a, x[ 7], S14); /* 8 */
FF (ref a, b, c, d, x[ 8], S11); /* 9 */
FF (ref d, a, b, c, x[ 9], S12); /* 10 */
FF (ref c, d, a, b, x[10], S13); /* 11 */
FF (ref b, c, d, a, x[11], S14); /* 12 */
FF (ref a, b, c, d, x[12], S11); /* 13 */
FF (ref d, a, b, c, x[13], S12); /* 14 */
FF (ref c, d, a, b, x[14], S13); /* 15 */
FF (ref b, c, d, a, x[15], S14); /* 16 */
/* Round 2 */
GG (ref a, b, c, d, x[ 0], S21); /* 17 */
GG (ref d, a, b, c, x[ 4], S22); /* 18 */
GG (ref c, d, a, b, x[ 8], S23); /* 19 */
GG (ref b, c, d, a, x[12], S24); /* 20 */
GG (ref a, b, c, d, x[ 1], S21); /* 21 */
GG (ref d, a, b, c, x[ 5], S22); /* 22 */
GG (ref c, d, a, b, x[ 9], S23); /* 23 */
GG (ref b, c, d, a, x[13], S24); /* 24 */
GG (ref a, b, c, d, x[ 2], S21); /* 25 */
GG (ref d, a, b, c, x[ 6], S22); /* 26 */
GG (ref c, d, a, b, x[10], S23); /* 27 */
GG (ref b, c, d, a, x[14], S24); /* 28 */
GG (ref a, b, c, d, x[ 3], S21); /* 29 */
GG (ref d, a, b, c, x[ 7], S22); /* 30 */
GG (ref c, d, a, b, x[11], S23); /* 31 */
GG (ref b, c, d, a, x[15], S24); /* 32 */
HH (ref a, b, c, d, x[ 0], S31); /* 33 */
HH (ref d, a, b, c, x[ 8], S32); /* 34 */
HH (ref c, d, a, b, x[ 4], S33); /* 35 */
HH (ref b, c, d, a, x[12], S34); /* 36 */
HH (ref a, b, c, d, x[ 2], S31); /* 37 */
HH (ref d, a, b, c, x[10], S32); /* 38 */
HH (ref c, d, a, b, x[ 6], S33); /* 39 */
HH (ref b, c, d, a, x[14], S34); /* 40 */
HH (ref a, b, c, d, x[ 1], S31); /* 41 */
HH (ref d, a, b, c, x[ 9], S32); /* 42 */
HH (ref c, d, a, b, x[ 5], S33); /* 43 */
HH (ref b, c, d, a, x[13], S34); /* 44 */
HH (ref a, b, c, d, x[ 3], S31); /* 45 */
HH (ref d, a, b, c, x[11], S32); /* 46 */
HH (ref c, d, a, b, x[ 7], S33); /* 47 */
HH (ref b, c, d, a, x[15], S34); /* 48 */
state [0] += a;
state [1] += b;
state [2] += c;
state [3] += d;
/* Zeroize sensitive information. */
Array.Clear (x, 0, 16);
}
}
}
|