3 citations · 4 across the 3 of their papers we have counts for
1 paper · 1 filter
Mario Lamberger, Elmar Teufl
In this paper we discuss the problem of generically finding near-collisions for cryptographic hash functions in a memoryless way. A common approach is to truncate several output bi…