The Method of Building a Quaternary Tree
Keywords:
hash value, binary hash tree, quaternary hash treeAbstract
A method for constructing a quaternary hash tree based on the convolution of four previous hash values is proposed. The reduction of the volume of intermediate hash values by about 1,5 times compared to binary Merkle trees is theoretically substantiated.
Downloads
Published
2024-05-24
Issue
Section
Section 5 Information protection in information and telecommunication system