Merkle Tree Traversal in Log Space and Time

  • Michael Szydlo
Conference paper

DOI: 10.1007/978-3-540-24676-3_32

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3027)
Cite this paper as:
Szydlo M. (2004) Merkle Tree Traversal in Log Space and Time. In: Cachin C., Camenisch J.L. (eds) Advances in Cryptology - EUROCRYPT 2004. EUROCRYPT 2004. Lecture Notes in Computer Science, vol 3027. Springer, Berlin, Heidelberg


We present a technique for Merkle tree traversal which requires only logarithmic space and time. For a tree with N leaves, our algorithm computes sequential tree leaves and authentication path data in time 2 log2(N) and space less than 3 log2(N), where the units of computation are hash function evaluations or leaf value computations, and the units of space are the number of node values stored. This result is an asymptotic improvement over all other previous results (for example, measuring cost=space*time). We also prove that the complexity of our algorithm is optimal: There can exist no Merkle tree traversal algorithm which consumes both less than O(log2(N)) space and less than O(log2(N)) time. Our algorithm is especially of practical interest when space efficiency is required.


amortization authentication path Merkle tree tail zipping binary tree fractal traversal pebbling 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Michael Szydlo
    • 1
  1. 1.RSA LaboratoriesBedfordUSA

Personalised recommendations