1/* 2 * This code implements the MD5 message-digest algorithm. 3 * The algorithm is due to Ron Rivest. This code was 4 * written by Colin Plumb in 1993, no copyright is claimed. 5 * This code is in the public domain; do with it what you wish. 6 * 7 * Equivalent code is available from RSA Data Security, Inc. 8 * This code has been tested against that, and is equivalent, 9 * except that you don't need to include two pages of legalese 10 * with every copy. 11 * 12 * To compute the message digest of a chunk of bytes, declare an 13 * MD5Context structure, pass it to MD5Init, call MD5Update as 14 * needed on buffers full of bytes, and then call MD5Final, which 15 * will fill a supplied 16-byte array with the digest. 16 */ 17#include <string.h> /* for memcpy() */ 18#include "md5.h" 19 20void byteReverse(unsigned char *buf, unsigned longs); 21 22/* 23 * Note: this code is harmless on little-endian machines. 24 */ 25void byteReverse(unsigned char *buf, unsigned longs) 26{ 27 uint32 t; 28 do { 29 t = (uint32) ((unsigned) buf[3] << 8 | buf[2]) << 16 | 30 ((unsigned) buf[1] << 8 | buf[0]); 31 *(uint32 *) buf = t; 32 buf += 4; 33 } while (--longs); 34} 35 36/* 37 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious 38 * initialization constants. 39 */ 40void MD5Init(struct MD5Context *ctx) 41{ 42 ctx->buf[0] = 0x67452301; 43 ctx->buf[1] = 0xefcdab89; 44 ctx->buf[2] = 0x98badcfe; 45 ctx->buf[3] = 0x10325476; 46 47 ctx->bits[0] = 0; 48 ctx->bits[1] = 0; 49} 50 51/* 52 * Update context to reflect the concatenation of another buffer full 53 * of bytes. 54 */ 55void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len) 56{ 57 uint32 t; 58 59 /* Update bitcount */ 60 61 t = ctx->bits[0]; 62 if ((ctx->bits[0] = t + ((uint32) len << 3)) < t) 63 ctx->bits[1]++; /* Carry from low to high */ 64 ctx->bits[1] += len >> 29; 65 66 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ 67 68 /* Handle any leading odd-sized chunks */ 69 70 if (t) { 71 unsigned char *p = (unsigned char *) ctx->in + t; 72 73 t = 64 - t; 74 if (len < t) { 75 memcpy(p, buf, len); 76 return; 77 } 78 memcpy(p, buf, t); 79 byteReverse(ctx->in, 16); 80 MD5Transform(ctx->buf, (uint32 *) ctx->in); 81 buf += t; 82 len -= t; 83 } 84 /* Process data in 64-byte chunks */ 85 86 while (len >= 64) { 87 memcpy(ctx->in, buf, 64); 88 byteReverse(ctx->in, 16); 89 MD5Transform(ctx->buf, (uint32 *) ctx->in); 90 buf += 64; 91 len -= 64; 92 } 93 94 /* Handle any remaining bytes of data. */ 95 96 memcpy(ctx->in, buf, len); 97} 98 99/* 100 * Final wrapup - pad to 64-byte boundary with the bit pattern 101 * 1 0* (64-bit count of bits processed, MSB-first) 102 */ 103void MD5Final(unsigned char digest[16], struct MD5Context *ctx) 104{ 105 unsigned count; 106 unsigned char *p; 107 108 /* Compute number of bytes mod 64 */ 109 count = (ctx->bits[0] >> 3) & 0x3F; 110 111 /* Set the first char of padding to 0x80. This is safe since there is 112 always at least one byte free */ 113 p = ctx->in + count; 114 *p++ = 0x80; 115 116 /* Bytes of padding needed to make 64 bytes */ 117 count = 64 - 1 - count; 118 119 /* Pad out to 56 mod 64 */ 120 if (count < 8) { 121 /* Two lots of padding: Pad the first block to 64 bytes */ 122 memset(p, 0, count); 123 byteReverse(ctx->in, 16); 124 MD5Transform(ctx->buf, (uint32 *) ctx->in); 125 126 /* Now fill the next block with 56 bytes */ 127 memset(ctx->in, 0, 56); 128 } else { 129 /* Pad block to 56 bytes */ 130 memset(p, 0, count - 8); 131 } 132 byteReverse(ctx->in, 14); 133 134 /* Append length in bits and transform */ 135 ((uint32 *) ctx->in)[14] = ctx->bits[0]; 136 ((uint32 *) ctx->in)[15] = ctx->bits[1]; 137 138 MD5Transform(ctx->buf, (uint32 *) ctx->in); 139 byteReverse((unsigned char *) ctx->buf, 4); 140 memcpy(digest, ctx->buf, 16); 141 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */ 142} 143 144#ifndef ASM_MD5 145 146/* The four core functions - F1 is optimized somewhat */ 147 148/* #define F1(x, y, z) (x & y | ~x & z) */ 149#define F1(x, y, z) (z ^ (x & (y ^ z))) 150#define F2(x, y, z) F1(z, x, y) 151#define F3(x, y, z) (x ^ y ^ z) 152#define F4(x, y, z) (y ^ (x | ~z)) 153 154/* This is the central step in the MD5 algorithm. */ 155#define MD5STEP(f, w, x, y, z, data, s) \ 156 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) 157 158/* 159 * The core of the MD5 algorithm, this alters an existing MD5 hash to 160 * reflect the addition of 16 longwords of new data. MD5Update blocks 161 * the data and converts bytes into longwords for this routine. 162 */ 163void MD5Transform(uint32 buf[4], uint32 const in[16]) 164{ 165 register uint32 a, b, c, d; 166 167 a = buf[0]; 168 b = buf[1]; 169 c = buf[2]; 170 d = buf[3]; 171 172 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7); 173 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12); 174 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17); 175 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22); 176 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7); 177 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12); 178 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17); 179 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22); 180 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7); 181 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12); 182 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17); 183 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22); 184 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7); 185 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12); 186 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17); 187 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22); 188 189 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5); 190 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9); 191 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14); 192 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20); 193 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5); 194 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9); 195 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14); 196 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20); 197 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5); 198 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9); 199 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14); 200 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20); 201 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5); 202 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9); 203 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14); 204 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20); 205 206 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4); 207 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11); 208 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16); 209 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23); 210 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4); 211 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11); 212 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16); 213 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23); 214 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4); 215 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11); 216 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16); 217 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23); 218 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4); 219 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11); 220 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16); 221 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23); 222 223 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6); 224 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10); 225 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15); 226 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21); 227 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6); 228 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10); 229 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15); 230 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21); 231 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6); 232 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10); 233 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15); 234 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21); 235 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6); 236 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10); 237 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15); 238 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21); 239 240 buf[0] += a; 241 buf[1] += b; 242 buf[2] += c; 243 buf[3] += d; 244} 245 246#endif 247