2012-04-29 20:52:25 +02:00
|
|
|
//
|
|
|
|
// MD4Engine.cpp
|
|
|
|
//
|
|
|
|
// $Id: //poco/1.4/Foundation/src/MD4Engine.cpp#1 $
|
|
|
|
//
|
|
|
|
// Library: Foundation
|
|
|
|
// Package: Crypt
|
|
|
|
// Module: MD4Engine
|
|
|
|
//
|
|
|
|
// Copyright (c) 2004-2006, Applied Informatics Software Engineering GmbH.
|
|
|
|
// and Contributors.
|
|
|
|
//
|
2014-05-04 21:02:42 +02:00
|
|
|
// SPDX-License-Identifier: BSL-1.0
|
2012-04-29 20:52:25 +02:00
|
|
|
//
|
|
|
|
//
|
|
|
|
// MD4 (RFC 1320) algorithm:
|
|
|
|
// Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
|
|
|
|
// rights reserved.
|
|
|
|
//
|
|
|
|
// License to copy and use this software is granted provided that it
|
|
|
|
// is identified as the "RSA Data Security, Inc. MD4 Message-Digest
|
|
|
|
// Algorithm" in all material mentioning or referencing this software
|
|
|
|
// or this function.
|
|
|
|
//
|
|
|
|
// License is also granted to make and use derivative works provided
|
|
|
|
// that such works are identified as "derived from the RSA Data
|
|
|
|
// Security, Inc. MD4 Message-Digest Algorithm" in all material
|
|
|
|
// mentioning or referencing the derived work.
|
|
|
|
//
|
|
|
|
// RSA Data Security, Inc. makes no representations concerning either
|
|
|
|
// the merchantability of this software or the suitability of this
|
|
|
|
// software for any particular purpose. It is provided "as is"
|
|
|
|
// without express or implied warranty of any kind.
|
|
|
|
//
|
|
|
|
// These notices must be retained in any copies of any part of this
|
|
|
|
// documentation and/or software.
|
|
|
|
//
|
|
|
|
|
|
|
|
|
|
|
|
#include "Poco/MD4Engine.h"
|
|
|
|
#include <cstring>
|
|
|
|
|
|
|
|
|
|
|
|
namespace Poco {
|
|
|
|
|
|
|
|
|
|
|
|
MD4Engine::MD4Engine()
|
|
|
|
{
|
|
|
|
_digest.reserve(16);
|
|
|
|
reset();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
MD4Engine::~MD4Engine()
|
|
|
|
{
|
|
|
|
reset();
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-20 04:48:41 +02:00
|
|
|
void MD4Engine::updateImpl(const void* input_, std::size_t inputLen)
|
2012-04-29 20:52:25 +02:00
|
|
|
{
|
|
|
|
const unsigned char* input = (const unsigned char*) input_;
|
|
|
|
unsigned int i, index, partLen;
|
|
|
|
|
|
|
|
/* Compute number of bytes mod 64 */
|
|
|
|
index = (unsigned int)((_context.count[0] >> 3) & 0x3F);
|
|
|
|
|
|
|
|
/* Update number of bits */
|
|
|
|
if ((_context.count[0] += ((UInt32) inputLen << 3)) < ((UInt32) inputLen << 3))
|
|
|
|
_context.count[1]++;
|
|
|
|
_context.count[1] += ((UInt32) inputLen >> 29);
|
|
|
|
|
|
|
|
partLen = 64 - index;
|
|
|
|
|
|
|
|
/* Transform as many times as possible. */
|
|
|
|
if (inputLen >= partLen)
|
|
|
|
{
|
|
|
|
std::memcpy(&_context.buffer[index], input, partLen);
|
|
|
|
transform(_context.state, _context.buffer);
|
|
|
|
|
|
|
|
for (i = partLen; i + 63 < inputLen; i += 64)
|
|
|
|
transform(_context.state, &input[i]);
|
|
|
|
|
|
|
|
index = 0;
|
|
|
|
}
|
|
|
|
else i = 0;
|
|
|
|
|
|
|
|
/* Buffer remaining input */
|
|
|
|
std::memcpy(&_context.buffer[index], &input[i], inputLen-i);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-20 04:48:41 +02:00
|
|
|
std::size_t MD4Engine::digestLength() const
|
2012-04-29 20:52:25 +02:00
|
|
|
{
|
|
|
|
return DIGEST_SIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MD4Engine::reset()
|
|
|
|
{
|
|
|
|
std::memset(&_context, 0, sizeof(_context));
|
|
|
|
_context.count[0] = _context.count[1] = 0;
|
|
|
|
_context.state[0] = 0x67452301;
|
|
|
|
_context.state[1] = 0xefcdab89;
|
|
|
|
_context.state[2] = 0x98badcfe;
|
|
|
|
_context.state[3] = 0x10325476;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
const DigestEngine::Digest& MD4Engine::digest()
|
|
|
|
{
|
|
|
|
static const unsigned char PADDING[64] =
|
|
|
|
{
|
|
|
|
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
|
|
|
|
};
|
|
|
|
unsigned char bits[8];
|
|
|
|
unsigned int index, padLen;
|
|
|
|
|
|
|
|
/* Save number of bits */
|
|
|
|
encode(bits, _context.count, 8);
|
|
|
|
|
|
|
|
/* Pad out to 56 mod 64. */
|
|
|
|
index = (unsigned int)((_context.count[0] >> 3) & 0x3f);
|
|
|
|
padLen = (index < 56) ? (56 - index) : (120 - index);
|
|
|
|
update(PADDING, padLen);
|
|
|
|
|
|
|
|
/* Append length (before padding) */
|
|
|
|
update(bits, 8);
|
|
|
|
|
|
|
|
/* Store state in digest */
|
|
|
|
unsigned char digest[16];
|
|
|
|
encode(digest, _context.state, 16);
|
|
|
|
_digest.clear();
|
|
|
|
_digest.insert(_digest.begin(), digest, digest + sizeof(digest));
|
|
|
|
|
|
|
|
/* Zeroize sensitive information. */
|
|
|
|
std::memset(&_context, 0, sizeof (_context));
|
|
|
|
reset();
|
|
|
|
return _digest;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Constants for MD4Transform routine. */
|
|
|
|
#define S11 3
|
|
|
|
#define S12 7
|
|
|
|
#define S13 11
|
|
|
|
#define S14 19
|
|
|
|
#define S21 3
|
|
|
|
#define S22 5
|
|
|
|
#define S23 9
|
|
|
|
#define S24 13
|
|
|
|
#define S31 3
|
|
|
|
#define S32 9
|
|
|
|
#define S33 11
|
|
|
|
#define S34 15
|
|
|
|
|
|
|
|
|
|
|
|
/* F, G and H are basic MD4 functions. */
|
|
|
|
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
|
|
|
|
#define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
|
|
|
|
#define H(x, y, z) ((x) ^ (y) ^ (z))
|
|
|
|
|
|
|
|
|
|
|
|
/* ROTATE_LEFT rotates x left n bits. */
|
|
|
|
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
|
|
|
|
|
|
|
|
|
|
|
|
/* FF, GG and HH are transformations for rounds 1, 2 and 3 */
|
|
|
|
/* Rotation is separate from addition to prevent recomputation */
|
|
|
|
#define FF(a, b, c, d, x, s) { \
|
|
|
|
(a) += F ((b), (c), (d)) + (x); \
|
|
|
|
(a) = ROTATE_LEFT ((a), (s)); \
|
|
|
|
}
|
|
|
|
#define GG(a, b, c, d, x, s) { \
|
|
|
|
(a) += G ((b), (c), (d)) + (x) + (UInt32)0x5a827999; \
|
|
|
|
(a) = ROTATE_LEFT ((a), (s)); \
|
|
|
|
}
|
|
|
|
#define HH(a, b, c, d, x, s) { \
|
|
|
|
(a) += H ((b), (c), (d)) + (x) + (UInt32)0x6ed9eba1; \
|
|
|
|
(a) = ROTATE_LEFT ((a), (s)); \
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void MD4Engine::transform (UInt32 state[4], const unsigned char block[64])
|
|
|
|
{
|
|
|
|
UInt32 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
|
|
|
|
|
|
|
|
decode(x, block, 64);
|
|
|
|
|
|
|
|
/* Round 1 */
|
|
|
|
FF (a, b, c, d, x[ 0], S11); /* 1 */
|
|
|
|
FF (d, a, b, c, x[ 1], S12); /* 2 */
|
|
|
|
FF (c, d, a, b, x[ 2], S13); /* 3 */
|
|
|
|
FF (b, c, d, a, x[ 3], S14); /* 4 */
|
|
|
|
FF (a, b, c, d, x[ 4], S11); /* 5 */
|
|
|
|
FF (d, a, b, c, x[ 5], S12); /* 6 */
|
|
|
|
FF (c, d, a, b, x[ 6], S13); /* 7 */
|
|
|
|
FF (b, c, d, a, x[ 7], S14); /* 8 */
|
|
|
|
FF (a, b, c, d, x[ 8], S11); /* 9 */
|
|
|
|
FF (d, a, b, c, x[ 9], S12); /* 10 */
|
|
|
|
FF (c, d, a, b, x[10], S13); /* 11 */
|
|
|
|
FF (b, c, d, a, x[11], S14); /* 12 */
|
|
|
|
FF (a, b, c, d, x[12], S11); /* 13 */
|
|
|
|
FF (d, a, b, c, x[13], S12); /* 14 */
|
|
|
|
FF (c, d, a, b, x[14], S13); /* 15 */
|
|
|
|
FF (b, c, d, a, x[15], S14); /* 16 */
|
|
|
|
|
|
|
|
/* Round 2 */
|
|
|
|
GG (a, b, c, d, x[ 0], S21); /* 17 */
|
|
|
|
GG (d, a, b, c, x[ 4], S22); /* 18 */
|
|
|
|
GG (c, d, a, b, x[ 8], S23); /* 19 */
|
|
|
|
GG (b, c, d, a, x[12], S24); /* 20 */
|
|
|
|
GG (a, b, c, d, x[ 1], S21); /* 21 */
|
|
|
|
GG (d, a, b, c, x[ 5], S22); /* 22 */
|
|
|
|
GG (c, d, a, b, x[ 9], S23); /* 23 */
|
|
|
|
GG (b, c, d, a, x[13], S24); /* 24 */
|
|
|
|
GG (a, b, c, d, x[ 2], S21); /* 25 */
|
|
|
|
GG (d, a, b, c, x[ 6], S22); /* 26 */
|
|
|
|
GG (c, d, a, b, x[10], S23); /* 27 */
|
|
|
|
GG (b, c, d, a, x[14], S24); /* 28 */
|
|
|
|
GG (a, b, c, d, x[ 3], S21); /* 29 */
|
|
|
|
GG (d, a, b, c, x[ 7], S22); /* 30 */
|
|
|
|
GG (c, d, a, b, x[11], S23); /* 31 */
|
|
|
|
GG (b, c, d, a, x[15], S24); /* 32 */
|
|
|
|
|
|
|
|
/* Round 3 */
|
|
|
|
HH (a, b, c, d, x[ 0], S31); /* 33 */
|
|
|
|
HH (d, a, b, c, x[ 8], S32); /* 34 */
|
|
|
|
HH (c, d, a, b, x[ 4], S33); /* 35 */
|
|
|
|
HH (b, c, d, a, x[12], S34); /* 36 */
|
|
|
|
HH (a, b, c, d, x[ 2], S31); /* 37 */
|
|
|
|
HH (d, a, b, c, x[10], S32); /* 38 */
|
|
|
|
HH (c, d, a, b, x[ 6], S33); /* 39 */
|
|
|
|
HH (b, c, d, a, x[14], S34); /* 40 */
|
|
|
|
HH (a, b, c, d, x[ 1], S31); /* 41 */
|
|
|
|
HH (d, a, b, c, x[ 9], S32); /* 42 */
|
|
|
|
HH (c, d, a, b, x[ 5], S33); /* 43 */
|
|
|
|
HH (b, c, d, a, x[13], S34); /* 44 */
|
|
|
|
HH (a, b, c, d, x[ 3], S31); /* 45 */
|
|
|
|
HH (d, a, b, c, x[11], S32); /* 46 */
|
|
|
|
HH (c, d, a, b, x[ 7], S33); /* 47 */
|
|
|
|
HH (b, c, d, a, x[15], S34); /* 48 */
|
|
|
|
|
|
|
|
state[0] += a;
|
|
|
|
state[1] += b;
|
|
|
|
state[2] += c;
|
|
|
|
state[3] += d;
|
|
|
|
|
|
|
|
/* Zeroize sensitive information. */
|
|
|
|
std::memset(x, 0, sizeof(x));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-20 04:48:41 +02:00
|
|
|
void MD4Engine::encode(unsigned char* output, const UInt32* input, std::size_t len)
|
2012-04-29 20:52:25 +02:00
|
|
|
{
|
|
|
|
unsigned int i, j;
|
|
|
|
|
|
|
|
for (i = 0, j = 0; j < len; i++, j += 4)
|
|
|
|
{
|
|
|
|
output[j] = (unsigned char)(input[i] & 0xff);
|
|
|
|
output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
|
|
|
|
output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
|
|
|
|
output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-07-20 04:48:41 +02:00
|
|
|
void MD4Engine::decode(UInt32* output, const unsigned char* input, std::size_t len)
|
2012-04-29 20:52:25 +02:00
|
|
|
{
|
|
|
|
unsigned int i, j;
|
|
|
|
|
|
|
|
for (i = 0, j = 0; j < len; i++, j += 4)
|
|
|
|
output[i] = ((UInt32)input[j]) | (((UInt32)input[j+1]) << 8) |
|
|
|
|
(((UInt32)input[j+2]) << 16) | (((UInt32)input[j+3]) << 24);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
} // namespace Poco
|