A hash chain is a popular tool for improving the efficiency of several cryptographic applications. In spite of the computation efficiency of one-way function, the performance issue is a challenging research topic for chains with long length in resource-constrained environments. We propose a recursive algorithm of hash chain traversal for arbitrary length n with a#x2308;log2na#x2309; storage cells and the computational costs of our solution are less than a#x00BD;n log2n hash function evaluations.