Cited 1 time in
Cited 1 time in
Generalized Hash Chain Traversal with Selective Output
- Generalized Hash Chain Traversal with Selective Output
- Yum, DH[Yum, Dae Hyun]; Seo, JW[Seo, Jae Woo]; Cho, K[Cho, Kookrae]; Lee, PJ[Lee, Pil Joong]
- DGIST Authors
- Cho, K[Cho, Kookrae]
- Issue Date
- IEICE Transactions on Information and Systems, E93D(5), 1303-1306
- Article Type
- Amortization; Computational Costs; Depreciation; Direct Use; Fractal Traversal; Fractals; Hash Chain; Hash Chain Traversal; Hash Chains; Hash Functions; Hash Value; Memory Storage; One Way Hash Functions; Public Values; Secret Value; Time Periods
- A hash chain H for a one-way hash function h(·) is a sequence of hash values >v0, vi, ⋯ , vn<, where v0 is a public value, vn a secret value, and vi = h(vi+1). A hash chain traversal algorithm T computes and outputs the hash chain H, returning vi in time period (called round) i for 1 ≤ i ≤ n. While previous hash chain traversal algorithms were designed to output all hash values vi (1 ≤ i ≤ n) in order, there are applications where every m-th hash value (i.e., vm, v2m, v3m, ⋯) is required to be output. We introduce a hash chain traversal algorithm that selectively outputs every m-th hash value efficiently. The main technique is a transformation from a hash chain traversal algorithm outputting every hash value into that outputting every m-th hash value. Compared with the direct use of previous hash chain traversal algorithms, our proposed method requires less memory storages and computational costs. Copyright © 2010 The Institute of Electronics, Information and Communication Engineers.
- Institute of Electronics, Information and Communication Engineers
- Related Researcher
There are no files associated with this item.
- Companion Diagnostics and Medical Technology Research Group1. Journal Articles
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.