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/md4.h>
58
59 #include <stdlib.h>
60 #include <string.h>
61
62 #include "../../internal.h"
63
64
MD4(const uint8_t * data,size_t len,uint8_t * out)65 uint8_t *MD4(const uint8_t *data, size_t len, uint8_t *out) {
66 MD4_CTX ctx;
67 MD4_Init(&ctx);
68 MD4_Update(&ctx, data, len);
69 MD4_Final(out, &ctx);
70
71 return out;
72 }
73
74 // Implemented from RFC1186 The MD4 Message-Digest Algorithm.
75
MD4_Init(MD4_CTX * md4)76 int MD4_Init(MD4_CTX *md4) {
77 OPENSSL_memset(md4, 0, sizeof(MD4_CTX));
78 md4->h[0] = 0x67452301UL;
79 md4->h[1] = 0xefcdab89UL;
80 md4->h[2] = 0x98badcfeUL;
81 md4->h[3] = 0x10325476UL;
82 return 1;
83 }
84
85 void md4_block_data_order(uint32_t *state, const uint8_t *data, size_t num);
86
87 #define DATA_ORDER_IS_LITTLE_ENDIAN
88
89 #define HASH_CTX MD4_CTX
90 #define HASH_CBLOCK 64
91 #define HASH_UPDATE MD4_Update
92 #define HASH_TRANSFORM MD4_Transform
93 #define HASH_FINAL MD4_Final
94 #define HASH_MAKE_STRING(c, s) \
95 do { \
96 uint32_t ll; \
97 ll = (c)->h[0]; \
98 HOST_l2c(ll, (s)); \
99 ll = (c)->h[1]; \
100 HOST_l2c(ll, (s)); \
101 ll = (c)->h[2]; \
102 HOST_l2c(ll, (s)); \
103 ll = (c)->h[3]; \
104 HOST_l2c(ll, (s)); \
105 } while (0)
106 #define HASH_BLOCK_DATA_ORDER md4_block_data_order
107
108 #include "../digest/md32_common.h"
109
110 // As pointed out by Wei Dai <weidai@eskimo.com>, the above can be
111 // simplified to the code below. Wei attributes these optimizations
112 // to Peter Gutmann's SHS code, and he attributes it to Rich Schroeppel.
113 #define F(b, c, d) ((((c) ^ (d)) & (b)) ^ (d))
114 #define G(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
115 #define H(b, c, d) ((b) ^ (c) ^ (d))
116
117 #define ROTATE(a, n) (((a) << (n)) | ((a) >> (32 - (n))))
118
119 #define R0(a, b, c, d, k, s, t) \
120 do { \
121 (a) += ((k) + (t) + F((b), (c), (d))); \
122 (a) = ROTATE(a, s); \
123 } while (0)
124
125 #define R1(a, b, c, d, k, s, t) \
126 do { \
127 (a) += ((k) + (t) + G((b), (c), (d))); \
128 (a) = ROTATE(a, s); \
129 } while (0)
130
131 #define R2(a, b, c, d, k, s, t) \
132 do { \
133 (a) += ((k) + (t) + H((b), (c), (d))); \
134 (a) = ROTATE(a, s); \
135 } while (0)
136
md4_block_data_order(uint32_t * state,const uint8_t * data,size_t num)137 void md4_block_data_order(uint32_t *state, const uint8_t *data, size_t num) {
138 uint32_t A, B, C, D, l;
139 uint32_t X0, X1, X2, X3, X4, X5, X6, X7, X8, X9, X10, X11, X12, X13, X14, X15;
140
141 A = state[0];
142 B = state[1];
143 C = state[2];
144 D = state[3];
145
146 for (; num--;) {
147 HOST_c2l(data, l);
148 X0 = l;
149 HOST_c2l(data, l);
150 X1 = l;
151 // Round 0
152 R0(A, B, C, D, X0, 3, 0);
153 HOST_c2l(data, l);
154 X2 = l;
155 R0(D, A, B, C, X1, 7, 0);
156 HOST_c2l(data, l);
157 X3 = l;
158 R0(C, D, A, B, X2, 11, 0);
159 HOST_c2l(data, l);
160 X4 = l;
161 R0(B, C, D, A, X3, 19, 0);
162 HOST_c2l(data, l);
163 X5 = l;
164 R0(A, B, C, D, X4, 3, 0);
165 HOST_c2l(data, l);
166 X6 = l;
167 R0(D, A, B, C, X5, 7, 0);
168 HOST_c2l(data, l);
169 X7 = l;
170 R0(C, D, A, B, X6, 11, 0);
171 HOST_c2l(data, l);
172 X8 = l;
173 R0(B, C, D, A, X7, 19, 0);
174 HOST_c2l(data, l);
175 X9 = l;
176 R0(A, B, C, D, X8, 3, 0);
177 HOST_c2l(data, l);
178 X10 = l;
179 R0(D, A, B, C, X9, 7, 0);
180 HOST_c2l(data, l);
181 X11 = l;
182 R0(C, D, A, B, X10, 11, 0);
183 HOST_c2l(data, l);
184 X12 = l;
185 R0(B, C, D, A, X11, 19, 0);
186 HOST_c2l(data, l);
187 X13 = l;
188 R0(A, B, C, D, X12, 3, 0);
189 HOST_c2l(data, l);
190 X14 = l;
191 R0(D, A, B, C, X13, 7, 0);
192 HOST_c2l(data, l);
193 X15 = l;
194 R0(C, D, A, B, X14, 11, 0);
195 R0(B, C, D, A, X15, 19, 0);
196 // Round 1
197 R1(A, B, C, D, X0, 3, 0x5A827999L);
198 R1(D, A, B, C, X4, 5, 0x5A827999L);
199 R1(C, D, A, B, X8, 9, 0x5A827999L);
200 R1(B, C, D, A, X12, 13, 0x5A827999L);
201 R1(A, B, C, D, X1, 3, 0x5A827999L);
202 R1(D, A, B, C, X5, 5, 0x5A827999L);
203 R1(C, D, A, B, X9, 9, 0x5A827999L);
204 R1(B, C, D, A, X13, 13, 0x5A827999L);
205 R1(A, B, C, D, X2, 3, 0x5A827999L);
206 R1(D, A, B, C, X6, 5, 0x5A827999L);
207 R1(C, D, A, B, X10, 9, 0x5A827999L);
208 R1(B, C, D, A, X14, 13, 0x5A827999L);
209 R1(A, B, C, D, X3, 3, 0x5A827999L);
210 R1(D, A, B, C, X7, 5, 0x5A827999L);
211 R1(C, D, A, B, X11, 9, 0x5A827999L);
212 R1(B, C, D, A, X15, 13, 0x5A827999L);
213 // Round 2
214 R2(A, B, C, D, X0, 3, 0x6ED9EBA1L);
215 R2(D, A, B, C, X8, 9, 0x6ED9EBA1L);
216 R2(C, D, A, B, X4, 11, 0x6ED9EBA1L);
217 R2(B, C, D, A, X12, 15, 0x6ED9EBA1L);
218 R2(A, B, C, D, X2, 3, 0x6ED9EBA1L);
219 R2(D, A, B, C, X10, 9, 0x6ED9EBA1L);
220 R2(C, D, A, B, X6, 11, 0x6ED9EBA1L);
221 R2(B, C, D, A, X14, 15, 0x6ED9EBA1L);
222 R2(A, B, C, D, X1, 3, 0x6ED9EBA1L);
223 R2(D, A, B, C, X9, 9, 0x6ED9EBA1L);
224 R2(C, D, A, B, X5, 11, 0x6ED9EBA1L);
225 R2(B, C, D, A, X13, 15, 0x6ED9EBA1L);
226 R2(A, B, C, D, X3, 3, 0x6ED9EBA1L);
227 R2(D, A, B, C, X11, 9, 0x6ED9EBA1L);
228 R2(C, D, A, B, X7, 11, 0x6ED9EBA1L);
229 R2(B, C, D, A, X15, 15, 0x6ED9EBA1L);
230
231 A = state[0] += A;
232 B = state[1] += B;
233 C = state[2] += C;
234 D = state[3] += D;
235 }
236 }
237
238 #undef DATA_ORDER_IS_LITTLE_ENDIAN
239 #undef HASH_CTX
240 #undef HASH_CBLOCK
241 #undef HASH_UPDATE
242 #undef HASH_TRANSFORM
243 #undef HASH_FINAL
244 #undef HASH_MAKE_STRING
245 #undef HASH_BLOCK_DATA_ORDER
246 #undef F
247 #undef G
248 #undef H
249 #undef ROTATE
250 #undef R0
251 #undef R1
252 #undef R2
253 #undef HOST_c2l
254 #undef HOST_l2c
255