We study the problem of traversing a hash chain with dynamic helper points (called pebbles). Basically, two kinds of algorithms for this problem are known to date. Jakobsson algorithm is a single-layer fractal algorithm with the computational cost of logn (hash evaluations per chain link) and logn pebbles. Coppersmith-Jakobsson algorithm is a complicated double-layer fractal algorithm that improves efficiency at the expense of simplicity; with a complex movement pattern and some extra pebbles, it reduces the computational cost by half. Specifically, Coppersmith-Jakobsson algorithm requires 1/2 logn hash evaluations per chain link and logn + log(log n + 1) pebbles, which attains an almost optimal complexity. We introduce a new hash chain traversal algorithm that achieves both simplicity and efficiency. While our algorithm is based on the simple single-layer fractal structure of the Jakobsson algorithm, it reduces the computational cost by half without using extra pebbles; specifically, 1/2 logn hash evaluations per chain link and logn pebbles are needed.
CITATION STYLE
Yum, D. H., Seo, J. W., Eom, S., & Lee, P. J. (2009). Single-layer fractal hash chain traversal with almost optimal complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5473, pp. 325–339). https://doi.org/10.1007/978-3-642-00862-7_22
Mendeley helps you to discover research relevant for your work.