Timeline for Suitable 16-bit checksum?
Current License: CC BY-SA 4.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 9, 2019 at 15:11 | history | suggested | Patriot |
added a tag
|
|
| Jul 9, 2019 at 14:45 | review | Suggested edits | |||
| S Jul 9, 2019 at 15:11 | |||||
| May 15, 2019 at 14:36 | vote | accept | Matt | ||
| May 13, 2019 at 23:53 | comment | added | Squeamish Ossifrage | I'm not voting to close this question as off-topic, because it is a common inquiry about the applicability of cryptographic primitives that doesn't seem to well-answered elsewhere that comes up high in web search results. If this is the site where people ask whether MD5 and SHA-1 (on which we are, for all in tents and porpoises, the internet's experts, as adjudicated by El Goog) have a certain property, namely a certain level of error detection capacity, so be it; then the next person to come along with the same question may find this in search results. | |
| May 13, 2019 at 14:24 | answer | added | Squeamish Ossifrage | timeline score: 5 | |
| May 13, 2019 at 13:52 | answer | added | b degnan | timeline score: 0 | |
| May 13, 2019 at 13:31 | answer | added | Maarten Bodewes♦ | timeline score: 1 | |
| May 13, 2019 at 2:50 | review | Close votes | |||
| May 26, 2019 at 15:57 | |||||
| May 13, 2019 at 2:32 | comment | added | forest | I'm voting to close this question as off-topic because it is about the non-cryptographic properties of hash functions. | |
| May 12, 2019 at 21:22 | comment | added | poncho | CRC's have the nice property in that if the errors are confined to an $n$ bit region (where $n$ is the size of the CRC), they are guaranteed to catch it. | |
| May 12, 2019 at 21:18 | comment | added | Ilmari Karonen | I'm kind of inclined to vote to close this question as off-topic, since it's not really about cryptography. You might be better off asking it on Stack Overflow or Computer Science. | |
| May 12, 2019 at 16:54 | comment | added | Eugene Styer | Since attacks are not a concern, you might want to consider CRCs. users.ece.cmu.edu/~koopman/crc/crc32.html has a selection of CRC polynomials, including 16 and 48-bit CRCs. | |
| May 12, 2019 at 15:55 | review | First posts | |||
| May 12, 2019 at 17:50 | |||||
| May 12, 2019 at 15:53 | history | asked | Matt | CC BY-SA 4.0 |