Welcome to the resource topic for 2002/001
Title:
Fractal Hash Sequence Representation and Traversal
Authors: Markus Jakobsson
Abstract:We introduce a novel amortization technique for computation of consecutive preimages of hash chains, given knowledge of the seed.
While all previously known techniques have a memory-times-computational complexity of O(n) per chain element, the complexity of our technique can be upper bounded at O(log^2 n), making it a useful primitive for low-cost applications such as authentication, signatures and micro-payments. Our technique uses a logarithmic number
of {\em pebbles} associated with points on the hash chain. The locations of these pebbles are modified over time. Like fractals, where images can be found within images, the pebbles move within intervals and sub-intervals according to a highly symmetric pattern.
ePrint: https://eprint.iacr.org/2002/001
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .