Lipmaa, H (2002) On Optimal Hash Tree Traversal for Interval Time-Stamping. (IACR ePrint Archive 2002/124 ). IACR
Full text not available from this repository.
| Type: | Report |
|---|---|
| Title: | On Optimal Hash Tree Traversal for Interval Time-Stamping |
| Keywords: | analysis of algorithms, implementation complexity, interval time-stamping, Laplace's method for integrals, tree traversal |
| UCL classification: | UCL > School of BEAMS > Faculty of Engineering Science > Adastral Park |
Archive Staff Only: edit this record