A (dummy) implementation of the SHA-1 encryption algorithm written for educational purposes. Includes a birthday attack which finds collisions on the first 32 bits of different output digests.
-
Updated
Apr 16, 2021 - Python
#
finds-collisions
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the finds-collisions topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the finds-collisions topic, visit your repo's landing page and select "manage topics."