Fast CRC algorithm?
问题 I want to create a 32 bit number out of an ASCII-string. CRC32 algorithm is exactly what I'm looking for but I can't use it because the table it requires is way too huge (it is for an embedded systems where ressources are VERY rare). So: any suggestions for a fast and slim CRC algorithm? It does not matter when collissions are a bit more probable than with the original CRC32. Thanks! 回答1: CRC implementations use tables for speed. They are not required. Here is a short CRC32 using either the