A space- and time-efficient Implementation of the Merkle Tree Traversal Algorithm
Loading...
Authors
Nicola, Carlo U.
Author (Corporation)
Publication date
12/2013
Typ of student thesis
Course of study
Collections
Type
01B - Magazine or newspaper article
Editors
Editor (Corporation)
Supervisor
Parent work
IMVS Fokus Report
Special issue
DOI of the original publication
Link
Series
Series number
Volume
7
Issue / Number
Pages / Duration
35-39
Patent number
Publisher / Publishing institution
Place of publication / Event location
Edition
Version
Programming language
Assignee
Practice partner / Client
Abstract
We have developed an algorithm for the Merkle tree traversal problem which combines the efficient spacetime
trade-off from the fractal Merkle-trees and the space efficiency from the improved log space-time Merkle-trees traversal. We further programmed a low storage space and a low time overhead version of
the algorithm in Java and measured its performance with respect to two different implementations.
Keywords
new Merkle tree traversal algorithm, performance evaluation
Subject (DDC)
004 - Computer Wissenschaften, Internet
Event
Exhibition start date
Exhibition end date
Conference start date
Conference end date
Date of the last check
ISBN
ISSN
2296-4169
1662-2014
1662-2014
Language
English
Created during FHNW affiliation
Yes
Strategic action fields FHNW
Publication status
Published
Review
Expert editing/editorial review
Open access category
License
Citation
KNECHT, Markus und Carlo U. NICOLA, 2013. A space- and time-efficient Implementation of the Merkle Tree Traversal Algorithm. IMVS Fokus Report. Dezember 2013. Bd. 7, S. 35–39. DOI 10.26041/fhnw-562. Verfügbar unter: https://doi.org/10.26041/fhnw-562