1 /* $NetBSD: md4.c,v 1.2 2017/01/28 21:31:47 christos Exp $ */
2
3 /*
4 * Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan
5 * (Royal Institute of Technology, Stockholm, Sweden).
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 *
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 *
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 *
19 * 3. Neither the name of the Institute nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #include <config.h>
37 #include <krb5/roken.h>
38
39 #include "hash.h"
40 #include "md4.h"
41
42 #define A m->counter[0]
43 #define B m->counter[1]
44 #define C m->counter[2]
45 #define D m->counter[3]
46 #define X data
47
48 int
MD4_Init(struct md4 * m)49 MD4_Init (struct md4 *m)
50 {
51 m->sz[0] = 0;
52 m->sz[1] = 0;
53 D = 0x10325476;
54 C = 0x98badcfe;
55 B = 0xefcdab89;
56 A = 0x67452301;
57 return 1;
58 }
59
60 #define F(x,y,z) CRAYFIX((x & y) | (~x & z))
61 #define G(x,y,z) ((x & y) | (x & z) | (y & z))
62 #define H(x,y,z) (x ^ y ^ z)
63
64 #define DOIT(a,b,c,d,k,s,i,OP) \
65 a = cshift(a + OP(b,c,d) + X[k] + i, s)
66
67 #define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
68 #define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
69 #define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
70
71 static inline void
calc(struct md4 * m,uint32_t * data)72 calc (struct md4 *m, uint32_t *data)
73 {
74 uint32_t AA, BB, CC, DD;
75
76 AA = A;
77 BB = B;
78 CC = C;
79 DD = D;
80
81 /* Round 1 */
82
83 DO1(A,B,C,D,0,3,0);
84 DO1(D,A,B,C,1,7,0);
85 DO1(C,D,A,B,2,11,0);
86 DO1(B,C,D,A,3,19,0);
87
88 DO1(A,B,C,D,4,3,0);
89 DO1(D,A,B,C,5,7,0);
90 DO1(C,D,A,B,6,11,0);
91 DO1(B,C,D,A,7,19,0);
92
93 DO1(A,B,C,D,8,3,0);
94 DO1(D,A,B,C,9,7,0);
95 DO1(C,D,A,B,10,11,0);
96 DO1(B,C,D,A,11,19,0);
97
98 DO1(A,B,C,D,12,3,0);
99 DO1(D,A,B,C,13,7,0);
100 DO1(C,D,A,B,14,11,0);
101 DO1(B,C,D,A,15,19,0);
102
103 /* Round 2 */
104
105 DO2(A,B,C,D,0,3,0x5A827999);
106 DO2(D,A,B,C,4,5,0x5A827999);
107 DO2(C,D,A,B,8,9,0x5A827999);
108 DO2(B,C,D,A,12,13,0x5A827999);
109
110 DO2(A,B,C,D,1,3,0x5A827999);
111 DO2(D,A,B,C,5,5,0x5A827999);
112 DO2(C,D,A,B,9,9,0x5A827999);
113 DO2(B,C,D,A,13,13,0x5A827999);
114
115 DO2(A,B,C,D,2,3,0x5A827999);
116 DO2(D,A,B,C,6,5,0x5A827999);
117 DO2(C,D,A,B,10,9,0x5A827999);
118 DO2(B,C,D,A,14,13,0x5A827999);
119
120 DO2(A,B,C,D,3,3,0x5A827999);
121 DO2(D,A,B,C,7,5,0x5A827999);
122 DO2(C,D,A,B,11,9,0x5A827999);
123 DO2(B,C,D,A,15,13,0x5A827999);
124
125 /* Round 3 */
126
127 DO3(A,B,C,D,0,3,0x6ED9EBA1);
128 DO3(D,A,B,C,8,9,0x6ED9EBA1);
129 DO3(C,D,A,B,4,11,0x6ED9EBA1);
130 DO3(B,C,D,A,12,15,0x6ED9EBA1);
131
132 DO3(A,B,C,D,2,3,0x6ED9EBA1);
133 DO3(D,A,B,C,10,9,0x6ED9EBA1);
134 DO3(C,D,A,B,6,11,0x6ED9EBA1);
135 DO3(B,C,D,A,14,15,0x6ED9EBA1);
136
137 DO3(A,B,C,D,1,3,0x6ED9EBA1);
138 DO3(D,A,B,C,9,9,0x6ED9EBA1);
139 DO3(C,D,A,B,5,11,0x6ED9EBA1);
140 DO3(B,C,D,A,13,15,0x6ED9EBA1);
141
142 DO3(A,B,C,D,3,3,0x6ED9EBA1);
143 DO3(D,A,B,C,11,9,0x6ED9EBA1);
144 DO3(C,D,A,B,7,11,0x6ED9EBA1);
145 DO3(B,C,D,A,15,15,0x6ED9EBA1);
146
147 A += AA;
148 B += BB;
149 C += CC;
150 D += DD;
151 }
152
153 /*
154 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
155 */
156
157 #if defined(WORDS_BIGENDIAN)
158 static inline uint32_t
swap_uint32_t(uint32_t t)159 swap_uint32_t (uint32_t t)
160 {
161 uint32_t temp1, temp2;
162
163 temp1 = cshift(t, 16);
164 temp2 = temp1 >> 8;
165 temp1 &= 0x00ff00ff;
166 temp2 &= 0x00ff00ff;
167 temp1 <<= 8;
168 return temp1 | temp2;
169 }
170 #endif
171
172 struct x32{
173 unsigned int a:32;
174 unsigned int b:32;
175 };
176
177 int
MD4_Update(struct md4 * m,const void * v,size_t len)178 MD4_Update (struct md4 *m, const void *v, size_t len)
179 {
180 const unsigned char *p = v;
181 size_t old_sz = m->sz[0];
182 size_t offset;
183
184 m->sz[0] += len * 8;
185 if (m->sz[0] < old_sz)
186 ++m->sz[1];
187 offset = (old_sz / 8) % 64;
188 while(len > 0) {
189 size_t l = min(len, 64 - offset);
190 memcpy(m->save + offset, p, l);
191 offset += l;
192 p += l;
193 len -= l;
194 if(offset == 64) {
195 #if defined(WORDS_BIGENDIAN)
196 int i;
197 uint32_t current[16];
198 struct x32 *us = (struct x32*)m->save;
199 for(i = 0; i < 8; i++){
200 current[2*i+0] = swap_uint32_t(us[i].a);
201 current[2*i+1] = swap_uint32_t(us[i].b);
202 }
203 calc(m, current);
204 #else
205 calc(m, (uint32_t*)m->save);
206 #endif
207 offset = 0;
208 }
209 }
210 return 1;
211 }
212
213 int
MD4_Final(void * res,struct md4 * m)214 MD4_Final (void *res, struct md4 *m)
215 {
216 unsigned char zeros[72];
217 unsigned offset = (m->sz[0] / 8) % 64;
218 unsigned int dstart = (120 - offset - 1) % 64 + 1;
219
220 *zeros = 0x80;
221 memset (zeros + 1, 0, sizeof(zeros) - 1);
222 zeros[dstart+0] = (m->sz[0] >> 0) & 0xff;
223 zeros[dstart+1] = (m->sz[0] >> 8) & 0xff;
224 zeros[dstart+2] = (m->sz[0] >> 16) & 0xff;
225 zeros[dstart+3] = (m->sz[0] >> 24) & 0xff;
226 zeros[dstart+4] = (m->sz[1] >> 0) & 0xff;
227 zeros[dstart+5] = (m->sz[1] >> 8) & 0xff;
228 zeros[dstart+6] = (m->sz[1] >> 16) & 0xff;
229 zeros[dstart+7] = (m->sz[1] >> 24) & 0xff;
230 MD4_Update (m, zeros, dstart + 8);
231 {
232 int i;
233 unsigned char *r = (unsigned char *)res;
234
235 for (i = 0; i < 4; ++i) {
236 r[4*i] = m->counter[i] & 0xFF;
237 r[4*i+1] = (m->counter[i] >> 8) & 0xFF;
238 r[4*i+2] = (m->counter[i] >> 16) & 0xFF;
239 r[4*i+3] = (m->counter[i] >> 24) & 0xFF;
240 }
241 }
242 #if 0
243 {
244 int i;
245 uint32_t *r = (uint32_t *)res;
246
247 for (i = 0; i < 4; ++i)
248 r[i] = swap_uint32_t (m->counter[i]);
249 }
250 #endif
251 return 1;
252 }
253