1/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
2 * All rights reserved.
3 *
4 * This package is an SSL implementation written
5 * by Eric Young (eay@cryptsoft.com).
6 * The implementation was written so as to conform with Netscapes SSL.
7 *
8 * This library is free for commercial and non-commercial use as long as
9 * the following conditions are aheared to. The following conditions
10 * apply to all code found in this distribution, be it the RC4, RSA,
11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
12 * included with this distribution is covered by the same copyright terms
13 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
14 *
15 * Copyright remains Eric Young's, and as such any Copyright notices in
16 * the code are not to be removed.
17 * If this package is used in a product, Eric Young should be given attribution
18 * as the author of the parts of the library used.
19 * This can be in the form of a textual message at program startup or
20 * in documentation (online or textual) provided with the package.
21 *
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
24 * are met:
25 * 1. Redistributions of source code must retain the copyright
26 * notice, this list of conditions and the following disclaimer.
27 * 2. Redistributions in binary form must reproduce the above copyright
28 * notice, this list of conditions and the following disclaimer in the
29 * documentation and/or other materials provided with the distribution.
30 * 3. All advertising materials mentioning features or use of this software
31 * must display the following acknowledgement:
32 * "This product includes cryptographic software written by
33 * Eric Young (eay@cryptsoft.com)"
34 * The word 'cryptographic' can be left out if the rouines from the library
35 * being used are not cryptographic related :-).
36 * 4. If you include any Windows specific code (or a derivative thereof) from
37 * the apps directory (application code) you must include an acknowledgement:
38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
39 *
40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
50 * SUCH DAMAGE.
51 *
52 * The licence and distribution terms for any publically available version or
53 * derivative of this code cannot be changed. i.e. this code cannot simply be
54 * copied and put under another distribution licence
55 * [including the GNU Public Licence.] */
56
57#include <openssl/md5.h>
58
59#include <string.h>
60
61#include <openssl/mem.h>
62
63#include "internal.h"
64#include "../../internal.h"
65
66
67uint8_t *MD5(const uint8_t *data, size_t len, uint8_t out[MD5_DIGEST_LENGTH]) {
68 MD5_CTX ctx;
69 MD5_Init(&ctx);
70 MD5_Update(&ctx, data, len);
71 MD5_Final(out, &ctx);
72
73 return out;
74}
75
76int MD5_Init(MD5_CTX *md5) {
77 OPENSSL_memset(md5, 0, sizeof(MD5_CTX));
78 md5->h[0] = 0x67452301UL;
79 md5->h[1] = 0xefcdab89UL;
80 md5->h[2] = 0x98badcfeUL;
81 md5->h[3] = 0x10325476UL;
82 return 1;
83}
84
85#if defined(MD5_ASM)
86#define md5_block_data_order md5_block_asm_data_order
87#else
88static void md5_block_data_order(uint32_t *state, const uint8_t *data,
89 size_t num);
90#endif
91
92
93#define DATA_ORDER_IS_LITTLE_ENDIAN
94
95#define HASH_CTX MD5_CTX
96#define HASH_CBLOCK 64
97#define HASH_DIGEST_LENGTH 16
98#define HASH_UPDATE MD5_Update
99#define HASH_TRANSFORM MD5_Transform
100#define HASH_FINAL MD5_Final
101#define HASH_MAKE_STRING(c, s) \
102 do { \
103 uint32_t ll; \
104 ll = (c)->h[0]; \
105 HOST_l2c(ll, (s)); \
106 ll = (c)->h[1]; \
107 HOST_l2c(ll, (s)); \
108 ll = (c)->h[2]; \
109 HOST_l2c(ll, (s)); \
110 ll = (c)->h[3]; \
111 HOST_l2c(ll, (s)); \
112 } while (0)
113#define HASH_BLOCK_DATA_ORDER md5_block_data_order
114
115#include "../digest/md32_common.h"
116
117// As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
118// simplified to the code below. Wei attributes these optimizations
119// to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
120#define F(b, c, d) ((((c) ^ (d)) & (b)) ^ (d))
121#define G(b, c, d) ((((b) ^ (c)) & (d)) ^ (c))
122#define H(b, c, d) ((b) ^ (c) ^ (d))
123#define I(b, c, d) (((~(d)) | (b)) ^ (c))
124
125#define ROTATE(a, n) (((a) << (n)) | ((a) >> (32 - (n))))
126
127#define R0(a, b, c, d, k, s, t) \
128 do { \
129 (a) += ((k) + (t) + F((b), (c), (d))); \
130 (a) = ROTATE(a, s); \
131 (a) += (b); \
132 } while (0)
133
134#define R1(a, b, c, d, k, s, t) \
135 do { \
136 (a) += ((k) + (t) + G((b), (c), (d))); \
137 (a) = ROTATE(a, s); \
138 (a) += (b); \
139 } while (0)
140
141#define R2(a, b, c, d, k, s, t) \
142 do { \
143 (a) += ((k) + (t) + H((b), (c), (d))); \
144 (a) = ROTATE(a, s); \
145 (a) += (b); \
146 } while (0)
147
148#define R3(a, b, c, d, k, s, t) \
149 do { \
150 (a) += ((k) + (t) + I((b), (c), (d))); \
151 (a) = ROTATE(a, s); \
152 (a) += (b); \
153 } while (0)
154
155#ifndef MD5_ASM
156#ifdef X
157#undef X
158#endif
159static void md5_block_data_order(uint32_t *state, const uint8_t *data,
160 size_t num) {
161 uint32_t A, B, C, D, l;
162 uint32_t XX0, XX1, XX2, XX3, XX4, XX5, XX6, XX7, XX8, XX9, XX10, XX11, XX12,
163 XX13, XX14, XX15;
164#define X(i) XX##i
165
166 A = state[0];
167 B = state[1];
168 C = state[2];
169 D = state[3];
170
171 for (; num--;) {
172 HOST_c2l(data, l);
173 X(0) = l;
174 HOST_c2l(data, l);
175 X(1) = l;
176 // Round 0
177 R0(A, B, C, D, X(0), 7, 0xd76aa478L);
178 HOST_c2l(data, l);
179 X(2) = l;
180 R0(D, A, B, C, X(1), 12, 0xe8c7b756L);
181 HOST_c2l(data, l);
182 X(3) = l;
183 R0(C, D, A, B, X(2), 17, 0x242070dbL);
184 HOST_c2l(data, l);
185 X(4) = l;
186 R0(B, C, D, A, X(3), 22, 0xc1bdceeeL);
187 HOST_c2l(data, l);
188 X(5) = l;
189 R0(A, B, C, D, X(4), 7, 0xf57c0fafL);
190 HOST_c2l(data, l);
191 X(6) = l;
192 R0(D, A, B, C, X(5), 12, 0x4787c62aL);
193 HOST_c2l(data, l);
194 X(7) = l;
195 R0(C, D, A, B, X(6), 17, 0xa8304613L);
196 HOST_c2l(data, l);
197 X(8) = l;
198 R0(B, C, D, A, X(7), 22, 0xfd469501L);
199 HOST_c2l(data, l);
200 X(9) = l;
201 R0(A, B, C, D, X(8), 7, 0x698098d8L);
202 HOST_c2l(data, l);
203 X(10) = l;
204 R0(D, A, B, C, X(9), 12, 0x8b44f7afL);
205 HOST_c2l(data, l);
206 X(11) = l;
207 R0(C, D, A, B, X(10), 17, 0xffff5bb1L);
208 HOST_c2l(data, l);
209 X(12) = l;
210 R0(B, C, D, A, X(11), 22, 0x895cd7beL);
211 HOST_c2l(data, l);
212 X(13) = l;
213 R0(A, B, C, D, X(12), 7, 0x6b901122L);
214 HOST_c2l(data, l);
215 X(14) = l;
216 R0(D, A, B, C, X(13), 12, 0xfd987193L);
217 HOST_c2l(data, l);
218 X(15) = l;
219 R0(C, D, A, B, X(14), 17, 0xa679438eL);
220 R0(B, C, D, A, X(15), 22, 0x49b40821L);
221 // Round 1
222 R1(A, B, C, D, X(1), 5, 0xf61e2562L);
223 R1(D, A, B, C, X(6), 9, 0xc040b340L);
224 R1(C, D, A, B, X(11), 14, 0x265e5a51L);
225 R1(B, C, D, A, X(0), 20, 0xe9b6c7aaL);
226 R1(A, B, C, D, X(5), 5, 0xd62f105dL);
227 R1(D, A, B, C, X(10), 9, 0x02441453L);
228 R1(C, D, A, B, X(15), 14, 0xd8a1e681L);
229 R1(B, C, D, A, X(4), 20, 0xe7d3fbc8L);
230 R1(A, B, C, D, X(9), 5, 0x21e1cde6L);
231 R1(D, A, B, C, X(14), 9, 0xc33707d6L);
232 R1(C, D, A, B, X(3), 14, 0xf4d50d87L);
233 R1(B, C, D, A, X(8), 20, 0x455a14edL);
234 R1(A, B, C, D, X(13), 5, 0xa9e3e905L);
235 R1(D, A, B, C, X(2), 9, 0xfcefa3f8L);
236 R1(C, D, A, B, X(7), 14, 0x676f02d9L);
237 R1(B, C, D, A, X(12), 20, 0x8d2a4c8aL);
238 // Round 2
239 R2(A, B, C, D, X(5), 4, 0xfffa3942L);
240 R2(D, A, B, C, X(8), 11, 0x8771f681L);
241 R2(C, D, A, B, X(11), 16, 0x6d9d6122L);
242 R2(B, C, D, A, X(14), 23, 0xfde5380cL);
243 R2(A, B, C, D, X(1), 4, 0xa4beea44L);
244 R2(D, A, B, C, X(4), 11, 0x4bdecfa9L);
245 R2(C, D, A, B, X(7), 16, 0xf6bb4b60L);
246 R2(B, C, D, A, X(10), 23, 0xbebfbc70L);
247 R2(A, B, C, D, X(13), 4, 0x289b7ec6L);
248 R2(D, A, B, C, X(0), 11, 0xeaa127faL);
249 R2(C, D, A, B, X(3), 16, 0xd4ef3085L);
250 R2(B, C, D, A, X(6), 23, 0x04881d05L);
251 R2(A, B, C, D, X(9), 4, 0xd9d4d039L);
252 R2(D, A, B, C, X(12), 11, 0xe6db99e5L);
253 R2(C, D, A, B, X(15), 16, 0x1fa27cf8L);
254 R2(B, C, D, A, X(2), 23, 0xc4ac5665L);
255 // Round 3
256 R3(A, B, C, D, X(0), 6, 0xf4292244L);
257 R3(D, A, B, C, X(7), 10, 0x432aff97L);
258 R3(C, D, A, B, X(14), 15, 0xab9423a7L);
259 R3(B, C, D, A, X(5), 21, 0xfc93a039L);
260 R3(A, B, C, D, X(12), 6, 0x655b59c3L);
261 R3(D, A, B, C, X(3), 10, 0x8f0ccc92L);
262 R3(C, D, A, B, X(10), 15, 0xffeff47dL);
263 R3(B, C, D, A, X(1), 21, 0x85845dd1L);
264 R3(A, B, C, D, X(8), 6, 0x6fa87e4fL);
265 R3(D, A, B, C, X(15), 10, 0xfe2ce6e0L);
266 R3(C, D, A, B, X(6), 15, 0xa3014314L);
267 R3(B, C, D, A, X(13), 21, 0x4e0811a1L);
268 R3(A, B, C, D, X(4), 6, 0xf7537e82L);
269 R3(D, A, B, C, X(11), 10, 0xbd3af235L);
270 R3(C, D, A, B, X(2), 15, 0x2ad7d2bbL);
271 R3(B, C, D, A, X(9), 21, 0xeb86d391L);
272
273 A = state[0] += A;
274 B = state[1] += B;
275 C = state[2] += C;
276 D = state[3] += D;
277 }
278}
279#undef X
280#endif
281
282#undef DATA_ORDER_IS_LITTLE_ENDIAN
283#undef HASH_CTX
284#undef HASH_CBLOCK
285#undef HASH_DIGEST_LENGTH
286#undef HASH_UPDATE
287#undef HASH_TRANSFORM
288#undef HASH_FINAL
289#undef HASH_MAKE_STRING
290#undef HASH_BLOCK_DATA_ORDER
291#undef F
292#undef G
293#undef H
294#undef I
295#undef ROTATE
296#undef R0
297#undef R1
298#undef R2
299#undef R3
300#undef HOST_c2l
301#undef HOST_l2c
302