1 /* $NetBSD: md4.c,v 1.1.1.1 2011/04/13 18:14:50 elric 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 38 #include "hash.h" 39 #include "md4.h" 40 41 #define A m->counter[0] 42 #define B m->counter[1] 43 #define C m->counter[2] 44 #define D m->counter[3] 45 #define X data 46 47 void 48 MD4_Init (struct md4 *m) 49 { 50 m->sz[0] = 0; 51 m->sz[1] = 0; 52 D = 0x10325476; 53 C = 0x98badcfe; 54 B = 0xefcdab89; 55 A = 0x67452301; 56 } 57 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) 61 62 #define DOIT(a,b,c,d,k,s,i,OP) \ 63 a = cshift(a + OP(b,c,d) + X[k] + i, s) 64 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) 68 69 static inline void 70 calc (struct md4 *m, uint32_t *data) 71 { 72 uint32_t AA, BB, CC, DD; 73 74 AA = A; 75 BB = B; 76 CC = C; 77 DD = D; 78 79 /* Round 1 */ 80 81 DO1(A,B,C,D,0,3,0); 82 DO1(D,A,B,C,1,7,0); 83 DO1(C,D,A,B,2,11,0); 84 DO1(B,C,D,A,3,19,0); 85 86 DO1(A,B,C,D,4,3,0); 87 DO1(D,A,B,C,5,7,0); 88 DO1(C,D,A,B,6,11,0); 89 DO1(B,C,D,A,7,19,0); 90 91 DO1(A,B,C,D,8,3,0); 92 DO1(D,A,B,C,9,7,0); 93 DO1(C,D,A,B,10,11,0); 94 DO1(B,C,D,A,11,19,0); 95 96 DO1(A,B,C,D,12,3,0); 97 DO1(D,A,B,C,13,7,0); 98 DO1(C,D,A,B,14,11,0); 99 DO1(B,C,D,A,15,19,0); 100 101 /* Round 2 */ 102 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); 107 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); 112 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); 117 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); 122 123 /* Round 3 */ 124 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); 129 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); 134 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); 139 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); 144 145 A += AA; 146 B += BB; 147 C += CC; 148 D += DD; 149 } 150 151 /* 152 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu> 153 */ 154 155 #if defined(WORDS_BIGENDIAN) 156 static inline uint32_t 157 swap_uint32_t (uint32_t t) 158 { 159 uint32_t temp1, temp2; 160 161 temp1 = cshift(t, 16); 162 temp2 = temp1 >> 8; 163 temp1 &= 0x00ff00ff; 164 temp2 &= 0x00ff00ff; 165 temp1 <<= 8; 166 return temp1 | temp2; 167 } 168 #endif 169 170 struct x32{ 171 unsigned int a:32; 172 unsigned int b:32; 173 }; 174 175 void 176 MD4_Update (struct md4 *m, const void *v, size_t len) 177 { 178 const unsigned char *p = v; 179 size_t old_sz = m->sz[0]; 180 size_t offset; 181 182 m->sz[0] += len * 8; 183 if (m->sz[0] < old_sz) 184 ++m->sz[1]; 185 offset = (old_sz / 8) % 64; 186 while(len > 0) { 187 size_t l = min(len, 64 - offset); 188 memcpy(m->save + offset, p, l); 189 offset += l; 190 p += l; 191 len -= l; 192 if(offset == 64) { 193 #if defined(WORDS_BIGENDIAN) 194 int i; 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); 200 } 201 calc(m, current); 202 #else 203 calc(m, (uint32_t*)m->save); 204 #endif 205 offset = 0; 206 } 207 } 208 } 209 210 void 211 MD4_Final (void *res, struct md4 *m) 212 { 213 unsigned char zeros[72]; 214 unsigned offset = (m->sz[0] / 8) % 64; 215 unsigned int dstart = (120 - offset - 1) % 64 + 1; 216 217 *zeros = 0x80; 218 memset (zeros + 1, 0, sizeof(zeros) - 1); 219 zeros[dstart+0] = (m->sz[0] >> 0) & 0xff; 220 zeros[dstart+1] = (m->sz[0] >> 8) & 0xff; 221 zeros[dstart+2] = (m->sz[0] >> 16) & 0xff; 222 zeros[dstart+3] = (m->sz[0] >> 24) & 0xff; 223 zeros[dstart+4] = (m->sz[1] >> 0) & 0xff; 224 zeros[dstart+5] = (m->sz[1] >> 8) & 0xff; 225 zeros[dstart+6] = (m->sz[1] >> 16) & 0xff; 226 zeros[dstart+7] = (m->sz[1] >> 24) & 0xff; 227 MD4_Update (m, zeros, dstart + 8); 228 { 229 int i; 230 unsigned char *r = (unsigned char *)res; 231 232 for (i = 0; i < 4; ++i) { 233 r[4*i] = m->counter[i] & 0xFF; 234 r[4*i+1] = (m->counter[i] >> 8) & 0xFF; 235 r[4*i+2] = (m->counter[i] >> 16) & 0xFF; 236 r[4*i+3] = (m->counter[i] >> 24) & 0xFF; 237 } 238 } 239 #if 0 240 { 241 int i; 242 uint32_t *r = (uint32_t *)res; 243 244 for (i = 0; i < 4; ++i) 245 r[i] = swap_uint32_t (m->counter[i]); 246 } 247 #endif 248 } 249