Anzeige
Erschienen in:
2021 | OriginalPaper | Buchkapitel
13. Parallelized C Implementation of a Merkle Tree
verfasst von : Andrew Flangas, Autumn Cuellar, Michael Reyes, Frederick C. Harris Jr.
Erschienen in: ITNG 2021 18th International Conference on Information Technology-New Generations
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Merkle trees are primarily known for being an attribute found in blockchain technology. They are used for encrypting data by hashing values multiple times to avoid incidents such as hash collisions, or the successful guessing of hash values. Merkle trees are not only a useful feature found on the blockchain but in the field of Cyber Security in general. This paper outlines the process of implementing a Merkle tree as a data structure in C++ and then parallelizing it using OpenMP. The final result is a Merkle tree password storing program with reduced running-time and the ability to operate on multiple processors. The validity of this program is tested by creating a Merkle tree of the correct passwords, storing the value of the root node, and then building a second tree where a single incorrect password is stored within that tree. The two trees are passed through an audit function that compares the root nodes of the two trees. If they are different, then the tree in question has been tampered with.