comparison: sources/md5.cpp
sources/md5.cpp
- changeset 10
- 3874575d924d
- child 11
- cffa2777d917
equal
deleted
inserted
replaced
| 9:e7a09ceb4505 | 10:3874575d924d |
|---|---|
| 1 #include "md5.h" | |
| 2 #include <stdio.h> | |
| 3 #include <string.h> | |
| 4 | |
| 5 /* | |
| 6 * This code implements the MD5 message-digest algorithm. | |
| 7 * The algorithm is due to Ron Rivest. This code was | |
| 8 * written by Colin Plumb in 1993, no copyright is claimed. | |
| 9 * This code is in the public domain; do with it what you wish. | |
| 10 * | |
| 11 * Equivalent code is available from RSA Data Security, Inc. | |
| 12 * This code has been tested against that, and is equivalent, | |
| 13 * except that you don't need to include two pages of legalese | |
| 14 * with every copy. | |
| 15 * | |
| 16 * To compute the message digest of a chunk of bytes, declare an | |
| 17 * MD5Context structure, pass it to MD5Init, call MD5Update as | |
| 18 * needed on buffers full of bytes, and then call MD5Final, which | |
| 19 * will fill a supplied 16-byte array with the digest. | |
| 20 * | |
| 21 */ | |
| 22 | |
| 23 /* md5.h */ | |
| 24 typedef unsigned int uint32; | |
| 25 | |
| 26 struct MD5Context | |
| 27 { | |
| 28 uint32 buf[4]; | |
| 29 uint32 bits[2]; | |
| 30 unsigned char in[64]; | |
| 31 }; | |
| 32 | |
| 33 void MD5Init (struct MD5Context*); | |
| 34 void MD5Update (struct MD5Context*, unsigned const char*, unsigned); | |
| 35 void MD5Final (unsigned char digest[16], struct MD5Context*); | |
| 36 void MD5Transform (uint32 buf[4], uint32 const in[16]); | |
| 37 | |
| 38 /* | |
| 39 * This is needed to make RSAREF happy on some MS-DOS compilers. | |
| 40 */ | |
| 41 | |
| 42 typedef struct MD5Context MD5_CTX; | |
| 43 | |
| 44 /* md5.c */ | |
| 45 | |
| 46 /* | |
| 47 * Note: this code is harmless on little-endian machines. | |
| 48 */ | |
| 49 static void byteReverse (unsigned char* buf, unsigned longs) | |
| 50 { | |
| 51 uint32 t; | |
| 52 | |
| 53 do | |
| 54 { | |
| 55 t = (uint32) ( (unsigned) buf[3] << 8 | buf[2]) << 16 | | |
| 56 ( (unsigned) buf[1] << 8 | buf[0]); | |
| 57 * (uint32*) buf = t; | |
| 58 buf += 4; | |
| 59 } | |
| 60 while (--longs); | |
| 61 } | |
| 62 | |
| 63 static void putu32 (uint32 data, unsigned char* addr) | |
| 64 { | |
| 65 addr[0] = (unsigned char) data; | |
| 66 addr[1] = (unsigned char) (data >> 8); | |
| 67 addr[2] = (unsigned char) (data >> 16); | |
| 68 addr[3] = (unsigned char) (data >> 24); | |
| 69 } | |
| 70 | |
| 71 /* | |
| 72 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious | |
| 73 * initialization constants. | |
| 74 */ | |
| 75 void MD5Init (struct MD5Context* ctx) | |
| 76 { | |
| 77 ctx->buf[0] = 0x67452301U; | |
| 78 ctx->buf[1] = 0xefcdab89U; | |
| 79 ctx->buf[2] = 0x98badcfeU; | |
| 80 ctx->buf[3] = 0x10325476U; | |
| 81 | |
| 82 ctx->bits[0] = 0; | |
| 83 ctx->bits[1] = 0; | |
| 84 } | |
| 85 | |
| 86 /* | |
| 87 * Update context to reflect the concatenation of another buffer full | |
| 88 * of bytes. | |
| 89 */ | |
| 90 void MD5Update (struct MD5Context* ctx, unsigned const char* buf, unsigned len) | |
| 91 { | |
| 92 uint32 t; | |
| 93 | |
| 94 /* Update bitcount */ | |
| 95 | |
| 96 t = ctx->bits[0]; | |
| 97 | |
| 98 if ( (ctx->bits[0] = t + ( (uint32) len << 3)) < t) | |
| 99 ctx->bits[1]++; /* Carry from low to high */ | |
| 100 | |
| 101 ctx->bits[1] += len >> 29; | |
| 102 | |
| 103 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */ | |
| 104 | |
| 105 /* Handle any leading odd-sized chunks */ | |
| 106 | |
| 107 if (t) | |
| 108 { | |
| 109 unsigned char* p = (unsigned char*) ctx->in + t; | |
| 110 | |
| 111 t = 64 - t; | |
| 112 | |
| 113 if (len < t) | |
| 114 { | |
| 115 memcpy (p, buf, len); | |
| 116 return; | |
| 117 } | |
| 118 | |
| 119 memcpy (p, buf, t); | |
| 120 byteReverse (ctx->in, 16); | |
| 121 MD5Transform (ctx->buf, (uint32*) ctx->in); | |
| 122 buf += t; | |
| 123 len -= t; | |
| 124 } | |
| 125 | |
| 126 /* Process data in 64-byte chunks */ | |
| 127 | |
| 128 while (len >= 64) | |
| 129 { | |
| 130 memcpy (ctx->in, buf, 64); | |
| 131 byteReverse (ctx->in, 16); | |
| 132 MD5Transform (ctx->buf, (uint32*) ctx->in); | |
| 133 buf += 64; | |
| 134 len -= 64; | |
| 135 } | |
| 136 | |
| 137 /* Handle any remaining bytes of data. */ | |
| 138 | |
| 139 memcpy (ctx->in, buf, len); | |
| 140 } | |
| 141 | |
| 142 /* | |
| 143 * Final wrapup - pad to 64-byte boundary with the bit pattern | |
| 144 * 1 0* (64-bit count of bits processed, MSB-first) | |
| 145 */ | |
| 146 void MD5Final (unsigned char digest[16], struct MD5Context* ctx) | |
| 147 { | |
| 148 unsigned count; | |
| 149 unsigned char* p; | |
| 150 | |
| 151 /* Compute number of bytes mod 64 */ | |
| 152 count = (ctx->bits[0] >> 3) & 0x3F; | |
| 153 | |
| 154 /* Set the first char of padding to 0x80. This is safe since there is | |
| 155 always at least one byte free */ | |
| 156 p = ctx->in + count; | |
| 157 *p++ = 0x80; | |
| 158 | |
| 159 /* Bytes of padding needed to make 64 bytes */ | |
| 160 count = 64 - 1 - count; | |
| 161 | |
| 162 /* Pad out to 56 mod 64 */ | |
| 163 if (count < 8) | |
| 164 { | |
| 165 /* Two lots of padding: Pad the first block to 64 bytes */ | |
| 166 memset (p, 0, count); | |
| 167 byteReverse (ctx->in, 16); | |
| 168 MD5Transform (ctx->buf, (uint32*) ctx->in); | |
| 169 | |
| 170 /* Now fill the next block with 56 bytes */ | |
| 171 memset (ctx->in, 0, 56); | |
| 172 } | |
| 173 else | |
| 174 { | |
| 175 /* Pad block to 56 bytes */ | |
| 176 memset (p, 0, count - 8); | |
| 177 } | |
| 178 | |
| 179 byteReverse (ctx->in, 14); | |
| 180 | |
| 181 /* Append length in bits and transform */ | |
| 182 putu32 (ctx->bits[0], ctx->in + (14 * 4)); | |
| 183 putu32 (ctx->bits[1], ctx->in + (15 * 4)); | |
| 184 | |
| 185 MD5Transform (ctx->buf, (uint32*) ctx->in); | |
| 186 byteReverse ( (unsigned char*) ctx->buf, 4); | |
| 187 memcpy (digest, ctx->buf, 16); | |
| 188 // memset (ctx, 0, sizeof (ctx)); /* In case it's sensitive */ | |
| 189 ctx = NULL; // GCC doesn't like the line above. | |
| 190 } | |
| 191 | |
| 192 /* The four core functions - F1 is optimized somewhat */ | |
| 193 | |
| 194 /* #define F1(x, y, z) (x & y | ~x & z) */ | |
| 195 #define F1(x, y, z) (z ^ (x & (y ^ z))) | |
| 196 #define F2(x, y, z) F1(z, x, y) | |
| 197 #define F3(x, y, z) (x ^ y ^ z) | |
| 198 #define F4(x, y, z) (y ^ (x | ~z)) | |
| 199 | |
| 200 /* This is the central step in the MD5 algorithm. */ | |
| 201 #define MD5STEP(f, w, x, y, z, data, s) \ | |
| 202 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x ) | |
| 203 | |
| 204 /* | |
| 205 * The core of the MD5 algorithm, this alters an existing MD5 hash to | |
| 206 * reflect the addition of 16 longwords of new data. MD5Update blocks | |
| 207 * the data and converts bytes into longwords for this routine. | |
| 208 */ | |
| 209 void MD5Transform (uint32 buf[4], uint32 const in[16]) | |
| 210 { | |
| 211 uint32 a, b, c, d; | |
| 212 | |
| 213 a = buf[0]; | |
| 214 b = buf[1]; | |
| 215 c = buf[2]; | |
| 216 d = buf[3]; | |
| 217 | |
| 218 MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478U, 7); | |
| 219 MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756U, 12); | |
| 220 MD5STEP (F1, c, d, a, b, in[2] + 0x242070dbU, 17); | |
| 221 MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceeeU, 22); | |
| 222 MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0fafU, 7); | |
| 223 MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62aU, 12); | |
| 224 MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613U, 17); | |
| 225 MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501U, 22); | |
| 226 MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8U, 7); | |
| 227 MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7afU, 12); | |
| 228 MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1U, 17); | |
| 229 MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7beU, 22); | |
| 230 MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122U, 7); | |
| 231 MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193U, 12); | |
| 232 MD5STEP (F1, c, d, a, b, in[14] + 0xa679438eU, 17); | |
| 233 MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821U, 22); | |
| 234 | |
| 235 MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562U, 5); | |
| 236 MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340U, 9); | |
| 237 MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51U, 14); | |
| 238 MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aaU, 20); | |
| 239 MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105dU, 5); | |
| 240 MD5STEP (F2, d, a, b, c, in[10] + 0x02441453U, 9); | |
| 241 MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681U, 14); | |
| 242 MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8U, 20); | |
| 243 MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6U, 5); | |
| 244 MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6U, 9); | |
| 245 MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87U, 14); | |
| 246 MD5STEP (F2, b, c, d, a, in[8] + 0x455a14edU, 20); | |
| 247 MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905U, 5); | |
| 248 MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8U, 9); | |
| 249 MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9U, 14); | |
| 250 MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8aU, 20); | |
| 251 | |
| 252 MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942U, 4); | |
| 253 MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681U, 11); | |
| 254 MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122U, 16); | |
| 255 MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380cU, 23); | |
| 256 MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44U, 4); | |
| 257 MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9U, 11); | |
| 258 MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60U, 16); | |
| 259 MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70U, 23); | |
| 260 MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6U, 4); | |
| 261 MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127faU, 11); | |
| 262 MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085U, 16); | |
| 263 MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05U, 23); | |
| 264 MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039U, 4); | |
| 265 MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5U, 11); | |
| 266 MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8U, 16); | |
| 267 MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665U, 23); | |
| 268 | |
| 269 MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244U, 6); | |
| 270 MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97U, 10); | |
| 271 MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7U, 15); | |
| 272 MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039U, 21); | |
| 273 MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3U, 6); | |
| 274 MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92U, 10); | |
| 275 MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47dU, 15); | |
| 276 MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1U, 21); | |
| 277 MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4fU, 6); | |
| 278 MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0U, 10); | |
| 279 MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314U, 15); | |
| 280 MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1U, 21); | |
| 281 MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82U, 6); | |
| 282 MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235U, 10); | |
| 283 MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bbU, 15); | |
| 284 MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391U, 21); | |
| 285 | |
| 286 buf[0] += a; | |
| 287 buf[1] += b; | |
| 288 buf[2] += c; | |
| 289 buf[3] += d; | |
| 290 } | |
| 291 | |
| 292 void CalculateMD5 (const unsigned char* buffer, int length, char* checksum) | |
| 293 { | |
| 294 int i; | |
| 295 struct MD5Context m_md5; | |
| 296 unsigned char signature[16]; | |
| 297 | |
| 298 MD5Init (&m_md5); | |
| 299 MD5Update (&m_md5, buffer, length); | |
| 300 MD5Final (signature, &m_md5); | |
| 301 | |
| 302 for (i = 0; i < 16; i++) | |
| 303 { | |
| 304 sprintf (checksum + i * 2, "%02X", signature[i]); | |
| 305 } | |
| 306 } | |
| 307 |
