The Method of Building a Quaternary Tree

Authors

  • Volodymyr Luzhetskyi Department of Information Protection, Vinnytsia National Technical University
  • Volodymyr Kozyra Department of Information Protection, Vinnytsia National Technical University
  • Dmytro Rohachevskyi Department of Information Protection, Vinnytsia National Technical University

Keywords:

hash value, binary hash tree, quaternary hash tree

Abstract

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.

Published

2024-05-24

Issue

Section

Section 5 Information protection in information and telecommunication system