CRC8校验算法总结

最近做项目时，一直在用crc8算法做校验，但是编程平台多样，所以总结一下。使用的多项式是：X8 + X2 + X + 1

1 C语言

/*************************************************************
*	函数名称：	gh_crc8
*
*	函数功能：	生成crc8 密匙
*
*	入口参数：	p_buffer 需要校验的数据首地址 buf_size:需要校验的数据的长度
*
*	返回参数：	生成的crc8 秘钥
*
*	说明：p_buffer的空间必须要要>=buf_size 此函数不负责检测数据溢出
*************************************************************/
static uint8_t gh_crc8( uint8_t * p_buffer, uint16_t buf_size )
{
    uint8_t crc = 0;
    if(buf_size <= 0)
    {
        return crc;
    }
    while( buf_size-- )
    {
        for ( uint8_t i = 0x80; i != 0; i /= 2 )
        {
            if ( (crc & 0x80) != 0)
            {
                crc *= 2;
                crc ^= 0x07; // 多项式：X8 + X2 + X + 1
            }
            else
            {
                crc *= 2;
            }

            if ( (*p_buffer & i) != 0 )
            {
                crc ^= 0x07;
            }
        }
        p_buffer++;
    }
    return crc;
}

2 C#

        /*************************************************************
        *	函数名称：	gh_crc8
        *
        *	函数功能：	生成crc8 密匙
        *
        *	入口参数：	p_buffer 需要校验的数据首地址 buf_size:需要校验的数据的长度
        *
        *	返回参数：	生成的crc8 秘钥
        *
        *	说明：p_buffer的空间必须要要>=buf_size 此函数不负责检测数据溢出
        *************************************************************/
        private byte CRC8(byte[] buffer)
        {
            byte crc = 0;

            for (int j = 0; j < buffer.Length; j++)
            {
                for (byte i = 0x80; i != 0; i /= 2)
                {
                    if ((crc & 0x80) != 0)
                    {
                        crc *= 2;
                        crc ^= 0x07; // 多项式：X8 + X2 + X + 1
                    }
                    else
                    {
                        crc *= 2;
                    }

                    if ((buffer[j] & i) != 0)
                    {
                        crc ^= 0x07;
                    }
                }
            }
            return crc;
        }

3 JS

const CHECKSUM_TABLE = [
  0x00, 0x07, 0x0e, 0x09, 0x1c, 0x1b,
  0x12, 0x15, 0x38, 0x3f, 0x36, 0x31, 0x24, 0x23, 0x2a,
  0x2d, 0x70, 0x77, 0x7e, 0x79, 0x6c, 0x6b, 0x62, 0x65,
  0x48, 0x4f, 0x46, 0x41, 0x54, 0x53, 0x5a, 0x5d, 0xe0,
  0xe7, 0xee, 0xe9, 0xfc, 0xfb, 0xf2, 0xf5, 0xd8, 0xdf,
  0xd6, 0xd1, 0xc4, 0xc3, 0xca, 0xcd, 0x90, 0x97, 0x9e,
  0x99, 0x8c, 0x8b, 0x82, 0x85, 0xa8, 0xaf, 0xa6, 0xa1,
  0xb4, 0xb3, 0xba, 0xbd, 0xc7, 0xc0, 0xc9, 0xce, 0xdb,
  0xdc, 0xd5, 0xd2, 0xff, 0xf8, 0xf1, 0xf6, 0xe3, 0xe4,
  0xed, 0xea, 0xb7, 0xb0, 0xb9, 0xbe, 0xab, 0xac, 0xa5,
  0xa2, 0x8f, 0x88, 0x81, 0x86, 0x93, 0x94, 0x9d, 0x9a,
  0x27, 0x20, 0x29, 0x2e, 0x3b, 0x3c, 0x35, 0x32, 0x1f,
  0x18, 0x11, 0x16, 0x03, 0x04, 0x0d, 0x0a, 0x57, 0x50,
  0x59, 0x5e, 0x4b, 0x4c, 0x45, 0x42, 0x6f, 0x68, 0x61,
  0x66, 0x73, 0x74, 0x7d, 0x7a, 0x89, 0x8e, 0x87, 0x80,
  0x95, 0x92, 0x9b, 0x9c, 0xb1, 0xb6, 0xbf, 0xb8, 0xad,
  0xaa, 0xa3, 0xa4, 0xf9, 0xfe, 0xf7, 0xf0, 0xe5, 0xe2,
  0xeb, 0xec, 0xc1, 0xc6, 0xcf, 0xc8, 0xdd, 0xda, 0xd3,
  0xd4, 0x69, 0x6e, 0x67, 0x60, 0x75, 0x72, 0x7b, 0x7c,
  0x51, 0x56, 0x5f, 0x58, 0x4d, 0x4a, 0x43, 0x44, 0x19,
  0x1e, 0x17, 0x10, 0x05, 0x02, 0x0b, 0x0c, 0x21, 0x26,
  0x2f, 0x28, 0x3d, 0x3a, 0x33, 0x34, 0x4e, 0x49, 0x40,
  0x47, 0x52, 0x55, 0x5c, 0x5b, 0x76, 0x71, 0x78, 0x7f,
  0x6a, 0x6d, 0x64, 0x63, 0x3e, 0x39, 0x30, 0x37, 0x22,
  0x25, 0x2c, 0x2b, 0x06, 0x01, 0x08, 0x0f, 0x1a, 0x1d,
  0x14, 0x13, 0xae, 0xa9, 0xa0, 0xa7, 0xb2, 0xb5, 0xbc,
  0xbb, 0x96, 0x91, 0x98, 0x9f, 0x8a, 0x8d, 0x84, 0x83,
  0xde, 0xd9, 0xd0, 0xd7, 0xc2, 0xc5, 0xcc, 0xcb, 0xe6,
  0xe1, 0xe8, 0xef, 0xfa, 0xfd, 0xf4, 0xf3
];

function gh_crc8(buffer){
  let crc = new Uint8Array(1);
  crc = 0;
  for (let i = 0; i < buffer.length; i++) {
    crc = CHECKSUM_TABLE[(crc ^ (buffer[i] & 0xFF)) & 0xFF];
  }
  return (crc & 0xff);
}

以上算法经过实际测试可用！