Left full binary hash tree for remote attestation

Using Merkle hash tree as data structure to store value is a common method in remote attestation. For the large amount of root hash calculation in the construction process, we proposed a new hash tree data structure — left full binary hash tree, and provided the algorithm for constructing and node insertion. Algorithm's analysis and experimental results show that the left full binary hash tree not only adapt to the uncertainty of the number of modules, but also greatly reduce the rate of calculation process in constructing the hash value for updating, and accelerate the credible measurement process of the system.