1/* 2 * Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan 3 * (Royal Institute of Technology, Stockholm, Sweden). 4 * All rights reserved. 5 * 6 * Redistribution and use in source and binary forms, with or without 7 * modification, are permitted provided that the following conditions 8 * are met: 9 * 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 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. 16 * 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. 20 * 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 31 * SUCH DAMAGE. 32 */ 33 34#ifdef HAVE_CONFIG_H 35#include "config.h" 36 37__RCSID("$Heimdal: md5.c,v 1.15 2001/01/29 04:33:44 assar Exp $" 38 "$NetBSD: md5.c,v 1.1.1.4 2002/09/12 12:41:42 joda Exp $"); 39#endif 40 41#include <endian.h> 42#include "md5.h" 43#include "hash.h" 44 45#define A m->counter[0] 46#define B m->counter[1] 47#define C m->counter[2] 48#define D m->counter[3] 49#define X data 50 51void 52MD5_Init (struct md5 *m) 53{ 54 m->sz[0] = 0; 55 m->sz[1] = 0; 56 D = 0x10325476; 57 C = 0x98badcfe; 58 B = 0xefcdab89; 59 A = 0x67452301; 60} 61 62#define F(x,y,z) CRAYFIX((x & y) | (~x & z)) 63#define G(x,y,z) CRAYFIX((x & z) | (y & ~z)) 64#define H(x,y,z) (x ^ y ^ z) 65#define I(x,y,z) CRAYFIX(y ^ (x | ~z)) 66 67#define DOIT(a,b,c,d,k,s,i,OP) \ 68a = b + cshift(a + OP(b,c,d) + X[k] + (i), s) 69 70#define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F) 71#define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G) 72#define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H) 73#define DO4(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,I) 74 75static inline void 76calc (struct md5 *m, u_int32_t *data) 77{ 78 u_int32_t AA, BB, CC, DD; 79 80 AA = A; 81 BB = B; 82 CC = C; 83 DD = D; 84 85 /* Round 1 */ 86 87 DO1(A,B,C,D,0,7,0xd76aa478); 88 DO1(D,A,B,C,1,12,0xe8c7b756); 89 DO1(C,D,A,B,2,17,0x242070db); 90 DO1(B,C,D,A,3,22,0xc1bdceee); 91 92 DO1(A,B,C,D,4,7,0xf57c0faf); 93 DO1(D,A,B,C,5,12,0x4787c62a); 94 DO1(C,D,A,B,6,17,0xa8304613); 95 DO1(B,C,D,A,7,22,0xfd469501); 96 97 DO1(A,B,C,D,8,7,0x698098d8); 98 DO1(D,A,B,C,9,12,0x8b44f7af); 99 DO1(C,D,A,B,10,17,0xffff5bb1); 100 DO1(B,C,D,A,11,22,0x895cd7be); 101 102 DO1(A,B,C,D,12,7,0x6b901122); 103 DO1(D,A,B,C,13,12,0xfd987193); 104 DO1(C,D,A,B,14,17,0xa679438e); 105 DO1(B,C,D,A,15,22,0x49b40821); 106 107 /* Round 2 */ 108 109 DO2(A,B,C,D,1,5,0xf61e2562); 110 DO2(D,A,B,C,6,9,0xc040b340); 111 DO2(C,D,A,B,11,14,0x265e5a51); 112 DO2(B,C,D,A,0,20,0xe9b6c7aa); 113 114 DO2(A,B,C,D,5,5,0xd62f105d); 115 DO2(D,A,B,C,10,9,0x2441453); 116 DO2(C,D,A,B,15,14,0xd8a1e681); 117 DO2(B,C,D,A,4,20,0xe7d3fbc8); 118 119 DO2(A,B,C,D,9,5,0x21e1cde6); 120 DO2(D,A,B,C,14,9,0xc33707d6); 121 DO2(C,D,A,B,3,14,0xf4d50d87); 122 DO2(B,C,D,A,8,20,0x455a14ed); 123 124 DO2(A,B,C,D,13,5,0xa9e3e905); 125 DO2(D,A,B,C,2,9,0xfcefa3f8); 126 DO2(C,D,A,B,7,14,0x676f02d9); 127 DO2(B,C,D,A,12,20,0x8d2a4c8a); 128 129 /* Round 3 */ 130 131 DO3(A,B,C,D,5,4,0xfffa3942); 132 DO3(D,A,B,C,8,11,0x8771f681); 133 DO3(C,D,A,B,11,16,0x6d9d6122); 134 DO3(B,C,D,A,14,23,0xfde5380c); 135 136 DO3(A,B,C,D,1,4,0xa4beea44); 137 DO3(D,A,B,C,4,11,0x4bdecfa9); 138 DO3(C,D,A,B,7,16,0xf6bb4b60); 139 DO3(B,C,D,A,10,23,0xbebfbc70); 140 141 DO3(A,B,C,D,13,4,0x289b7ec6); 142 DO3(D,A,B,C,0,11,0xeaa127fa); 143 DO3(C,D,A,B,3,16,0xd4ef3085); 144 DO3(B,C,D,A,6,23,0x4881d05); 145 146 DO3(A,B,C,D,9,4,0xd9d4d039); 147 DO3(D,A,B,C,12,11,0xe6db99e5); 148 DO3(C,D,A,B,15,16,0x1fa27cf8); 149 DO3(B,C,D,A,2,23,0xc4ac5665); 150 151 /* Round 4 */ 152 153 DO4(A,B,C,D,0,6,0xf4292244); 154 DO4(D,A,B,C,7,10,0x432aff97); 155 DO4(C,D,A,B,14,15,0xab9423a7); 156 DO4(B,C,D,A,5,21,0xfc93a039); 157 158 DO4(A,B,C,D,12,6,0x655b59c3); 159 DO4(D,A,B,C,3,10,0x8f0ccc92); 160 DO4(C,D,A,B,10,15,0xffeff47d); 161 DO4(B,C,D,A,1,21,0x85845dd1); 162 163 DO4(A,B,C,D,8,6,0x6fa87e4f); 164 DO4(D,A,B,C,15,10,0xfe2ce6e0); 165 DO4(C,D,A,B,6,15,0xa3014314); 166 DO4(B,C,D,A,13,21,0x4e0811a1); 167 168 DO4(A,B,C,D,4,6,0xf7537e82); 169 DO4(D,A,B,C,11,10,0xbd3af235); 170 DO4(C,D,A,B,2,15,0x2ad7d2bb); 171 DO4(B,C,D,A,9,21,0xeb86d391); 172 173 A += AA; 174 B += BB; 175 C += CC; 176 D += DD; 177} 178 179/* 180 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu> 181 */ 182#if !defined(__BYTE_ORDER) || !defined (__BIG_ENDIAN) 183#error __BYTE_ORDER macros not defined 184#endif 185 186#if __BYTE_ORDER == __BIG_ENDIAN 187static inline u_int32_t 188swap_u_int32_t (u_int32_t t) 189{ 190 u_int32_t temp1, temp2; 191 192 temp1 = cshift(t, 16); 193 temp2 = temp1 >> 8; 194 temp1 &= 0x00ff00ff; 195 temp2 &= 0x00ff00ff; 196 temp1 <<= 8; 197 return temp1 | temp2; 198} 199#endif 200 201struct x32{ 202 unsigned int a:32; 203 unsigned int b:32; 204}; 205 206void 207MD5_Update (struct md5 *m, const void *v, size_t len) 208{ 209 const unsigned char *p = v; 210 size_t old_sz = m->sz[0]; 211 size_t offset; 212 213 m->sz[0] += len * 8; 214 if (m->sz[0] < old_sz) 215 ++m->sz[1]; 216 offset = (old_sz / 8) % 64; 217 while(len > 0){ 218 size_t l = min(len, 64 - offset); 219 memcpy(m->save + offset, p, l); 220 offset += l; 221 p += l; 222 len -= l; 223 if(offset == 64){ 224#if __BYTE_ORDER == __BIG_ENDIAN 225 int i; 226 u_int32_t current[16]; 227 struct x32 *u = (struct x32*)m->save; 228 for(i = 0; i < 8; i++){ 229 current[2*i+0] = swap_u_int32_t(u[i].a); 230 current[2*i+1] = swap_u_int32_t(u[i].b); 231 } 232 calc(m, current); 233#else 234 calc(m, (u_int32_t*)m->save); 235#endif 236 offset = 0; 237 } 238 } 239} 240 241void 242MD5_Final (void *res, struct md5 *m) 243{ 244 unsigned char zeros[72]; 245 unsigned offset = (m->sz[0] / 8) % 64; 246 unsigned int dstart = (120 - offset - 1) % 64 + 1; 247 248 *zeros = 0x80; 249 memset (zeros + 1, 0, sizeof(zeros) - 1); 250 zeros[dstart+0] = (m->sz[0] >> 0) & 0xff; 251 zeros[dstart+1] = (m->sz[0] >> 8) & 0xff; 252 zeros[dstart+2] = (m->sz[0] >> 16) & 0xff; 253 zeros[dstart+3] = (m->sz[0] >> 24) & 0xff; 254 zeros[dstart+4] = (m->sz[1] >> 0) & 0xff; 255 zeros[dstart+5] = (m->sz[1] >> 8) & 0xff; 256 zeros[dstart+6] = (m->sz[1] >> 16) & 0xff; 257 zeros[dstart+7] = (m->sz[1] >> 24) & 0xff; 258 MD5_Update (m, zeros, dstart + 8); 259 { 260 int i; 261 unsigned char *r = (unsigned char *)res; 262 263 for (i = 0; i < 4; ++i) { 264 r[4*i] = m->counter[i] & 0xFF; 265 r[4*i+1] = (m->counter[i] >> 8) & 0xFF; 266 r[4*i+2] = (m->counter[i] >> 16) & 0xFF; 267 r[4*i+3] = (m->counter[i] >> 24) & 0xFF; 268 } 269 } 270#if 0 271 { 272 int i; 273 u_int32_t *r = (u_int32_t *)res; 274 275 for (i = 0; i < 4; ++i) 276 r[i] = swap_u_int32_t (m->counter[i]); 277 } 278#endif 279} 280