2 * Copyright (C) 2014 Felix Fietkau <nbd@openwrt.org>
4 * Permission to use, copy, modify, and/or distribute this software for any
5 * purpose with or without fee is hereby granted, provided that the above
6 * copyright notice and this permission notice appear in all copies.
8 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
9 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
10 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
11 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
12 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
13 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
14 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17 * This is an OpenSSL-compatible implementation of the RSA Data Security, Inc.
18 * MD5 Message-Digest Algorithm (RFC 1321).
21 * http://openwall.info/wiki/people/solar/software/public-domain-source-code/md5
24 * Alexander Peslyak, better known as Solar Designer <solar at openwall.com>
26 * This software was written by Alexander Peslyak in 2001. No copyright is
27 * claimed, and the software is hereby placed in the public domain.
28 * In case this attempt to disclaim copyright and place the software in the
29 * public domain is deemed null and void, then the software is
30 * Copyright (c) 2001 Alexander Peslyak and it is hereby released to the
31 * general public under the following terms:
33 * Redistribution and use in source and binary forms, with or without
34 * modification, are permitted.
36 * There's ABSOLUTELY NO WARRANTY, express or implied.
38 * (This is a heavily cut-down "BSD license".)
40 * This differs from Colin Plumb's older public domain implementation in that
41 * no exactly 32-bit integer data type is required (any 32-bit or wider
42 * unsigned integer data type will do), there's no compile-time endianness
43 * configuration, and the function prototypes match OpenSSL's. No code from
44 * Colin Plumb's implementation has been reused; this comment merely compares
45 * the properties of the two independent implementations.
47 * The primary goals of this implementation are portability and ease of use.
48 * It is meant to be fast, but not as fast as possible. Some known
49 * optimizations are not included to reduce source code size and avoid
50 * compile-time configuration.
59 * The basic MD5 functions.
61 * F and G are optimized compared to their RFC 1321 definitions for
62 * architectures that lack an AND-NOT instruction, just like in Colin Plumb's
65 #define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
66 #define G(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
67 #define H(x, y, z) (((x) ^ (y)) ^ (z))
68 #define H2(x, y, z) ((x) ^ ((y) ^ (z)))
69 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
72 * The MD5 transformation for all four rounds.
74 #define STEP(f, a, b, c, d, x, t, s) \
75 (a) += f((b), (c), (d)) + (x) + (t); \
76 (a) = (((a) << (s)) | (((a) & 0xffffffff) >> (32 - (s)))); \
80 * SET reads 4 input bytes in little-endian byte order and stores them
81 * in a properly aligned word in host byte order.
83 #if __BYTE_ORDER == __LITTLE_ENDIAN
85 (*(uint32_t *)&ptr[(n) * 4])
91 (uint32_t)ptr[(n) * 4] | \
92 ((uint32_t)ptr[(n) * 4 + 1] << 8) | \
93 ((uint32_t)ptr[(n) * 4 + 2] << 16) | \
94 ((uint32_t)ptr[(n) * 4 + 3] << 24))
100 * This processes one or more 64-byte data blocks, but does NOT update
101 * the bit counters. There are no alignment requirements.
103 static const void *body(md5_ctx_t
*ctx
, const void *data
, unsigned long size
)
105 const unsigned char *ptr
;
107 uint32_t saved_a
, saved_b
, saved_c
, saved_d
;
108 #if __BYTE_ORDER != __LITTLE_ENDIAN
112 ptr
= (const unsigned char *)data
;
126 STEP(F
, a
, b
, c
, d
, SET(0), 0xd76aa478, 7)
127 STEP(F
, d
, a
, b
, c
, SET(1), 0xe8c7b756, 12)
128 STEP(F
, c
, d
, a
, b
, SET(2), 0x242070db, 17)
129 STEP(F
, b
, c
, d
, a
, SET(3), 0xc1bdceee, 22)
130 STEP(F
, a
, b
, c
, d
, SET(4), 0xf57c0faf, 7)
131 STEP(F
, d
, a
, b
, c
, SET(5), 0x4787c62a, 12)
132 STEP(F
, c
, d
, a
, b
, SET(6), 0xa8304613, 17)
133 STEP(F
, b
, c
, d
, a
, SET(7), 0xfd469501, 22)
134 STEP(F
, a
, b
, c
, d
, SET(8), 0x698098d8, 7)
135 STEP(F
, d
, a
, b
, c
, SET(9), 0x8b44f7af, 12)
136 STEP(F
, c
, d
, a
, b
, SET(10), 0xffff5bb1, 17)
137 STEP(F
, b
, c
, d
, a
, SET(11), 0x895cd7be, 22)
138 STEP(F
, a
, b
, c
, d
, SET(12), 0x6b901122, 7)
139 STEP(F
, d
, a
, b
, c
, SET(13), 0xfd987193, 12)
140 STEP(F
, c
, d
, a
, b
, SET(14), 0xa679438e, 17)
141 STEP(F
, b
, c
, d
, a
, SET(15), 0x49b40821, 22)
144 STEP(G
, a
, b
, c
, d
, GET(1), 0xf61e2562, 5)
145 STEP(G
, d
, a
, b
, c
, GET(6), 0xc040b340, 9)
146 STEP(G
, c
, d
, a
, b
, GET(11), 0x265e5a51, 14)
147 STEP(G
, b
, c
, d
, a
, GET(0), 0xe9b6c7aa, 20)
148 STEP(G
, a
, b
, c
, d
, GET(5), 0xd62f105d, 5)
149 STEP(G
, d
, a
, b
, c
, GET(10), 0x02441453, 9)
150 STEP(G
, c
, d
, a
, b
, GET(15), 0xd8a1e681, 14)
151 STEP(G
, b
, c
, d
, a
, GET(4), 0xe7d3fbc8, 20)
152 STEP(G
, a
, b
, c
, d
, GET(9), 0x21e1cde6, 5)
153 STEP(G
, d
, a
, b
, c
, GET(14), 0xc33707d6, 9)
154 STEP(G
, c
, d
, a
, b
, GET(3), 0xf4d50d87, 14)
155 STEP(G
, b
, c
, d
, a
, GET(8), 0x455a14ed, 20)
156 STEP(G
, a
, b
, c
, d
, GET(13), 0xa9e3e905, 5)
157 STEP(G
, d
, a
, b
, c
, GET(2), 0xfcefa3f8, 9)
158 STEP(G
, c
, d
, a
, b
, GET(7), 0x676f02d9, 14)
159 STEP(G
, b
, c
, d
, a
, GET(12), 0x8d2a4c8a, 20)
162 STEP(H
, a
, b
, c
, d
, GET(5), 0xfffa3942, 4)
163 STEP(H2
, d
, a
, b
, c
, GET(8), 0x8771f681, 11)
164 STEP(H
, c
, d
, a
, b
, GET(11), 0x6d9d6122, 16)
165 STEP(H2
, b
, c
, d
, a
, GET(14), 0xfde5380c, 23)
166 STEP(H
, a
, b
, c
, d
, GET(1), 0xa4beea44, 4)
167 STEP(H2
, d
, a
, b
, c
, GET(4), 0x4bdecfa9, 11)
168 STEP(H
, c
, d
, a
, b
, GET(7), 0xf6bb4b60, 16)
169 STEP(H2
, b
, c
, d
, a
, GET(10), 0xbebfbc70, 23)
170 STEP(H
, a
, b
, c
, d
, GET(13), 0x289b7ec6, 4)
171 STEP(H2
, d
, a
, b
, c
, GET(0), 0xeaa127fa, 11)
172 STEP(H
, c
, d
, a
, b
, GET(3), 0xd4ef3085, 16)
173 STEP(H2
, b
, c
, d
, a
, GET(6), 0x04881d05, 23)
174 STEP(H
, a
, b
, c
, d
, GET(9), 0xd9d4d039, 4)
175 STEP(H2
, d
, a
, b
, c
, GET(12), 0xe6db99e5, 11)
176 STEP(H
, c
, d
, a
, b
, GET(15), 0x1fa27cf8, 16)
177 STEP(H2
, b
, c
, d
, a
, GET(2), 0xc4ac5665, 23)
180 STEP(I
, a
, b
, c
, d
, GET(0), 0xf4292244, 6)
181 STEP(I
, d
, a
, b
, c
, GET(7), 0x432aff97, 10)
182 STEP(I
, c
, d
, a
, b
, GET(14), 0xab9423a7, 15)
183 STEP(I
, b
, c
, d
, a
, GET(5), 0xfc93a039, 21)
184 STEP(I
, a
, b
, c
, d
, GET(12), 0x655b59c3, 6)
185 STEP(I
, d
, a
, b
, c
, GET(3), 0x8f0ccc92, 10)
186 STEP(I
, c
, d
, a
, b
, GET(10), 0xffeff47d, 15)
187 STEP(I
, b
, c
, d
, a
, GET(1), 0x85845dd1, 21)
188 STEP(I
, a
, b
, c
, d
, GET(8), 0x6fa87e4f, 6)
189 STEP(I
, d
, a
, b
, c
, GET(15), 0xfe2ce6e0, 10)
190 STEP(I
, c
, d
, a
, b
, GET(6), 0xa3014314, 15)
191 STEP(I
, b
, c
, d
, a
, GET(13), 0x4e0811a1, 21)
192 STEP(I
, a
, b
, c
, d
, GET(4), 0xf7537e82, 6)
193 STEP(I
, d
, a
, b
, c
, GET(11), 0xbd3af235, 10)
194 STEP(I
, c
, d
, a
, b
, GET(2), 0x2ad7d2bb, 15)
195 STEP(I
, b
, c
, d
, a
, GET(9), 0xeb86d391, 21)
203 } while (size
-= 64);
213 void md5_begin(md5_ctx_t
*ctx
)
224 void md5_hash(const void *data
, size_t size
, md5_ctx_t
*ctx
)
227 unsigned long used
, available
;
230 if ((ctx
->lo
= (saved_lo
+ size
) & 0x1fffffff) < saved_lo
)
232 ctx
->hi
+= size
>> 29;
234 used
= saved_lo
& 0x3f;
237 available
= 64 - used
;
239 if (size
< available
) {
240 memcpy(&ctx
->buffer
[used
], data
, size
);
244 memcpy(&ctx
->buffer
[used
], data
, available
);
245 data
= (const unsigned char *)data
+ available
;
247 body(ctx
, ctx
->buffer
, 64);
251 data
= body(ctx
, data
, size
& ~((size_t) 0x3f));
255 memcpy(ctx
->buffer
, data
, size
);
258 void md5_end(void *resbuf
, md5_ctx_t
*ctx
)
260 unsigned char *result
= resbuf
;
261 unsigned long used
, available
;
263 used
= ctx
->lo
& 0x3f;
265 ctx
->buffer
[used
++] = 0x80;
267 available
= 64 - used
;
270 memset(&ctx
->buffer
[used
], 0, available
);
271 body(ctx
, ctx
->buffer
, 64);
276 memset(&ctx
->buffer
[used
], 0, available
- 8);
279 ctx
->buffer
[56] = ctx
->lo
;
280 ctx
->buffer
[57] = ctx
->lo
>> 8;
281 ctx
->buffer
[58] = ctx
->lo
>> 16;
282 ctx
->buffer
[59] = ctx
->lo
>> 24;
283 ctx
->buffer
[60] = ctx
->hi
;
284 ctx
->buffer
[61] = ctx
->hi
>> 8;
285 ctx
->buffer
[62] = ctx
->hi
>> 16;
286 ctx
->buffer
[63] = ctx
->hi
>> 24;
288 body(ctx
, ctx
->buffer
, 64);
291 result
[1] = ctx
->a
>> 8;
292 result
[2] = ctx
->a
>> 16;
293 result
[3] = ctx
->a
>> 24;
295 result
[5] = ctx
->b
>> 8;
296 result
[6] = ctx
->b
>> 16;
297 result
[7] = ctx
->b
>> 24;
299 result
[9] = ctx
->c
>> 8;
300 result
[10] = ctx
->c
>> 16;
301 result
[11] = ctx
->c
>> 24;
303 result
[13] = ctx
->d
>> 8;
304 result
[14] = ctx
->d
>> 16;
305 result
[15] = ctx
->d
>> 24;
307 memset(ctx
, 0, sizeof(*ctx
));
310 int md5sum(char *file
, void *md5_buf
)
317 f
= fopen(file
, "r");
323 int len
= fread(buf
, 1, sizeof(buf
), f
);
327 md5_hash(buf
, len
, &ctx
);
331 md5_end(md5_buf
, &ctx
);