HashClash

In this article, we will explore the fascinating world of HashClash and everything it has to offer. HashClash has been the subject of interest and debate for centuries, and its impact has been felt in a variety of areas, from science to popular culture. Throughout these pages, we will examine the history of HashClash, its importance in the modern world and the different perspectives that exist on this topic. Whether you are an expert on HashClash or simply looking to learn more about it, this article will give you a comprehensive and insightful overview.

HashClash
Operating systemcross-platform
PlatformBOINC
Websiteweb.archive.org/web/20071016235617/http://boinc.banaan.org:80/hashclash/

HashClash was a volunteer computing project running on the Berkeley Open Infrastructure for Network Computing (BOINC) software platform to find collisions in the MD5 hash algorithm.[1] It was based at Department of Mathematics and Computer Science at the Eindhoven University of Technology, and Marc Stevens initiated the project as part of his master's degree thesis.

The project ended after Stevens defended his M.Sc. thesis in June 2007.[2] However, SHA1 was added later, and the code repository was ported to git in 2017.[3]

The project was used to create a rogue certificate authority certificate in 2009.[4]

See also

References

  1. ^ "HashClash". 2007-10-16. Archived from the original on 2007-10-16. Retrieved 2022-08-28.
  2. ^ Stevens's thesis "On Collisions for MD5" is available for download Archived 2017-05-17 at the Wayback Machine.
  3. ^ "Old-SVN-hashclash/Downloads at master · cr-marcstevens/Old-SVN-hashclash". GitHub. Archived from the original on 2022-09-05. Retrieved 2019-05-29.
  4. ^ Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen Lenstra, David Molnar, Dag Arne Osvik and Benne de Weger, "Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate", August 2009.
Wikimedia Commons has media related to HashClash.
Stub icon

This computer-engineering-related article is a stub. You can help Wikipedia by expanding it.