Name
Abstract | ||
|---|---|---|
A hash chain H for a one-way hash function h(.) is a sequence of hash values (v(0), v(1),..., v(n)), where v(0) is a public value, v,, a secret value, and v, = h(vi+i). A hash chain traversal algorithm T computes and outputs the hash chain H, returning v, in time period (called round) i for 1 <= i <= n. While previous hash chain traversal algorithms were designed to output all hash values v(i) (1 <= i <= n) in order, there are applications where every,n-th hash value (i.e., v(m), v(2m), v(3m,)...,) 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 computatibnal costs. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1587/transinf.E93.D.1303 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
hash chain, fractal traversal, amortization | Hash tree,Double hashing,Computer science,Rolling hash,Theoretical computer science,Hash buster,Artificial intelligence,MDC-2,SHA-2,Discrete mathematics,Pattern recognition,Hash function,Hash chain | Journal |
Volume | Issue | ISSN |
E93D | 5 | 1745-1361 |
Citations | PageRank | References |
1 | 0.36 | 7 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dae Hyun Yum | 1 | 315 | 24.95 |
| Jae Woo Seo | 2 | 36 | 4.50 |
| Kookrae Cho | 3 | 11 | 2.61 |
| Pil Joong Lee | 4 | 1039 | 103.09 |