Security detection circuits and methods for data linked lists, storage media and electronic devices

Abstract

This disclosure discloses a security detection circuit and method for data linked lists, a storage medium, and an electronic device, relating to the field of security technology. The security detection circuit includes an information receiving circuit, a parameter query circuit, and a security comparison circuit. In this embodiment, upon obtaining access information, the linked list to be detected is first determined based on the access information; then, based on the linked list to be detected and the access information, the node parameters corresponding to the target linked list node in the linked list to be detected are queried; furthermore, the node parameters corresponding to the target linked list node are compared with preset values ​​to obtain the security detection result of the linked list to be detected. Because the linked list security detection is performed upon obtaining access information, and a specific information query method and matching logic are used for judgment, data linked list security detection can be achieved with relatively low hardware overhead.

Description

Technical Field

[0001] This disclosure relates to the field of security technology, and in particular to a security detection circuit and detection method for a data linked list, a storage medium, and an electronic device. Background Technology

[0002] A linked list is a non-contiguous, non-sequential storage structure where the logical order of data elements is achieved through the connection of pointers within the linked list. For those skilled in the art, employing cost-effective security detection solutions becomes crucial.

[0003] Related technologies typically employ security redundancy protection schemes for the control logic of linked lists and ECC (Error Correction Code) protection schemes for the linked list storage media. However, these protection schemes consume significant chip area. Summary of the Invention

[0004] To address the aforementioned technical issues, this disclosure provides a security detection circuit and method for data linked lists, a storage medium, and an electronic device, enabling security detection of data linked lists with minimal hardware overhead.

[0005] The first aspect of this disclosure provides a security detection circuit for a data linked list, comprising: an information receiving circuit configured to acquire access information and determine a first linked list identifier corresponding to the access information; compare the first linked list identifier with a second linked list identifier in a linked list memory to obtain a first comparison result; a parameter query circuit configured to, in response to the first comparison result indicating the existence of a second linked list identifier identical to the first linked list identifier in the linked list memory, determine the linked list corresponding to the second linked list identifier as the linked list to be detected; query the node parameters corresponding to a target linked list node in the linked list to be detected based on the linked list to be detected and the access information from the information receiving circuit; and a security comparison circuit configured to compare the node parameters corresponding to the target linked list node with preset values ​​to obtain a security detection result for the linked list to be detected.

[0006] A second aspect of this disclosure provides a security detection method for a data linked list, comprising: acquiring access information and determining a first linked list identifier corresponding to the access information; comparing the first linked list identifier with a second linked list identifier in a linked list storage to obtain a first comparison result; in response to the first comparison result indicating the existence of a second linked list identifier identical to the first linked list identifier in the linked list storage, determining the linked list corresponding to the second linked list identifier as the linked list to be detected; based on the linked list to be detected and the access information, querying the node parameters corresponding to the target linked list node in the linked list to be detected; comparing the node parameters corresponding to the target linked list node with preset values ​​to obtain a security detection result for the linked list to be detected.

[0007] A third aspect of this disclosure provides a computer-readable storage medium storing a computer program that, when executed by a processor, is used to implement the secure detection method for the data linked list provided in the second aspect above.

[0008] A fourth aspect of this disclosure provides an electronic device comprising: a processor; a memory for storing executable instructions of the processor; the processor being configured to read the executable instructions from the memory and execute the instructions to implement the secure detection method for the data linked list provided in the second aspect above.

[0009] A fifth aspect of this disclosure provides a computer program product that, when instructions in the computer program product are executed by a processor, performs a security detection method for a data linked list provided in the second aspect of this disclosure.

[0010] A sixth aspect of this disclosure provides a chip that includes a security detection circuit for a data linked list provided in the first aspect above.

[0011] In the technical solution provided by this disclosure, access information is obtained, and a first linked list identifier corresponding to the access information is determined; the first linked list identifier is compared with a second linked list identifier in the linked list memory to obtain a first comparison result; in response to the first comparison result indicating that a second linked list identifier with the same first linked list identifier exists in the linked list memory, the linked list corresponding to the second linked list identifier is determined as the linked list to be detected; based on the linked list to be detected and the access information, the node parameters corresponding to the target linked list node in the linked list to be detected are queried; the node parameters corresponding to the target linked list node are compared with preset values ​​to obtain the security detection result of the linked list to be detected. Thus, since linked list security detection is performed each time access information is obtained (such as when read / write information is returned), and a specific information query method (querying the node parameters corresponding to the target linked list node in the linked list to be detected) and matching logic (comparing the node parameters with preset values) are used for judgment, data linked list security detection can be completed with low hardware overhead, greatly reducing hardware area overhead. Attached Figure Description

[0012] Figure 1A This is a schematic diagram of the structure of a security detection circuit for a data linked list provided in an exemplary embodiment of this disclosure.

[0013] Figure 1B This is a schematic diagram of the structure of a security detection circuit for a data linked list provided in another exemplary embodiment of this disclosure.

[0014] Figure 2 This is a schematic diagram of the structure of a security detection circuit for a data linked list provided in yet another exemplary embodiment of this disclosure.

[0015] Figure 3 This is a schematic diagram of the structure of a security detection circuit for a data linked list provided in yet another exemplary embodiment of this disclosure.

[0016] Figure 4 This is a schematic diagram of the structure of a security detection circuit for a data linked list provided in yet another exemplary embodiment of this disclosure.

[0017] Figure 5 This is a schematic diagram of the structure of a security detection circuit for a data linked list provided in yet another exemplary embodiment of this disclosure.

[0018] Figure 6 This is a flowchart illustrating a security detection method for a data linked list provided in an exemplary embodiment of this disclosure.

[0019] Figure 7 This is a flowchart illustrating a security detection method for a data linked list provided in another exemplary embodiment of this disclosure.

[0020] Figure 8 This is a schematic diagram of the structure of an electronic device provided in an exemplary embodiment of this disclosure.

[0021] Figure 9 This is a schematic diagram of the structure of a chip provided in an exemplary embodiment of this disclosure. Detailed Implementation

[0022] To explain this disclosure, exemplary embodiments of the disclosure will now be described in detail with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the disclosure, and not all of them. It should be understood that the disclosure is not limited to exemplary embodiments.

[0023] It should be noted that, unless otherwise specifically stated, the relative arrangement, numerical expressions, and values ​​of the components and steps set forth in these embodiments do not limit the scope of this disclosure.

[0024] Application Overview In chip bus design, linked lists are widely used in dynamic cache management. If the linked list logic or stored data in the automotive chip bus malfunctions, it can cause data calculation errors or bus hangs.

[0025] The solutions in related technologies employ security redundancy protection schemes for the control logic of the linked list and ECC protection schemes for the linked list storage medium. However, these protection schemes consume a large amount of chip resources, resulting in very low cost-effectiveness.

[0026] To address the aforementioned issues, this disclosure provides a security detection circuit and method for data linked lists that can be applied to chips. The method involves acquiring access information and determining a first linked list identifier corresponding to the access information; comparing the first linked list identifier with a second linked list identifier in a linked list memory to obtain a first comparison result; responding to the first comparison result indicating the existence of a second linked list identifier identical to the first linked list identifier in the linked list memory, identifying the linked list corresponding to the second linked list identifier as the linked list to be detected; querying the node parameters corresponding to the target linked list node in the linked list to be detected based on the linked list to be detected and the access information; and comparing the node parameters corresponding to the target linked list node with preset values ​​to obtain the security detection result of the linked list to be detected. Thus, since linked list security detection is performed each time access information is acquired (e.g., when read / write information is returned), and a specific information query method (i.e., querying the node parameters corresponding to the target linked list node in the linked list to be detected) and matching logic (i.e., comparing the node parameters with preset values) are used for judgment, data linked list security detection can be achieved with minimal hardware overhead, significantly reducing hardware area overhead.

[0027] Exemplary circuit Figure 1A This is a schematic diagram of the structure of a security detection circuit for a data linked list provided in an exemplary embodiment of this disclosure, such as... Figure 1A As shown, the security detection circuit 100 includes at least an information receiving circuit 101, a parameter query circuit 102, and a security comparison circuit 103.

[0028] The information receiving circuit 101 is configured to acquire access information and determine the first linked list identifier corresponding to the access information; compare the first linked list identifier with the second linked list identifier in the linked list memory to obtain a first comparison result.

[0029] For example, the access information in this disclosure includes, but is not limited to, request information transmitted upstream and / or response information returned downstream. The upstream can also be referred to as the source or request side, referring to the end in the bus that initiates the request; the downstream can also be referred to as the destination or response side, referring to the other end in the bus that responds to the request, that is, the end that receives the request and returns data.

[0030] The following example illustrates the application of the data linked list security detection circuit in an automotive chip, with the requesting end being the CPU (Central Processing Unit) and the responding end being SDRAM (Synchronous Dynamic Random Access Memory). Since the intelligent driving function of a vehicle simultaneously performs multiple tasks such as visual detection, LiDAR fusion, planning and decision-making, and vehicle control, the CPU typically issues multiple memory read / write requests for different tasks concurrently. These memory read / write requests are first queued in a linked list, allowing the SDRAM to process them one by one according to priority and timing. Finally, the SDRAM returns the corresponding response information. Thus, when the CPU issues a request, the information receiving circuit 101 can determine the first linked list identifier corresponding to the request information, and then compare the first linked list identifier with the second linked list identifier in the linked list memory to obtain a first comparison result. Similarly, when the SDRAM returns a response, the information receiving circuit 101 can determine the first linked list identifier corresponding to the response information, and then compare the first linked list identifier with the second linked list identifier in the linked list memory to obtain a first comparison result. The first linked list identifier refers to the identifier of the linked list corresponding to the request / response information. Each linked list has a unique linked list identifier.

[0031] In some examples, the linked list memory of this disclosure is a functional module that organizes and manages storage blocks using a linked list structure. For example, the linked list memory can be implemented using hardware resources of a memory buffer constructed from registers. This hardware resource internally stores multiple Entry nodes, each Entry node corresponding to a linked list node in the logical linked list, and the information recorded in each Entry node includes, but is not limited to, at least one of the following: (1) Business data: including actual interactive business data such as request information.

[0032] (2) Occupancy status information: used to identify whether the current Entry node is in an occupied state. Only unoccupied Entry nodes can write and store data.

[0033] (3) Head node identifier: used to mark whether the current Entry node is the first node of the corresponding logical linked list.

[0034] (4) Tail node identifier: used to mark whether the current Entry node is the end node of the corresponding logical linked list.

[0035] (5) List identifier: includes the identifier of the list to which it belongs (i.e. the identifier of the second list) and the node position identifier. It is mainly used to distinguish the logical list to which the current Entry node belongs and the node position of the current Entry node.

[0036] For example, the ARID (Read Address ID) field in the AXI (Advanced eXtensible Interface) transport protocol is mainly used to identify the read transaction associated with the request, and its matching response returns the RID (Read ID) field. Correspondingly, the high-order bits of the ARID or RID field can be used as the list ID, and the low-order bits can be used as the node ID.

[0037] (6) Link pointer information: including successor pointer and / or predecessor pointer; wherein, the successor pointer is used to point to the next Entry node in the same logical linked list, and the predecessor pointer is used to point to the previous Entry node in the same logical linked list.

[0038] In other words, the information recorded in each Entry node includes not only the business data itself, but also information indicating the current Entry node's position in the linked list and its context.

[0039] Furthermore, the first linked list identifier can be compared with the second linked list identifier pre-stored in the linked list memory to obtain a first comparison result. For example, when the CPU issues a request message, it can obtain the request message and compare the first linked list identifier corresponding to the request message with the second linked list identifier recorded in each Entry node to obtain a first comparison result. The first comparison result indicates whether the linked list corresponding to the request message is stored in the current hardware resources.

[0040] In some examples, such as Figure 1A As shown, the input terminal of the information receiving circuit 101 is coupled to the request terminal or the response terminal to obtain access information. The output terminal of the information receiving circuit 101 is coupled to the input terminal of the parameter query circuit 102. After the information receiving circuit 101 determines the first comparison result between the first linked list identifier and the second linked list identifier, it outputs the first comparison result to the parameter query circuit 102 through the output terminal of the information receiving circuit 101. The output terminal of the parameter query circuit 102 is coupled to the input terminal of the security comparison circuit 103. After the parameter query circuit 102 determines the node parameter corresponding to the target linked list node in the linked list to be detected based on the first comparison result and the access information, it outputs the node parameter to the security comparison circuit 103 through the output terminal of the parameter query circuit 102, so that the security comparison circuit 103 compares the node parameter with a preset value to obtain the security detection result of the linked list to be detected.

[0041] In some embodiments, such as Figure 1B As shown, in Figure 1A Based on this, another exemplary embodiment of the present disclosure further provides a security detection circuit for a data linked list.

[0042] When the access information is a request, the information receiving circuit 101 may include a request allocation circuit 1011. The request allocation circuit 1011 is configured to, when a request exists, determine whether a second linked list identifier exists in the linked list memory that is identical to the first linked list identifier corresponding to the request; and, if it exists, link the request information so that the request information is located at the tail of the linked list corresponding to the second linked list identifier, and send the result of the existence of a second linked list identifier identical to the first linked list identifier and the received request information to the parameter query circuit 102.

[0043] Similarly, when the access information is a response information, the information receiving circuit 101 may include a response buffer circuit 1012. The response buffer circuit 1012 is configured to buffer the non-sequentially returned response information when the preset response sequence is a non-sequential response; and to send the response information received from the response end to the parameter query circuit in sequence.

[0044] The parameter query circuit 102 is configured to, in response to the first comparison result indicating the existence of a second linked list identifier in the linked list memory that is the same as the first linked list identifier, determine the linked list corresponding to the second linked list identifier as the linked list to be detected; and query the node parameters corresponding to the target linked list node in the linked list to be detected based on the linked list to be detected and the access information from the information receiving circuit 101.

[0045] For example, in the field of automotive chips, in intelligent driving vehicles equipped with automotive chips, some access information needs to be executed according to the "order preservation principle." For instance, if the CPU continuously issues requests regarding whether there are obstacles ahead of the intelligent driving vehicle, the execution priority of request information 1 issued at the first moment is higher than that of request information 2 issued at the second moment, which in turn is higher than that of request information 3 issued at the third moment, and so on. This prevents timing errors and trajectory jumps in the tracker within the intelligent driving function. Specifically, the first moment precedes the second moment, and the second moment precedes the third moment. Thus, request information 1, request information 2, and request information 3 will have the same linked list identifier.

[0046] Furthermore, the parameter query circuit 102 can, in response to the first comparison result indicating the existence of a second linked list identifier in the linked list memory that is identical to the first linked list identifier, determine the linked list corresponding to the second linked list identifier as the linked list to be detected. For example, the hardware resource internally stores two Entry nodes. The first Entry node records request information 1 and its corresponding second linked list identifier, and the second Entry node records request information 2 and its corresponding second linked list identifier. These two Entry nodes belong to the same logical linked list A. Further, when the CPU issues request information 3, linked list A can be determined as the linked list to be detected based on the first linked list identifier corresponding to request information 3 and the second linked list identifier of linked list A.

[0047] It should be noted that, since some transmission protocols use identification information to distinguish whether different request information belongs to the same logical linked list, and some transmission protocols use address information to distinguish whether different request information belongs to the same logical linked list, this embodiment of the disclosure supports using "same ID" to determine the linked list to be detected, and also supports using "same address" to determine the linked list to be detected, without any limitation on this.

[0048] In some examples, the parameter query circuit 102 can also query the node parameters corresponding to the target linked list node in the linked list to be detected based on the linked list to be detected and the access information from the information receiving circuit 101, so as to determine the security detection result of the linked list to be detected based on the node parameters. The node positions of the target linked list nodes corresponding to different types of access information can be different. For example, when the access information is a request, the target linked list node can be the tail node in the linked list to be detected. Then, the Tail node parameter of the tail node in the linked list to be detected can be queried to determine the security detection result of the linked list to be detected based on the Tail node parameter. Here, the tail node refers to the last node in a linked list, and the Tail node parameter is used to mark whether the current node is the end node of the corresponding logical linked list. As another example, when the access information is a response, the target linked list node can be the head node in the linked list to be detected. Then, the Head node parameter of the head node in the linked list to be detected can be queried to determine the security detection result of the linked list to be detected based on the Head node parameter. Here, the head node refers to the very first node in a linked list, and the Head node parameter is used to mark whether the current node is the first node of the corresponding logical linked list.

[0049] The security comparison circuit 103 is configured to compare the node parameters corresponding to the target linked list node with preset values ​​to obtain the security detection result of the linked list to be detected.

[0050] For example, in this embodiment of the present disclosure, after determining the node parameters corresponding to the target linked list node, the parameter value of the node parameter can be compared with a preset value. Furthermore, if the comparison matches, it is considered that the logic and storage information of the linked list are error-free; otherwise, if the comparison does not match, a bus error interruption is generated.

[0051] Thus, since the linked list security check is performed each time access information is obtained (such as when read / write information is returned), and a specific information query method (i.e., querying the node parameters corresponding to the target linked list node in the linked list to be checked) and matching logic (i.e., comparing the node parameters with preset values) are used for judgment, the security check of the data linked list can be achieved with low hardware overhead, greatly reducing the hardware area overhead.

[0052] In some embodiments of this disclosure, such as Figure 2 As shown, in Figure 1A Based on this, the parameter query circuit 102 may include a first query circuit 1021 and a second query circuit 1022.

[0053] The first query circuit 1021 is configured to respond to the access information as a request information and query the first node parameter corresponding to the first node in the linked list to be detected based on the linked list to be detected. The target linked list node includes the first linked list node, which is the node at the first target position in the linked list to be detected, and the first node parameter is the first node identifier information stored in the first linked list node.

[0054] For example, when a request message exists, it is necessary to determine whether a second linked list identifier exists in the linked list storage that is identical to the first linked list identifier corresponding to the request message. If it exists, the request message needs to be linked so that it is located at the tail of the linked list corresponding to the second linked list identifier. In this process, it is necessary to query the tail node of the linked list corresponding to the second linked list identifier (i.e., the linked list to be detected) to link the request message. Therefore, in this embodiment of the disclosure, the first linked list node can be the node at the last position of the tail of the linked list to be detected; correspondingly, the first node parameter can be the Tail node parameter (i.e., the tail node identifier).

[0055] Furthermore, when the access information is a request, the tail node identifier of the tail node in the linked list to be tested can be compared with a preset value to obtain the security test result of the linked list to be tested. For example, when the access information is a request, if the tail node identifier of the tail node in the linked list to be tested is 1, it indicates that the security test result of the linked list to be tested is passed.

[0056] In some examples, such as Figure 2As shown, the input terminal of the information receiving circuit 101 is coupled to the request terminal to obtain request information. The output terminal of the information receiving circuit 101 is coupled to the input terminal of the first query circuit 1021. After the information receiving circuit 101 determines the first comparison result between the first linked list identifier and the second linked list identifier, it outputs the first comparison result to the first query circuit 1021 through the output terminal of the information receiving circuit 101. The output terminal of the first query circuit 1021 is coupled to the input terminal of the security comparison circuit 103. After the first query circuit 1021 determines the first node identifier information corresponding to the node at the first target position in the linked list to be detected based on the first comparison result and the request information, it outputs the first node identifier information to the security comparison circuit 103 through the output terminal of the first query circuit 1021, so that the security comparison circuit 103 compares the first node identifier information with a preset value to obtain the security detection result of the linked list to be detected.

[0057] In some embodiments, the information receiving circuit 101 is further configured to, in response to the access information being request information and the first comparison result indicating that a second linked list identifier identical to the first linked list identifier exists in the linked list memory, link the node corresponding to the received request information to the linked list corresponding to the second linked list identifier. Additionally, in response to the access information being request information and the first comparison result indicating that a second linked list identifier identical to the first linked list identifier does not exist in the linked list memory, a new linked list is created based on the request information.

[0058] The second query circuit 1022 is configured to respond to the access information as a response information, and query the second node parameter corresponding to the second node in the second linked list in the linked list to be detected based on the preset response timing and the linked list to be detected. The target linked list node includes the second linked list node.

[0059] For example, the preset response sequence in this embodiment refers to the return order of response information corresponding to request information of different nodes in the same linked list. This preset response sequence is pre-set. The preset response sequence includes: sequential response and non-sequential response. If it is a sequential response, the response information corresponding to request information of different nodes in the same linked list must be returned sequentially. For example, the response information corresponding to the request information stored at the head node of the linked list must be returned first, the response information corresponding to the request information stored at the second node after the head node must be returned second, and so on, with the response information corresponding to the request information stored at the tail node being the last to be returned. Conversely, if it is a non-sequential response, the return order of response information corresponding to request information of different nodes in the same linked list can be non-sequential. For example, if the return time of the response information corresponding to node 1 in the linked list is later than the return time of the response information corresponding to node 2 in the linked list, where the position of node 1 in the linked list is before node 2 (e.g., node 1 is the head node and node 2 is the tail node), then it is a non-sequential response.

[0060] Furthermore, by utilizing the characteristics of the preset response timing, the node parameters (i.e., second node parameters) corresponding to a specific node in the linked list to be tested (i.e., the second linked list node) can be queried based on the linked list to be tested, thereby determining the security test result of the linked list to be tested.

[0061] For example, when the preset response sequence is sequential and the response information is the first response information corresponding to the linked list to be tested, the Head node parameter (i.e., the head node identifier) ​​of the node corresponding to the response information in the linked list to be tested can be queried to determine the security detection result of the linked list to be tested based on the Head node parameter. As another example, when the preset response sequence is non-sequential, the attribute information corresponding to the response information can be determined first, and based on the attribute information, the node parameters of the linked list node at a specific position in the linked list to be tested can be queried. The attribute information can be used to indicate whether the response information corresponds to the response information of a linked list node (such as the head node) at a specific position in the linked list to be tested.

[0062] In some examples, such as Figure 2As shown, the input terminal of the information receiving circuit 101 is coupled to the response terminal to obtain response information. The output terminal of the information receiving circuit 101 is coupled to the input terminal of the second query circuit 1022. After the information receiving circuit 101 determines the first comparison result between the first linked list identifier and the second linked list identifier, it outputs the first comparison result to the second query circuit 1022 through the output terminal of the information receiving circuit 101. The output terminal of the second query circuit 1022 is coupled to the input terminal of the security comparison circuit 103. After the second query circuit 1022 determines the second node parameter corresponding to the second linked list node in the linked list to be detected based on the first comparison result and the preset response timing, it outputs the second node parameter to the security comparison circuit 103 through the output terminal of the second query circuit 1022, so that the security comparison circuit 103 compares the second node parameter with the preset value, thereby obtaining the security detection result of the linked list to be detected.

[0063] It should be noted that the transmission protocols used during the transmission of access information include, but are not limited to: AXI transmission protocol, APB (Advanced Peripheral Bus) transmission protocol, AHB (Advanced High-performance Bus) transmission protocol, and CHI (Coherent Hub Interface) transmission protocol. Furthermore, the preset response timing in this embodiment can be predetermined by one or more factors, such as transmission protocol rules, hardware arbitration mechanisms, service data flow attributes, and designer configuration.

[0064] In some embodiments of this disclosure, such as Figure 3 As shown, in Figure 2 Based on this, the second query circuit 1022 may include a first sub-query circuit 10221 and a second sub-query circuit 10222.

[0065] The first sub-query circuit 10221 is configured to respond sequentially to a preset response timing, and the response information is the first response information corresponding to the linked list to be detected, and to query the second node parameter corresponding to the second linked list node in the linked list to be detected. The second linked list node is the node at the second target position in the linked list to be detected, and the second node parameter is the second node identifier information stored in the second linked list node.

[0066] For example, since the first request is placed at the head of the linked list and the last request is placed at the tail, the hardware must follow the "first-in, first-out" principle when the response information returns. That is, the response information corresponding to the request that entered the linked list first must be returned upstream first, and the response information corresponding to the request that entered the linked list later must be returned upstream last. Therefore, when the preset response sequence is sequential and the response information is the first response information corresponding to the linked list to be detected, the second node parameter of the node corresponding to the response information in the linked list to be detected can be queried first, and then the security detection result of the linked list to be detected can be determined based on the second node parameter. In other words, in this embodiment of the disclosure, when the preset response sequence is sequential and the response information is the first response information corresponding to the linked list to be detected, the second linked list node is the node corresponding to the response information in the linked list to be detected, and the second node parameter can be the Head node parameter (i.e., the head node identifier).

[0067] Furthermore, the Head node parameter of the node corresponding to the response information can be compared with a preset value to obtain the security detection result of the linked list to be tested. For example, if the Head node parameter of the node corresponding to the response information is 1, it indicates that the security detection result of the linked list to be tested has passed.

[0068] In some examples, such as Figure 3 As shown, the input terminal of the information receiving circuit 101 is coupled to the response terminal to obtain response information. The output terminal of the information receiving circuit 101 is coupled to the input terminal of the first sub-query circuit 10221. After the information receiving circuit 101 determines the first comparison result between the first linked list identifier and the second linked list identifier, it outputs the first comparison result to the first sub-query circuit 10221 through the output terminal of the information receiving circuit 101. The output terminal of the first sub-query circuit 10221 is coupled to the input terminal of the security comparison circuit 103. After the first sub-query circuit 10221 determines the second node identifier information corresponding to the node at the second target position in the linked list to be detected based on the first comparison result, the preset response timing of the sequential response, and the response information, it outputs the second node identifier information to the security comparison circuit 103 through the output terminal of the first sub-query circuit 10221, so that the security comparison circuit 103 compares the second node identifier information with a preset value to obtain the security detection result of the linked list to be detected.

[0069] The second sub-query circuit 10222 is configured to respond to a non-sequential response in response to a preset response timing, determine the attribute information corresponding to the response information, and query the second node parameter corresponding to the second linked list node in the linked list to be detected based on the attribute information. Among them, the attribute information is used to indicate whether the response information is the response information corresponding to the node at the second target position in the chain to be detected.

[0070] For example, in this embodiment of the present disclosure, when the preset response sequence is a non-sequential response, the attribute information corresponding to the acquired response information can be determined first; for example, whether the acquired response information is the response information corresponding to the head node of the linked list to be detected. Further, based on the attribute information, the second node parameter corresponding to the second linked list node in the linked list to be detected is queried, and the security detection result of the linked list to be detected is determined based on the second node parameter.

[0071] For example, if the attribute information indicates that the response information corresponds to the head node in the linked list to be detected, then the head node identifier stored in the head node is determined as the second node parameter. If the attribute information indicates that the response information does not correspond to the head node in the linked list to be detected, then the head node identifier and tail node identifier of each linked list node in the linked list to be detected are queried, and the second node parameter is determined based on the head node identifier and tail node identifier of each linked list node.

[0072] In some examples, such as Figure 3 As shown, the input terminal of the information receiving circuit 101 is coupled to the response terminal to obtain response information. The output terminal of the information receiving circuit 101 is coupled to the input terminal of the second sub-query circuit 10222. After the information receiving circuit 101 determines the first comparison result between the first linked list identifier and the second linked list identifier, it outputs the first comparison result to the second sub-query circuit 10222 through the output terminal of the information receiving circuit 101. The output terminal of the second sub-query circuit 10222 is coupled to the input terminal of the security comparison circuit 103. After the second sub-query circuit 10222 determines the second node parameter corresponding to the second linked list node in the linked list to be detected based on the first comparison result, the preset response timing of the non-sequential response, and the response information, it outputs the second node parameter to the security comparison circuit 103 through the output terminal of the second sub-query circuit 10222, so that the security comparison circuit 103 compares the second node parameter with the preset value, thereby obtaining the security detection result of the linked list to be detected.

[0073] In some embodiments of this disclosure, such as Figure 4 As shown, in Figure 3 Based on this, the second sub-query circuit 10222 may include a matching query circuit 11 and a traversal query circuit 12.

[0074] The matching query circuit 11 is configured to determine the second node identifier information stored in the node at the second target position as the second node parameter in response to the attribute information indicating that the response information is the response information corresponding to the node at the second target position in the linked list to be detected.

[0075] For example, in this embodiment of the present disclosure, the node at the second target position can be the head node of the linked list to be detected. Furthermore, the matching query circuit 11 can determine the second node identifier stored in the node corresponding to the currently obtained response information as the second node parameter when the attribute information indicates that the currently obtained response information is the response information corresponding to the head node of the linked list to be detected. That is, if the attribute information indicates that the currently obtained response information is the response information corresponding to the head node of the linked list to be detected, then the second linked list node is the node corresponding to the obtained response information, and the second node parameter can be the Head node parameter (i.e., the head node identifier).

[0076] In some examples, such as Figure 4 As shown, the input terminal of the information receiving circuit 101 is coupled to the response terminal to obtain response information. The output terminal of the information receiving circuit 101 is coupled to the input terminal of the matching query circuit 11. After the information receiving circuit 101 determines the first comparison result between the first linked list identifier and the second linked list identifier, it outputs the first comparison result to the matching query circuit 11 through the output terminal of the information receiving circuit 101. The output terminal of the matching query circuit 11 is coupled to the input terminal of the security comparison circuit 103. After the matching query circuit 11 determines the second node identifier information corresponding to the node at the second target position in the linked list to be detected based on the first comparison result, the preset response timing of the non-sequential response, and the response information, it outputs the second node identifier information to the security comparison circuit 103 through the output terminal of the matching query circuit 11, so that the security comparison circuit 103 compares the second node identifier information with a preset value to obtain the security detection result of the linked list to be detected.

[0077] The query circuit 12 is traversed and configured to respond to the attribute information indicating that the response information is the response information corresponding to the node in the linked list to be detected that is not the second target position, query the first node identifier information and the second node identifier information corresponding to each linked list node in the linked list to be detected; based on the first node identifier information and the second node identifier information, determine the second node parameter corresponding to the second linked list node.

[0078] For example, in this embodiment of the present disclosure, the node at the second target position can be the head node of the linked list to be detected, the first node identification information can be the tail node identification, and the second node identification information can be the head node identification.

[0079] Furthermore, the traversal query circuit 12 can query the head node identifier and tail node identifier stored in each linked list node of the linked list to be tested, even if the attribute information indicates that the currently obtained response information is not the response information corresponding to the head node of the linked list to be tested. Further, based on the head node identifier and tail node identifier stored in each linked list node, the second node parameter is determined and compared with a preset value to obtain the security detection result of the linked list to be tested. At this time, the second linked list node is each linked list node in the linked list to be tested, and the second node parameter includes the sum of the parameter values ​​of the head node parameter (i.e., the head node identifier) ​​of each linked list node, and the sum of the parameter values ​​of the tail node parameter (i.e., the tail node identifier) ​​of each linked list node.

[0080] For example, the linked list to be tested includes 5 linked list nodes: node 1 (head node), node 2, ..., node 5 (tail node). If the attribute information indicates that the received response information is the response information corresponding to node 3, then the traversal query circuit 12 can query the head node identifier and tail node identifier corresponding to each linked list node, and determine whether the sum of the parameter values ​​of the head node identifiers and the tail node identifiers of each linked list node is 1. If both are satisfied, the security test result of the linked list to be tested is determined to be passed. If the sum of the parameter values ​​of the head node identifiers or the sum of the parameter values ​​of the tail node identifiers of each linked list node is not 1, the security test result of the linked list to be tested is determined to be failed.

[0081] In some examples, such as Figure 4 As shown, the input terminal of the information receiving circuit 101 is coupled to the response terminal to obtain response information. The output terminal of the information receiving circuit 101 is coupled to the input terminal of the traversal query circuit 12. After the information receiving circuit 101 determines the first comparison result between the first linked list identifier and the second linked list identifier, it outputs the first comparison result to the traversal query circuit 12 through the output terminal of the information receiving circuit 101. The output terminal of the traversal query circuit 12 is coupled to the input terminal of the security comparison circuit 103. After the traversal query circuit 12 determines the first node identifier information and the second node identifier information corresponding to each linked list node in the linked list to be detected based on the first comparison result, the preset response timing of the non-sequential response, and the response information, it outputs the first node identifier information and the second node identifier information to the security comparison circuit 103 through the output terminal of the traversal query circuit 12, so that the security comparison circuit 103 compares the first node identifier information and the second node identifier information with preset values ​​to obtain the security detection result of the linked list to be detected.

[0082] In some embodiments, the response caching circuit 1012 described above is specifically configured to: cache response information that does not need to be returned at the current moment when the preset response timing is non-sequential response, and return the cached response information upstream in sequence according to the order of each node in the linked list to be detected. For example, the CPU first sends request information 1, then request information 2, and finally request information 3. These three request information belong to the same linked list. However, response information 3 corresponding to request information 3 is received first. At this time, the caching circuit needs to cache response information 3. After the response information corresponding to request information 1 and request information 2 are returned to the CPU, response information 3 is then returned to the CPU. If the obtained response information is the response information corresponding to request information 1, then the response information can be returned to the CPU directly without caching.

[0083] In some embodiments, the security detection circuit in this disclosure further includes an information modification circuit, which is configured to modify the relevant information of the linked list to be detected in the linked list memory after a response message has been returned. For example, the CPU first sends request message 1, then request message 2, and finally request message 3. The nodes corresponding to these three request messages all belong to linked list A. After receiving response message 1 sent by SDRAM (response message 1 is the response to request message 1), the discrimination cache circuit will directly return response message 1 to the CPU. At this time, the information modification circuit will delete the node corresponding to request message 1 in linked list A and modify the head node of linked list A after modifying the node corresponding to request message 2.

[0084] In some embodiments, Figure 1A The security comparison circuit 103 is configured to: compare the node parameters corresponding to the target linked list node with preset values ​​to obtain a second comparison result; in response to the second comparison result indicating that the value of the node parameter is the same as the preset value, determine that the security detection result of the linked list to be detected is passed; or, in response to the second comparison result indicating that the value of the node parameter is different from the preset value, determine that the security detection result of the linked list to be detected is failed.

[0085] For example, since a normal linked list has only one head node or one tail node, and in this embodiment of the present disclosure, the head node identifier and tail node identifier of each linked list node can be set to a value of 1 to represent "true" and a value of "0" to represent "false". Therefore, the preset value in this embodiment of the present disclosure can be 1. Furthermore, the parameter value of the node parameter corresponding to the target node can be compared with the preset value to obtain a second comparison result. If the second comparison result shows that the value of the node parameter is also 1, then the security detection result of the linked list to be tested is determined to be passed; if the second comparison result shows that the value of the node parameter is not 1, then the security detection result of the linked list to be tested is determined to be failed.

[0086] For example, after the information receiving circuit 101 obtains the request information, it can compare the first linked list identifier corresponding to the request information with the second linked list identifier in the linked list memory to obtain the first comparison result. The parameter query circuit 102 can respond to the first comparison result indicating the existence of a second linked list identifier in the linked list memory that is identical to the first linked list identifier, and determine the linked list corresponding to the second linked list identifier as the linked list to be tested; then, based on the linked list to be tested and the request information, it queries the tail node identifier corresponding to the tail node in the linked list to be tested. Further, the security comparison circuit 103 determines whether the parameter value of the tail node identifier is 1; if it is 1, it indicates that the security test result of the linked list to be tested has passed.

[0087] For example, after the information receiving circuit 101 obtains the response information, it can compare the first linked list identifier corresponding to the response information with the second linked list identifier in the linked list memory to obtain the first comparison result. The parameter query circuit 102 can, in response to the first comparison result indicating the existence of a second linked list identifier in the linked list memory that is identical to the first linked list identifier, determine the linked list corresponding to the second linked list identifier as the linked list to be detected. Further, the parameter query circuit 102 can also determine whether the current preset response sequence is a sequential response; if it is a sequential response and the response information is the first response information corresponding to the linked list to be detected, then it queries the head node identifier of the node corresponding to the response information. Subsequently, the security comparison circuit 103 determines whether the parameter value of the head node identifier is 1; if it is 1, it indicates that the security detection result of the linked list to be detected has passed.

[0088] For example, after the information receiving circuit 101 obtains the response information, it can compare the first linked list identifier corresponding to the response information with the second linked list identifier in the linked list memory to obtain the first comparison result. The parameter query circuit 102 can, in response to the first comparison result indicating the existence of a second linked list identifier in the linked list memory that is identical to the first linked list identifier, determine the linked list corresponding to the second linked list identifier as the linked list to be detected. Further, the parameter query circuit 102 can also determine whether the current preset response sequence is a sequential response; if it is a non-sequential response and the response information is the response information corresponding to the head node of the linked list to be detected, then it queries the head node identifier of the node corresponding to the response information. Subsequently, the security comparison circuit 103 determines whether the parameter value of the head node identifier is 1; if it is 1, it indicates that the security detection result of the linked list to be detected has passed.

[0089] For example, after the information receiving circuit 101 obtains the response information, it can compare the first linked list identifier corresponding to the response information with the second linked list identifier in the linked list memory to obtain the first comparison result. The parameter query circuit 102 can, in response to the first comparison result indicating the existence of a second linked list identifier in the linked list memory that is identical to the first linked list identifier, determine the linked list corresponding to the second linked list identifier as the linked list to be detected. Further, the parameter query circuit 102 can also determine whether the current preset response sequence is a sequential response; if it is a non-sequential response and the response information is not the response information corresponding to the head node in the linked list to be detected, then it queries the head node identifier and tail node identifier of each linked list node in the linked list to be detected. Furthermore, if the security comparison circuit 103 determines that the sum of the head node identifiers of each linked list node is 1, and the sum of the tail node identifiers of each linked list node is also 1, then it indicates that the security detection result of the linked list to be detected has passed.

[0090] In some embodiments of this disclosure, such as Figure 5 As shown, in Figure 1A In addition to the above, the safety detection circuit 100 also includes an error handling circuit 104.

[0091] Error handling circuit 104 is configured to perform a preset security handling operation in response to a security detection result from security comparison circuit 103 indicating failure.

[0092] For example, the preset security processing operations in the embodiments of this disclosure include, but are not limited to: setting the abnormal status register flag, restarting the chip, and printing error logs.

[0093] In some embodiments, a function switch can also be provided for the security detection circuit in this disclosure. For example, an Enable switch can be provided for the security detection circuit, and the Enable switch can be configured to be on after the chip is powered on, thereby activating the relevant functions of the security detection circuit.

[0094] Exemplary methods Corresponding to the circuit embodiments provided above, this disclosure also provides a method for secure detection of data linked lists.

[0095] Figure 6 This is a flowchart illustrating a security detection method for a data linked list provided in an exemplary embodiment of this disclosure. Figure 6 As shown, this security detection method can be applied to SOC (System on Chip) and may include the following steps 601 to 605.

[0096] Step 601: Obtain access information and determine the first linked list identifier corresponding to the access information.

[0097] Step 602: Compare the first linked list identifier with the second linked list identifier in the linked list memory to obtain the first comparison result.

[0098] Step 603: In response to the first comparison result indicating that there is a second linked list identifier in the linked list memory that is the same as the first linked list identifier, the linked list corresponding to the second linked list identifier is determined as the linked list to be detected.

[0099] Step 604: Based on the linked list to be detected and the access information, query the node parameters corresponding to the target linked list node in the linked list to be detected.

[0100] Step 605: Compare the node parameters corresponding to the target linked list node with the preset values ​​to obtain the security detection result of the linked list to be detected.

[0101] In some embodiments, step 604, querying the node parameters corresponding to the target linked list node in the linked list to be detected based on the linked list to be detected and the access information, includes: in response to the access information being request information, querying the first node parameters corresponding to the first linked list node in the linked list to be detected based on the linked list to be detected. The target linked list node includes the first linked list node, which is the node at the first target position in the linked list to be detected, and the first node parameter is the first node identifier information stored in the first linked list node.

[0102] In some embodiments, step 604, querying the node parameters corresponding to the target linked list node in the linked list to be detected based on the linked list to be detected and the access information, further includes: responding to the access information as response information, querying the second node parameters corresponding to the second linked list node in the linked list to be detected based on a preset response timing and the linked list to be detected; wherein, the target linked list node includes the second linked list node.

[0103] In some embodiments, based on a preset response sequence and a linked list to be detected, querying the second node parameter corresponding to the second linked list node in the linked list to be detected includes: responding to the preset response sequence as a sequential response, and the response information being the first response information corresponding to the linked list to be detected, querying the second node parameter corresponding to the second linked list node in the linked list to be detected; wherein, the second linked list node is the node at the second target position in the linked list to be detected, and the second node parameter is the second node identifier information stored in the second linked list node.

[0104] In some embodiments, based on a preset response sequence and a linked list to be detected, querying the second node parameters corresponding to the second linked list node in the linked list to be detected includes: responding to a non-sequential response in response to the preset response sequence, determining the attribute information corresponding to the response information, and querying the second node parameters corresponding to the second linked list node in the linked list to be detected based on the attribute information; wherein, the attribute information is used to indicate whether the response information is the response information corresponding to the node at the second target position in the linked list to be detected.

[0105] In some embodiments, querying the second node parameter corresponding to the second linked list node in the linked list to be detected based on attribute information includes: in response to the attribute information indicating that the response information is the response information corresponding to the node at the second target position in the linked list to be detected, determining the second node identifier information stored in the node at the second target position as the second node parameter.

[0106] In some embodiments, querying the second node parameters corresponding to the second linked list node in the linked list to be detected based on attribute information includes: in response to the attribute information indicating that the response information is the response information corresponding to a node in the linked list to be detected that is not at the second target position, querying the first node identifier information and the second node identifier information corresponding to each linked list node in the linked list to be detected; and determining the second node parameters corresponding to the second linked list node based on the first node identifier information and the second node identifier information.

[0107] like Figure 7 As shown above, in the above Figure 6 Based on the illustrated embodiment, step 605 may include steps 6051-6053.

[0108] Step 6051: Compare the node parameters corresponding to the target linked list node with the preset values ​​to obtain the second comparison result.

[0109] Step 6052: In response to the second comparison result showing that the node parameter values ​​are the same as the preset values, the security detection result of the linked list to be tested is determined to be passed.

[0110] Step 6053: In response to the second comparison result indicating that the node parameter values ​​are different from the preset values, the security test result of the linked list to be tested is determined to be unsuccessful.

[0111] For example, if the second comparison result shows that the value of the node parameter is the same as the preset value, then step 6052 can be executed after step 6051. If the second comparison result shows that the value of the node parameter is different from the preset value, then step 6053 can be executed after step 6051.

[0112] In some embodiments, the security detection method further includes: in response to the security detection result in step 605 being unsuccessful, performing a preset security processing operation.

[0113] It is understood that the specific execution methods and corresponding beneficial effects of each step in the data linked list security detection method in the above embodiments have been described in detail in the embodiments corresponding to the data linked list security detection circuit. Please refer to the corresponding execution methods and beneficial technical effects of the above exemplary circuit section, which will not be repeated here.

[0114] Exemplary electronic devices Figure 8 A structural diagram of an electronic device 800 provided for an exemplary embodiment of the present disclosure includes at least one processor 801 and a memory 802.

[0115] The processor 801 may be a central processing unit (CPU) or other form of processing unit with data processing capabilities and / or instruction execution capabilities, and may control other components in the electronic device 800 to perform desired functions.

[0116] The memory 802 may include one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. Volatile memory may include, for example, random access memory (RAM) and / or cache memory. Non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium, and the processor 801 may execute one or more computer program instructions to implement the data linked list security detection method and / or other desired functions of the various embodiments of this disclosure described above.

[0117] In one example, the electronic device 800 may also include an input device 803 and an output device 804, which are interconnected via a bus system and / or other forms of connection mechanism (not shown).

[0118] The input device 803 may also include, for example, a keyboard, a mouse, etc.

[0119] The output device 804 can output various information to the outside, including, for example, a display, a speaker, a printer, and a communication network and its connected remote output devices, etc.

[0120] Of course, for the sake of simplicity, Figure 8 Only some of the components of the electronic device 800 relevant to this disclosure are shown, omitting components such as buses, input / output interfaces, etc. In addition, the electronic device 800 may include any other suitable components depending on the specific application.

[0121] Exemplary chip Figure 9 This is a schematic diagram of a chip structure provided for an exemplary embodiment of this disclosure. For example... Figure 9 As shown, the chip 900 integrates at least a linked list memory 901 and a security detection circuit 902 for data linked list security detection.

[0122] Among them, the linked list memory 901 is mainly used to organize and manage storage blocks using a linked list structure, and is a dedicated functional module for implementing this storage management method. For example, the linked list memory can be implemented using hardware resources that rely on a memory buffer built from registers.

[0123] The security detection circuit 902 is mainly used to perform real-time security detection on the data linked list during the operation of the linked list memory 901, quickly identify and handle risks such as abnormal linked list access and illegal data tampering, thereby ensuring the orderly operation of linked list storage management without occupying a large amount of additional chip hardware resources, and effectively improving the overall stability of chip operation and the security of data information.

[0124] The safety detection circuit 902 can be the above Figures 1A to 5 In any of the security detection circuits shown, the chip 900 can be a SOC (System on Chip) chip or other types of chips, and this disclosure does not limit this.

[0125] Exemplary computer program products and computer-readable storage media In addition to the methods and devices described above, embodiments of this disclosure may also provide a computer program product, including computer program instructions, which, when executed by a processor, cause the processor to perform the steps in the data linked list security detection method of the various embodiments of this disclosure described in the "Exemplary Methods" section above.

[0126] Computer program products can be written in any combination of one or more programming languages ​​to perform the operations of embodiments of this disclosure. The programming languages ​​include object-oriented programming languages ​​such as Java and C++, as well as conventional procedural programming languages ​​such as C or similar languages. The program code can be executed entirely on a user's computing device, partially on a user's computing device, as a standalone software package, partially on a user's computing device and partially on a remote computing device, or entirely on a remote computing device or server.

[0127] Furthermore, embodiments of this disclosure may also be computer-readable storage media storing computer program instructions that, when executed by a processor, cause the processor to perform the steps in the security detection method for a data linked list according to various embodiments of this disclosure described in the "Exemplary Methods" section above.

[0128] Computer-readable storage media may take the form of any combination of one or more readable media. A readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may include, but is not limited to, systems, apparatuses, or devices that are electrical, magnetic, optical, electromagnetic, infrared, or semiconductor, or any combination thereof. More specific examples of readable storage media (a non-exhaustive list) include: electrical connections having one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0129] The basic principles of this disclosure have been described above with reference to specific embodiments. However, the advantages, benefits, and effects mentioned in this disclosure are merely examples and not limitations, and should not be considered as essential features of each embodiment of this disclosure. Furthermore, the specific details disclosed above are for illustrative and facilitative purposes only, and are not limitations. These details do not limit the scope of this disclosure to the necessity of employing the aforementioned specific details for implementation.

[0130] Various modifications and variations can be made to this disclosure without departing from the spirit and scope of this application. Therefore, if such modifications and variations fall within the scope of the claims of this disclosure and their equivalents, this disclosure is also intended to include such modifications and variations.

Claims

1. A security detection circuit for a data linked list, comprising: The information receiving circuit is configured to acquire access information and determine the first linked list identifier corresponding to the access information; The first linked list identifier is compared with the second linked list identifier in the linked list memory to obtain the first comparison result; The parameter query circuit is configured to determine the linked list corresponding to the second linked list identifier as the linked list to be detected in response to the first comparison result indicating that there is a second linked list identifier in the linked list memory that is the same as the first linked list identifier. Based on the linked list to be detected and the access information, query the node parameters corresponding to the target linked list node in the linked list to be detected; A security comparison circuit is configured to compare the node parameters corresponding to the target linked list node with preset values ​​to obtain the security detection result of the linked list to be detected.

2. The circuit according to claim 1, wherein, The parameter query circuit includes: The first query circuit is configured to respond to the access information as a request information and, based on the linked list to be detected, query the first node parameter corresponding to the first linked list node in the linked list to be detected. The target linked list node includes the first linked list node, which is the node at the first target position in the linked list to be detected, and the first node parameter is the first node identifier information stored in the first linked list node.

3. The circuit according to claim 1 or 2, wherein, The parameter query circuit further includes: The second query circuit is configured to respond to the access information as a response information, and based on a preset response timing and the linked list to be detected, query the second node parameter corresponding to the second linked list node in the linked list to be detected. The target linked list node includes the second linked list node.

4. The circuit according to claim 3, wherein, The second query circuit includes: The first sub-query circuit is configured to respond sequentially to the preset response timing, and the response information is the first response information corresponding to the linked list to be detected, and to query the second node parameter corresponding to the second linked list node in the linked list to be detected. Wherein, the second linked list node is the node at the second target position in the linked list to be detected, and the second node parameter is the second node identifier information stored in the second linked list node.

5. The circuit according to claim 3, wherein, The second query circuit includes: The second sub-query circuit is configured to, in response to the preset response timing being a non-sequential response, determine the attribute information corresponding to the response information, and, based on the attribute information, query the second node parameter corresponding to the second linked list node in the linked list to be detected; The attribute information is used to indicate whether the response information is the response information corresponding to the node at the second target position in the chain list to be detected.

6. The circuit according to claim 5, wherein, The second sub-query circuit includes: The matching query circuit is configured to, in response to the attribute information indicating that the response information corresponds to the node at the second target position in the linked list to be detected, determine the second node identifier information stored in the node at the second target position as the second node parameter.

7. The circuit according to claim 5, wherein, The second sub-query circuit includes: The traversal query circuit is configured to, in response to the attribute information indicating that the response information corresponds to the node in the linked list to be detected that is not the second target position, query the first node identifier information and the second node identifier information corresponding to each linked list node in the linked list to be detected; and determine the second node parameter corresponding to the second linked list node based on the first node identifier information and the second node identifier information.

8. The circuit according to any one of claims 1-7, wherein, The security comparison circuit is configured as follows: The node parameters corresponding to the target linked list node are compared with preset values ​​to obtain a second comparison result; In response to the second comparison result indicating that the value of the node parameter is the same as the preset value, the security detection result of the linked list to be detected is determined to be passed; or, In response to the second comparison result indicating that the value of the node parameter is different from the preset value, it is determined that the security detection result of the linked list to be detected is not passed.

9. The circuit according to any one of claims 1-7, wherein the security detection circuit further comprises: An error handling circuit is configured to perform a preset security handling operation in response to a security detection result from the security comparison circuit indicating that the security test has failed.

10. A security detection method for a data linked list, comprising: Obtain access information and determine the first linked list identifier corresponding to the access information; The first linked list identifier is compared with the second linked list identifier in the linked list memory to obtain the first comparison result; In response to the first comparison result indicating that there is a second linked list identifier in the linked list memory that is the same as the first linked list identifier, the linked list corresponding to the second linked list identifier is determined as the linked list to be detected; Based on the linked list to be detected and the access information, query the node parameters corresponding to the target linked list node in the linked list to be detected; The node parameters corresponding to the target linked list node are compared with preset values ​​to obtain the security detection result of the linked list to be detected.

11. The method according to claim 10, wherein, The step of querying the node parameters corresponding to the target node in the target linked list based on the linked list to be detected and the access information includes: In response to the access information being a request, based on the linked list to be detected, query the first node parameter corresponding to the first linked list node in the linked list to be detected; The target linked list node includes the first linked list node, which is the node at the first target position in the linked list to be detected, and the first node parameter is the first node identifier information stored in the first linked list node.

12. The method according to claim 10 or 11, wherein, The step of querying the node parameters corresponding to the target linked list node in the linked list to be detected based on the linked list to be detected and the access information further includes: In response to the access information being a response information, based on the preset response timing and the linked list to be detected, the second node parameter corresponding to the second linked list node in the linked list to be detected is queried. The target linked list node includes the second linked list node.

13. The method according to claim 12, wherein, The step of querying the second node parameters corresponding to the second node in the second linked list in the list to be detected, based on the preset response timing and the linked list to be detected, includes: In response to the preset response sequence being sequential, and the response information being the first response information corresponding to the linked list to be detected, the second node parameter corresponding to the second linked list node in the linked list to be detected is queried. Wherein, the second linked list node is the node at the second target position in the linked list to be detected, and the second node parameter is the second node identifier information stored in the second linked list node.

14. The method according to claim 12, wherein, The step of querying the second node parameters corresponding to the second node in the second linked list in the list to be detected, based on the preset response timing and the linked list to be detected, includes: In response to the preset response sequence being a non-sequential response, the attribute information corresponding to the response information is determined, and based on the attribute information, the second node parameter corresponding to the second linked list node in the linked list to be detected is queried. The attribute information is used to indicate whether the response information is the response information corresponding to the node at the second target position in the chain list to be detected.

15. A computer-readable storage medium storing a computer program that is executed by a processor to perform the security detection method for a data linked list according to any one of claims 10-14.

16. An electronic device, the electronic device comprising: processor; Memory used to store the processor's executable instructions; The processor is configured to read the executable instructions from the memory and execute the instructions to implement the secure detection method for the data linked list as described in any one of claims 10-14.

Images