2 * Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 #define A m->counter[0]
41 #define B m->counter[1]
42 #define C m->counter[2]
43 #define D m->counter[3]
47 MD4_Init (struct md4
*m
)
58 #define F(x,y,z) CRAYFIX((x & y) | (~x & z))
59 #define G(x,y,z) ((x & y) | (x & z) | (y & z))
60 #define H(x,y,z) (x ^ y ^ z)
62 #define DOIT(a,b,c,d,k,s,i,OP) \
63 a = cshift(a + OP(b,c,d) + X[k] + i, s)
65 #define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
66 #define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
67 #define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
70 calc (struct md4
*m
, uint32_t *data
)
72 uint32_t AA
, BB
, CC
, DD
;
103 DO2(A
,B
,C
,D
,0,3,0x5A827999);
104 DO2(D
,A
,B
,C
,4,5,0x5A827999);
105 DO2(C
,D
,A
,B
,8,9,0x5A827999);
106 DO2(B
,C
,D
,A
,12,13,0x5A827999);
108 DO2(A
,B
,C
,D
,1,3,0x5A827999);
109 DO2(D
,A
,B
,C
,5,5,0x5A827999);
110 DO2(C
,D
,A
,B
,9,9,0x5A827999);
111 DO2(B
,C
,D
,A
,13,13,0x5A827999);
113 DO2(A
,B
,C
,D
,2,3,0x5A827999);
114 DO2(D
,A
,B
,C
,6,5,0x5A827999);
115 DO2(C
,D
,A
,B
,10,9,0x5A827999);
116 DO2(B
,C
,D
,A
,14,13,0x5A827999);
118 DO2(A
,B
,C
,D
,3,3,0x5A827999);
119 DO2(D
,A
,B
,C
,7,5,0x5A827999);
120 DO2(C
,D
,A
,B
,11,9,0x5A827999);
121 DO2(B
,C
,D
,A
,15,13,0x5A827999);
125 DO3(A
,B
,C
,D
,0,3,0x6ED9EBA1);
126 DO3(D
,A
,B
,C
,8,9,0x6ED9EBA1);
127 DO3(C
,D
,A
,B
,4,11,0x6ED9EBA1);
128 DO3(B
,C
,D
,A
,12,15,0x6ED9EBA1);
130 DO3(A
,B
,C
,D
,2,3,0x6ED9EBA1);
131 DO3(D
,A
,B
,C
,10,9,0x6ED9EBA1);
132 DO3(C
,D
,A
,B
,6,11,0x6ED9EBA1);
133 DO3(B
,C
,D
,A
,14,15,0x6ED9EBA1);
135 DO3(A
,B
,C
,D
,1,3,0x6ED9EBA1);
136 DO3(D
,A
,B
,C
,9,9,0x6ED9EBA1);
137 DO3(C
,D
,A
,B
,5,11,0x6ED9EBA1);
138 DO3(B
,C
,D
,A
,13,15,0x6ED9EBA1);
140 DO3(A
,B
,C
,D
,3,3,0x6ED9EBA1);
141 DO3(D
,A
,B
,C
,11,9,0x6ED9EBA1);
142 DO3(C
,D
,A
,B
,7,11,0x6ED9EBA1);
143 DO3(B
,C
,D
,A
,15,15,0x6ED9EBA1);
152 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
155 #if defined(WORDS_BIGENDIAN)
156 static inline uint32_t
157 swap_uint32_t (uint32_t t
)
159 uint32_t temp1
, temp2
;
161 temp1
= cshift(t
, 16);
166 return temp1
| temp2
;
176 MD4_Update (struct md4
*m
, const void *v
, size_t len
)
178 const unsigned char *p
= v
;
179 size_t old_sz
= m
->sz
[0];
183 if (m
->sz
[0] < old_sz
)
185 offset
= (old_sz
/ 8) % 64;
187 size_t l
= min(len
, 64 - offset
);
188 memcpy(m
->save
+ offset
, p
, l
);
193 #if defined(WORDS_BIGENDIAN)
195 uint32_t current
[16];
196 struct x32
*us
= (struct x32
*)m
->save
;
197 for(i
= 0; i
< 8; i
++){
198 current
[2*i
+0] = swap_uint32_t(us
[i
].a
);
199 current
[2*i
+1] = swap_uint32_t(us
[i
].b
);
203 calc(m
, (uint32_t*)m
->save
);
212 MD4_Final (void *res
, struct md4
*m
)
214 unsigned char zeros
[72];
215 unsigned offset
= (m
->sz
[0] / 8) % 64;
216 unsigned int dstart
= (120 - offset
- 1) % 64 + 1;
219 memset (zeros
+ 1, 0, sizeof(zeros
) - 1);
220 zeros
[dstart
+0] = (m
->sz
[0] >> 0) & 0xff;
221 zeros
[dstart
+1] = (m
->sz
[0] >> 8) & 0xff;
222 zeros
[dstart
+2] = (m
->sz
[0] >> 16) & 0xff;
223 zeros
[dstart
+3] = (m
->sz
[0] >> 24) & 0xff;
224 zeros
[dstart
+4] = (m
->sz
[1] >> 0) & 0xff;
225 zeros
[dstart
+5] = (m
->sz
[1] >> 8) & 0xff;
226 zeros
[dstart
+6] = (m
->sz
[1] >> 16) & 0xff;
227 zeros
[dstart
+7] = (m
->sz
[1] >> 24) & 0xff;
228 MD4_Update (m
, zeros
, dstart
+ 8);
231 unsigned char *r
= (unsigned char *)res
;
233 for (i
= 0; i
< 4; ++i
) {
234 r
[4*i
] = m
->counter
[i
] & 0xFF;
235 r
[4*i
+1] = (m
->counter
[i
] >> 8) & 0xFF;
236 r
[4*i
+2] = (m
->counter
[i
] >> 16) & 0xFF;
237 r
[4*i
+3] = (m
->counter
[i
] >> 24) & 0xFF;
243 uint32_t *r
= (uint32_t *)res
;
245 for (i
= 0; i
< 4; ++i
)
246 r
[i
] = swap_uint32_t (m
->counter
[i
]);