Explicit optimal binary pebbling for one-way hash chain reversal

DOI10.1007/978-3-662-54970-4_18MaRDI QIDQ5857777zbMATH OpenOpenAlexFDO

Authors Berry Schoenmakers

Publication date 7 April 2021

Published in Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/explicit-optimal-binary-pebbling-for-oneway-hash-chain-reversal(84335d12-6fdb-4342-970d-2907ecf44e36).html

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
• Almost optimal hash sequence traversal
• Binary pebbling algorithms for in-place reversal of one-way hash chains
• On the computation-storage trade-offs of hash chain traversal
• Topics in Cryptology – CT-RSA 2004

Cited in

(5)

• Efficient pebbling for list traversal synopses with application to program rollback
• Almost optimal hash sequence traversal
• Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
• scientific article; zbMATH DE number 2038764 (Why is no real title available?)
• Binary pebbling algorithms for in-place reversal of one-way hash chains

This page was built for publication: Explicit optimal binary pebbling for one-way hash chain reversal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857777)