Data integrity verification method suitable for embedded processor

Abstract

The invention discloses a data integrity verification method suitable for an embedded processor. The method comprises a multi-granularity hash computation method, an address conversion method and a hash node access control method, wherein the multi-granularity hash computation method is used for generating a multi-granularity Merkle tree which is cached in a hash cache and is in charge of computing a hash value of a data block in a memory when nodes of the tree are absent; the address conversion method is used for providing a unique corresponding address for each node; and the hash node access control method is mainly in charge of accessing the nodes of each hash tree and adopting different strategies particularly during reading absence and writing operation. Due to the multi-granularity hash computation method, the hash tree generated by the data integrity verification method has less nodes and layers so as to reduce a memory space and hardware area overhead, shorten initialization time and improve the performance.

Description

technical field [0001] The invention belongs to the field of digital integrated circuits, and specifically relates to a data integrity verification method suitable for embedded processors. The core of the method is multi-granularity memory hash calculation, which is a high-performance, less-related access, and low-initialization method. Time data integrity check method. Due to consideration of factors such as performance and overhead during design, the method is completely suitable for embedded systems and computer systems, and can provide reliable data integrity verification for them. Background technique [0002] Data integrity verification is an effective means to solve tampering attacks. Based on this, methods such as hash function, message authentication code (MAC: Memory Authentication Code) and AREA (Added Redundancy Explicit Authentication) have emerged. [0003] Among them, hash function (namely Hash function) is an important foundation of modern cryptographic tec...

AI Technical Summary

Problems solved by technology

However, this method produces a large number of hash tree layers and nodes, a large missing cost, and a large resource overhead during verification, so it cannot meet the requirements of embedded system applications.

PAT and TEC-tree improve the node value of the Merkle tree, but do not improve the Merkle tree itself, so the two generate more nodes, and also have the disadvantages of missing cost and large resource overhead during verification.

Images