-
-
Save mahizsas/7d8c25c92d199e2b82f6 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
using System; | |
using System.Text; | |
namespace System.Security.Cryptography { | |
public static class StringExtensions | |
{ | |
public static int CRC32(this string src) | |
{ | |
return (int)Crc32.Compute(Encoding.UTF8.GetBytes(src)); | |
} | |
} | |
public class Crc32 : HashAlgorithm | |
{ | |
public const UInt32 DefaultPolynomial = 0xedb88320; | |
public const UInt32 DefaultSeed = 0xffffffff; | |
private UInt32 hash; | |
private readonly UInt32 seed; | |
private readonly UInt32[] table; | |
private static UInt32[] defaultTable; | |
public Crc32() | |
{ | |
table = InitializeTable(DefaultPolynomial); | |
seed = DefaultSeed; | |
Initialize(); | |
} | |
public override int HashSize{get { return 32; }} | |
public override sealed void Initialize(){hash = seed;} | |
protected override void HashCore(byte[] buffer, int start, int length) | |
{ | |
hash = CalculateHash(table, hash, buffer, start, length); | |
} | |
protected override byte[] HashFinal() | |
{ | |
var hashBuffer = UInt32ToBigEndianBytes(~hash); | |
HashValue = hashBuffer; | |
return hashBuffer; | |
} | |
public static UInt32 Compute(byte[] buffer) | |
{ | |
return ~CalculateHash(InitializeTable(DefaultPolynomial), DefaultSeed, buffer, 0, buffer.Length); | |
} | |
public static UInt32 Compute(UInt32 seed, byte[] buffer) | |
{ | |
return ~CalculateHash(InitializeTable(DefaultPolynomial), seed, buffer, 0, buffer.Length); | |
} | |
public static UInt32 Compute(UInt32 polynomial, UInt32 seed, byte[] buffer) | |
{ | |
return ~CalculateHash(InitializeTable(polynomial), seed, buffer, 0, buffer.Length); | |
} | |
private static UInt32[] InitializeTable(UInt32 polynomial) | |
{ | |
if (polynomial == DefaultPolynomial && defaultTable != null) return defaultTable; | |
var createTable = new UInt32[256]; | |
for (int i = 0; i < 256; i++) | |
{ | |
var entry = (UInt32)i; | |
for (int j = 0; j < 8; j++) entry = (entry & 1) == 1 ? (entry >> 1) ^ polynomial : entry >> 1; | |
createTable[i] = entry; | |
} | |
if (polynomial == DefaultPolynomial) defaultTable = createTable; | |
return createTable; | |
} | |
private static UInt32 CalculateHash(UInt32[] table, UInt32 seed, byte[] buffer, int start, int size) | |
{ | |
var crc = seed; | |
for (int i = start; i < size; i++) | |
unchecked | |
{ | |
crc = (crc >> 8) ^ table[buffer[i] ^ crc & 0xff]; | |
} | |
return crc; | |
} | |
private static byte[] UInt32ToBigEndianBytes(UInt32 x) | |
{ | |
return new[] { | |
(byte)((x >> 24) & 0xff), | |
(byte)((x >> 16) & 0xff), | |
(byte)((x >> 8) & 0xff), | |
(byte)(x & 0xff) | |
}; | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment