mirror of
https://github.com/EQEmu/Server.git
synced 2025-12-11 16:51:29 +00:00
dfd8f84cac
* Initial commit checkpoint * More functions converted * Commify * More functions * Fin * Sort declarations * Split functions between files * Bots * Update strings.h * Split * Revert find replaces * Repository template * Money * Misc function * Update CMakeLists.txt * Saylink * Update strings.cpp * Swap Strings::Saylink for Saylink::Create since saylink is coupled to zone database * API casings
276 lines
8.6 KiB
C++
276 lines
8.6 KiB
C++
/* md5.c -- An implementation of Ron Rivest's MD5 message-digest algorithm.
|
|
* Written by Colin Plumb in 1993, no copyright is claimed. This code is in the
|
|
* public domain; do with it what you wish. Equivalent code is available from
|
|
* RSA Data Security, Inc. This code does not oblige you to include legal
|
|
* boilerplate in the documentation. To compute the message digest of a string
|
|
* of bytes, declare an MD5Context structure, pass it to MD5Init, call
|
|
* MD5Update as needed on buffers full of bytes, and then call MD5Final, which
|
|
* will fill a supplied 16-byte array with the digest.
|
|
*/
|
|
#include <string.h> /* for memcpy() */
|
|
#include "../common/md5.h"
|
|
#include "../common/strings.h"
|
|
#include "../common/seperator.h"
|
|
|
|
MD5::MD5() {
|
|
memset(pMD5, 0, 16);
|
|
}
|
|
|
|
MD5::MD5(const uchar* buf, uint32 len) {
|
|
Generate(buf, len, pMD5);
|
|
}
|
|
|
|
MD5::MD5(const char* buf, uint32 len) {
|
|
Generate((const uchar*) buf, len, pMD5);
|
|
}
|
|
|
|
MD5::MD5(const uint8 buf[16]) {
|
|
Set(buf);
|
|
}
|
|
|
|
MD5::MD5(const char* iMD5String) {
|
|
Set(iMD5String);
|
|
}
|
|
|
|
void MD5::Generate(const char* iString) {
|
|
Generate((const uchar*) iString, strlen(iString));
|
|
}
|
|
|
|
void MD5::Generate(const uint8* buf, uint32 len) {
|
|
Generate(buf, len, pMD5);
|
|
}
|
|
|
|
bool MD5::Set(const uint8 buf[16]) {
|
|
memcpy(pMD5, buf, 16);
|
|
return true;
|
|
}
|
|
|
|
bool MD5::Set(const char* iMD5String) {
|
|
char tmp[5] = { '0', 'x', 0, 0, 0 };
|
|
for (int i=0; i<16; i++) {
|
|
tmp[2] = iMD5String[i*2];
|
|
tmp[3] = iMD5String[(i*2) + 1];
|
|
if (!Seperator::IsHexNumber(tmp))
|
|
return false;
|
|
pMD5[i] = hextoi(tmp);
|
|
}
|
|
return true;
|
|
}
|
|
|
|
MD5::operator const char* () {
|
|
snprintf(pMD5String, sizeof(pMD5String), "%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x", pMD5[0], pMD5[1], pMD5[2], pMD5[3], pMD5[4], pMD5[5], pMD5[6], pMD5[7], pMD5[8], pMD5[9], pMD5[10], pMD5[11], pMD5[12], pMD5[13], pMD5[14], pMD5[15]);
|
|
return pMD5String;
|
|
}
|
|
|
|
bool MD5::operator== (const MD5& iMD5) {
|
|
if (memcmp(pMD5, iMD5.pMD5, 16) == 0)
|
|
return true;
|
|
else
|
|
return false;
|
|
}
|
|
|
|
bool MD5::operator== (const uint8* iMD5) {
|
|
if (memcmp(pMD5, iMD5, 16) == 0)
|
|
return true;
|
|
else
|
|
return false;
|
|
}
|
|
|
|
bool MD5::operator== (const char* iMD5String) {
|
|
char tmp[5] = { '0', 'x', 0, 0, 0 };
|
|
for (int i=0; i<16; i++) {
|
|
tmp[2] = iMD5String[i*2];
|
|
tmp[3] = iMD5String[(i*2) + 1];
|
|
if (pMD5[i] != hextoi(tmp))
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
MD5& MD5::operator= (const MD5& iMD5) {
|
|
memcpy(pMD5, iMD5.pMD5, 16);
|
|
return *this;
|
|
}
|
|
|
|
MD5* MD5::operator= (const MD5* iMD5) {
|
|
memcpy(pMD5, iMD5->pMD5, 16);
|
|
return this;
|
|
}
|
|
|
|
/* Byte-swap an array of words to little-endian. (Byte-sex independent) */
|
|
void MD5::byteSwap(uint32 *buf, uint32 words) {
|
|
uint8 *p = (uint8 *)buf;
|
|
do {
|
|
*buf++ = (uint32)((uint32)p[3]<<8 | p[2]) << 16 |
|
|
((uint32)p[1]<<8 | p[0]);
|
|
p += 4;
|
|
} while (--words);
|
|
}
|
|
|
|
void MD5::Generate(const uint8* buf, uint32 len, uint8 digest[16]) {
|
|
MD5Context ctx;
|
|
Init(&ctx);
|
|
Update(&ctx, buf, len);
|
|
Final(digest, &ctx);
|
|
}
|
|
|
|
/* Start MD5 accumulation. */
|
|
void MD5::Init(struct MD5Context *ctx) {
|
|
ctx->hash[0] = 0x67452301;
|
|
ctx->hash[1] = 0xefcdab89;
|
|
ctx->hash[2] = 0x98badcfe;
|
|
ctx->hash[3] = 0x10325476;
|
|
ctx->bytes[1] = ctx->bytes[0] = 0;
|
|
}
|
|
|
|
/* Update ctx to reflect the addition of another buffer full of bytes. */
|
|
void MD5::Update(struct MD5Context *ctx, uint8 const *buf, uint32 len) {
|
|
uint32 t = ctx->bytes[0];
|
|
if ((ctx->bytes[0] = t + len) < t) /* Update 64-bit byte count */
|
|
ctx->bytes[1]++; /* Carry from low to high */
|
|
|
|
|
|
|
|
t = 64 - (t & 0x3f); /* Bytes available in ctx->input (>= 1) */
|
|
if (t > len) {
|
|
memcpy((uint8*)ctx->input+64-t, buf, len);
|
|
return;
|
|
}
|
|
/* First chunk is an odd size */
|
|
memcpy((uint8*)ctx->input+64-t, buf, t);
|
|
byteSwap(ctx->input, 16);
|
|
Transform(ctx->hash, ctx->input);
|
|
buf += t;
|
|
len -= t;
|
|
/* Process data in 64-byte chunks */
|
|
while (len >= 64) {
|
|
memcpy(ctx->input, buf, 64);
|
|
byteSwap(ctx->input, 16);
|
|
Transform(ctx->hash, ctx->input);
|
|
buf += 64;
|
|
len -= 64;
|
|
}
|
|
/* Buffer any remaining bytes of data */
|
|
memcpy(ctx->input, buf, len);
|
|
}
|
|
|
|
/* Final wrapup - pad to 64-byte boundary with the bit pattern
|
|
* 1 0* (64-bit count of bits processed, LSB-first) */
|
|
void MD5::Final(uint8 digest[16], MD5Context *ctx) {
|
|
int count = ctx->bytes[0] & 0x3F; /* Bytes mod 64 */
|
|
uint8 *p = (uint8*)ctx->input + count;
|
|
/* Set the first byte of padding to 0x80. There is always room. */
|
|
*p++ = 0x80;
|
|
/* Bytes of zero padding needed to make 56 bytes (-8..55) */
|
|
count = 56 - 1 - count;
|
|
if (count < 0) { /* Padding forces an extra block */
|
|
memset(p, 0, count+8);
|
|
byteSwap(ctx->input, 16);
|
|
Transform(ctx->hash, ctx->input);
|
|
p = (uint8*)ctx->input;
|
|
count = 56;
|
|
}
|
|
memset(p, 0, count);
|
|
byteSwap(ctx->input, 14);
|
|
/* Append 8 bytes of length in *bits* and transform */
|
|
ctx->input[14] = ctx->bytes[0] << 3;
|
|
|
|
ctx->input[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
|
|
Transform(ctx->hash, ctx->input);
|
|
byteSwap(ctx->hash, 4);
|
|
memcpy(digest, ctx->hash, 16);
|
|
memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */
|
|
}
|
|
|
|
/* The four core functions */
|
|
#define F1(x, y, z) (z ^ (x & (y ^ z)))
|
|
#define F2(x, y, z) F1(z, x, y)
|
|
#define F3(x, y, z) (x ^ y ^ z)
|
|
#define F4(x, y, z) (y ^ (x | ~z))
|
|
/* This is the central step in the MD5 algorithm. */
|
|
#define MD5STEP(f,w,x,y,z,in,s) (w += f(x,y,z)+in, w = (w<<s | w>>(32-s)) + x)
|
|
|
|
|
|
|
|
/* The heart of the MD5 algorithm. */
|
|
void MD5::Transform(uint32 hash[4], const uint32 input[16]) {
|
|
uint32 a = hash[0], b = hash[1], c = hash[2], d = hash[3];
|
|
|
|
MD5STEP(F1, a, b, c, d, input[ 0]+0xd76aa478, 7);
|
|
MD5STEP(F1, d, a, b, c, input[ 1]+0xe8c7b756, 12);
|
|
MD5STEP(F1, c, d, a, b, input[ 2]+0x242070db, 17);
|
|
MD5STEP(F1, b, c, d, a, input[ 3]+0xc1bdceee, 22);
|
|
MD5STEP(F1, a, b, c, d, input[ 4]+0xf57c0faf, 7);
|
|
MD5STEP(F1, d, a, b, c, input[ 5]+0x4787c62a, 12);
|
|
MD5STEP(F1, c, d, a, b, input[ 6]+0xa8304613, 17);
|
|
MD5STEP(F1, b, c, d, a, input[ 7]+0xfd469501, 22);
|
|
MD5STEP(F1, a, b, c, d, input[ 8]+0x698098d8, 7);
|
|
MD5STEP(F1, d, a, b, c, input[ 9]+0x8b44f7af, 12);
|
|
MD5STEP(F1, c, d, a, b, input[10]+0xffff5bb1, 17);
|
|
MD5STEP(F1, b, c, d, a, input[11]+0x895cd7be, 22);
|
|
MD5STEP(F1, a, b, c, d, input[12]+0x6b901122, 7);
|
|
MD5STEP(F1, d, a, b, c, input[13]+0xfd987193, 12);
|
|
MD5STEP(F1, c, d, a, b, input[14]+0xa679438e, 17);
|
|
MD5STEP(F1, b, c, d, a, input[15]+0x49b40821, 22);
|
|
|
|
MD5STEP(F2, a, b, c, d, input[ 1]+0xf61e2562, 5);
|
|
MD5STEP(F2, d, a, b, c, input[ 6]+0xc040b340, 9);
|
|
MD5STEP(F2, c, d, a, b, input[11]+0x265e5a51, 14);
|
|
MD5STEP(F2, b, c, d, a, input[ 0]+0xe9b6c7aa, 20);
|
|
MD5STEP(F2, a, b, c, d, input[ 5]+0xd62f105d, 5);
|
|
MD5STEP(F2, d, a, b, c, input[10]+0x02441453, 9);
|
|
MD5STEP(F2, c, d, a, b, input[15]+0xd8a1e681, 14);
|
|
MD5STEP(F2, b, c, d, a, input[ 4]+0xe7d3fbc8, 20);
|
|
MD5STEP(F2, a, b, c, d, input[ 9]+0x21e1cde6, 5);
|
|
MD5STEP(F2, d, a, b, c, input[14]+0xc33707d6, 9);
|
|
MD5STEP(F2, c, d, a, b, input[ 3]+0xf4d50d87, 14);
|
|
MD5STEP(F2, b, c, d, a, input[ 8]+0x455a14ed, 20);
|
|
MD5STEP(F2, a, b, c, d, input[13]+0xa9e3e905, 5);
|
|
MD5STEP(F2, d, a, b, c, input[ 2]+0xfcefa3f8, 9);
|
|
MD5STEP(F2, c, d, a, b, input[ 7]+0x676f02d9, 14);
|
|
MD5STEP(F2, b, c, d, a, input[12]+0x8d2a4c8a, 20);
|
|
|
|
|
|
|
|
|
|
MD5STEP(F3, a, b, c, d, input[ 5]+0xfffa3942, 4);
|
|
MD5STEP(F3, d, a, b, c, input[ 8]+0x8771f681, 11);
|
|
MD5STEP(F3, c, d, a, b, input[11]+0x6d9d6122, 16);
|
|
MD5STEP(F3, b, c, d, a, input[14]+0xfde5380c, 23);
|
|
MD5STEP(F3, a, b, c, d, input[ 1]+0xa4beea44, 4);
|
|
MD5STEP(F3, d, a, b, c, input[ 4]+0x4bdecfa9, 11);
|
|
MD5STEP(F3, c, d, a, b, input[ 7]+0xf6bb4b60, 16);
|
|
MD5STEP(F3, b, c, d, a, input[10]+0xbebfbc70, 23);
|
|
MD5STEP(F3, a, b, c, d, input[13]+0x289b7ec6, 4);
|
|
MD5STEP(F3, d, a, b, c, input[ 0]+0xeaa127fa, 11);
|
|
MD5STEP(F3, c, d, a, b, input[ 3]+0xd4ef3085, 16);
|
|
MD5STEP(F3, b, c, d, a, input[ 6]+0x04881d05, 23);
|
|
MD5STEP(F3, a, b, c, d, input[ 9]+0xd9d4d039, 4);
|
|
MD5STEP(F3, d, a, b, c, input[12]+0xe6db99e5, 11);
|
|
MD5STEP(F3, c, d, a, b, input[15]+0x1fa27cf8, 16);
|
|
MD5STEP(F3, b, c, d, a, input[ 2]+0xc4ac5665, 23);
|
|
|
|
MD5STEP(F4, a, b, c, d, input[ 0]+0xf4292244, 6);
|
|
MD5STEP(F4, d, a, b, c, input[ 7]+0x432aff97, 10);
|
|
MD5STEP(F4, c, d, a, b, input[14]+0xab9423a7, 15);
|
|
MD5STEP(F4, b, c, d, a, input[ 5]+0xfc93a039, 21);
|
|
MD5STEP(F4, a, b, c, d, input[12]+0x655b59c3, 6);
|
|
MD5STEP(F4, d, a, b, c, input[ 3]+0x8f0ccc92, 10);
|
|
MD5STEP(F4, c, d, a, b, input[10]+0xffeff47d, 15);
|
|
MD5STEP(F4, b, c, d, a, input[ 1]+0x85845dd1, 21);
|
|
MD5STEP(F4, a, b, c, d, input[ 8]+0x6fa87e4f, 6);
|
|
MD5STEP(F4, d, a, b, c, input[15]+0xfe2ce6e0, 10);
|
|
MD5STEP(F4, c, d, a, b, input[ 6]+0xa3014314, 15);
|
|
MD5STEP(F4, b, c, d, a, input[13]+0x4e0811a1, 21);
|
|
MD5STEP(F4, a, b, c, d, input[ 4]+0xf7537e82, 6);
|
|
MD5STEP(F4, d, a, b, c, input[11]+0xbd3af235, 10);
|
|
MD5STEP(F4, c, d, a, b, input[ 2]+0x2ad7d2bb, 15);
|
|
MD5STEP(F4, b, c, d, a, input[ 9]+0xeb86d391, 21);
|
|
|
|
hash[0] += a;
|
|
hash[1] += b;
|
|
hash[2] += c;
|
|
hash[3] += d;
|
|
}
|
|
|