C#几种加密算法,包括MD5

王朝c#·作者佚名  2006-11-24
窄屏简体版  字體: |||超大  

MD5算法:

using System;

using System.Text;

namespace BaseStationPDA

{

/**//// <summary>

/// Summary description for MD5.

/// </summary>

public class MD5

{

const int BITS_TO_A_BYTE = 8;

const int BYTES_TO_A_WORD = 4;

const int BITS_TO_A_WORD = 32;

private static long[] m_lOnBits = new long[30 + 1];

private static long[] m_l2Power = new long[30 + 1];

private static long LShift(long lValue, long iShiftBits)

{

long LShift = 0;

if (iShiftBits == 0)

{

LShift = lValue;

return LShift;

}

else

{

if( iShiftBits == 31)

{

if (Convert.ToBoolean(lValue & 1))

{

LShift = 0x80000000;

}

else

{

LShift = 0;

}

return LShift;

}

else

{

if( iShiftBits < 0 || iShiftBits > 31)

{

// Err.Raise 6;

}

}

}

if (Convert.ToBoolean((lValue & m_l2Power[31 - iShiftBits])))

{

LShift = ((lValue & m_lOnBits[31 - (iShiftBits + 1)]) * m_l2Power[iShiftBits]) | 0x80000000;

}

else

{

LShift = ((lValue & m_lOnBits[31 - iShiftBits]) * m_l2Power[iShiftBits]);

}

return LShift;

}

private static long RShift(long lValue, long iShiftBits)

{

long RShift = 0;

if (iShiftBits == 0)

{

RShift = lValue;

return RShift;

}

else

{

if( iShiftBits == 31)

{

if (Convert.ToBoolean(lValue & 0x80000000))

{

RShift = 1;

}

else

{

RShift = 0;

}

return RShift;

}

else

{

if( iShiftBits < 0 || iShiftBits > 31)

{

// Err.Raise 6;

}

}

}

RShift = (lValue & 0x7FFFFFFE) / m_l2Power[iShiftBits];

if (Convert.ToBoolean((lValue & 0x80000000)))

{

RShift = (RShift | (0x40000000 / m_l2Power[iShiftBits - 1]));

}

return RShift;

}

private static long RotateLeft(long lValue, long iShiftBits)

{

long RotateLeft = 0;

RotateLeft = LShift(lValue, iShiftBits) | RShift(lValue, (32 - iShiftBits));

return RotateLeft;

}

private static long AddUnsigned(long lX, long lY)

{

long AddUnsigned = 0;

long lX4 = 0;

long lY4 = 0;

long lX8 = 0;

long lY8 = 0;

long lResult = 0;

lX8 = lX & 0x80000000;

lY8 = lY & 0x80000000;

lX4 = lX & 0x40000000;

lY4 = lY & 0x40000000;

lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF);

if (Convert.ToBoolean(lX4 & lY4))

{

lResult = lResult ^ 0x80000000 ^ lX8 ^ lY8;

}

else if( Convert.ToBoolean(lX4 | lY4))

{

if (Convert.ToBoolean(lResult & 0x40000000))

{

lResult = lResult ^ 0xC0000000 ^ lX8 ^ lY8;

}

else

{

lResult = lResult ^ 0x40000000 ^ lX8 ^ lY8;

}

}

else

{

lResult = lResult ^ lX8 ^ lY8;

}

AddUnsigned = lResult;

return AddUnsigned;

}

private static long md5_F(long x, long y, long z)

{

long md5_F = 0;

md5_F = (x & y) | (( ~x) & z);

return md5_F;

}

private static long md5_G(long x, long y, long z)

{

long md5_G = 0;

md5_G = (x & z) | (y & ( ~z));

return md5_G;

}

private static long md5_H(long x, long y, long z)

{

long md5_H = 0;

md5_H = (x ^ y ^ z);

return md5_H;

}

private static long md5_I(long x, long y, long z)

{

long md5_I = 0;

md5_I = (y ^ (x | (~z)));

return md5_I;

}

private static void md5_FF(ref long a, long b, long c, long d, long x, long s, long ac)

{

a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_F(b, c, d), x), ac));

a = RotateLeft(a, s);

a = AddUnsigned(a, b);

}

private static void md5_GG(ref long a, long b, long c, long d, long x, long s, long ac)

{

a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_G(b, c, d), x), ac));

a = RotateLeft(a, s);

a = AddUnsigned(a, b);

}

private static void md5_HH(ref long a, long b, long c, long d, long x, long s, long ac)

{

a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_H(b, c, d), x), ac));

a = RotateLeft(a, s);

a = AddUnsigned(a, b);

}

private static void md5_II(ref long a, long b, long c, long d, long x, long s, long ac)

{

a = AddUnsigned(a, AddUnsigned(AddUnsigned(md5_I(b, c, d), x), ac));

a = RotateLeft(a, s);

a = AddUnsigned(a, b);

}

private static long[] ConvertToWordArray(string sMessage)

{

long[] ConvertToWordArray = null;

int lMessageLength = 0;

int lNumberOfWords = 0;

long[] lWordArray = null;

int lBytePosition = 0;

int lByteCount = 0;

int lWordCount = 0;

const int MODULUS_BITS = 512;

const int CONGRUENT_BITS = 448;

lMessageLength = sMessage.Length;

lNumberOfWords = (((lMessageLength + ((MODULUS_BITS - CONGRUENT_BITS) / BITS_TO_A_BYTE)) / (MODULUS_BITS / BITS_TO_A_BYTE)) + 1) * (MODULUS_BITS / BITS_TO_A_WORD);

lWordArray = new long[lNumberOfWords];

lBytePosition = 0;

lByteCount = 0;

while(lByteCount < lMessageLength)

{

lWordCount = lByteCount / BYTES_TO_A_WORD;

lBytePosition = (lByteCount % BYTES_TO_A_WORD) * BITS_TO_A_BYTE;

lWordArray[lWordCount]

[1] [2] [3] 下一页

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
 
© 2005- 王朝網路 版權所有 導航