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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
