A space- and time-efficient Implementation of the Merkle Tree Traversal Algorithm

dc.accessRightsAnonymous
dc.audiencePraxis
dc.contributor.authorKnecht, Markus
dc.contributor.authorNicola, Carlo U.
dc.date.accessioned2016-04-20T12:09:59Z
dc.date.available2016-04-20T12:09:59Z
dc.date.issued2013-12
dc.description.abstractWe 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.
dc.identifier.issn2296-4169
dc.identifier.issn1662-2014
dc.identifier.urihttp://hdl.handle.net/11654/17789
dc.identifier.urihttps://doi.org/10.26041/fhnw-562
dc.language.isoenen_US
dc.relation.ispartofIMVS Fokus Reporten_US
dc.subjectnew Merkle tree traversal algorithm
dc.subjectperformance evaluation
dc.subject.ddc004 - Computer Wissenschaften, Internetde
dc.titleA space- and time-efficient Implementation of the Merkle Tree Traversal Algorithm
dc.type01B - Beitrag in Magazin oder Zeitung
dc.volume7
dspace.entity.typePublication
fhnw.InventedHereYes
fhnw.IsStudentsWorkno
fhnw.PublishedSwitzerlandYes
fhnw.ReviewTypeLectoring (ex ante)
fhnw.affiliation.hochschuleHochschule für Informatik FHNWde_CH
fhnw.affiliation.institutInstitut für Mobile und Verteilte Systemede_CH
fhnw.pagination35-39
fhnw.publicationOnlineJa
fhnw.publicationStatePublished
relation.isAuthorOfPublication9b425249-9a7f-49e8-a0e5-13432fe634cc
relation.isAuthorOfPublication.latestForDiscovery9b425249-9a7f-49e8-a0e5-13432fe634cc
Dateien

Originalbündel

Gerade angezeigt 1 - 1 von 1
Vorschaubild
Name:
MerkleTree_Nicola.pdf
Größe:
294.39 KB
Format:
Adobe Portable Document Format
Beschreibung:

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Kein Vorschaubild vorhanden
Name:
license.txt
Größe:
2.94 KB
Format:
Item-specific license agreed upon to submission
Beschreibung: