GNU libmicrohttpd  0.9.68
md5.c
Go to the documentation of this file.
1 /*
2  * This code implements the MD5 message-digest algorithm.
3  * The algorithm is due to Ron Rivest. This code was
4  * written by Colin Plumb in 1993, no copyright is claimed.
5  * This code is in the public domain; do with it what you wish.
6  *
7  * Equivalent code is available from RSA Data Security, Inc.
8  * This code has been tested against that, and is equivalent,
9  * except that you don't need to include two pages of legalese
10  * with every copy.
11  *
12  * To compute the message digest of a chunk of bytes, declare an
13  * MD5Context structure, pass it to MHD_MD5Init, call MHD_MD5Update as
14  * needed on buffers full of bytes, and then call MHD_MD5Final, which
15  * will fill a supplied 16-byte array with the digest.
16  */
17 
18 /* Based on OpenBSD modifications.
19  * Optimized by Karlson2k (Evgeny Grin). */
20 
21 #include "md5.h"
22 #include <string.h>
23 #ifdef HAVE_MEMORY_H
24 #include <memory.h>
25 #endif /* HAVE_MEMORY_H */
26 #include "mhd_bithelpers.h"
27 #include "mhd_assert.h"
28 
29 
36 void
37 MHD_MD5Init (void *ctx_)
38 {
39  struct MD5Context *ctx = ctx_;
40 
41  mhd_assert (ctx != NULL);
42  ctx->count = 0;
43  ctx->state[0] = 0x67452301;
44  ctx->state[1] = 0xefcdab89;
45  ctx->state[2] = 0x98badcfe;
46  ctx->state[3] = 0x10325476;
47 }
48 
49 static void
50 MD5Transform (uint32_t state[4],
51  const uint8_t block[MD5_BLOCK_SIZE]);
52 
53 
59 void
60 MHD_MD5Final (void *ctx_,
61  uint8_t digest[MD5_DIGEST_SIZE])
62 {
63  struct MD5Context *ctx = ctx_;
64  uint64_t count_bits;
65  size_t have_bytes;
66 
67  mhd_assert (ctx != NULL);
68  mhd_assert (digest != NULL);
69 
70  /* Convert count to 8 bytes in little endian order. */
71  have_bytes = (ctx->count) & (MD5_BLOCK_SIZE - 1);
72 
73  /* Pad data */
74  /* Buffer always have space for one byte or more. */
75  ctx->buffer[have_bytes++] = 0x80; /* First padding byte is 0x80 */
76 
77  if (MD5_BLOCK_SIZE - have_bytes < 8)
78  { /* Not enough space to put number of bits */
79  while (have_bytes < MD5_BLOCK_SIZE)
80  ctx->buffer[have_bytes++] = 0;
81  MD5Transform (ctx->state, ctx->buffer);
82  have_bytes = 0; /* Additional block */
83  }
84  /* Pad out to 56 */
85  memset (ctx->buffer + have_bytes, 0, MD5_BLOCK_SIZE - have_bytes - 8);
86 
87  /* Put number of bits */
88  count_bits = ctx->count << 3;
89  _MHD_PUT_64BIT_LE (ctx->buffer + 56, count_bits);
90  MD5Transform (ctx->state, ctx->buffer);
91 
92  /* Put digest in LE mode */
93  _MHD_PUT_32BIT_LE (digest, ctx->state[0]);
94  _MHD_PUT_32BIT_LE (digest + 4, ctx->state[1]);
95  _MHD_PUT_32BIT_LE (digest + 8, ctx->state[2]);
96  _MHD_PUT_32BIT_LE (digest + 12, ctx->state[3]);
97 
98  /* Erase buffer */
99  memset (ctx, 0, sizeof(*ctx));
100 }
101 
102 
107 #define MD5_BYTES_IN_WORD (32 / 8)
108 
109 /* The four core functions - F1 is optimized somewhat */
110 
111 /* #define F1(x, y, z) (x & y | ~x & z) */
112 #define F1(x, y, z) (z ^ (x & (y ^ z)))
113 #define F2(x, y, z) F1 (z, x, y)
114 #define F3(x, y, z) (x ^ y ^ z)
115 #define F4(x, y, z) (y ^ (x | ~z))
116 
117 /* This is the central step in the MD5 algorithm. */
118 #define MD5STEP(f, w, x, y, z, data, s) \
119  (w += f (x, y, z) + data, w = w << s | w >> (32 - s), w += x)
120 
126 static void
127 MD5Transform (uint32_t state[4],
128  const uint8_t block[MD5_BLOCK_SIZE])
129 {
130  uint32_t a, b, c, d;
131 
132 #if _MHD_BYTE_ORDER == _MHD_LITTLE_ENDIAN
133  const uint32_t *in = (const uint32_t *) block;
134 #else
135  uint32_t in[MD5_BLOCK_SIZE / MD5_BYTES_IN_WORD];
136  int i;
137 
138  for (i = 0; i < MD5_BLOCK_SIZE / MD5_BYTES_IN_WORD; i++)
139  {
140  in[i] = _MHD_GET_32BIT_LE (block + i * MD5_BYTES_IN_WORD);
141  }
142 #endif
143 
144  a = state[0];
145  b = state[1];
146  c = state[2];
147  d = state[3];
148 
149  MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7);
150  MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
151  MD5STEP (F1, c, d, a, b, in[2] + 0x242070db, 17);
152  MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
153  MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
154  MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62a, 12);
155  MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613, 17);
156  MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501, 22);
157  MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8, 7);
158  MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
159  MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
160  MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7be, 22);
161  MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122, 7);
162  MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193, 12);
163  MD5STEP (F1, c, d, a, b, in[14] + 0xa679438e, 17);
164  MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821, 22);
165 
166  MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562, 5);
167  MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340, 9);
168  MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51, 14);
169  MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
170  MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105d, 5);
171  MD5STEP (F2, d, a, b, c, in[10] + 0x02441453, 9);
172  MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
173  MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
174  MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
175  MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6, 9);
176  MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
177  MD5STEP (F2, b, c, d, a, in[8] + 0x455a14ed, 20);
178  MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
179  MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
180  MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9, 14);
181  MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
182 
183  MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942, 4);
184  MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681, 11);
185  MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
186  MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380c, 23);
187  MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44, 4);
188  MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
189  MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
190  MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
191  MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
192  MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
193  MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
194  MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05, 23);
195  MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
196  MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
197  MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
198  MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
199 
200  MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244, 6);
201  MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97, 10);
202  MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7, 15);
203  MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039, 21);
204  MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3, 6);
205  MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
206  MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47d, 15);
207  MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1, 21);
208  MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
209  MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
210  MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314, 15);
211  MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
212  MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82, 6);
213  MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235, 10);
214  MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
215  MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391, 21);
216 
217  state[0] += a;
218  state[1] += b;
219  state[2] += c;
220  state[3] += d;
221 }
222 
223 
228 void
229 MHD_MD5Update (void *ctx_,
230  const uint8_t *input,
231  size_t len)
232 {
233  struct MD5Context *ctx = ctx_;
234  size_t have, need;
235 
236  mhd_assert (ctx != NULL);
237  mhd_assert ((ctx != NULL) || (len == 0));
238 
239  /* Check how many bytes we already have and how many more we need. */
240  have = (size_t) ((ctx->count) & (MD5_BLOCK_SIZE - 1));
241  need = MD5_BLOCK_SIZE - have;
242 
243  /* Update bytecount */
244  ctx->count += (uint64_t) len;
245 
246  if (len >= need)
247  {
248  if (have != 0)
249  {
250  memcpy (ctx->buffer + have,
251  input,
252  need);
253  MD5Transform (ctx->state, ctx->buffer);
254  input += need;
255  len -= need;
256  have = 0;
257  }
258 
259  /* Process data in MD5_BLOCK_SIZE-byte chunks. */
260  while (len >= MD5_BLOCK_SIZE)
261  {
262  MD5Transform (ctx->state,
263  (const unsigned char *) input);
264  input += MD5_BLOCK_SIZE;
265  len -= MD5_BLOCK_SIZE;
266  }
267  }
268 
269  /* Handle any remaining bytes of data. */
270  if (0 != len)
271  memcpy (ctx->buffer + have,
272  input,
273  len);
274 }
275 
276 
277 /* end of md5.c */
#define _MHD_PUT_32BIT_LE(addr, value32)
#define F2(x, y, z)
Definition: md5.c:113
#define F1(x, y, z)
Definition: md5.c:112
uint8_t buffer[MD5_BLOCK_SIZE]
Definition: md5.h:33
void MHD_MD5Final(void *ctx_, uint8_t digest[MD5_DIGEST_SIZE])
Definition: md5.c:60
uint64_t count
Definition: md5.h:32
void MHD_MD5Init(void *ctx_)
Definition: md5.c:37
#define MD5_BYTES_IN_WORD
Definition: md5.c:107
#define MD5STEP(f, w, x, y, z, data, s)
Definition: md5.c:118
macros for mhd_assert()
#define F3(x, y, z)
Definition: md5.c:114
#define NULL
Definition: reason_phrase.c:30
void MHD_MD5Update(void *ctx_, const uint8_t *input, size_t len)
Definition: md5.c:229
#define F4(x, y, z)
Definition: md5.c:115
#define MD5_BLOCK_SIZE
Definition: md5.h:25
#define mhd_assert(CHK)
Definition: mhd_assert.h:39
Definition: md5.h:29
#define _MHD_GET_32BIT_LE(addr)
#define MD5_DIGEST_SIZE
Definition: md5.h:26
static void MD5Transform(uint32_t state[4], const uint8_t block[MD5_BLOCK_SIZE])
Definition: md5.c:127
uint32_t state[4]
Definition: md5.h:31
#define _MHD_PUT_64BIT_LE(addr, value64)
macros for bits manipulations