524 lines
15 KiB
C
524 lines
15 KiB
C
/*
|
|
* Kneron crc, checksum & sha1 integrity check value generation
|
|
*
|
|
* Copyright (C) 2018 Kneron, Inc. All rights reserved.
|
|
*
|
|
*/
|
|
|
|
#include <string.h>
|
|
#include "kdp_sha1.h"
|
|
#include "kmdw_utils_crc.h"
|
|
#include "kmdw_console.h"
|
|
|
|
|
|
#define SHA1CircularShift(bits,word) \
|
|
(((word) << (bits)) | ((word) >> (32-(bits))))
|
|
|
|
/* Local Function Prototyptes */
|
|
void SHA1PadMessage(SHA1Context *);
|
|
void SHA1ProcessMessageBlock(SHA1Context *);
|
|
|
|
int SHA1Reset(SHA1Context *context)
|
|
{
|
|
if (!context)
|
|
{
|
|
return shaNull;
|
|
}
|
|
|
|
context->Length_Low = 0;
|
|
context->Length_High = 0;
|
|
context->Message_Block_Index = 0;
|
|
|
|
context->Intermediate_Hash[0] = 0x67452301;
|
|
context->Intermediate_Hash[1] = 0xEFCDAB89;
|
|
context->Intermediate_Hash[2] = 0x98BADCFE;
|
|
context->Intermediate_Hash[3] = 0x10325476;
|
|
context->Intermediate_Hash[4] = 0xC3D2E1F0;
|
|
|
|
context->Computed = 0;
|
|
context->Corrupted = 0;
|
|
|
|
return shaSuccess;
|
|
}
|
|
|
|
/*
|
|
* SHA1Result
|
|
*
|
|
* Description:
|
|
* This function will return the 160-bit message digest into the
|
|
* Message_Digest array provided by the caller.
|
|
* NOTE: The first octet of hash is stored in the 0th element,
|
|
* the last octet of hash in the 19th element.
|
|
*
|
|
* Parameters:
|
|
* context: [in/out]
|
|
* The context to use to calculate the SHA-1 hash.
|
|
* Message_Digest: [out]
|
|
* Where the digest is returned.
|
|
*
|
|
* Returns:
|
|
* sha Error Code.
|
|
*
|
|
*/
|
|
int SHA1Result( SHA1Context *context,
|
|
uint8_t Message_Digest[SHA1HashSize])
|
|
{
|
|
int i;
|
|
|
|
if (!context || !Message_Digest)
|
|
{
|
|
return shaNull;
|
|
}
|
|
|
|
if (context->Corrupted)
|
|
{
|
|
return context->Corrupted;
|
|
}
|
|
|
|
if (!context->Computed)
|
|
{
|
|
SHA1PadMessage(context);
|
|
for(i=0; i<64; ++i)
|
|
{
|
|
/* message may be sensitive, clear it out */
|
|
context->Message_Block[i] = 0;
|
|
}
|
|
context->Length_Low = 0; /* and clear length */
|
|
context->Length_High = 0;
|
|
context->Computed = 1;
|
|
|
|
}
|
|
|
|
for(i = 0; i < SHA1HashSize; ++i)
|
|
{
|
|
Message_Digest[i] = context->Intermediate_Hash[i>>2]
|
|
>> 8 * ( 3 - ( i & 0x03 ) );
|
|
}
|
|
|
|
return shaSuccess;
|
|
}
|
|
|
|
/*
|
|
* SHA1Input
|
|
*
|
|
* Description:
|
|
* This function accepts an array of octets as the next portion
|
|
* of the message.
|
|
*
|
|
* Parameters:
|
|
* context: [in/out]
|
|
* The SHA context to update
|
|
* message_array: [in]
|
|
* An array of characters representing the next portion of
|
|
* the message.
|
|
* length: [in]
|
|
* The length of the message in message_array
|
|
*
|
|
* Returns:
|
|
* sha Error Code.
|
|
*
|
|
*/
|
|
int SHA1Input( SHA1Context *context,
|
|
const uint8_t *message_array,
|
|
unsigned length)
|
|
{
|
|
if (!length)
|
|
{
|
|
return shaSuccess;
|
|
}
|
|
|
|
if (!context || !message_array)
|
|
{
|
|
return shaNull;
|
|
}
|
|
|
|
if (context->Computed)
|
|
{
|
|
context->Corrupted = shaStateError;
|
|
|
|
return shaStateError;
|
|
}
|
|
|
|
if (context->Corrupted)
|
|
{
|
|
return context->Corrupted;
|
|
}
|
|
while(length-- && !context->Corrupted)
|
|
{
|
|
context->Message_Block[context->Message_Block_Index++] =
|
|
(*message_array & 0xFF);
|
|
|
|
context->Length_Low += 8;
|
|
if (context->Length_Low == 0)
|
|
{
|
|
context->Length_High++;
|
|
if (context->Length_High == 0)
|
|
{
|
|
/* Message is too long */
|
|
context->Corrupted = 1;
|
|
}
|
|
}
|
|
|
|
if (context->Message_Block_Index == 64)
|
|
{
|
|
SHA1ProcessMessageBlock(context);
|
|
}
|
|
|
|
message_array++;
|
|
}
|
|
|
|
return shaSuccess;
|
|
}
|
|
|
|
/*
|
|
* SHA1ProcessMessageBlock
|
|
*
|
|
* Description:
|
|
* This function will process the next 512 bits of the message
|
|
* stored in the Message_Block array.
|
|
*
|
|
* Parameters:
|
|
* None.
|
|
*
|
|
* Returns:
|
|
* Nothing.
|
|
*
|
|
* Comments:
|
|
|
|
* Many of the variable names in this code, especially the
|
|
* single character names, were used because those were the
|
|
* names used in the publication.
|
|
*
|
|
*
|
|
*/
|
|
void SHA1ProcessMessageBlock(SHA1Context *context)
|
|
{
|
|
const uint32_t K[] = { /* Constants defined in SHA-1 */
|
|
0x5A827999,
|
|
0x6ED9EBA1,
|
|
0x8F1BBCDC,
|
|
0xCA62C1D6
|
|
};
|
|
int t; /* Loop counter */
|
|
uint32_t temp; /* Temporary word value */
|
|
uint32_t W[80]; /* Word sequence */
|
|
uint32_t A, B, C, D, E; /* Word buffers */
|
|
|
|
/*
|
|
* Initialize the first 16 words in the array W
|
|
*/
|
|
for(t = 0; t < 16; t++)
|
|
{
|
|
W[t] = context->Message_Block[t * 4] << 24;
|
|
W[t] |= context->Message_Block[t * 4 + 1] << 16;
|
|
W[t] |= context->Message_Block[t * 4 + 2] << 8;
|
|
W[t] |= context->Message_Block[t * 4 + 3];
|
|
}
|
|
|
|
for(t = 16; t < 80; t++)
|
|
{
|
|
W[t] = SHA1CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]);
|
|
}
|
|
|
|
A = context->Intermediate_Hash[0];
|
|
B = context->Intermediate_Hash[1];
|
|
C = context->Intermediate_Hash[2];
|
|
D = context->Intermediate_Hash[3];
|
|
E = context->Intermediate_Hash[4];
|
|
|
|
for(t = 0; t < 20; t++)
|
|
{
|
|
temp = SHA1CircularShift(5,A) +
|
|
((B & C) | ((~B) & D)) + E + W[t] + K[0];
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30,B);
|
|
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
for(t = 20; t < 40; t++)
|
|
{
|
|
temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1];
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30,B);
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
for(t = 40; t < 60; t++)
|
|
{
|
|
temp = SHA1CircularShift(5,A) +
|
|
((B & C) | (B & D) | (C & D)) + E + W[t] + K[2];
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30,B);
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
for(t = 60; t < 80; t++)
|
|
{
|
|
temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];
|
|
E = D;
|
|
D = C;
|
|
C = SHA1CircularShift(30,B);
|
|
B = A;
|
|
A = temp;
|
|
}
|
|
|
|
context->Intermediate_Hash[0] += A;
|
|
context->Intermediate_Hash[1] += B;
|
|
context->Intermediate_Hash[2] += C;
|
|
context->Intermediate_Hash[3] += D;
|
|
context->Intermediate_Hash[4] += E;
|
|
|
|
context->Message_Block_Index = 0;
|
|
}
|
|
|
|
/*
|
|
* SHA1PadMessage
|
|
*
|
|
|
|
* Description:
|
|
* According to the standard, the message must be padded to an even
|
|
* 512 bits. The first padding bit must be a '1'. The last 64
|
|
* bits represent the length of the original message. All bits in
|
|
* between should be 0. This function will pad the message
|
|
* according to those rules by filling the Message_Block array
|
|
* accordingly. It will also call the ProcessMessageBlock function
|
|
* provided appropriately. When it returns, it can be assumed that
|
|
* the message digest has been computed.
|
|
*
|
|
* Parameters:
|
|
* context: [in/out]
|
|
* The context to pad
|
|
* ProcessMessageBlock: [in]
|
|
* The appropriate SHA*ProcessMessageBlock function
|
|
* Returns:
|
|
* Nothing.
|
|
*
|
|
*/
|
|
|
|
void SHA1PadMessage(SHA1Context *context)
|
|
{
|
|
/*
|
|
* Check to see if the current message block is too small to hold
|
|
* the initial padding bits and length. If so, we will pad the
|
|
* block, process it, and then continue padding into a second
|
|
* block.
|
|
*/
|
|
if (context->Message_Block_Index > 55)
|
|
{
|
|
context->Message_Block[context->Message_Block_Index++] = 0x80;
|
|
while(context->Message_Block_Index < 64)
|
|
{
|
|
context->Message_Block[context->Message_Block_Index++] = 0;
|
|
}
|
|
|
|
SHA1ProcessMessageBlock(context);
|
|
|
|
while(context->Message_Block_Index < 56)
|
|
{
|
|
context->Message_Block[context->Message_Block_Index++] = 0;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
context->Message_Block[context->Message_Block_Index++] = 0x80;
|
|
while(context->Message_Block_Index < 56)
|
|
{
|
|
|
|
context->Message_Block[context->Message_Block_Index++] = 0;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Store the message length as the last 8 octets
|
|
*/
|
|
context->Message_Block[56] = context->Length_High >> 24;
|
|
context->Message_Block[57] = context->Length_High >> 16;
|
|
context->Message_Block[58] = context->Length_High >> 8;
|
|
context->Message_Block[59] = context->Length_High;
|
|
context->Message_Block[60] = context->Length_Low >> 24;
|
|
context->Message_Block[61] = context->Length_Low >> 16;
|
|
context->Message_Block[62] = context->Length_Low >> 8;
|
|
context->Message_Block[63] = context->Length_Low;
|
|
|
|
SHA1ProcessMessageBlock(context);
|
|
}
|
|
|
|
struct SHA1Context sha_core;
|
|
|
|
uint32_t kmdw_utils_crc_gen_sha32(uint8_t *data, uint32_t size)
|
|
{
|
|
uint32_t *sram, *ddr, i, j;
|
|
ddr = (uint32_t*)data;
|
|
sram = (uint32_t*)(sha_core.Message_Block);
|
|
SHA1Reset(&sha_core);
|
|
for (i = 0; i < size; i += 64)
|
|
{
|
|
#if 0
|
|
memcpy(sram, ddr, 64);
|
|
ddr += 16;
|
|
#else
|
|
for (j = 0; j < 16; j++) // copy one block over
|
|
sram[j] = *ddr++;
|
|
#endif
|
|
SHA1ProcessMessageBlock(&sha_core);
|
|
}
|
|
if (size & 0x03F) // pad partial block with zero's
|
|
{
|
|
i -= 64; // point to the start of partial block
|
|
memset(sha_core.Message_Block, 0, 64);
|
|
memcpy(sha_core.Message_Block, &data[i], size & 0x03F);
|
|
SHA1ProcessMessageBlock(&sha_core);
|
|
}
|
|
j = 0;
|
|
for (i = 0; i < 5; i++)
|
|
j ^= sha_core.Intermediate_Hash[i];
|
|
return(j);
|
|
}
|
|
|
|
/* Calculate the 32-bit checksum of object using 32-bit size block
|
|
** If address is not 32-bit aligned, use the fraction of the block w/ zero's
|
|
** replacing excluded bytes. (Note: we use Little Endian)
|
|
*/
|
|
uint32_t kmdw_utils_crc_gen_sum32(uint8_t *data, uint32_t size)
|
|
{
|
|
uint32_t sum, *ddr, i = (uint32_t)data & 0x03;
|
|
ddr = (uint32_t*) ((uint32_t)data & 0xFFFFFFFC); // point to the first 32-bit aligned block
|
|
if (i) { // starting address misaligned ?
|
|
size = size + i - 4;
|
|
sum = *ddr;
|
|
sum >>= i*8;
|
|
sum <<= i*8;
|
|
ddr++;
|
|
}
|
|
else
|
|
sum = 0;
|
|
for (i = 0; i < (size & 0xFFFFFFFC); i += 4) {
|
|
sum += *ddr;
|
|
ddr++;
|
|
}
|
|
i = size & 3;
|
|
if (i) // ending address misaligned ?
|
|
{
|
|
size = *ddr;
|
|
size <<= (4-i)*8;
|
|
size >>= (4-i)*8;
|
|
sum += size;
|
|
}
|
|
return(sum);
|
|
}
|
|
|
|
#if ENABLE_CRC32
|
|
static const uint32_t crc32_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
|
|
};
|
|
|
|
uint32_t kmdw_utils_crc_gen_crc32(uint8_t *data, uint32_t size)
|
|
{
|
|
const uint8_t *p = data;
|
|
uint32_t crc;
|
|
|
|
crc = ~0U;
|
|
while (size--)
|
|
crc = crc32_tab[(crc ^ *p++) & 0xFF] ^ (crc >> 8);
|
|
return crc ^ ~0U;
|
|
}
|
|
|
|
uint16_t kmdw_utils_crc_gen_crc16(uint8_t *data, uint32_t size)
|
|
{
|
|
uint16_t out = 0;
|
|
int bits_read = 0, bit_flag, i;
|
|
|
|
/* Sanity check: */
|
|
if (data == NULL)
|
|
return 0;
|
|
|
|
while (size > 0)
|
|
{
|
|
bit_flag = out >> 15;
|
|
|
|
/* Get next bit: */
|
|
out <<= 1;
|
|
out |= (*data >> bits_read) & 1;
|
|
bits_read++;
|
|
if (bits_read > 7)
|
|
{
|
|
bits_read = 0;
|
|
data++;
|
|
size--;
|
|
}
|
|
|
|
/* Cycle check: */
|
|
if (bit_flag)
|
|
out ^= CRC16_CONSTANT;
|
|
|
|
}
|
|
|
|
// push out the last 16 bits
|
|
for (i = 0; i < 16; ++i) {
|
|
bit_flag = out >> 15;
|
|
out <<= 1;
|
|
if (bit_flag)
|
|
out ^= CRC16_CONSTANT;
|
|
}
|
|
|
|
// reverse the bits
|
|
uint16_t crc = 0;
|
|
i = 0x8000;
|
|
int j = 0x0001;
|
|
for (; i != 0; i >>= 1, j <<= 1) {
|
|
if (i & out) crc |= j;
|
|
}
|
|
|
|
return crc;
|
|
}
|
|
#endif
|