A full-process national secret encryption exchange transmission method
By building a hierarchical network and integrating distance characteristics into the encryption process, using dimensionality reduction information as random numbers, the problem of insufficient security in cross-system data exchange transmission is solved, efficient and secure data transmission path screening and encryption is achieved, and network security is reduced risk.
Patent Information
- Application Number
- CN202411001961.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-25
- Publication Date
- 2024-12-06
- Estimated Expiration
- 2044-07-25
AI Technical Summary
In the prior art, the security of cross-system data exchange transmission is insufficient, and the existing encryption algorithm rules can be followed, making it difficult to ensure 100% security; at the same time, cross-system data exchange transmission path screening and encryption process are independent, and distance cannot be fully considered. Features; and in scenarios where waiting time is allowed, the timing of network isolation state transition is unclear, increasing network security risks.
By building a hierarchical network of different types of business systems, and using data exchange nodes to perform spatial dimensionality reduction, integrating distance characteristics into the encryption process, using dimensionality reduction information as a random number of national encryption, and calculating the comprehensive urgent value during path filtering Determine the intended path and dynamically adjust the network status to improve security.
It improves the efficiency and effectiveness of data encryption security level and cross-system data exchange transmission path screening, making it difficult to crack encrypted data, reduces network security risks, and improves the security and efficiency of data transmission.
Smart Images

Figure CN118740495B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of data security technology, and in particular to a full-process national secret encryption exchange and transmission method. Background Art
[0002] A business system usually provides one type of business service or several types of business services with business associations. In order to increase data security, different types of business systems are usually in a network isolation state, but there are exceptions. For example, when it is necessary for the data exchange node e1 in the business system b1 and the data exchange node e2 in the business system b2 to jointly provide a business service through data exchange, it is necessary to open up the network between the business systems b1 and b2 from an isolated state to a networked state.
[0003] In order to improve the security of data exchange and transmission between different business systems, the exchanged data is usually encrypted, such as using a national secret algorithm to encrypt the exchanged data before transmission. However, the existing national secret encryption algorithms usually have rules to follow. In theory, as long as the computing power is sufficient, they can be cracked. Therefore, in areas with strict data security requirements, how to ensure the security of data exchange and transmission between systems is almost 100% the first technical problem to be solved in this application.
[0004] In addition, servers of different types of business systems are usually distributed in different locations. For example, the servers of business systems b1 and b2 are placed in Hangzhou and Ningbo respectively. Since the speed of data transmission is related to the distance, it is necessary to consider the distance priority for cross-system data exchange and transmission. For example, when data is exchanged and transmitted from Taizhou to Shaoxing, the optional paths include Taizhou-Hangzhou-Shaoxing and Taizhou-Ningbo-Shaoxing. Ideally, the transmission path should choose Taizhou-Ningbo-Shaoxing with a shorter distance. In the prior art, considering distance priority for cross-system data exchange and transmission and encrypting cross-system exchange and transmission data are two independent processes. This field expects that when screening the path of cross-system data exchange and transmission, the distance feature can be integrated into the encryption process of exchange and transmission data, which not only improves the data encryption level, but also improves the efficiency and effectiveness of the screening of cross-system data exchange and transmission paths. However, how to integrate the encryption process of cross-system exchange and transmission data with the screening process of cross-system exchange and transmission paths based on distance priority is the second technical problem to be solved in this system.
[0005] Finally, in a scenario where data exchange has an allowable waiting time, when to open up the network from an isolated state to a connected state to reduce the network security risks of cross-system data exchange and transmission is the third technical problem that needs to be urgently solved in this application. Summary of the invention
[0006] The present invention aims to improve the security of cross-system data exchange and transmission. When screening cross-system data exchange and transmission paths, the distance characteristics are integrated into the encryption process of the exchanged and transmitted data, so as to improve the data encryption security level and the efficiency and effectiveness of cross-system data exchange and transmission path screening, and provides a full-process national secret encrypted exchange and transmission method.
[0007] To achieve this object, the present invention adopts the following technical solutions:
[0008] A full-process national secret encryption exchange transmission method is provided, including the following steps:
[0009] S1, through the hierarchical network construction and node space dimensionality reduction of different types of business systems, find the available path for data exchange in one-dimensional space and obtain the dimensionality reduction information of each data exchange node in the path;
[0010] S2, calculating the comprehensive urgency value of each of the available data exchange paths changing the interconnection state between adjacent nodes at different levels through path similarity matching and data traffic prediction, or obtaining the historical comprehensive urgency value of the historically used path with the maximum morphological similarity to each of the available data exchange paths;
[0011] S3, extracting the available data exchange path corresponding to the largest comprehensive urgency value or the historical comprehensive urgency value as the proposed path, and then adding the dimension reduction information corresponding to each node in the proposed path as a random number to the designated link of national secret generation;
[0012] S4, opening up the network between the nodes in the proposed path, exchanging and transmitting the business data containing the national secret with the random number added to the data exchange node, and then restoring the network to the original state.
[0013] Preferably, in step S1, the method for constructing the hierarchical network of different types of business systems comprises the steps of:
[0014] A1, for the data exchange nodes distributed at various locations under each of the business systems, a rectangular area is selected with a minimum rectangular selection area, and then the plane coordinates of any vertex of the rectangular area corresponding to each of the business systems are solved;
[0015] A2, taking the first vertex of the solved plane coordinates in the first rectangular area containing the data exchange start node as the origin of the three-dimensional space coordinate system, and for each of the remaining second rectangular areas, calculating the distance between the second vertex of the solved plane coordinates and the origin as the z-axis coordinate value of the corresponding second rectangular area in the three-dimensional space coordinate system;
[0016] A3, taking the first vertex and each of the second vertices as the z-axis positions of the corresponding rectangular areas in the three-dimensional space coordinate system, loading each rectangular area into the three-dimensional space coordinate system to form the hierarchical network that is parallel to the upper and lower parts in the three-dimensional space.
[0017] Preferably, in step A2, the z-axis coordinate value of the second vertex is: a conversion value of the average distance between each of the data exchange nodes in the second rectangular area and the data exchange start node in the first rectangular area in real space converted to the three-dimensional space coordinate system;
[0018] In the rectangular area where the data exchange nodes forming the proposed path are located, the conversion relationship of the vertices of the plane coordinates from the real physical space to the three-dimensional virtual space is solved, and / or the conversion value is used as the random number at the same time.
[0019] Preferably, in step S1, the method for performing spatial dimension reduction on each of the data exchange nodes at different levels in the constructed hierarchical network comprises the steps of:
[0020] B1, construct the coordinate mapping relationship between the real space and the three-dimensional space as expressed by the following formula (1):
[0021]
[0022] In formula (1), A3D and Areal represent the x-axis value, y-axis value or z-axis value of the data exchange node in the same business system in the three-dimensional space and the real space respectively; Indicates that 真实 The x-axis value, y-axis value or z-axis value of the vertex of the rectangular area as the origin in the three-dimensional space having a coordinate correspondence in the real space; M represents the three-dimensional space conversion ratio; represents the conversion value corresponding to the i-th second rectangular area in the hierarchical network; when A 三维 When is the x-axis value or y-axis value to be mapped,
[0023] B2, with the dimensionality reduction condition that the number of coordinate values with corresponding axes and the same three-dimensional coordinate values is at least "2", the data exchange nodes under each network level are reduced to a straight line on the xz axis plane or the yz axis plane.
[0024] Preferably, in step S1, the method for finding available paths is: after identifying each of the data exchange nodes having the same business service type as the intended data exchange from each layer of the network, a plurality of available data exchange paths are formed from the data exchange start node to the data exchange target node on the condition that adjacent nodes in the path have a cross-layer relationship;
[0025] The dimensionality reduction information of each data exchange node in the available path for data exchange includes: the node coordinate value after three-dimensional dimensionality reduction, the network hierarchy relationship with adjacent nodes, the coordinate mapping relationship between dimensionality increase and dimensionality reduction, and at least one of the system types of the business system to which the data exchange node belongs.
[0026] Preferably, in step S2, the method for calculating the comprehensive urgency value comprises the steps of:
[0027] S21, determining whether the number of historically used paths matched from the historical path library and having the same service type as the available path for data exchange and having a morphological similarity greater than a similarity threshold is "0",
[0028] If yes, sort the available paths for data exchange from small to large according to the sum of the hierarchical distances between adjacent nodes in the paths to form an available path list;
[0029] If not, extract the historically used path with the greatest morphological similarity to each of the available data exchange paths, and then arrange the extracted historically used paths from high to low according to morphological similarity to form a historically used path list;
[0030] S22, extract the top n elements in the available path list, calculate the network disconnection urgency value and the network connection urgency value for each group of adjacent nodes in each element that are in a networked state or an isolated state, and then merge the network disconnection urgency values and the network connection urgency values calculated for the same element into the comprehensive urgency value; or for the top n elements in the historical used path list, obtain the historical comprehensive urgency value corresponding to the element.
[0031] Preferably, in step S21, the matching parameters of the morphological similarity include at least one of the angle information between the straight line and the horizontal line between adjacent nodes in the path, the number of nodes, and the number of network level jumps between adjacent nodes; the angle information includes the angle degree and the quadrant feature of the angle;
[0032] The method for calculating morphological similarity includes the following steps:
[0033] S211, calculating the angle information between the straight line and the horizontal line between the adjacent nodes in the available path for data exchange, and then determining whether the historically used path having the first similarity with the angle information corresponding to each group of adjacent nodes in the available path is matched from the historical path library, and if so, proceeding to step S212;
[0034] S212, for each second adjacent node in each of the historically used paths remaining after filtering in step S211, determine whether the first network level hop number of the second adjacent node has a second similarity with the second network level hop number of the first adjacent node whose angle information in the available path has the first similarity, and if so, proceed to step S213;
[0035] S213, for each of the historically used paths whose network level jump number has the second similarity, determining whether the first number of nodes in the used path and the second number of nodes in the available path have a third similarity, and if so, combining the first similarity, the second similarity and the third similarity into the morphological similarity;
[0036] When any of steps S211-S213 is judged as "if no", it indicates that the historical available path having morphological similarity with the data exchange available path is not matched, and the subsequent judgment process is terminated, and the available path list is formed in the current step.
[0037] Preferably, for the elements in the available path list, the ratio of the difference between the amount of data to be sent from the pointing node to the pointed node and the amount of data to be released from the pointed node among the adjacent nodes at the current time point to the amount of data to be sent is used as the network disconnection urgency value or the network connection urgency value between the adjacent nodes;
[0038] When calculating the networking urgency value, the amount of data to be released is a negative value;
[0039] The method for obtaining the historical comprehensive urgency value of each group of adjacent nodes in the elements in the historical used path list comprises the steps of:
[0040] S221, for each group of adjacent nodes in the data exchange available path that have a corresponding relationship with the historically used path with morphological similarity when the path is used as a historically available path, calculate a fourth similarity of connected or isolated state, if both are connected or disconnected, the fourth similarity is "1", otherwise it is "0", and then the sum of the fourth similarities is used as the comprehensive similarity;
[0041] S222, extracting and obtaining the historical comprehensive urgency values respectively corresponding to the historically used paths ranked top m in comprehensive similarity from the top n elements ranked top n in the historically used path list.
[0042] Preferably, in step S4, the network between the nodes in the proposed path is opened at the calculated ideal time point, and the calculation method of the ideal time point includes the steps of:
[0043] S41, starting the timing by taking as an instruction the pointing node among the adjacent nodes in the proposed path in an isolated state to generate the national secret service data with the random number added thereto;
[0044] S42, judging whether the accumulated time reaches the preset allowable waiting time according to the preset frequency,
[0045] If so, connecting the network between the adjacent nodes;
[0046] If not, proceed to step S43;
[0047] S43, determining whether the adjacent nodes have reached a state of data accumulation and release equilibrium,
[0048] If yes, the ideal time point is achieved, and then the network between the adjacent nodes is opened;
[0049] If not, return to step S42.
[0050] Preferably, the data accumulation and release balance state in step S43 is: at the current time point, the ratio of the difference between the amount of data to be sent from the pointing node to the pointed node among the adjacent nodes and the amount of data to be released of the pointed node to the amount of data to be sent is within a preset ratio threshold range.
[0051] The present invention has the following beneficial effects:
[0052] 1. By building a hierarchical network of different types of business systems, As a kind of dimensionality reduction information after spatial dimensionality reduction of data exchange nodes in hierarchical networks, the distance characteristics between different business systems are integrated into the encryption process of exchanged and transmitted data, which not only improves the data encryption security level, but also improves the efficiency and effectiveness of cross-system data exchange transmission path screening. In addition, using dimensionality reduction information as the random number of the national secret encryption process, once the starting node of data exchange changes, the hierarchical network structure changes, the random number changes synchronously and dynamically, and it is difficult to find the change pattern, which greatly improves the security of encrypted data exchange and transmission.
[0053] 2. By constructing a hierarchical network of different types of business systems in three-dimensional space, it becomes possible to obtain dimensionality reduction information for generating random numbers for national secret data. The hierarchical relationship of the network is directly related to the rectangular area where the data exchange starting node is currently located. Once the data exchange starting node changes, the hierarchical network structure changes, and the dimensionality reduction information of each node in the proposed path of data exchange transmission formed by the data exchange nodes at all levels in the network changes synchronously. Therefore, in each data exchange transmission, the random number for generating national secret data is changing dynamically, and it is difficult to find the pattern of change, which greatly improves the security of data exchange and transmission after national secret encryption.
[0054] 3. In the rectangular area where the data exchange nodes that form the proposed path are located, the conversion relationship of the vertex of the plane coordinate from the real physical space to the three-dimensional virtual space and / or the z-axis coordinate conversion value of the vertex are solved and used as the random number for national secret encryption of the data. Since the conversion relationship and the conversion value change synchronously with the dynamically changing hierarchical network structure, the security of the national secret encryption of the exchanged data is further greatly improved, making it almost impossible to crack.
[0055] 4. When constructing a hierarchical network of different types of business systems, the distance priority of screening data exchange nodes when exchanging data between different business systems is taken into account through the calculation of the first similarity, the second similarity and the third similarity, so that the proposed path for data exchange transmission that is ultimately formed by screening each data exchange node that can reach the data exchange target node layer by layer through the hierarchical network has a higher data transmission efficiency.
[0056] 5. When calculating the networking urgency value, the amount of data to be released at the pointed node is set to a negative value, so that the more balanced the amount of data to be sent at the pointed node and the amount of data to be released at the pointed node, the higher the urgency value for the network between adjacent nodes at different network levels to change from an isolated state to a networked state will be. This prevents the adjacent node from being changed from an isolated state to a networked state when the amount of data to be sent is insufficient or the pointed node needs to maintain an isolated state (the amount of data to be sent at the pointed node and the amount of data to be released at the pointed node are in an unbalanced state), thereby increasing the network security risk caused by the transmission and reception of large amounts of data.
[0057] 6. When calculating the network disconnection urgency value, the amount of data to be released at the pointed node is set to a positive value, so that the greater the difference between the amount of data to be sent by the pointing node and the amount of data to be released by the pointed node at the same time point, the greater the network disconnection urgency value is, to prevent the pointing node or the pointed node from recovering to the isolation state when the characteristics are obvious (the amount of data to be sent by the pointing node and the amount of data to be released by the pointed node are in an unbalanced state), which increases the network security risk by delaying the adjacent node from changing from a connected state to an isolated state.
[0058] 7. By calculating the ideal time point, we try to avoid connecting the pointed node to the pointed node when the pointed node urgently needs to restore the isolation state, thereby reducing the risk of network security problems caused by the greater probability of sending and receiving large amounts of data.
[0059] 8. Using any vertex in the rectangular area corresponding to the business system as the origin of the constructed hierarchical network enhances the randomness of the dimensionality reduction information, thereby making data encryption exchange and transmission more secure. BRIEF DESCRIPTION OF THE DRAWINGS
[0060] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0061] Figure 1 This is a diagram of the implementation steps of a full-process national secret encryption exchange and transmission method provided by an embodiment of the present invention;
[0062] Figure 2 is a schematic diagram of the structure of a hierarchical network constructed in an embodiment of the present invention;
[0063] Figure 3 It is an example diagram of the calculation of the morphological similarity between the available paths for data exchange and the paths used historically;
[0064] Figure 4 This is an example diagram for calculating the network disconnection urgency value or the network connection urgency value. DETAILED DESCRIPTION
[0065] The technical solution of the present invention is further described below with reference to the accompanying drawings and through specific implementation methods.
[0066] Among them, the drawings are only used for illustrative explanations, and they only represent schematic diagrams rather than actual pictures, and should not be understood as limitations on the present invention. In order to better illustrate the embodiments of the present invention, some parts of the drawings may be omitted, enlarged or reduced, and do not represent the size of actual products. For those skilled in the art, it is understandable that some well-known structures and their descriptions in the drawings may be omitted.
[0067] The same or similar numbers in the drawings of the embodiments of the present invention correspond to the same or similar parts; in the description of the present invention, it should be understood that if the terms "upper", "lower", "left", "right", "inside", "outside", etc. appear to indicate the orientation or position relationship, it is based on the orientation or position relationship shown in the drawings, which is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operate in a specific orientation. Therefore, the terms describing the position relationship in the drawings are only used for illustrative purposes and cannot be understood as a limitation on the present invention. For ordinary technicians in this field, the specific meanings of the above terms can be understood according to specific circumstances.
[0068] In the description of the present invention, unless otherwise clearly specified and limited, if the term "connection" or the like appears to indicate the connection relationship between components, the term should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two components or the interaction relationship between two components. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.
[0069] The embodiment of the present invention provides a full-process national secret encryption exchange transmission method, such as Figure 1 As shown, the steps include:
[0070] S1, through the hierarchical network construction and node space dimensionality reduction of different types of business systems, find the available path for data exchange in one-dimensional space and obtain the dimensionality reduction information of each data exchange node in the path;
[0071] The method of constructing a hierarchical network of different types of business systems includes the steps of:
[0072] A1, for the data exchange nodes distributed in various places under each business system, a rectangular area is selected with the minimum rectangular selection area, and then the plane coordinates of any vertex of the rectangular area corresponding to each business system are solved;
[0073] Assume that the servers in the first business system are distributed in various places in Hangzhou. These servers are used to provide a certain type of business service. Each server is used as a data exchange node. First, the coordinate position of each data exchange node in the first business system in the real physical space is obtained. Then, the rectangular area formed by these data exchange nodes is selected in the minimum area rectangular selection method, such as Figure 2 The rectangular area 100 shown in FIG. 1 is then solved for the plane coordinates of any vertex of the rectangular area 100. The plane coordinates of any vertex of the rectangular area 100 can be solved by an existing calculation method, for example, Figure 2The long side of the rectangle where the data exchange node 2 is shown in the figure is the x-axis, and the short side of the rectangle where the data exchange node 1 is shown in the figure is the y-axis. When the coordinate positions of the data exchange nodes 1 and 2 in the physical space are known, the plane coordinates of the vertex 3 can be solved according to the cosine theorem.
[0074] A2, taking the first vertex of the solved plane coordinates in the first rectangular area containing the data exchange start node as the origin of the three-dimensional space coordinate system, for each of the remaining second rectangular areas, calculating the distance between the second vertex of the solved plane coordinates and the origin as the z-axis coordinate value of the corresponding second rectangular area in the three-dimensional space coordinate system;
[0075] Assume that Figure 2 In the example, the first vertex 3 of the first rectangular area 100 containing the data exchange start node 4 is used as the origin of the three-dimensional space coordinate system, and the remaining second rectangular areas (such as Figure 2 The distance between the second vertex 5 and the origin (i.e., the first vertex 3) of the plane coordinates is calculated as the z-axis coordinate value of the corresponding second rectangular area 200 in the three-dimensional space coordinate system. The z-axis coordinate value is preferably:
[0076] The average distance between each data exchange node in the second rectangular area and the data exchange start node in the first rectangular area in real space is converted to the conversion value of the three-dimensional space coordinate system. For example, Figure 2 The data exchange nodes (such as data exchange nodes 6 and 7) in the second rectangular area 200 are distributed in Ningbo, and the distances from the data exchange start node 4 in the first rectangular area 100 distributed in Hangzhou are, for example, as follows: the distances in real space between the data exchange nodes 6 and 7 and the data exchange start node 4 are L 6-4 , L 7-4 Assuming that there are only two data exchange nodes 6 and 7 in the second rectangular area 200, the z-axis coordinate value of the second rectangular area 200 in the three-dimensional space coordinate system is
[0077] It should be noted here that the conversion value of the z-axis coordinate value of the rectangular area in the three-dimensional space coordinate system is the scaling ratio of the distance mean value in the above example. The distance mean value of 100km is converted to 1cm in the three-dimensional space coordinate system, and the scaling ratio is
[0078] A3, taking the first vertex and each second vertex as the z-axis position of the corresponding rectangular area in the three-dimensional space coordinate system, loading each rectangular area into the three-dimensional space coordinate system, forming a three-dimensional space coordinate system as shown in FIG. Figure 2 The upper and lower parallel hierarchical networks shown in .
[0079] The following is an explanation of the method for performing spatial dimensionality reduction on each data exchange node at different levels in the constructed hierarchical network in step S1, which specifically includes the following steps:
[0080] B1, construct the coordinate mapping relationship between the real space and the three-dimensional space as expressed by the following formula (1):
[0081]
[0082] In formula (1), A3D and Areal represent the x-axis value, y-axis value or z-axis value of the data exchange node in the same business system in the three-dimensional space and the real space respectively; Indicates that 真实 The x-axis value, y-axis value or z-axis value of the vertex of the rectangular area with a coordinate correspondence as the origin in the three-dimensional space in the real space; M represents the three-dimensional space conversion ratio; Represents the conversion value corresponding to the second rectangular area of the i-th layer in the hierarchical network; when A 三维 When is the x-axis value or y-axis value to be mapped,
[0083] For example, suppose Figure 2 The x-axis coordinate value of the data exchange node 7 in the real space is A 真实 , the x-axis coordinate value of the first vertex 3 as the origin in real space is Because A 三维 is the x-axis value to be mapped, then When solving the z-axis coordinate value of the data exchange node 7 in the three-dimensional space, since the z-axis coordinate value of the data exchange node 7 and the first vertex 3 as the origin in the real space is "0", the z-axis value of the data exchange node 7 in the three-dimensional space is
[0084] B2, with the dimension reduction condition that the number of coordinate values with corresponding axes and the same three-dimensional coordinate values is at least "2", the data exchange nodes under each network level are reduced to the xz axis plane or the yz axis plane.
[0085] For example, building Figure 2 After the hierarchical network of the example, for the data exchange starting node 4 and the data exchange node 2 in the first business system in the first network level, it is assumed that both are reduced to a straight line in the xz-axis plane. After the data exchange starting node 4 and the data exchange node 2 are reduced to a one-dimensional space, the coordinate values of the z-axis corresponding to the axis are the same, the coordinate values of the y-axis corresponding to the axis are the same, and the coordinate values of the x-axis corresponding to the axis are different, satisfying the dimensionality reduction condition that the number of coordinate values corresponding to the axis and having the same three-dimensional coordinate values is at least "2", thereby Figure 2The first rectangular area 100 in the first network level and the second rectangular area 200 in the second network level are reduced to the xz axis plane. The method of reducing the data exchange nodes in the rectangular area to the straight line on the yz axis plane is the same as the method of reducing the dimension to the xz axis plane, and will not be repeated.
[0086] The following is an explanation of the method for finding an available path for data exchange in step S1:
[0087] In this embodiment, in the one-dimensional space after dimensionality reduction, the method for finding available paths for data exchange is as follows: after identifying each data exchange node that has business service capabilities for the data to be exchanged from each network layer, a number of available paths for data exchange are formed from the data exchange start node to the data exchange target node, based on the condition that adjacent nodes in the path have a cross-layer relationship.
[0088] It should be emphasized here that the application scenario of the technical solution provided by this application is: how to ensure the security of data exchange and transmission in the network connection state between cross-systems where network isolation is the norm, therefore, the adjacent nodes in the available path must have a cross-layer relationship. The data exchange nodes in the same network layer are usually distributed in the same city or the same building or even the same computer room, so the distance between these data exchange nodes has a negligible effect on the rate of data exchange and transmission. Therefore, when looking for an available path, in this application, it is determined that there is a cross-layer relationship between adjacent nodes. The purpose is to select only one data exchange node in the same network layer when looking for an available path, so as to avoid increasing the data exchange transmission time when adjacent nodes are in the same network layer. In addition, the number of nodes constituting the available path is reduced, thereby reducing the number of data exchanges and maximizing the security of data transmission.
[0089] For example, suppose that the data to be exchanged is from Figure 2 Starting from the data exchange starting node 4 in the third network level, and taking the data exchange node 8 in the third network level as the target node for data exchange, in the process of finding the available path, it is assumed that Figure 2 The data exchange start node 4 in the first network layer can transmit the data to be exchanged under the specified service type to the data exchange target node 8 through the data exchange nodes 6, 7, and 9 in the second network layer, or can transmit the data to be exchanged to the data exchange node 11 in the third network layer first, then to the data exchange node 10 in the second network layer, and finally to the data exchange target node 8. The available data exchange paths found are: the four available paths expressed as 4-6-8, 4-7-8, 4-9-8, and 4-11-10-8 formed by each data exchange node in the order of receiving the data to be exchanged.
[0090] The dimension reduction information of each data exchange node in the available data exchange path includes: the node coordinate value after three-dimensional dimension reduction, the network hierarchical relationship with the adjacent nodes, the coordinate mapping relationship, and at least one of the system type of the business system to which it belongs. The system type of the business system is expressed by a specific code, such as the code "001" to represent the first business system; the coordinate value after three-dimensional dimension reduction is the coordinate value of A in the above formula (1) after three-dimensional dimension reduction to the xz-axis plane or the yz-axis plane; the network hierarchical relationship with the adjacent nodes, for example, in the available data exchange path of "4-6-8", the network hierarchical relationship between the data exchange node 6 and the adjacent nodes is: as the next network layer of the data exchange node 4, and as the previous network layer of the data exchange node 8, for example, it can be expressed as The mapping relationship of the coordinates is the relationship expressed by the above formula (1), which includes the hierarchical distance from the origin.
[0091] After finding the available paths for data exchange and obtaining the dimensionality reduction information of each data exchange node in each path, the full-process national secret encrypted exchange transmission method provided in this embodiment proceeds to the following steps:
[0092] S2, through path similarity matching and data traffic prediction, calculate the comprehensive urgency value of each available data exchange path changing the interconnection state between adjacent nodes at different levels, or obtain the historical comprehensive urgency value of the historically used path with the maximum morphological similarity to each available data exchange path;
[0093] The calculation method of the comprehensive urgency value specifically includes the following steps:
[0094] S21, determining whether the number of historically used paths matched from the historical path database and having the same service type as the available path for data exchange and whose morphological similarity is greater than a similarity threshold is "0",
[0095] If so, sort the available paths for data exchange from small to large according to the sum of the hierarchical distances between adjacent nodes in the path to form a list of available paths;
[0096] If not, extract the historically used path with the greatest morphological similarity to each available data exchange path, and then arrange the extracted historically used paths from high to low according to the morphological similarity to form a historically used path list;
[0097] In step S21, the matching parameters of the morphological similarity include at least one of the angle information between the direct line and the horizontal line between adjacent nodes in the path, the number of nodes, and the number of network level jumps between adjacent nodes; the angle information includes the degree of the angle and the quadrant feature of the angle;
[0098] The following is an explanation of the calculation method of morphological similarity, which specifically includes the following steps:
[0099] S211, calculating the angle information between the straight line and the horizontal line between the adjacent nodes in the available path for data exchange, and then determining whether a historically used path having a first similarity with the angle information corresponding to each group of adjacent nodes in the available path is matched from the historical path library, and if so, proceeding to step S212;
[0100] For example, Figure 3 The left side (a) is an example of a path available for data exchange; Figure 3 The right side (b) of the figure is an example of a historically used path. In step S211, first, the angle information between the direct line between adjacent nodes in the available path for data exchange and the horizontal line is calculated, such as Figure 3 The angle information between the direct line L1 between the group of adjacent nodes 10 and 20 of the data exchange nodes and the horizontal line includes angles θ1 and θ2, and the quadrant feature of θ1 is: θ1 is in the fourth quadrant; the quadrant feature of θ2 is: θ2 is in the second quadrant. The quadrant where the angle is located is determined by taking the data exchange node as the origin, dividing the plane space into four quadrants by a horizontal line passing through the data exchange node and a vertical line passing through the data exchange node perpendicular to the horizontal line, and then determining the quadrant where the angle θ less than 90° is located as the quadrant feature of the angle.
[0101] Having the first similarity means that the corresponding angles have the same quadrant characteristics, that is, they are in the same quadrant space, such as Figure 3 The angle θ1 in the available path for data exchange in has the same quadrant characteristics as the angle θ1′ in the historically used path, and the deviation of the angle is less than the preset deviation threshold, such as the absolute value of the difference between θ1 and θ1′ is less than the preset absolute value threshold of the difference. It should be noted here that the first similarity is the comprehensive similarity between the adjacent nodes in the available path and the adjacent nodes in the historically used path, that is, Figure 3 When the angles θ1 and θ1′, as well as θ2 and θ2′ in the equation reach the first similarity, it is determined that Figure 3 There is a first similarity between the first adjacent nodes formed by the data exchange nodes 10 and 20 and the second adjacent nodes formed by the historical data exchange nodes 30 and 40. When all the first adjacent nodes in the data exchange available path are matched to the corresponding second adjacent nodes with the first similarity in the same historically used path, the historically used path is filtered out and the process proceeds to step S212; otherwise, it is determined that the first similarity matching between the historically used path and the data exchange available path fails, and the historically available path is filtered out from the historical path library.
[0102] S212, for each second adjacent node in each historically used path remaining after filtering in step S211, determine whether the first network level hop number of the second adjacent node has a second similarity with the second network level hop number of the first adjacent node whose angle information in the available path has a first similarity, and if so, proceed to step S213;
[0103] For example, assuming that the remaining historically used paths filtered in step S211 are Figure 3 In the figure (b) on the right side of the figure, the historical data exchange nodes 30 and 40 in the figure (b) constitute one of the second adjacent nodes, and the first network level jump number of the second adjacent node is assumed to be "3" (for example, the historical data exchange node 30 is at the first network level, and the historical data exchange node 40 is at the fourth network level, then the first network level jump number between nodes 40 and 30 is "3"). In the available path, the first adjacent node (such as Figure 3 The second network layer hop number of the data exchange node 10 and the data exchange node 20 shown in the figure is assumed to be "2" (for example, the data exchange node 10 is at the first network layer, and the data exchange node 20 is at the third network layer, then the second network layer hop number between nodes 10 and 20 is "2"). Since the ratio of the first network layer hop number to the second network layer hop number is two-thirds, which is not an integer ratio relationship, it is determined that the second adjacent node does not have a second similarity with the first adjacent node. When all second adjacent nodes in the same historically used path have first adjacent nodes that satisfy the same second similarity (the same integer ratio relationship) in the available data exchange path, it is determined that the historically used path has a second similarity with the available data exchange path, otherwise, the historically used path is filtered out from the historical path library. It should be noted here that in order to ensure an integer proportional relationship, when calculating the second similarity, the larger value of the level jump number is used as the denominator and the smaller value is used as the numerator. Moreover, once the level jump number in the historically used path or the available path for data exchange is determined as the denominator, when performing the second similarity matching, the level jump numbers of all adjacent nodes in the previously determined historically used path or the available path for data exchange are used as the denominator in the second similarity calculation.
[0104] S213, for each historically used path with a second similarity in the number of network level jumps, determine whether the second number of nodes in the used path and the second number of nodes in the available path have a third similarity, and if so, combine the first similarity, the second similarity and the third similarity to form a morphological similarity.
[0105] The third similarity is set as follows: the difference between the number of nodes in the historically used path (defined as the first number of nodes) and the number of nodes in the data exchange available path (defined as the second number of nodes) is less than a preset difference threshold.
[0106] In addition, in order to facilitate the calculation of the morphological similarity between the historically used paths and the available paths for data exchange, the above-mentioned first similarity, second similarity, and third similarity can be quantified into a first similarity value, a second similarity value, and a third similarity value, respectively. There are many existing methods for quantifying the similarity values, so they are not elaborated in detail.
[0107] It should be noted that when any of steps S211-S213 is judged as "if no", it indicates that no historical available path with morphological similarity to the available data exchange path is matched, and the judgment process of the subsequent steps is terminated, and an available path list is formed in the current step. It should also be noted that the primary condition for having morphological similarity is that the data exchange available path has the same data exchange start node and data exchange target node as the historically used path.
[0108] After the above step S21, after forming the available path list or the historically used path list, in step S2, the calculation and screening method of the comprehensive urgency value is transferred to the step:
[0109] S22, extract the top n elements in the available path list, calculate the disconnection urgency value and the connection urgency value for each group of adjacent nodes in each element that are in a connected state or an isolated state, and then merge the disconnection urgency values and the connection urgency values calculated for the same element into a comprehensive urgency value; or for the top n elements in the historically used path list, obtain the historical comprehensive urgency value corresponding to the element;
[0110] In this embodiment, for the elements in the available path list, the ratio of the difference between the amount of data to be sent from the pointing node to the pointed node and the amount of data to be released at the pointed node to the amount of data to be sent at the current time point is used as the network disconnection urgency value or network connection urgency value between the adjacent nodes.
[0111] by Figure 4 For example, suppose Figure 4The adjacent nodes composed of data exchange nodes 10 and 20 in the available path for data exchange represented are in a networked state at the current time point. The data exchange node 10 has a data intended to be sent with the data exchange node 20 as the target, and the data exchange nodes 10 and 20 are respectively defined as the pointing node and the pointed node at the current time point. And at the current time point, the data exchange node 20 as the pointed node has a corresponding amount of data to be released. In order to improve the security of cross-system data transmission and reception, the shorter the networking time, the higher the security. In this embodiment, in order to achieve this goal, the above ratio is used as the basis for judging the urgency of disconnection of the adjacent nodes. When the difference between the amount of data intended to be sent by the pointing node and the amount of data to be released by the pointed node is greater than the ratio of the amount of data intended to be sent, it means that the data transmission and reception of the pointing node and the pointed node are more unbalanced. At this time, the pointing node lacking the amount of data intended to be sent or the pointed node lacking the amount of data to be released is eager to change from the networked state to the disconnected state with another of the adjacent nodes. Therefore, in this embodiment, the above ratio is used as the disconnection urgency value between adjacent nodes.
[0112] The larger the amount of data that the pointing node intends to send to the pointed node, the more urgent it is to establish a networking relationship with the pointed node; and when the pointed node has data to be released, the smaller the amount of data to be released within a certain time period, the greater the probability that the data will be used across layers to execute designated business services within the time period, and the lower the urgency of the designated node changing from a connected state to a disconnected state. This is because, once the network is disconnected, the data currently owned by the pointed node cannot be successfully consumed by the designated business service. At this time, it is necessary to find a parasitic node, transfer the data currently owned by the pointed node to the parasitic node, and then disconnect from the network. This will increase the complexity of business service execution. Therefore, the lower the urgency of the pointed node changing from a connected state to a disconnected state. In order to achieve the above-mentioned technical effects, in this embodiment, when calculating the networking urgency value, the amount of data to be released is cleverly set to a negative value, so that the more balanced the amount of data to be sent to the pointed node and the amount of data to be released to the pointed node, the higher the urgency value for the network between adjacent nodes at different network levels to change from an isolated state to a networking state. This prevents the adjacent node from being changed from an isolated state to a networking state when the amount of data to be sent is insufficient or the pointed node needs to remain in an isolated state, thereby increasing the network security risk caused by the transmission and reception of large amounts of data.
[0113] The comprehensive urgency value is the weighted sum of the disconnection urgency value and the connection urgency value.
[0114] In this embodiment, the method for obtaining the historical comprehensive urgency value of each group of adjacent nodes in the elements in the historical used path list includes the steps of:
[0115] S221, for each group of adjacent nodes in the data exchange available path that have a corresponding relationship with the historically used path with morphological similarity when it is used as a historically available path, calculate the fourth similarity of the connected or isolated state, if both are in the connected or disconnected state, the fourth similarity is "1", otherwise it is "0", and then the sum of the fourth similarities is used as the comprehensive similarity;
[0116] For example, suppose Figure 3 When the historically used path expressed in FIG. (b) is used as a historically available path, its data exchange node 30 and the data exchange node 40 are in a networked state. Figure 3 If the first adjacent node composed of data exchange nodes 10 and 20 in the available data exchange path expressed in Figure (a) and having morphological similarity with the second adjacent node composed of data exchange nodes 30 and 40 is also in a networked state, then the fourth similarity between the second adjacent node and the second adjacent node is "1", otherwise it is "0", and then the fourth similarities between each group of adjacent nodes in the historically used path and the corresponding adjacent nodes in the available data exchange path with morphological similarity are summed, and the sum result is used as the comprehensive similarity of the historically used path.
[0117] S222 , extracting and obtaining the historical comprehensive urgency values corresponding to the historically used paths ranked top m in comprehensive similarity from the top n elements in the historically used path list.
[0118] After step S2, the calculation of the comprehensive urgency value of each available data exchange path is completed, or the historical comprehensive urgency value of the historically used path with the maximum morphological similarity to each available data exchange path is obtained, the full-process national secret encrypted exchange transmission method provided in this embodiment enters the step:
[0119] S3, extracting the available data exchange path with the largest comprehensive urgency value or the largest historical comprehensive urgency value as the proposed path, and then adding the dimensionality reduction information corresponding to each node in the proposed path as a random number to the designated link generated by the national secret;
[0120] For example, encrypting the exchanged transmission data between adjacent nodes in a networked state includes the following steps:
[0121] for example, Figure 4 The pointing node 10 and the pointed node 20 shown in FIG. 1 are in a networked state. At this time, the exchange data needs to be transmitted from the node 10 to the node 20. The encryption process is as follows:
[0122] First, the pointed node 20 forwards the authentication request pointing to the node 10 to the authentication center, and adds the random number of the pointed node 20 (any one or more of the node coordinate value of the pointed node 20 after three-dimensional dimension reduction, the network hierarchy relationship with the adjacent nodes, the coordinate mapping relationship, and the system type of the business system to which it belongs) to the authentication request;
[0123] Then, after receiving the authentication request, the authentication center generates a first authentication password, which includes a random number of the pointed node 20 and is sent to the pointing node 10 via the pointed node 20;
[0124] After receiving the first authentication code, the pointing node verifies the authority to exchange data with the pointed node 20, then generates a second authentication code (including the pointing node's random number), and sends it to the authentication center through the pointed node.
[0125] Finally, the authentication center cross-verifies the correctness of the first authentication password and the second authentication password, and after the verification is passed, notifies the pointing node to transmit the data exchange to the pointed node. It should be noted here that the method of cross-verifying the first authentication password and the second authentication password is not within the scope of the rights protection claimed by this application, nor does it affect the solution of the technical problem of this application, so it is not described in detail.
[0126] After the data to be exchanged is encrypted with the national secret, the full-process national secret encryption exchange transmission method provided in this embodiment enters the following steps:
[0127] S4, open up the network between the nodes in the intended path, transmit the intended exchange data containing the national secret with random numbers to the data exchange node, and then restore the network to its original state (the original isolation state, that is, restore to the network isolation state).
[0128] In this embodiment, in order to increase the security of cross-system data exchange transmission, in the scenario where the data exchange has an allowed waiting time, the national secret data to be exchanged with random numbers is not immediately transmitted to the adjacent nodes. The specific operation method is:
[0129] Calculate an ideal time point, then open up the network between adjacent nodes, and restore the network to its original state after completing the exchange transmission.
[0130] The calculation method of the ideal time point includes the following steps:
[0131] S41, starting the timing by taking the instruction of generating the business data with the national secret added with the random number from the pointing node among the adjacent nodes in the isolated state in the proposed path;
[0132] S42, judging whether the accumulated time reaches the preset allowable waiting time according to the preset frequency,
[0133] If so, the network between the adjacent nodes is opened up;
[0134] If not, proceed to step S43;
[0135] S43, judging whether the adjacent nodes have reached a state of data accumulation and release equilibrium,
[0136] If so, the ideal time point is achieved, and then the network between the adjacent nodes is opened;
[0137] If not, return to step S42.
[0138] The data accumulation and release balance state in step S43 is: at the current time point, the ratio of the difference between the amount of data to be sent from the pointing node to the pointed node and the amount of data to be released from the pointed node among the adjacent nodes to the amount of data to be sent is within the preset ratio threshold range; the amount of data to be released is a negative value.
[0139] In summary, the present invention constructs a hierarchical network of different types of business systems and As a kind of dimensionality reduction information after spatial dimensionality reduction of data exchange nodes in hierarchical networks, the distance characteristics between different business systems are integrated into the encryption process of exchanged and transmitted data, which not only improves the data encryption security level, but also improves the efficiency and effectiveness of cross-system data exchange transmission path screening. In addition, using dimensionality reduction information as the random number of the national secret encryption process, once the starting node of data exchange changes, the hierarchical network structure changes, the random number changes synchronously and dynamically, and it is difficult to find the change pattern, which greatly improves the security of encrypted data exchange and transmission.
[0140] It should be noted that the above specific implementations are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art should understand that various modifications, equivalent substitutions, changes, etc. can be made to the present invention. However, as long as these changes do not deviate from the spirit of the present invention, they should be within the scope of protection of the present invention. In addition, some terms used in the specification and claims of this application are not restrictive, but are only for the convenience of description.
Claims
1. A full-process national secret encryption exchange transmission method, characterized in that: Includes steps: S1, through the hierarchical network construction and node space dimensionality reduction of different types of business systems, find the available path for data exchange in one-dimensional space and obtain the dimensionality reduction information of each data exchange node in the path; S2, calculating the comprehensive urgency value of each of the available data exchange paths changing the interconnection state between adjacent nodes at different levels through path similarity matching and data traffic prediction, or obtaining the historical comprehensive urgency value of the historically used path with the maximum morphological similarity to each of the available data exchange paths; S3, extracting the available data exchange path corresponding to the largest comprehensive urgency value or the historical comprehensive urgency value as the proposed path, and then adding the dimension reduction information corresponding to each node in the proposed path as a random number to the designated link of national secret generation; S4, opening up the network between the nodes in the proposed path, exchanging and transmitting the business data containing the national secret with the random number added to the data exchange node, and then restoring the network to the original state.
2. The full-process national secret encryption exchange transmission method according to claim 1 is characterized in that: In step S1, the method for constructing the hierarchical network of different types of business systems includes the following steps: A1, for the data exchange nodes distributed at various locations under each of the business systems, a rectangular area is selected with a minimum rectangular selection area, and then the plane coordinates of any vertex of the rectangular area corresponding to each of the business systems are solved; A2, taking the first vertex of the solved plane coordinates in the first rectangular area containing the data exchange start node as the origin of the three-dimensional space coordinate system, and for each of the remaining second rectangular areas, calculating the distance between the second vertex of the solved plane coordinates and the origin as the z-axis coordinate value of the corresponding second rectangular area in the three-dimensional space coordinate system; A3, taking the first vertex and each of the second vertices as the z-axis positions of the corresponding rectangular areas in the three-dimensional space coordinate system, loading each rectangular area into the three-dimensional space coordinate system to form the hierarchical network that is parallel to the upper and lower parts in the three-dimensional space.
3. The full-process national secret encryption exchange transmission method according to claim 2 is characterized in that: In step A2, the z-axis coordinate value of the second vertex is: the conversion value of the average distance between each of the data exchange nodes in the second rectangular area and the data exchange start node in the first rectangular area in the real space converted to the three-dimensional space coordinate system; In the rectangular area where the data exchange nodes forming the proposed path are located, the conversion relationship of the vertices of the plane coordinates from the real physical space to the three-dimensional virtual space is solved, and / or the conversion value is used as the random number at the same time.
4. The full-process national secret encryption exchange transmission method according to claim 3 is characterized in that: In step S1, the method for performing spatial dimension reduction on each of the data exchange nodes at different levels in the constructed hierarchical network comprises the steps of: B1, construct the coordinate mapping relationship between the real space and the three-dimensional space as expressed by the following formula (1): In formula (1), , Respectively represent the x-axis value, y-axis value or z-axis value of the data exchange node under the same business system in three-dimensional space and real space; Representation and The x-axis value, y-axis value or z-axis value of the vertex of the rectangular area as the origin in the three-dimensional space having a coordinate correspondence in the real space; Indicates the three-dimensional space conversion ratio; Represents the first the conversion value corresponding to the second rectangular area; When is the x-axis value or y-axis value to be mapped, ; B2, with the dimensionality reduction condition that the number of coordinate values with corresponding axes and the same three-dimensional coordinate values is at least "2", the data exchange nodes under each network level are reduced to a straight line on the xz axis plane or the yz axis plane.
5. The full-process national secret encryption exchange transmission method according to claim 1 is characterized in that: In step S1, the method for finding the available data exchange path is: after identifying each data exchange node having the same business service type as the intended data exchange from each network layer, a plurality of available data exchange paths are formed from the data exchange start node to the data exchange target node on the condition that the adjacent nodes in the path have a cross-layer relationship; The dimensionality reduction information of each data exchange node in the available path for data exchange includes: the node coordinate value after three-dimensional dimensionality reduction, the network hierarchy relationship with adjacent nodes, the coordinate mapping relationship between dimensionality increase and dimensionality reduction, and at least one of the system types of the business system to which the data exchange node belongs.
6. The full-process national secret encryption exchange and transmission method according to any one of claims 1 to 5 is characterized in that: In step S2, the method for calculating the comprehensive urgency value comprises the steps of: S21, determining whether the number of historically used paths matched from the historical path library and having the same service type as the available path for data exchange and whose morphological similarity is greater than a similarity threshold is "0", If yes, sort the available paths for data exchange from small to large according to the sum of the hierarchical distances between adjacent nodes in the paths to form an available path list; If not, extract the historically used path with the greatest morphological similarity to each of the available data exchange paths, and then arrange the extracted historically used paths from high to low according to morphological similarity to form a historically used path list; S22, extract the top ranking paths in the available path list of elements, respectively calculating the network disconnection urgency value and the network connection urgency value for each group of adjacent nodes in the element that are in a networked state or in an isolated state, and then fusing the network disconnection urgency values and the network connection urgency values calculated for the same element to form the comprehensive urgency value; or calculating the network disconnection urgency value and the network connection urgency value for the top nodes in the historically used path list. of elements, and obtain the historical comprehensive urgency value corresponding to the element.
7. The full-process national secret encryption exchange transmission method according to claim 6 is characterized in that: In step S21, the matching parameters of the morphological similarity include at least one of the angle information between the direct line and the horizontal line between adjacent nodes in the path, the number of nodes, and the number of network level jumps between adjacent nodes; the angle information includes the degree of the angle and the quadrant feature of the angle; The method for calculating morphological similarity includes the following steps: S211, calculating the angle information between the straight line and the horizontal line between the adjacent nodes in the available data exchange path, and then determining whether the historically used path having the first similarity with the angle information corresponding to each group of adjacent nodes in the available data exchange path is matched from the historical path library, and if so, proceeding to step S212; S212, for each second adjacent node in each of the historically used paths remaining after filtering in step S211, determine whether the second network layer hop number of the second adjacent node has a second similarity with the angle information in the available path for data exchange, and if so, proceed to step S213; S213, for each of the historically used paths having the second similarity in the number of network level jumps, determining whether the number of first nodes in the historically used path and the number of second nodes in the data exchange available path have a third similarity, and if so, combining the first similarity, the second similarity and the third similarity into the morphological similarity; When any one of steps S211-S213 is judged as "if no", it indicates that the historically used path having a morphological similarity with the available path for data exchange is not matched, and the subsequent judgment process is terminated, and the available path list is formed in the current step.
8. The full-process national secret encryption exchange transmission method according to claim 6 is characterized in that: For the elements in the available path list, the ratio of the difference between the amount of data to be sent from the pointing node to the pointed node and the amount of data to be released from the pointed node among the adjacent nodes at the current time point to the amount of data to be sent is used as the network disconnection urgency value or the network connection urgency value between the adjacent nodes; When calculating the networking urgency value, the amount of data to be released is a negative value; The method for obtaining the historical comprehensive urgency value of each group of adjacent nodes in the elements in the historical used path list comprises the steps of: S221, for each group of adjacent nodes in the data exchange available path that have a corresponding relationship with the historically used path with morphological similarity when it is used as a historically available path, calculate a fourth similarity of connected or isolated state, if both are connected or disconnected, the fourth similarity is "1", otherwise it is "0", and then the sum of the fourth similarities is used as the comprehensive similarity; S222, ranking the top paths in the historically used path list of elements, extract and obtain the top comprehensive similarity ranking The historical comprehensive urgency values corresponding to each of the historically used paths.
9. The full-process national secret encryption exchange transmission method according to claim 1 is characterized in that: In step S4, the network between the nodes in the proposed path is opened at the calculated ideal time point, and the calculation method of the ideal time point includes the steps of: S41, starting the timing by taking as an instruction the pointing node among the adjacent nodes in the proposed path in an isolated state to generate the national secret service data with the random number added thereto; S42, judging whether the accumulated time reaches the preset allowable waiting time according to the preset frequency, If so, connecting the network between the adjacent nodes; If not, proceed to step S43; S43, determining whether the adjacent nodes have reached a state of data accumulation and release equilibrium, If yes, the ideal time point is achieved, and then the network between the adjacent nodes is opened; If not, return to step S42.
10. The full-process national secret encryption exchange transmission method according to claim 9 is characterized in that: The data accumulation and release balance state in step S43 is: at the current time point, the ratio of the difference between the amount of data to be sent from the pointing node to the pointed node and the amount of data to be released of the pointed node among the adjacent nodes to the amount of data to be sent is within a preset ratio threshold interval; The amount of data to be released is a negative value.
