![]() ![]() ![]() A cryptographic hash is as likely to detect a change to a single bit as it is to detect the entire input being replaced with something entirely different. Detection of changes to input is entirely probabilistic. With a cryptographic hash like SHA-256 (which attempts to model a random oracle) on the other hand, there is no such guarantee. ![]() Using a good polynomial (a value intrinsic to a CRC's ability to detect modifications) allows more common types of changes to be detected. With an algorithm like CRC32, certain types of changes to the input are guaranteed to result in a different checksum value. However, you can compare the error detection capabilities of CRC32 with a hash like SHA-256. SHA-256 is not designed to deal with burst errors, so you cannot compare the burst error detection properties of a CRC to a hash like SHA-256. Is there any research of the similar capabilities for sha256?
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |