Google-Checksumpublic class CheckSum
{
private const uint GOOGLE_MAGIC = 0xE6359A60;
private static uint zeroFill(uint a, int b)
{
checked
{
uint z = 0x80000000;
if (Convert.ToBoolean(z & a))
{
a = (a >> 1);
a &= (~z);
a |= 0x40000000;
a = (a >> (b - 1));
}
else
{
a = (a >> b);
}
}
return a;
}
private static uint[] mix(uint a, uint b, uint c)
{
a -= b; a -= c; a ^= (uint)(zeroFill(c, 13));
b -= c; b -= a; b ^= (uint)(a << 8);
c -= a; c -= b; c ^= (uint)(zeroFill(b, 13));
a -= b; a -= c; a ^= (uint)(zeroFill(c, 12));
b -= c; b -= a; b ^= (uint)(a << 16);
c -= a; c -= b; c ^= (uint)(zeroFill(b, 5));
a -= b; a -= c; a ^= (uint)(zeroFill(c, 3));
b -= c; b -= a; b ^= (uint)(a << 10);
c -= a; c -= b; c ^= (uint)(zeroFill(b, 15));
return new uint[3] { a, b, c };
}
private static uint GoogleCH(uint[] url, uint length, uint init)
{
if (length == 0)
{
length = (uint)url.Length;
}
uint a, b;
a = b = 0x9E3779B9;
uint c = init;
int k = 0;
uint len = length;
uint[] m_mix = new uint[3];
while (len >= 12)
{
a += (uint)(url[k + 0] + (url[k + 1] << 8) + (url[k + 2] << 16) + (url[k + 3] << 24));
b += (uint)(url[k + 4] + (url[k + 5] << 8) + (url[k + 6] << 16) + (url[k + 7] << 24));
c += (uint)(url[k + 8] + (url[k + 9] << 8) + (url[k + 10] << 16) + (url[k + 11] << 24));
m_mix = mix(a, b, c);
a = m_mix[0]; b = m_mix[1]; c = m_mix[2];
k += 12;
len -= 12;
}
c += length;
switch (len) /* all the case statements fall through */
{
case 11:
{
c += (uint)(url[k + 10] << 24);
c += (uint)(url[k + 9] << 16);
c += (uint)(url[k + 8] << 8);
b += (uint)(url[k + 7] << 24);
b += (uint)(url[k + 6] << 16);
b += (uint)(url[k + 5] << 8);
b += (uint)(url[k + 4]);
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 10:
{
c += (uint)(url[k + 9] << 16);
c += (uint)(url[k + 8] << 8);
b += (uint)(url[k + 7] << 24);
b += (uint)(url[k + 6] << 16);
b += (uint)(url[k + 5] << 8);
b += (uint)(url[k + 4]);
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 9:
{
c += (uint)(url[k + 8] << 8);
b += (uint)(url[k + 7] << 24);
b += (uint)(url[k + 6] << 16);
b += (uint)(url[k + 5] << 8);
b += (uint)(url[k + 4]);
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
/* the first byte of c is reserved for the length */
case 8:
{
b += (uint)(url[k + 7] << 24);
b += (uint)(url[k + 6] << 16);
b += (uint)(url[k + 5] << 8);
b += (uint)(url[k + 4]);
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 7:
{
b += (uint)(url[k + 6] << 16);
b += (uint)(url[k + 5] << 8);
b += (uint)(url[k + 4]);
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 6:
{
b += (uint)(url[k + 4]);
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 5:
{
b += (uint)(url[k + 4]);
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 4:
{
a += (uint)(url[k + 3] << 24);
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 3:
{
a += (uint)(url[k + 2] << 16);
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 2:
{
a += (uint)(url[k + 1] << 8);
a += (uint)(url[k + 0]);
break;
}
case 1:
{
a += (uint)(url[k + 0]);
break;
}
/* case 0: nothing left to add */
}
m_mix = mix(a, b, c);
/*-------------------------------------------- report the result */
return m_mix[2];
}
private static uint GoogleCH(string url, uint length)
{
uint[] m_urluint = new uint[url.Length];
for (int i = 0; i < url.Length; i++)
{
m_urluint[i] = url[i];
}
return GoogleCH(m_urluint, length, GOOGLE_MAGIC);
}
private static uint GoogleCH(string sURL)
{
return GoogleCH(sURL, 0);
}
private static uint GoogleCH(uint[] url, uint length)
{
return GoogleCH(url, length, GOOGLE_MAGIC);
}
private static uint[] c32to8bit(uint[] arr32)
{
uint[] arr8 = new uint[arr32.GetLength(0) * 4 + 3];
for (int i = 0; i < arr32.GetLength(0); i++)
{
for (int bitOrder = i * 4; bitOrder <= i * 4 + 3; bitOrder++)
{
arr8[bitOrder] = arr32[i] & 255;
arr32[i] = zeroFill(arr32[i], 8);
}
}
return arr8;
}
//新算法,ToolBar 版本>>=2.0.114
public static string CalculateChecksum(string sURL)
{
uint ch = GoogleCH("info:" + sURL);
ch = (((ch / 7) << 2) | (((uint)(ch % 13)) & 7));
uint[] prbuf = new uint[20];
prbuf[0] = ch;
for (int i = 1; i < 20; i++)
{
prbuf[i] = prbuf[i - 1] - 9;
}
ch = GoogleCH(c32to8bit(prbuf), 80);
return string.Format("6{0}", ch);
}
//老算法,ToolBar 版本<2.0.114
public static string CalculateChecksumOld(string sURL)
{
uint ch = GoogleCH("info:" + sURL);
string CalculateChecksum = "6" + Convert.ToString((ch));
return CalculateChecksum;
}
}
CRC-32 Table：
CRC32 Tablepublic static uint[] CRC_32_TAB =
{
0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA,
0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988,
0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE,
0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC,
0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5,
0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172,
0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,
0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940,
0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116,
0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924,
0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,
0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A,
0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818,
0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01,
0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E,
0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457,
0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C,
0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2,
0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB,
0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0,
0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086,
0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4,
0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD,
0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A,
0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8,
0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE,
0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7,
0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC,
0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5,
0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252,
0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60,
0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236,
0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F,
0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04,
0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A,
0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713,
0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38,
0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21,
0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E,
0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C,
0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2,
0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB,
0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0,
0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6,
0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF,
0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94,
0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D,
};
CRC-32 Table 生成算法：
CRC32 Table 生成算法/// <summary>
/// Builds a crc32 table given a polynomial
/// </summary>
/// <param name="ulPolynomial">polynomial which used in WinZip, Ethernet, etc is 0x04C11DB7</param>
/// <returns></returns>
protected static uint[] BuildCRC32Table( uint ulPolynomial )
{
uint dwCrc;
uint[] table = new uint[256];
// 256 values representing ASCII character codes.
for (int i = 0; i < 256; i++)
{
dwCrc = (uint)i;
for (int j = 8; j > 0; j--)
{
if((dwCrc & 1) == 1)
dwCrc = (dwCrc >> 1) ^ ulPolynomial;
else
dwCrc >>= 1;
}
table[i] = dwCrc;
}
return table;
}
产生CRC32检验码：
CRC32检验码public static int CalcCRC32(string text)
{
byte[] bytes = System.Text.ASCIIEncoding.ASCII.GetBytes(text);
uint crc32 = 0xFFFFFFFF;
for (int i = 0; i < bytes.Length; i++)
{
crc32 = (CRC_32_TAB[(crc32 ^ bytes[i]) & 0xff] ^ (crc32 >> 8));
}
crc32 = ~crc32;
return (int)(crc32);
}