If there are any 0’s the data is deemed to be corrupt. The checksum is then added to that total if the result is all 1’s the integrity of the data is verified. The receiver verifies the integrity of data similarly to how the checksum was created by organizing data into 16-bit segments, adding all the values and accomodating wrap-around carry bits. This value is inserted into the header for use in receiver-side verification. The final 1101 value represents the 1’s complement of the total bit sum of the segment’s data. The client uses the sum of all data bits to calculate the checksum value Below is a simple illustration of how the checksum can be calculated for a data segment of 8 bits, separated into 2 4-bit words. The theory of checksum calculation accounts for lots of use cases and can get quite complex for those unfamiliar with its implications. Note: Step #6 was updated in the later RFC1141 Step-by-Step Breakdown
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |