________________________________
/ A Simple Python Script to Find \
\ Collision for Truncated SHA3 /
--------------------------------
\ ^__^
\ (oo)\_______
(__)\ )\/\
||----w |
|| ||
In comparison to the birthday attack it uses much less memory. For example to find an 80-bit collision the birthday attack uses around 2^(40) bits memory (approximately 137 Giga Bytes), while this algorithm uses at most couple of bytes of memory.