Unlock instant, AI-driven research and patent intelligence for your innovation.

A Method for Integrity Verification of Memory Data

A technology for integrity verification and memory data, which is applied in the field of memory integrity verification, can solve the problems of large delay in hash calculation and long verification path, etc., and achieve the goal of increasing access delay, improving utilization rate, and increasing delay Effect

Active Publication Date: 2017-12-19
HARBIN ENG UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] A common disadvantage of these three trees is that the integrity verification path length of all data blocks is the same, and each verification needs to go from the leaf node to the root node. The verification path is long, so the hash calculation is delayed. Big

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Method for Integrity Verification of Memory Data
  • A Method for Integrity Verification of Memory Data
  • A Method for Integrity Verification of Memory Data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0032] The present invention will be further described below in conjunction with accompanying drawing:

[0033] The invention relates to the field of memory integrity verification, and relates to a method for verifying the integrity of memory data. At present, tree structures such as Merkle Tree, PAT, and TEC-Tree are mainly used in memory integrity to protect memory. When performing verification, it is necessary to recurse from the leaf node to the root node, and the delay is very large. The predecessors proposed CHTree, which only needs to verify the nodes in the hash cache, but because the intermediate nodes of a certain layer are fixedly stored in the cache, the cache content remains unchanged. The common feature of these types of trees is that the check path lengths of the data blocks are the same regardless of the access frequency of the data blocks. According to the locality principle of the program, some data access frequency is high and some data access frequency is ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to the field of the integrity checking of a memory, in particular to an integrity checking method of memory data on the basis of a dynamic caching Hash tree. According to a locality principle of a program, data_blocks with a high access frequency and the data_blocks with a low access frequency are distinguished; a phenomenon that only intermediate nodes of a fixed layer are stored in the caching Hash tree is changed, and therefore, a Hash cache stores the intermediate nodes of different layers, a memory is divided into the data_blocks of different sizes, and one Hash tree is established by taking the data_blocks as leaf nodes; each data_block is provided with two counters (counter 1 and counter 2); and during initial time, the counter 1 is equal to 0, and the counter 2 is equal to 0; and t is set to represent a current moment, and T is a statistical period. Since a locality principle of the program is utilized, the intermediate nodes stored in the cache are dynamically regulated so as to integrally shorten an average checking path length of each data_block.

Description

technical field [0001] The invention relates to the field of memory integrity verification, in particular to a method for verifying the integrity of memory data based on a dynamic cache hash tree. technical background [0002] With the development of science and technology, the application of computers is becoming more and more popular. At present, e-commerce, banking, government, cloud computing and mobile computing all use computers as computing tools in large quantities. Since the processed data will involve a lot of confidentiality, it is necessary to ensure that the computer The security of processing these data has become a hotspot of current research. Data security includes confidentiality and integrity. This invention only discusses how to ensure data integrity. Attackers can perform spoofing, reassembly, and replay attacks on the flowing data on the bus. Integrity protection is to ensure that malicious tampering of data by attackers, such as hardware piggyback at...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F21/64
CPCG06F21/64G06F2221/2107
Inventor 张国印郭振华姚念民石翠华吴艳霞
Owner HARBIN ENG UNIV