This tutorial does more than simply explain hashing and collision resolution. It lets you try out hash functions and collision resolution methods for yourself so that you can reall...
Randomized algorithms are often enjoyed for their simplicity, but the hash functions used to yield the desired theoretical guarantees are often neither simple nor practical. Here ...
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...
Johannes Buchmann, Erik Dahmen, Sarah Ereth, Andre...
We describe a collision-finding attack on 16 rounds of the Tiger hash function requiring the time for about 244 compression function invocations. Another attack generates pseudo-ne...
Abstract—The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research. Several approaches based on the extensio...
Matteo Mordacchini, Laura Ricci, Luca Ferrucci, Mi...