Browse code

core: Use Colin Plumb's MD5 implementation

Origin: http://anonscm.debian.org/gitweb/?p=dpkg/dpkg.git;a=summary
Author: Tzafrir Cohen <tzafrir@debian.org>

Borrowed the md5 code from dpkg instead of the existing md5.[ch]

This makes the code compatible with Debian packing rules and
restrictions regarding license for distribution

Daniel-Constantin Mierla authored on 02/08/2012 08:13:00
Showing 2 changed files
... ...
@@ -1,343 +1,252 @@
1
-/* 
2
- * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
3
- * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
4
- * rights reserved.
5
- * License to copy and use this software is granted provided that it
6
- * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
7
- * Algorithm" in all material mentioning or referencing this software
8
- * or this function.
9
- * 
10
- * License is also granted to make and use derivative works provided
11
- * that such works are identified as "derived from the RSA Data
12
- * Security, Inc. MD5 Message-Digest Algorithm" in all material
13
- * mentioning or referencing the derived work.
14
- * 
15
- * RSA Data Security, Inc. makes no representations concerning either
16
- * the merchantability of this software or the suitability of this
17
- * software for any particular purpose. It is provided "as is"
18
- * without express or implied warranty of any kind.
19
- * 
20
- * These notices must be retained in any copies of any part of this
21
- * documentation and/or software.
22
- */
23
-
24
-/*!
25
- * \file
26
- * \brief SIP-router core :: md5 hash support
27
- * \ingroup core
28
- * Module: \ref core
1
+/*	$OpenBSD: md5.c,v 1.7 2004/05/28 15:10:27 millert Exp $	*/
2
+
3
+/*
4
+ * This code implements the MD5 message-digest algorithm.
5
+ * The algorithm is due to Ron Rivest.  This code was
6
+ * written by Colin Plumb in 1993, no copyright is claimed.
7
+ * This code is in the public domain; do with it what you wish.
8
+ *
9
+ * Equivalent code is available from RSA Data Security, Inc.
10
+ * This code has been tested against that, and is equivalent,
11
+ * except that you don't need to include two pages of legalese
12
+ * with every copy.
13
+ *
14
+ * To compute the message digest of a chunk of bytes, declare an
15
+ * MD5Context structure, pass it to MD5Init, call MD5Update as
16
+ * needed on buffers full of bytes, and then call MD5Final, which
17
+ * will fill a supplied 16-byte array with the digest.
29 18
  */
30 19
 
20
+#include <config.h>
21
+#include <compat.h>
31 22
 
23
+#include <sys/types.h>
32 24
 #include <string.h>
33
-#include "md5.h"
34
-
35
-
36
-/**
37
- * \name Constants for MD5Transform routine
38
- */
39
-
40
-/*@{ */
41
-#define S11 7
42
-#define S12 12
43
-#define S13 17
44
-#define S14 22
45
-#define S21 5
46
-#define S22 9
47
-#define S23 14
48
-#define S24 20
49
-#define S31 4
50
-#define S32 11
51
-#define S33 16
52
-#define S34 23
53
-#define S41 6
54
-#define S42 10
55
-#define S43 15
56
-#define S44 21
57
-/*@} */
58 25
 
59
-static void MD5Transform(unsigned int [4], unsigned char [64]);
60
-static void Encode(unsigned char *, unsigned int *, unsigned int);
61
-static void Decode(unsigned int *, unsigned char *, unsigned int);
26
+#include "md5.h"
62 27
 
63
-static unsigned char PADDING[64] = {
64
-  0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
65
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
66
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
28
+#define PUT_64BIT_LE(cp, value) do {					\
29
+	(cp)[7] = (value) >> 56;					\
30
+	(cp)[6] = (value) >> 48;					\
31
+	(cp)[5] = (value) >> 40;					\
32
+	(cp)[4] = (value) >> 32;					\
33
+	(cp)[3] = (value) >> 24;					\
34
+	(cp)[2] = (value) >> 16;					\
35
+	(cp)[1] = (value) >> 8;						\
36
+	(cp)[0] = (value); } while (0)
37
+
38
+#define PUT_32BIT_LE(cp, value) do {					\
39
+	(cp)[3] = (value) >> 24;					\
40
+	(cp)[2] = (value) >> 16;					\
41
+	(cp)[1] = (value) >> 8;						\
42
+	(cp)[0] = (value); } while (0)
43
+
44
+static u_int8_t PADDING[MD5_BLOCK_LENGTH] = {
45
+	0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
46
+	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
47
+	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
67 48
 };
68 49
 
69
-/**
70
- * \name F, G, H and I are basic MD5 functions
71
- */
72
-
73
-/*@{ */
74
-#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
75
-#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
76
-#define H(x, y, z) ((x) ^ (y) ^ (z))
77
-#define I(x, y, z) ((y) ^ ((x) | (~z)))
78
-/*@} */
79
-
80
-/**
81
- * \brief ROTATE_LEFT rotates x left n bits
82
- */
83
-#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
84
-
85
-/**
86
- * \name FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4
87
- * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
88
- * Rotation is separate from addition to prevent recomputation.
89
- */
90
-
91
-/*@{ */
92
-#define FF(a, b, c, d, x, s, ac) { \
93
- (a) += F ((b), (c), (d)) + (x) + (unsigned int)(ac); \
94
- (a) = ROTATE_LEFT ((a), (s)); \
95
- (a) += (b); \
96
-  }
97
-#define GG(a, b, c, d, x, s, ac) { \
98
- (a) += G ((b), (c), (d)) + (x) + (unsigned int)(ac); \
99
- (a) = ROTATE_LEFT ((a), (s)); \
100
- (a) += (b); \
101
-  }
102
-#define HH(a, b, c, d, x, s, ac) { \
103
- (a) += H ((b), (c), (d)) + (x) + (unsigned int)(ac); \
104
- (a) = ROTATE_LEFT ((a), (s)); \
105
- (a) += (b); \
106
-  }
107
-#define II(a, b, c, d, x, s, ac) { \
108
- (a) += I ((b), (c), (d)) + (x) + (unsigned int)(ac); \
109
- (a) = ROTATE_LEFT ((a), (s)); \
110
- (a) += (b); \
111
-  }
112
-/*@} */
113
-
114
-/**
115
- * \brief MD5 context initialization
116
- * 
117
- * MD5 context initialization. Begins an MD5 operation, writing a new context.
118
- * \param context initialized context
50
+/*
51
+ * Start MD5 accumulation.  Set bit count to 0 and buffer to mysterious
52
+ * initialization constants.
119 53
  */
120
-void MD5Init (MD5_CTX *context)
54
+void
55
+MD5Init(MD5_CTX *ctx)
121 56
 {
122
-  context->count[0] = context->count[1] = 0;
123
-  /* Load magic initialization constants.
124
-*/
125
-  context->state[0] = 0x67452301;
126
-  context->state[1] = 0xefcdab89;
127
-  context->state[2] = 0x98badcfe;
128
-  context->state[3] = 0x10325476;
57
+	ctx->count = 0;
58
+	ctx->state[0] = 0x67452301;
59
+	ctx->state[1] = 0xefcdab89;
60
+	ctx->state[2] = 0x98badcfe;
61
+	ctx->state[3] = 0x10325476;
129 62
 }
130 63
 
131
-/**
132
- * \brief MD5 block update operation
133
- * 
134
- * MD5 block update operation. Continues an MD5 message-digest
135
- * operation, processing another message block, and updating the
136
- * context.
137
- * \param context context
138
- * \param input input block
139
- * \param inputLen length of input block
64
+/*
65
+ * Update context to reflect the concatenation of another buffer full
66
+ * of bytes.
140 67
  */
141
-void U_MD5Update (MD5_CTX *context, unsigned char *input, unsigned int inputLen)
68
+void
69
+MD5Update(MD5_CTX *ctx, const unsigned char *input, size_t len)
142 70
 {
143
-  unsigned int i, index, partLen;
144
-
145
-  /* Compute number of bytes mod 64 */
146
-  index = (unsigned int)((context->count[0] >> 3) & 0x3F);
147
-
148
-  /* Update number of bits */
149
-  if ((context->count[0] += ((unsigned int)inputLen << 3))
150
-
151
-   < ((unsigned int)inputLen << 3))
152
- context->count[1]++;
153
-  context->count[1] += ((unsigned int)inputLen >> 29);
154
-
155
-  partLen = 64 - index;
156
-
157
-  /* Transform as many times as possible.
158
-*/
159
-  if (inputLen >= partLen) {
160
- memcpy
161
-   ((unsigned char *)&context->buffer[index], (unsigned char *)input, partLen);
162
- MD5Transform (context->state, context->buffer);
163
-
164
- for (i = partLen; i + 63 < inputLen; i += 64)
165
-   MD5Transform (context->state, &input[i]);
166
-
167
- index = 0;
168
-  }
169
-  else
170
- i = 0;
171
-
172
-  /* Buffer remaining input */
173
-  memcpy
174
- ((unsigned char *)&context->buffer[index], (unsigned char *)&input[i],
175
-  inputLen-i);
71
+	size_t have, need;
72
+
73
+	/* Check how many bytes we already have and how many more we need. */
74
+	have = (size_t)((ctx->count >> 3) & (MD5_BLOCK_LENGTH - 1));
75
+	need = MD5_BLOCK_LENGTH - have;
76
+
77
+	/* Update bitcount */
78
+	ctx->count += (u_int64_t)len << 3;
79
+
80
+	if (len >= need) {
81
+		if (have != 0) {
82
+			memcpy(ctx->buffer + have, input, need);
83
+			MD5Transform(ctx->state, ctx->buffer);
84
+			input += need;
85
+			len -= need;
86
+			have = 0;
87
+		}
88
+
89
+		/* Process data in MD5_BLOCK_LENGTH-byte chunks. */
90
+		while (len >= MD5_BLOCK_LENGTH) {
91
+			MD5Transform(ctx->state, input);
92
+			input += MD5_BLOCK_LENGTH;
93
+			len -= MD5_BLOCK_LENGTH;
94
+		}
95
+	}
96
+
97
+	/* Handle any remaining bytes of data. */
98
+	if (len != 0)
99
+		memcpy(ctx->buffer + have, input, len);
176 100
 }
177 101
 
178
-/**
179
- * \brief MD5 finalization
180
- * 
181
- * MD5 finalization. Ends an MD5 message-digest operation, writing the
182
- * the message digest and zeroizing the context.
183
- * \param digest message digest
184
- * \param context context
102
+/*
103
+ * Pad pad to 64-byte boundary with the bit pattern
104
+ * 1 0* (64-bit count of bits processed, MSB-first)
185 105
  */
186
-void U_MD5Final (unsigned char digest[16], MD5_CTX *context)
106
+void
107
+MD5Pad(MD5_CTX *ctx)
187 108
 {
188
-  unsigned char bits[8];
189
-  unsigned int index, padLen;
190
-
191
-  /* Save number of bits */
192
-  Encode (bits, context->count, 8);
193
-
194
-  /* Pad out to 56 mod 64.
195
-*/
196
-  index = (unsigned int)((context->count[0] >> 3) & 0x3f);
197
-  padLen = (index < 56) ? (56 - index) : (120 - index);
198
-  U_MD5Update (context, PADDING, padLen);
199
-
200
-  /* Append length (before padding) */
201
-  U_MD5Update (context, bits, 8);
202
-
203
-  /* Store state in digest */
204
-  Encode (digest, context->state, 16);
205
-
206
-  /* Zeroize sensitive information.
207
-*/
208
-  memset ((unsigned char *)context, 0, sizeof (*context));
109
+	u_int8_t count[8];
110
+	size_t padlen;
111
+
112
+	/* Convert count to 8 bytes in little endian order. */
113
+	PUT_64BIT_LE(count, ctx->count);
114
+
115
+	/* Pad out to 56 mod 64. */
116
+	padlen = MD5_BLOCK_LENGTH -
117
+	    ((ctx->count >> 3) & (MD5_BLOCK_LENGTH - 1));
118
+	if (padlen < 1 + 8)
119
+		padlen += MD5_BLOCK_LENGTH;
120
+	MD5Update(ctx, PADDING, padlen - 8);		/* padlen - 8 <= 64 */
121
+	MD5Update(ctx, count, 8);
209 122
 }
210 123
 
211
-/**
212
- * \brief MD5 basic transformation
213
- * 
214
- * MD5 basic transformation. Transforms state based on block.
215
- * \param state transformed state
216
- * \param block block input for transformation
124
+/*
125
+ * Final wrapup--call MD5Pad, fill in digest and zero out ctx.
217 126
  */
218
-static void MD5Transform (unsigned int state[4], unsigned char block[64])
127
+void
128
+MD5Final(unsigned char digest[MD5_DIGEST_LENGTH], MD5_CTX *ctx)
219 129
 {
220
-  unsigned int a = state[0], b = state[1], c = state[2], d = state[3], x[16];
221
-
222
-  Decode (x, block, 64);
223
-
224
-  /* Round 1 */
225
-  FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
226
-  FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
227
-  FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
228
-  FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
229
-  FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
230
-  FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
231
-  FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
232
-  FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
233
-  FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
234
-  FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
235
-  FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
236
-  FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
237
-  FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
238
-  FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
239
-  FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
240
-  FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
241
-
242
- /* Round 2 */
243
-  GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
244
-  GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
245
-  GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
246
-  GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
247
-  GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
248
-  GG (d, a, b, c, x[10], S22,  0x2441453); /* 22 */
249
-  GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
250
-  GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
251
-  GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
252
-  GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
253
-  GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
254
-  GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
255
-  GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
256
-  GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
257
-  GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
258
-  GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
259
-
260
-  /* Round 3 */
261
-  HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
262
-  HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
263
-  HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
264
-  HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
265
-  HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
266
-  HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
267
-  HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
268
-  HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
269
-  HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
270
-  HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
271
-  HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
272
-  HH (b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
273
-  HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
274
-  HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
275
-  HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
276
-  HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
277
-
278
-  /* Round 4 */
279
-  II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
280
-  II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
281
-  II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
282
-  II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
283
-  II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
284
-  II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
285
-  II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
286
-  II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
287
-  II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
288
-  II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
289
-  II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
290
-  II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
291
-  II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
292
-  II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
293
-  II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
294
-  II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
130
+	int i;
131
+
132
+	MD5Pad(ctx);
133
+	if (digest != NULL) {
134
+		for (i = 0; i < 4; i++)
135
+			PUT_32BIT_LE(digest + i * 4, ctx->state[i]);
136
+		memset(ctx, 0, sizeof(*ctx));
137
+	}
138
+}
295 139
 
296
-  state[0] += a;
297
-  state[1] += b;
298
-  state[2] += c;
299
-  state[3] += d;
300 140
 
301
-  /* Zeroize sensitive information.
302
-*/
303
-  memset ((unsigned char *)x, 0, sizeof (x));
304
-}
141
+/* The four core functions - F1 is optimized somewhat */
305 142
 
306
-/**
307
- * \brief Encodes input (unsigned int) into output (unsigned char)
308
- * 
309
- * Encodes input (unsigned int) into output (unsigned char). Assumes len is
310
- * a multiple of 4.
311
- * \param output output character
312
- * \param input integer input
313
- * \param len length of output
314
- */
315
-static void Encode (unsigned char *output, unsigned int *input, unsigned int len)
316
-{
317
-  unsigned int i, j;
143
+/* #define F1(x, y, z) (x & y | ~x & z) */
144
+#define F1(x, y, z) (z ^ (x & (y ^ z)))
145
+#define F2(x, y, z) F1(z, x, y)
146
+#define F3(x, y, z) (x ^ y ^ z)
147
+#define F4(x, y, z) (y ^ (x | ~z))
318 148
 
319
-  for (i = 0, j = 0; j < len; i++, j += 4) {
320
-    output[j] = (unsigned char)(input[i] & 0xff);
321
-    output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
322
-    output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
323
-    output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
324
-  }
325
-}
149
+/* This is the central step in the MD5 algorithm. */
150
+#define MD5STEP(f, w, x, y, z, data, s) \
151
+	( w += f(x, y, z) + data,  w = w<<s | w>>(32-s),  w += x )
326 152
 
327
-/**
328
- * \brief Decodes input (unsigned char) into output (unsigned int)
329
- * 
330
- * Decodes input (unsigned char) into output (unsigned int). Assumes len is
331
- * a multiple of 4.
332
- * \param output output integer
333
- * \param input input character
334
- * \param len length of input
153
+/*
154
+ * The core of the MD5 algorithm, this alters an existing MD5 hash to
155
+ * reflect the addition of 16 longwords of new data.  MD5Update blocks
156
+ * the data and converts bytes into longwords for this routine.
335 157
  */
336
-static void Decode (unsigned int *output, unsigned char *input, unsigned int len)
158
+void
159
+MD5Transform(u_int32_t state[4], const u_int8_t block[MD5_BLOCK_LENGTH])
337 160
 {
338
-  unsigned int i, j;
339
-
340
-  for (i = 0, j = 0; j < len; i++, j += 4)
341
-    output[i] = ((unsigned int)input[j]) | (((unsigned int)input[j+1]) << 8) |
342
-      (((unsigned int)input[j+2]) << 16) | (((unsigned int)input[j+3]) << 24);
161
+	u_int32_t a, b, c, d, in[MD5_BLOCK_LENGTH / 4];
162
+
163
+#ifndef WORDS_BIGENDIAN
164
+	memcpy(in, block, sizeof(in));
165
+#else
166
+	for (a = 0; a < MD5_BLOCK_LENGTH / 4; a++) {
167
+		in[a] = (u_int32_t)(
168
+		    (u_int32_t)(block[a * 4 + 0]) |
169
+		    (u_int32_t)(block[a * 4 + 1]) <<  8 |
170
+		    (u_int32_t)(block[a * 4 + 2]) << 16 |
171
+		    (u_int32_t)(block[a * 4 + 3]) << 24);
172
+	}
173
+#endif
174
+
175
+	a = state[0];
176
+	b = state[1];
177
+	c = state[2];
178
+	d = state[3];
179
+
180
+	MD5STEP(F1, a, b, c, d, in[ 0] + 0xd76aa478,  7);
181
+	MD5STEP(F1, d, a, b, c, in[ 1] + 0xe8c7b756, 12);
182
+	MD5STEP(F1, c, d, a, b, in[ 2] + 0x242070db, 17);
183
+	MD5STEP(F1, b, c, d, a, in[ 3] + 0xc1bdceee, 22);
184
+	MD5STEP(F1, a, b, c, d, in[ 4] + 0xf57c0faf,  7);
185
+	MD5STEP(F1, d, a, b, c, in[ 5] + 0x4787c62a, 12);
186
+	MD5STEP(F1, c, d, a, b, in[ 6] + 0xa8304613, 17);
187
+	MD5STEP(F1, b, c, d, a, in[ 7] + 0xfd469501, 22);
188
+	MD5STEP(F1, a, b, c, d, in[ 8] + 0x698098d8,  7);
189
+	MD5STEP(F1, d, a, b, c, in[ 9] + 0x8b44f7af, 12);
190
+	MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
191
+	MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
192
+	MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122,  7);
193
+	MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
194
+	MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
195
+	MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
196
+
197
+	MD5STEP(F2, a, b, c, d, in[ 1] + 0xf61e2562,  5);
198
+	MD5STEP(F2, d, a, b, c, in[ 6] + 0xc040b340,  9);
199
+	MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
200
+	MD5STEP(F2, b, c, d, a, in[ 0] + 0xe9b6c7aa, 20);
201
+	MD5STEP(F2, a, b, c, d, in[ 5] + 0xd62f105d,  5);
202
+	MD5STEP(F2, d, a, b, c, in[10] + 0x02441453,  9);
203
+	MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
204
+	MD5STEP(F2, b, c, d, a, in[ 4] + 0xe7d3fbc8, 20);
205
+	MD5STEP(F2, a, b, c, d, in[ 9] + 0x21e1cde6,  5);
206
+	MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6,  9);
207
+	MD5STEP(F2, c, d, a, b, in[ 3] + 0xf4d50d87, 14);
208
+	MD5STEP(F2, b, c, d, a, in[ 8] + 0x455a14ed, 20);
209
+	MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905,  5);
210
+	MD5STEP(F2, d, a, b, c, in[ 2] + 0xfcefa3f8,  9);
211
+	MD5STEP(F2, c, d, a, b, in[ 7] + 0x676f02d9, 14);
212
+	MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
213
+
214
+	MD5STEP(F3, a, b, c, d, in[ 5] + 0xfffa3942,  4);
215
+	MD5STEP(F3, d, a, b, c, in[ 8] + 0x8771f681, 11);
216
+	MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
217
+	MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
218
+	MD5STEP(F3, a, b, c, d, in[ 1] + 0xa4beea44,  4);
219
+	MD5STEP(F3, d, a, b, c, in[ 4] + 0x4bdecfa9, 11);
220
+	MD5STEP(F3, c, d, a, b, in[ 7] + 0xf6bb4b60, 16);
221
+	MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
222
+	MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6,  4);
223
+	MD5STEP(F3, d, a, b, c, in[ 0] + 0xeaa127fa, 11);
224
+	MD5STEP(F3, c, d, a, b, in[ 3] + 0xd4ef3085, 16);
225
+	MD5STEP(F3, b, c, d, a, in[ 6] + 0x04881d05, 23);
226
+	MD5STEP(F3, a, b, c, d, in[ 9] + 0xd9d4d039,  4);
227
+	MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
228
+	MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
229
+	MD5STEP(F3, b, c, d, a, in[2 ] + 0xc4ac5665, 23);
230
+
231
+	MD5STEP(F4, a, b, c, d, in[ 0] + 0xf4292244,  6);
232
+	MD5STEP(F4, d, a, b, c, in[7 ] + 0x432aff97, 10);
233
+	MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
234
+	MD5STEP(F4, b, c, d, a, in[5 ] + 0xfc93a039, 21);
235
+	MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3,  6);
236
+	MD5STEP(F4, d, a, b, c, in[3 ] + 0x8f0ccc92, 10);
237
+	MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
238
+	MD5STEP(F4, b, c, d, a, in[1 ] + 0x85845dd1, 21);
239
+	MD5STEP(F4, a, b, c, d, in[8 ] + 0x6fa87e4f,  6);
240
+	MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
241
+	MD5STEP(F4, c, d, a, b, in[6 ] + 0xa3014314, 15);
242
+	MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
243
+	MD5STEP(F4, a, b, c, d, in[4 ] + 0xf7537e82,  6);
244
+	MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
245
+	MD5STEP(F4, c, d, a, b, in[2 ] + 0x2ad7d2bb, 15);
246
+	MD5STEP(F4, b, c, d, a, in[9 ] + 0xeb86d391, 21);
247
+
248
+	state[0] += a;
249
+	state[1] += b;
250
+	state[2] += c;
251
+	state[3] += d;
343 252
 }
... ...
@@ -1,102 +1,34 @@
1
+/*	$OpenBSD: md5.h,v 1.15 2004/05/03 17:30:14 millert Exp $	*/
2
+
1 3
 /*
2
- * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
3
- * rights reserved.
4
- * 
5
- * License to copy and use this software is granted provided that it
6
- * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
7
- * Algorithm" in all material mentioning or referencing this software
8
- * or this function.
9
- * 
10
- * License is also granted to make and use derivative works provided
11
- * that such works are identified as "derived from the RSA Data
12
- * Security, Inc. MD5 Message-Digest Algorithm" in all material
13
- * mentioning or referencing the derived work.
14
- * 
15
- * RSA Data Security, Inc. makes no representations concerning either
16
- * the merchantability of this software or the suitability of this
17
- * software for any particular purpose. It is provided "as is"
18
- * without express or implied warranty of any kind.
19
- * 
20
- * These notices must be retained in any copies of any part of this
21
- * documentation and/or software.
4
+ * This code implements the MD5 message-digest algorithm.
5
+ * The algorithm is due to Ron Rivest.  This code was
6
+ * written by Colin Plumb in 1993, no copyright is claimed.
7
+ * This code is in the public domain; do with it what you wish.
8
+ *
9
+ * Equivalent code is available from RSA Data Security, Inc.
10
+ * This code has been tested against that, and is equivalent,
11
+ * except that you don't need to include two pages of legalese
12
+ * with every copy.
22 13
  */
23 14
 
24
-/*!
25
- * \file
26
- * \brief SIP-router core :: md5 hash support
27
- * \ingroup core
28
- * Module: \ref core
29
- */
15
+#ifndef _MD5_H_
16
+#define _MD5_H_
30 17
 
31
-#ifndef MD5_H
32
-#define MD5_H
18
+#define	MD5_BLOCK_LENGTH		64
19
+#define	MD5_DIGEST_LENGTH		16
20
+#define	MD5_DIGEST_STRING_LENGTH	(MD5_DIGEST_LENGTH * 2 + 1)
33 21
 
34
-/**
35
- * \brief MD5 context
36
- */
37
-typedef struct {
38
-  unsigned int state[4];                                   /* state (ABCD) */
39
-  unsigned int count[2];        /* number of bits, modulo 2^64 (lsb first) */
40
-  unsigned char buffer[64];                         /* input buffer */
22
+typedef struct MD5Context {
23
+	u_int32_t state[4];			/* state */
24
+	u_int64_t count;			/* number of bits, mod 2^64 */
25
+	u_int8_t buffer[MD5_BLOCK_LENGTH];	/* input buffer */
41 26
 } MD5_CTX;
42 27
 
43
-/**
44
- * \brief MD5 context initialization
45
- * 
46
- * MD5 context initialization. Begins an MD5 operation, writing a new context.
47
- * \param context initialized context
48
- */
49
-void MD5Init (MD5_CTX *context);
50
-
51
-/**
52
- * \brief MD5 block update operation
53
- * 
54
- * MD5 block update operation. Continues an MD5 message-digest
55
- * operation, processing another message block, and updating the
56
- * context.
57
- * \param context context
58
- * \param input input block
59
- * \param inputLen length of input block
60
- */
61
-void U_MD5Update (MD5_CTX *context, unsigned char *input, unsigned int inputLen);
62
-
63
-  /**
64
- * \brief MD5 finalization
65
- * 
66
- * MD5 finalization. Ends an MD5 message-digest operation, writing the
67
- * the message digest and zeroizing the context.
68
- * \param digest message digest
69
- * \param context context
70
- */
71
-void U_MD5Final (unsigned char digest[16], MD5_CTX *context);
72
-
73
-/*!
74
- * \brief Small wrapper around MD5Update
75
- *
76
- * Small wrapper around MD5Update, because everybody uses this on 'str' types
77
- * \param context MD5 context
78
- * \param input input block
79
- * \param inputLen length of input block
80
- * \note please not use this in new code
81
- * \todo review and fix all wrong usage
82
- */
83
-static inline void MD5Update (MD5_CTX *context, char *input, unsigned int inputLen)
84
-{
85
-	return U_MD5Update(context, (unsigned char *)input, inputLen);
86
-}
87
-
88
-/*!
89
- * \brief Small wrapper around MD5Final
90
- *
91
- * Small wrapper around MD5Final, because everybody uses this on 'str' types
92
- * \param digest message digest
93
- * \param context MD5 context
94
- * \note please not use this in new code
95
- * \todo review and fix all wrong usage
96
- */
97
-static inline void MD5Final (char digest[16], MD5_CTX *context)
98
-{
99
-	U_MD5Final((unsigned char *)digest, context);
100
-}
28
+void	 MD5Init(MD5_CTX *);
29
+void	 MD5Update(MD5_CTX *, const u_int8_t *, size_t);
30
+void	 MD5Pad(MD5_CTX *);
31
+void	 MD5Final(u_int8_t [MD5_DIGEST_LENGTH], MD5_CTX *);
32
+void	 MD5Transform(u_int32_t [4], const u_int8_t [MD5_BLOCK_LENGTH]);
101 33
 
102
-#endif /* MD5_H */
34
+#endif /* _MD5_H_ */