Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
type: Item
instance of: scholarly article
title: Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
zbMATH Open document ID: 1237.94103
DOI: 10.1007/978-3-642-00862-7_22
author: Dae Hyun Yum
author: Jae Woo Seo
author: Sungwook Eom
author: Pil Joong Lee
published in: Topics in Cryptology – CT-RSA 2009
publication date: 2009-04-29T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 5549170
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-00862-7 22
OpenAlex ID: W1543324900
cites work: Optimal trade-off for Merkle tree traversal
cites work: Almost optimal hash sequence traversal
cites work: Topics in Cryptology – CT-RSA 2004
cites work: Efficient Constructions for One-Way Hash Chains
cites work: Q4783734
cites work: Q4418545
cites work: Applied Cryptography and Network Security
cites work: On the computation-storage trade-offs of hash chain traversal
cites work: Q4817523
cites work: Advances in Cryptology - EUROCRYPT 2004
Recommended article: Almost optimal hash sequence traversal
Recommended article: On the computation-storage trade-offs of hash chain traversal
Recommended article: Applied Cryptography and Network Security
Recommended article: Explicit optimal binary pebbling for one-way hash chain reversal
Recommended article: Topics in Cryptology – CT-RSA 2004
description: scientific article; zbMATH DE number 5549170