All Questions
2 questions
7
votes
2
answers
948
views
Finding collisions of the first few bits of a SHA-1 hash
My objective is to find a hash collision of my modified hash function. Assuming my modified hash only outputs the first 36 bits of SHA-1. As we know, SHA-1 is a 160-bit hash value, hence, we only need ...
- 73
0
votes
1
answer
247
views
Effective ways to find partial sha1 collision
I need to find 2 different string and compare their hash value. Both string must contain "abc". I looking for the first eight character that are the same and stop. I have been running for more than 24 ...
Tommy