Lipmaa, H;
(2002)
On Optimal Hash Tree Traversal for Interval Time-Stamping.
(IACR ePrint Archive
2002/124
).
IACR
| 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 UCL > School of BEAMS > Faculty of Engineering Science |
| URI: | http://discovery.ucl.ac.uk/id/eprint/173563 |
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months
Archive Staff Only
 |
View Item |