tricky crc algorithm
问题 I am trying to find the crc that works with the following results. The byte string consists of 2 bytes (ie. 0xCE1E) and the crc is an single byte (ie. 0x03) byte crc CE1E 03 CE20 45 CE22 6F 0000 C0 0001 D4 FFFF 95 Can anyone help? 回答1: First, 4 hex digits aren't 4 bytes. Since all your examples show 4 hex digits -- 2 bytes -- I'll assume you mean 2 bytes. There are only 65,536 distinct hash values, here's what you do. Execute the hash function for all 65,536 values from 0000 to FFFF. Tabulate