Task: Demonstrate Weak vs Strong Collision Resistance in Hash Functions
Task: Demonstrate Weak vs Strong Collision Resistance in Hash Functions: a task in Terminal-Lego-15k (Harbor dataset). Create a Python program that demonstrates the difference between weak and strong collision resistance using a simplified hash function. Your program should empirically show why…
The task
Create a Python program that demonstrates the difference between weak and strong collision resistance using a simplified hash function. Your program should empirically show why strong collision resistance is harder to achieve than weak collision resistance (due to the birthday paradox).
Part of PrimeIntellect/Terminal-Lego-15k.