Calculation of the CRC-32 directly of 512bits OR use buffers of 8 bits step by step?
Good morning
In fact, my problem sums up as follows:
I have a "word" of 512 bits (6 bytes of address of destination + 6 bytes of source address + 2 bytes of ether type + 50 bytes of data) which is the presentation of a party of a ethernet packet which is necessary for us to calculate CRC-32 which is going to end this packet.
I wanted to know if the calculation of this CRC will be able to be built byte by byte if I have an algorithm which takes a word of 8 bits in entrance and that calculates a first CRC and uses this last to calculate the following etc... up to exhaustion of the 512 bits?
Or make an algorithm which takes the word of 512 in entrance directly?
Thank you in advance
|