Loading...
Please wait, while we are loading the content...
Similar Documents
Fractal Hash Sequence Representation and Traversal (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Jakobsson, Markus |
| Abstract | Abstract — We introduce a novel amortization technique for computation of consecutive preimages of hash chains, given knowledge of the seed. While all previously known techniques have a memorytimes-computational complexity of O(n) per chain element, the complexity of our technique can be upper bounded at O(log 2 n), making it a useful primitive for low-cost applications such as authentication, signatures and micro-payments. I. |
| File Format | |
| Journal | IEEE International Symposium on Information Theory |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Low-cost Application Fractal Hash Sequence Representation Memorytimes-computational Complexity Chain Element Consecutive Preimages Useful Primitive Hash Chain Novel Amortization Technique |
| Content Type | Text |
| Resource Type | Conference Proceedings |
