Cryptographic protocol state transition modeling method and system based on sequence recursion relationship

Abstract

The invention provides a cryptographic protocol state transition modeling method and system based on a sequence recursion relation, and the method comprises the following steps: obtaining a current state triple, the state triple comprising a state identifier, a configuration parameter and an operation sequence, and the state identifier corresponding to a state node in a state transition diagram of a cryptographic protocol; searching is carried out in an operation sequence of the state triad based on configuration parameters in the state triad, an executed operation is determined, and a state transition quadruple contained in the operation comprises a current state identifier, a protocol message type, a subsequent state identifier and subsequent configuration parameters; determining a subsequent state node of the current state node according to the subsequent state identifier of the state transition tetrad in the operation, and completing state transition; obtaining a state transition tetrad in the operation executed by the state transition, and updating a state transition tetrad sequence of the protocol; and recording the state transition tetrad of each state transition, and constructing a log file.

Description

Technical Field

[0001] The present invention relates to the field of network and information security technology, and in particular to a cryptographic protocol state transition modeling method and system based on a sequence recursion relationship. Background Art

[0002] Cryptographic protocols, also known as security protocols, serve as the foundation for building network and information security, aiming to provide security mechanisms for various network communications, including public mobile communications, industrial internet networks, e-commerce, and cloud computing platforms. To adapt to diverse application scenarios and operating environments, cryptographic protocols in practice typically offer multiple modes and optional configuration options to better adapt to various environments, meet specific user needs, and increase compatibility. However, increasing the number of configuration options increases the complexity of the protocols, expanding their attack surface and making these complex cryptographic protocols running in open network environments more vulnerable to attacks.

[0003] With the increasing complexity of network communications and the growing number of cryptographic protocol systems involved in network environments, traditional software testing and code review methods are no longer sufficient to identify potential security vulnerabilities in protocol design and implementation, thereby verifying the security of protocol designs and the correctness of protocol implementations. Formal analysis methods, with their precision and rigor, are becoming a research hotspot in cryptographic protocol security analysis. Accurately modeling the behavior of cryptographic protocols is the first and most crucial step in cryptographic protocol analysis. Compared to cryptographic protocol modeling methods such as process algebra, process communication languages, and symbolic logic, finite state machines (FSMs) have become a commonly used modeling method in formal analysis of cryptographic protocols due to their clear representation, ability to intuitively demonstrate the relationship between cryptographic protocol behavior and state transitions, and their wide applicability, which allows them to describe most protocol operations in network communications and system control.

[0004] However, existing cryptographic protocol finite state machine modeling methods can usually only model each configuration scenario separately, and cannot model the negotiation of configuration options between cryptographic protocol entities, nor can they model the interoperability between different configurations. Summary of the Invention

[0005] In view of this, an embodiment of the present invention provides a cryptographic protocol state transition modeling method based on a sequence recursion relationship to eliminate or improve one or more defects in the prior art.

[0006] One aspect of the present invention provides a method for modeling state transition of a cryptographic protocol based on a sequence recursion relationship, the method comprising the following steps:

[0007] Obtain a current state triplet, the state triplet including a state identifier, configuration parameters, and an operation sequence, wherein the state identifier corresponds to a state node in a state transition graph of a cryptographic protocol;

[0008] Searching the operation sequence of the state triple based on the configuration parameters in the state triple, determining the operation to be performed, and determining the state node that is a successor to the current state node in the state transition diagram, and completing the state transition;

[0009] Obtain configuration parameters of a subsequent state node and construct a state transition quadruple, wherein the state transition quadruple includes a current state identifier, a protocol message type, a subsequent state identifier, and subsequent configuration parameters;

[0010] The state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

[0011] Adopting the above scheme, this scheme controls the selection of different modes and options in the process of cryptographic protocol state transfer through configuration parameters. After the initial value of the parameter is given, the successor state can be searched under the recursive relationship constraint between the cryptographic protocol states to realize state transfer. Each time a cryptographic protocol state transfer occurs, the state transfer sequence will be updated once, and the judgment condition of the state transfer termination is used to determine whether to continue searching for the successor state or terminate the operation of the finite state machine, and output the log file of the state transfer sequence. This scheme determines whether the execution conditions of each operation are met based on the current configuration parameter value. If a legal operation that meets the execution conditions can be searched, the operation item is returned. If the execution conditions of all operations in the list are not met, the default value is returned. By setting the configuration parameters, various configuration scenarios can be modeled, the situation of negotiating configuration options between cryptographic protocol entities can be modeled, and the interoperability between different configurations can also be modeled.

[0012] In some embodiments of the present invention, in the step of searching the operation sequence of the state triplet based on the configuration parameters in the state triplet, determining the operation to be performed, and determining the successor state node of the current state node in the state transition diagram to complete the state transfer, if the operation to be performed is not found in the step of searching the operation sequence of the state triplet based on the configuration parameters in the state triplet, the state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

[0013] In some embodiments of the present invention, in the step of searching the operation sequence of the state triplet based on the configuration parameters in the state triplet, determining the operation to be executed, and determining the successor state node of the current state node in the state transition diagram to complete the state transfer, if the operation to be executed is not found in the step of searching the operation sequence of the state triplet based on the state identifier and configuration parameters in the state triplet, it is determined that there is no legal operation; if the operation to be executed is found, it is determined that there is a legal operation, and the operation to be executed is further searched based on the successor state node corresponding to the searched operation to be executed.

[0014] In some embodiments of the present invention, a search is performed in the operation sequence of the state triplet based on the configuration parameters in the state triplet to determine the operation to be performed, and the successor state node of the current state node in the state transition diagram is determined. In the step of completing the state transfer, if the successor state node is a terminal state, the state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

[0015] In some embodiments of the present invention, in the step of constructing the currently recorded state transition quadruple into a log file, the format of the log file is converted into a first format for storage. The first format can be JSON format, CSV format, Syslog format, etc.

[0016] In some embodiments of the present invention, a search is performed in the operation sequence of the state triple based on the configuration parameters in the state triple to determine the operation to be performed, and the successor state node of the current state node in the state transition diagram is determined. In the step of completing the state transfer, if the successor state node is not a terminal state, the state node in the state transition diagram is located based on the successor state identifier, and the state triple is reconstructed.

[0017] In some embodiments of the present invention, in the step of reconstructing the state triple based on the successor state node, multiple operations are determined based on the successor state node of the successor state node in the state transition graph and constructed into an operation sequence.

[0018] In some embodiments of the present invention, the operation sequence of the state triple corresponds to an operation list, and in the step of searching in the operation sequence of the state triple based on the state identifier and configuration parameters in the state triple, the operation sequence of the state triple corresponds to multiple operations in the operation list.

[0019] In some embodiments of the present invention, in the step of obtaining the configuration parameters of the successor state node and constructing the state transfer quadruple, the operation performed in the process from the current state node to the successor state node is obtained, and the protocol message type is obtained corresponding to the operation.

[0020] The second aspect of the present invention also provides a cryptographic protocol state transition modeling system based on a sequence recursive relationship, the system including a computer device, the computer device including a processor and a memory, the memory storing computer instructions, the processor being used to execute the computer instructions stored in the memory, and when the computer instructions are executed by the processor, the system implements the steps implemented by the method described above.

[0021] The third aspect of the present invention also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps implemented by the aforementioned cryptographic protocol state transition modeling method based on a sequence recursive relationship.

[0022] Additional advantages, objects, and features of the present invention will be described in part in the following description and will become apparent to those skilled in the art after studying the following or may be learned by practice of the present invention. The objects and other advantages of the present invention may be particularly pointed out and attained in the description and drawings.

[0023] Those skilled in the art will understand that the purposes and advantages that can be achieved by the present invention are not limited to the above specific descriptions, and the above and other purposes that can be achieved by the present invention will be more clearly understood based on the following detailed description. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] The drawings described herein are used to provide a further understanding of the present invention, constitute a part of this application, and do not constitute a limitation of the present invention.

[0025] Figure 1 A schematic diagram of an embodiment of a cryptographic protocol state transition modeling method based on a sequence recursion relationship of the present invention;

[0026] Figure 2 This is a system architecture diagram of the cryptographic protocol state transition modeling method based on sequence recursion relations of the present invention;

[0027] Figure 3 System architecture diagram for protocol state construction modules;

[0028] Figure 4 This is a system architecture diagram of the protocol subsequent state search module;

[0029] Figure 5 This is the system architecture diagram of the protocol state transition recording module;

[0030] Figure 6 This is a system architecture diagram of the protocol state transfer termination judgment module;

[0031] Figure 7 This is the system architecture diagram of the protocol state transition sequence output module. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the embodiments and the accompanying drawings. Here, the exemplary embodiments of the present invention and their descriptions are used to explain the present invention, but are not intended to limit the present invention.

[0033] It should also be noted that, in order to avoid obscuring the present invention due to unnecessary details, the accompanying drawings only show structures and / or processing steps closely related to the solutions according to the present invention, while other details that are not closely related to the present invention are omitted.

[0034] like Figure 1 As shown, the present invention proposes a cryptographic protocol state transition modeling method based on a sequence recursion relationship, the method comprising the following steps:

[0035] Step S100, obtaining a current state triplet, wherein the state triplet includes a state identifier, configuration parameters, and an operation sequence, wherein the state identifier corresponds to a state node in a state transition diagram of a cryptographic protocol;

[0036] Step S200, searching in the operation sequence of the state triple based on the configuration parameters in the state triple, determining the operation to be performed, and determining the state node that is a successor to the current state node in the state transition diagram, and completing the state transition;

[0037] Step S300, obtaining configuration parameters of the subsequent state node, and constructing a state transition quadruple, wherein the state transition quadruple includes a current state identifier, a protocol message type, a subsequent state identifier, and subsequent configuration parameters;

[0038] Step S400: Record the state transition quadruple of each state transition as a state transition sequence and construct it into a log file.

[0039] Adopting the above scheme, this scheme controls the selection of different modes and options in the process of cryptographic protocol state transfer through configuration parameters. After the initial value of the parameter is given, the successor state can be searched under the recursive relationship constraint between the cryptographic protocol states to realize state transfer. Each time a cryptographic protocol state transfer occurs, the state transfer sequence will be updated once, and the judgment condition of the state transfer termination is used to determine whether to continue searching for the successor state or terminate the operation of the finite state machine, and output the log file of the state transfer sequence. This scheme determines whether the execution conditions of each operation are met based on the current configuration parameter value. If a legal operation that meets the execution conditions can be searched, the operation item is returned. If the execution conditions of all operations in the list are not met, the default value is returned. By setting the configuration parameters, various configuration scenarios can be modeled, the situation of negotiating configuration options between cryptographic protocol entities can be modeled, and the interoperability between different configurations can also be modeled.

[0040] like Figure 2 As shown, in the specific implementation process, this solution performs the following operations:

[0041] 1. Instantiate the current state of the cryptographic protocol through the protocol state construction module. The input of this module is the configuration parameters and state identifier of the current state node, and outputs the state instance of the cryptographic protocol;

[0042] 2. After the current state instance is input into the subsequent state search module, the configuration parameters and state identifier required to construct the subsequent state, as well as the current state transition quadruple, are obtained;

[0043] 3. Input the state transition quadruple into the protocol state transition record module, which will output the updated state transition list of the cryptographic protocol;

[0044] 4. Input the current state transition list into the protocol state transition termination determination module. If it is determined that the termination state has not been reached, it returns to the state construction module, reads the configuration parameters and state identifiers updated by the protocol subsequent state search module, and then performs a new round of protocol state construction; if the termination state has been reached, it enters the protocol state transition output module;

[0045] 5. The protocol state transition output module receives the latest protocol state transition sequence as input and outputs it to the state sequence record log file in the specified format.

[0046] like Figure 3As shown in the figure, in the specific implementation process, the protocol state construction module receives the current state identifier and protocol configuration parameters as input and outputs a constructed protocol instance. This module implements its functions through the following four sub-steps: 1. Locate the protocol state node: Using the input state identifier, locate the target node in the module's built-in protocol state transition graph and output the target state node information. 2. Extract the successor state information: Based on the current target state node information, extract all the successor state information of the target state node, including the conditional Boolean expression required to transition to the specified subsequent state and the four-tuple for transitioning from the current state to the specified successor state. 3. Construct the operation list: The successor state information extracted in the previous step (i.e., the conditional Boolean expression for transitioning to the specified state) and the state transition four-tuple are used to construct the operations that can be performed in the current state. The operations corresponding to each successor state are arranged in order to form a successor state operation list. 4. Construct the current state instance: Using the externally input state identifier and configuration parameters, along with the module's internally generated successor state operation list as parameters, construct an instance of the current state, which serves as the module's final output.

[0047] like Figure 4 As shown, in a specific implementation, the protocol subsequent state search module receives the current protocol state instance as input and outputs the current protocol state transition quadruple, as well as the configuration parameters and state identifier required to construct the next state. This module implements its functions through the following six sub-steps: 1. Read Operation List: Reads the operation list stored in the current protocol state instance. 2. Read Configuration Parameter Values: Reads the configuration parameter values ​​stored in the current protocol state instance. 3. Legal Operation Determination: Starting from the first item in the operation list and proceeding backward, determines whether the execution conditions of each operation are met based on the current configuration parameter values. If a legal operation that meets the execution conditions is found, the operation item is returned. If the execution conditions of all operations in the list are not met, the default value is returned. 4. Read State Transition Quadruple: If a legal operation exists, the protocol state transition quadruple defined in that operation is returned. If no legal operation exists, the default quadruple is returned. 5. Update Configuration Parameters: If a legal operation exists, the configuration parameters stored in that operation are returned. If no legal operation exists, the default configuration parameters are returned.

[0048] 6. Update status identifier: If there is a legal operation, return the identifier of the next state saved in the operation; if there is no legal operation, return the default status identifier.

[0049] like Figure 5As shown, in the specific implementation process, the protocol state transition recording module receives the current protocol state transition quadruple as input and outputs the updated protocol state transition sequence. The functions of this module are realized through the following two sub-steps. 1. Update state transition sequence: Receive the input protocol state transition quadruple and the existing state transition sequence stored within the module, and add the newly input quadruple to the end of the existing state sequence. 2. Update sequence index number: Receive the index position of the sequence to be updated within the module as input, shift the index one position backward, and indicate the sequence index position that needs to be updated next time.

[0050] like Figure 6 As shown, in the specific implementation process, the protocol state transition termination determination module receives the updated protocol state transition sequence as input and outputs a determination result on whether the protocol state transition has terminated. This module's functions are implemented through the following six sub-steps. 1. Retrieve the last quadruple in the sequence: Retrieve the last protocol state transition quadruple in the input protocol state transition sequence. This quadruple records the most recent state transition during the protocol operation. 2. Retrieve the subsequent state identifier: Read the identifier of the subsequent state in the current state transition from the latest protocol state transition quadruple. 3. Determine the error state identifier: Determine whether the state identifier retrieved in the previous step is an error state identifier. If it is an error state identifier, it indicates that the protocol state is about to transition to an error state and the current protocol state transition is about to terminate. Otherwise, it indicates that the protocol state transition is still executing correctly. 4. Retrieve the configuration parameter value: If the protocol has not entered an error state, continue to retrieve the configuration parameter value from the latest protocol state transition quadruple and make further determinations based on the value of the termination identifier item in the configuration parameter. 5. Termination Flag Determination: If the termination flag in the configuration parameter is true, the protocol state transition has successfully reached the termination state; otherwise, the protocol state transition has not yet terminated and the protocol is still running. 6. Output State Transition Terminate / Continue: If the error state flag determination result is true, or if the error state flag determination result is false but the configuration parameter termination flag determination result is true, the protocol state transition is terminated. Otherwise, the protocol state transition is continued.

[0051] like Figure 7As shown, in the specific implementation process, the protocol state transition output module inputs the state transition sequence into the module for the state transition sequence that has been determined to have terminated, runs the following two sub-steps, and finally outputs the state sequence record log file of the protocol this time. 1. Convert data format: Convert the input protocol state transition sequence into input data in a specified format. Adding this step can make the output result adaptable to a variety of different I / O methods. 2. Write to log file: According to the log file path given inside the module, receive the input data in a specified format, write the data to the file, and finally output the state sequence record log file of this protocol state transition.

[0052] In some embodiments of the present invention, in the step of searching in the operation sequence of the state triplet based on the configuration parameters in the state triplet, determining the operation to be performed, and determining the successor state node of the current state node in the state transition diagram to complete the state transfer, if the operation to be performed is not found in the step of searching in the operation sequence of the state triplet based on the state identifier and configuration parameters in the state triplet, the state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

[0053] In some embodiments of the present invention, in the step of searching the operation sequence of the state triplet based on the configuration parameters in the state triplet, determining the operation to be executed, and determining the successor state node of the current state node in the state transition diagram to complete the state transfer, if the operation to be executed is not found in the step of searching the operation sequence of the state triplet based on the state identifier and configuration parameters in the state triplet, it is determined that there is no legal operation; if the operation to be executed is found, it is determined that there is a legal operation, and the operation to be executed is further searched based on the successor state node corresponding to the searched operation to be executed.

[0054] In some embodiments of the present invention, a search is performed in the operation sequence of the state triplet based on the configuration parameters in the state triplet to determine the operation to be performed, and the successor state node of the current state node in the state transition diagram is determined. In the step of completing the state transfer, if the successor state node is a terminal state, the state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

[0055] In some embodiments of the present invention, in the step of constructing the currently recorded state transition quadruple into a log file, the format of the log file is converted into a first format for storage.

[0056] In some embodiments of the present invention, a search is performed in the operation sequence of the state triple based on the configuration parameters in the state triple to determine the operation to be performed, and the successor state node of the current state node in the state transition diagram is determined. In the step of completing the state transfer, if the successor state node is not a terminal state, the state node in the state transition diagram is located based on the successor state identifier, and the state triple is reconstructed.

[0057] In some embodiments of the present invention, in the step of reconstructing the state triple based on the successor state node, multiple operations are determined based on the successor state node of the successor state node in the state transition graph and constructed into an operation sequence.

[0058] In some embodiments of the present invention, the operation sequence of the state triple corresponds to an operation list, and in the step of searching in the operation sequence of the state triple based on the state identifier and configuration parameters in the state triple, the operation sequence of the state triple corresponds to multiple operations in the operation list.

[0059] In some embodiments of the present invention, in the step of obtaining the configuration parameters of the successor state node and constructing the state transfer quadruple, the operation performed in the process from the current state node to the successor state node is obtained, and the protocol message type is obtained corresponding to the operation.

[0060] The beneficial effects of this program include:

[0061] 1. Ease of use. The present invention can complete the modeling of the cryptographic protocol state transition by only clarifying the constraint relationship between the initial configuration items of the cryptographic protocol and the cryptographic protocol state, and can clearly observe the relationship between the state transition of the cryptographic protocol and the sending and receiving of messages between the protocol entities through the output state transition sequence.

[0062] 2. Applicability. The present invention adopts the idea of ​​recursive sequence to abstract the state transition of the cryptographic protocol into three components: the construction of the initial state of the protocol, the implementation of the recursive relationship of the protocol state and the judgment of the termination condition of the protocol state sequence. It can model cryptographic protocols with message retransmission and state backtracking, and has a wider range of applicability.

[0063] 3. Universality: The present invention can use the scheme proposed in the present invention to model state transfer for any cryptographic protocol that can be abstracted into a finite state machine form.

[0064] 4. Scalability. The present invention can combine the modeling schemes of other cryptographic algorithms with the modeling scheme of the key system to refine the transition relationship between protocol states and the transition relationship between sub-states within the protocol state.

[0065] An embodiment of the present invention also provides a cryptographic protocol state transition modeling system based on a sequence recursive relationship, the system including a computer device, the computer device including a processor and a memory, the memory storing computer instructions, the processor being used to execute the computer instructions stored in the memory, and when the computer instructions are executed by the processor, the system implements the steps implemented by the method described above.

[0066] An embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps implemented by the aforementioned method for modeling state transitions of cryptographic protocols based on sequence recursion relations. The computer-readable storage medium can be a tangible storage medium, such as a random access memory (RAM), a memory, a read-only memory (ROM), an electrically programmable ROM, an electrically erasable programmable ROM, a register, a floppy disk, a hard disk, a removable storage disk, a CD-ROM, or any other form of storage medium known in the art.

[0067] It should be understood by those skilled in the art that the various exemplary components, systems and methods described in conjunction with the embodiments disclosed herein can be implemented in hardware, software or a combination of the two. Whether it is specifically performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention. When implemented in hardware, it can be, for example, an electronic circuit, an application specific integrated circuit (ASIC), appropriate firmware, a plug-in, a function card, etc. When implemented in software, the elements of the present invention are programs or code segments that are used to perform the required tasks. The program or code segment can be stored in a machine-readable medium, or transmitted on a transmission medium or a communication link via a data signal carried in a carrier.

[0068] It should be understood that the present invention is not limited to the specific configurations and processes described above and illustrated in the figures. For the sake of brevity, a detailed description of known methods is omitted. In the above embodiments, several specific steps are described and illustrated as examples. However, the method of the present invention is not limited to the specific steps described and illustrated. Those skilled in the art may make various changes, modifications, and additions, or change the order of the steps after understanding the spirit of the present invention.

[0069] In the present invention, features described and / or illustrated for one embodiment may be used in the same or similar manner in one or more other embodiments, and / or combined with or replace features of other embodiments.

[0070] The foregoing description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Those skilled in the art will readily appreciate that various modifications and variations to the present invention are possible. Any modifications, equivalent substitutions, or improvements made within the spirit and principles of the present invention are intended to be within the scope of protection of the present invention.

Claims

1. A cryptographic protocol state transition modeling method based on sequence recursion relations, characterized in that: The method comprises the following steps: Obtain a current state triplet, the state triplet including a state identifier, configuration parameters, and an operation sequence, wherein the state identifier corresponds to a state node in a state transition graph of a cryptographic protocol; Searching in the operation sequence of the state triple based on the configuration parameters in the state triple, determining the operation to be performed, and determining the state node that is a successor to the current state node in the state transition diagram, and completing the state transition; Obtain configuration parameters of a subsequent state node and construct a state transition quadruple, wherein the state transition quadruple includes a current state identifier, a protocol message type, a subsequent state identifier, and subsequent configuration parameters; The state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

2. The cryptographic protocol state transition modeling method based on sequence recursion relationship according to claim 1 is characterized in that: In the step of searching in the operation sequence of the state triplet based on the configuration parameters in the state triplet, determining the operation to be executed, and determining the successor state node of the current state node in the state transition diagram to complete the state transfer, if the operation to be executed is not found in the step of searching in the operation sequence of the state triplet based on the state identifier and configuration parameters in the state triplet, the state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

3. The cryptographic protocol state transition modeling method based on sequence recursion relationship according to claim 1 is characterized in that: In the step of searching the operation sequence of the state triple based on the configuration parameters in the state triple to determine the operation to be performed, and determining the state node subsequent to the current state node in the state transition diagram, to complete the state transition, if the operation to be performed is not found in the step of searching the operation sequence of the state triple based on the state identifier and the configuration parameters in the state triple, then determining that no legal operation exists; If the executed operation is found, it is determined that there is a legal operation, and based on the subsequent state node corresponding to the searched executed operation, the executed operation is further searched to determine.

4. The cryptographic protocol state transition modeling method based on sequence recursion relationship according to claim 1 is characterized in that: In the step of completing the state transfer, a search is performed in the operation sequence of the state triplet based on the configuration parameters in the state triplet, the operation to be performed is determined, and the successor state node of the current state node in the state transition diagram is determined. If the successor state node is a terminal state, the state transfer quadruple of each state transfer is recorded as a state transfer sequence and constructed as a log file.

5. The cryptographic protocol state transition modeling method based on sequence recursion relationship according to claim 1 is characterized in that: In the step of recording the state transition quadruple of each state transition as a state transition sequence and constructing it into a log file, the format of the log file is converted into the first format for storage.

6. The cryptographic protocol state transition modeling method based on sequence recursion relation according to claim 4 is characterized in that: In the step of completing the state transfer, a search is performed in the operation sequence of the state triplet based on the configuration parameters in the state triplet, the operation to be performed is determined, and the successor state node of the current state node in the state transition diagram is determined. If the successor state node is not a terminal state, the state node in the state transition diagram is located based on the successor state identifier, and the state triplet is reconstructed.

7. The cryptographic protocol state transition modeling method based on sequence recursion relation according to claim 6, characterized in that: In the step of reconstructing the state triple based on the subsequent state node, a plurality of operations are determined based on the subsequent state node in the state transition graph and constructed into an operation sequence.

8. The cryptographic protocol state transition modeling method based on sequence recursion relationship according to claim 1 is characterized in that: The operation sequence of the state triple corresponds to an operation list. In the step of searching the operation sequence of the state triple based on the configuration parameters in the state triple, the operation sequence of the state triple corresponds to multiple operations in the operation list.

9. The cryptographic protocol state transition modeling method based on sequence recursion relation according to claim 1, characterized in that: In the step of obtaining the configuration parameters of the subsequent state node and constructing the state transfer quadruple, the operation performed in the process from the current state node to the subsequent state node is obtained, and the protocol message type is obtained corresponding to the operation.

10. A cryptographic protocol state transition modeling system based on sequence recursion relations, characterized in that: The system includes a computer device, which includes a processor and a memory. The memory stores computer instructions. The processor is used to execute the computer instructions stored in the memory. When the computer instructions are executed by the processor, the system implements the steps implemented by the method according to any one of claims 1 to 9.

Images