md2engine.cpp

This software aims to create an applet and panel tools to manage a wireless interface card, such as

//
// MD2Engine.cpp
//
// $Id: //poco/Main/Foundation/src/MD2Engine.cpp#5 $
//
// Copyright (c) 2004, Guenter Obiltschnig/Applied Informatics.
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 
// 1. Redistributions of source code must retain the above copyright
//    notice, this list of conditions and the following disclaimer.
// 
// 2. Redistributions in binary form must reproduce the above copyright
//    notice, this list of conditions and the following disclaimer in the
//    documentation and/or other materials provided with the distribution.
// 
// 3. Redistributions in any form must be accompanied by information on
//    how to obtain complete source code for this software and any
//    accompanying software that uses this software.  The source code
//    must either be included in the distribution or be available for no
//    more than the cost of distribution plus a nominal fee, and must be
//    freely redistributable under reasonable conditions.  For an
//    executable file, complete source code means the source code for all
//    modules it contains.  It does not include source code for modules or
//    files that typically accompany the major components of the operating
//    system on which the executable file runs.
// 
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
// FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
// COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
// INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
// BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
// ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
//
// MD2 (RFC 1319) algorithm:
// Copyright (C) 1990-2, RSA Data Security, Inc. Created 1990. All
// rights reserved.
//
// License to copy and use this software is granted for
// non-commercial Internet Privacy-Enhanced Mail provided that it is
// identified as the "RSA Data Security, Inc. MD2 Message Digest
// Algorithm" in all material mentioning or referencing this software
// or this function.
//
// 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 "Foundation/MD2Engine.h"
#include <string.h>


Foundation_BEGIN


MD2Engine::MD2Engine()
{
	_digest.reserve(16);
	reset();
}


MD2Engine::~MD2Engine()
{
	reset();
}

	
void MD2Engine::updateImp(const void* input_, unsigned inputLen)
{
	const unsigned char* input = (const unsigned char*) input_;
	unsigned int i, index, partLen;

	/* Update number of bytes mod 16 */
	index = _context.count;
	_context.count = (index + inputLen) & 0xf;

	partLen = 16 - index;

	/* Transform as many times as possible.	*/
	if (inputLen >= partLen) 
	{
		memcpy(&_context.buffer[index], input, partLen);
		transform(_context.state, _context.checksum, _context.buffer);

		for (i = partLen; i + 15 < inputLen; i += 16)
			transform(_context.state, _context.checksum, &input[i]);

		index = 0;
	}
	else i = 0;

	/* Buffer remaining input */
	memcpy(&_context.buffer[index], &input[i], inputLen-i);
}


unsigned MD2Engine::digestLength() const
{
	return DIGEST_SIZE;
}


void MD2Engine::reset()
{
	memset(&_context, 0, sizeof(_context));
}


const DigestEngine::Digest& MD2Engine::digest()
{
	static const unsigned char* PADDING[] = 
	{
		(unsigned char*) "",
		(unsigned char*) "\001",
		(unsigned char*) "\002\002",
		(unsigned char*) "\003\003\003",
		(unsigned char*) "\004\004\004\004",
		(unsigned char*) "\005\005\005\005\005",
		(unsigned char*) "\006\006\006\006\006\006",
		(unsigned char*) "\007\007\007\007\007\007\007",
		(unsigned char*) "\010\010\010\010\010\010\010\010",
		(unsigned char*) "\011\011\011\011\011\011\011\011\011",
		(unsigned char*) "\012\012\012\012\012\012\012\012\012\012",
		(unsigned char*) "\013\013\013\013\013\013\013\013\013\013\013",
		(unsigned char*) "\014\014\014\014\014\014\014\014\014\014\014\014",
		(unsigned char*) "\015\015\015\015\015\015\015\015\015\015\015\015\015",
		(unsigned char *) "\016\016\016\016\016\016\016\016\016\016\016\016\016\016",
		(unsigned char *) "\017\017\017\017\017\017\017\017\017\017\017\017\017\017\017",
		(unsigned char *) "\020\020\020\020\020\020\020\020\020\020\020\020\020\020\020\020"
	};
	unsigned int index, padLen;

	/* Pad out to multiple of 16. */
	index = _context.count;
	padLen = 16 - index;
	update((const char*) PADDING[padLen], padLen);

	/* Extend with checksum */
	update((const char*) _context.checksum, 16);

	/* Store state in digest */
	_digest.clear();
	_digest.insert(_digest.begin(), _context.state, _context.state + 16);

	/* Zeroize sensitive information. */
	memset(&_context, 0, sizeof(_context));
	reset();
	return _digest;
}


void MD2Engine::transform(unsigned char state[16], unsigned char checksum[16], const unsigned char block[16])
{
	// Permutation of 0..255 constructed from the digits of pi. It gives a
	// "random" nonlinear byte substitution operation.
	static const unsigned char PI_SUBST[256] = 
	{
		41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,
		19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,
		76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,
		138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,
		245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,
		148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,
		39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,
		181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,
		150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,
		112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,
		96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,
		85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,
		234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,
		129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,
		8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,
		203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,
		166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,
		31, 26, 219, 153, 141, 51, 159, 17, 131, 20
	};
	unsigned int i, j, t;
	unsigned char x[48];

	/* Form encryption block from state, block, state ^ block. */
	memcpy(x, state, 16);
	memcpy(x+16, block, 16);
	for (i = 0; i < 16; i++)
		x[i+32] = state[i] ^ block[i];

	/* Encrypt block (18 rounds). */
	t = 0;
	for (i = 0; i < 18; i++) 
	{
		for (j = 0; j < 48; j++)
			t = x[j] ^= PI_SUBST[t];
		t = (t + i) & 0xff;
	}

	/* Save new state */
	memcpy(state, x, 16);

	/* Update checksum. */
	t = checksum[15];
	for (i = 0; i < 16; i++)
	t = checksum[i] ^= PI_SUBST[block[i] ^ t];

	/* Zeroize sensitive information. */
	memset(x, 0, sizeof(x));
}


Foundation_END