Search
Now showing items 1-1 of 1
Merkle puzzles revisited - finding matching elements between lists
(University of Hertfordshire, 1999)
Consider the following problem. A and B have a N-element set of bit-strings. They wish to find all collisions, in other words to find the common strings of their sets or to establish that there are none. How much data must ...