Paper 2002/023
Almost Optimal Hash Sequence Traversal
Don Coppersmith and Markus Jakobsson
Abstract
We introduce a novel technique for computation of
consecutive preimages of hash chains. Whereas traditional
techniques have a memory-times-computation complexity of
Metadata
- Available format(s)
- PDF PS
- Publication info
- Published elsewhere. FC '02
- Keywords
- amortizationhash chainpebbleslower bound
- Contact author(s)
- mjakobsson @ rsasecurity com
- History
- 2002-02-25: received
- Short URL
- https://ia.cr/2002/023
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2002/023, author = {Don Coppersmith and Markus Jakobsson}, title = {Almost Optimal Hash Sequence Traversal}, howpublished = {Cryptology {ePrint} Archive, Paper 2002/023}, year = {2002}, url = {https://eprint.iacr.org/2002/023} }