Difference between revisions of "Hash collision"
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{WikiEntry|key={{PAGENAME}}|qCode=1195184}}, or [[clash]] is a computer science situation where two data elements share a hashtag, checksum, fingerprint, etc.. | {{WikiEntry|key={{PAGENAME}}|qCode=1195184}}, or [[clash]] is a computer science situation where two data elements share a hashtag, checksum, fingerprint, etc.. | ||
=Shattered SHA-1 Function= | |||
{{:Shattered SHA-1 Function}} | |||
<noinclude> | |||
{{PagePostfix | |||
|categories={{#invoke:Utility|returnListOfCategoryFromString|Hash Function}} | |||
}} | |||
</noinclude> | |||
Latest revision as of 14:03, 19 June 2022
Hash collision(Q1195184), or clash is a computer science situation where two data elements share a hashtag, checksum, fingerprint, etc..
Shattered SHA-1 Function
It is public knowledge that Google had cracked SHA-1 and presented a website called:shattered.io to disclose their findings. You can even test if your document encoded using SHA-1 has name collisions or not. Name collision is a situation where names chosen by Secure Hash Algorithms (SHA) to represent a specific data object maybe shared by two different data objects. This name collision problem could allow one to submit a fake document or fake data object that has the same digital digest (the name), therefore confound the authenticity of information. An example of name collision can be found on shattered.io[1].
References
- ↑ Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik (2017). The first collision for full SHA-1 (PDF). local page: Shattered.io.