Network node verification method, device, equipment, medium and program product

Abstract

The invention provides a network node verification method which can be applied to the field of information security and the technical field of financial science and technology. The network node comprises a check node and a plurality of communication nodes, and the network node check method comprises the following steps: on the basis of a plurality of first initial value keys, performing random sequence generation in each communication node in sequence according to a predetermined sequence to obtain a first random sequence, and storing each first initial value key in each communication node respectively. And on the basis of a plurality of second initial value keys, according to a predetermined sequence, random sequence generation is carried out in the check node to obtain a second random sequence, and the second initial value keys are determined on the basis of the first initial value keys stored in the check node. And comparing the first random sequence with the second random sequence. And under the condition that the first random sequence is consistent with the second random sequence, determining that each communication node passes verification. The invention further provides a network node verification device and equipment, a storage medium and a program product.

Description

Technical Field

[0001] The present disclosure relates to the fields of information security and financial technology, and specifically to security verification of network nodes, and more specifically to a network node verification method, device, equipment, medium and program product. Background Art

[0002] The existing trusted local area network is mainly guaranteed by the SSL protocol. The SSL protocol has a CA organization for issuing SSL certificates to prove the authenticity and identity of the node. When one node visits another node, the visited node sends its SSL certificate to the visitor. The visitor confirms the authenticity and identity of the server by verifying the validity of the certificate, thereby ensuring the security of data transmission.

[0003] In the existing trusted local area network, the certificate authenticated by the CA organization will not be changed after it is generated, and each access requires both parties to verify the certificate, which is a cumbersome and inefficient process. In addition, when applying for a certificate, the protocol uses an asymmetric encryption algorithm. Due to its natural mathematical calculation properties, asymmetric encryption technology has low computational efficiency and is prone to waste of resources. Summary of the invention

[0004] In view of the above problems, embodiments of the present disclosure provide a network node verification method, apparatus, device, medium and program product that improve network node verification efficiency and save computing resources.

[0005] According to the first aspect of the present disclosure, a network node verification method is provided, wherein the network node includes a verification node and a plurality of communication nodes, and the method includes: based on a plurality of first initial value keys, a random sequence is generated in each communication node in sequence according to a predetermined order to obtain a first random sequence, and each first initial value key is stored in each communication node respectively. Based on a plurality of second initial value keys, a random sequence is generated in the verification node in a predetermined order to obtain a second random sequence, and the second initial value key is determined based on the first initial value key stored in the verification node. The first random sequence is compared with the second random sequence. When the first random sequence is consistent with the second random sequence, it is determined that each communication node has passed the verification.

[0006] According to an embodiment of the present disclosure, based on multiple first initial value keys, random sequences are generated in each communication node in sequence according to a predetermined order, and obtaining a first random sequence includes: obtaining the initial value key in the first sequence node. According to the initial value key in the first sequence node, chaotic mapping is performed to obtain a first binary sequence. Determine the second binary sequence of the second sequence node. Perform an XOR operation on the first binary sequence and the second binary sequence to obtain a fused binary sequence. For subsequent sequence nodes, the chaotic mapping and XOR operation are repeated in sequence until multiple communication nodes are traversed to obtain the first random sequence.

[0007] According to an embodiment of the present disclosure, the algorithm corresponding to the chaotic map is at least one-dimensional, and the dimension of the algorithm represents the dimension of the state space of the power system. When the algorithm is one-dimensional, the value of the system growth rate is between 3.5 and 4.

[0008] According to an embodiment of the present disclosure, multiple communication nodes constitute a communication node sequence, and the verification node communicates only with the last communication node in the communication node sequence to obtain a first random sequence. In the verification node, the first random sequence is compared with the second random sequence to implement verification of multiple communication nodes.

[0009] According to an embodiment of the present disclosure, there are multiple communication node sequences, each communication node sequence includes a portion of multiple communication nodes, and each communication node sequence is respectively provided with a corresponding check node.

[0010] According to an embodiment of the present disclosure, multiple communication nodes are verified according to a preset fixed period. Alternatively, the verification period is determined according to the size relationship between network traffic and a preset traffic threshold. Multiple communication nodes are verified according to the verification period. The verification period is negatively correlated with the network traffic.

[0011] According to an embodiment of the present disclosure, the network node verification method further includes: sending a warning to each communication node when the first random sequence is inconsistent with the second random sequence. And / or when the first random sequence is inconsistent with the second random sequence, performing an exclusion check on each communication node to determine an abnormal communication node.

[0012] According to an embodiment of the present disclosure, a network node verification method is applied to a local area network.

[0013] The second aspect of the present disclosure provides a network node verification device, the network node includes a verification node and a plurality of communication nodes, the device includes: a first generation module, for generating a random sequence in each communication node in sequence according to a predetermined order based on a plurality of first initial value keys to obtain a first random sequence, each first initial value key is stored in each communication node respectively. A second generation module, for generating a random sequence in the verification node in a predetermined order based on a plurality of second initial value keys to obtain a second random sequence, the second initial value key is determined based on the first initial value key stored in the verification node. A comparison module, for comparing the first random sequence with the second random sequence. A determination module, for determining that each communication node has passed verification when the first random sequence is consistent with the second random sequence.

[0014] A third aspect of the present disclosure provides an electronic device, comprising: one or more processors; a memory for storing one or more computer programs, wherein the one or more processors execute the one or more computer programs to implement the steps of the above-mentioned network node verification method.

[0015] The fourth aspect of the present disclosure further provides a computer-readable storage medium having a computer program or instruction stored thereon, which implements the steps of the above-mentioned network node verification method when the above-mentioned computer program or instruction is executed by a processor.

[0016] The fifth aspect of the present disclosure further provides a computer program product, including a computer program or instructions, which implement the steps of the above-mentioned network node verification method when the above-mentioned computer program or instructions are executed by a processor. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] The above contents and other objects, features and advantages of the present disclosure will become more apparent through the following description of the embodiments of the present disclosure with reference to the accompanying drawings, in which:

[0018] Figure 1 The application scenario diagram of the network node verification method, apparatus, device, medium and program product according to the embodiments of the present disclosure is schematically shown;

[0019] Figure 2 A flowchart of a network node verification method according to an embodiment of the present disclosure is schematically shown;

[0020] Figure 3 A flowchart of a method for generating a first random sequence according to an embodiment of the present disclosure is schematically shown;

[0021] Figure 4 Schematically shows a bifurcation diagram of a logistic map according to an embodiment of the present disclosure;

[0022] Figure 5A flowchart of a network node verification method according to another embodiment of the present disclosure is schematically shown;

[0023] Figure 6 A network architecture diagram schematically illustrates a network node verification method according to an embodiment of the present disclosure;

[0024] Figure 7 A schematic diagram of a network node verification device according to an embodiment of the present disclosure is shown; and

[0025] Figure 8 A block diagram of an electronic device suitable for implementing a network node verification method according to an embodiment of the present disclosure is schematically shown. DETAILED DESCRIPTION

[0026] Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. However, it should be understood that these descriptions are exemplary only and are not intended to limit the scope of the present disclosure. In the following detailed description, for ease of explanation, many specific details are set forth to provide a comprehensive understanding of the embodiments of the present disclosure. However, it is apparent that one or more embodiments may also be implemented without these specific details. In addition, in the following description, descriptions of known structures and technologies are omitted to avoid unnecessary confusion of the concepts of the present disclosure.

[0027] The terms used herein are only for describing specific embodiments and are not intended to limit the present disclosure. The terms "comprise", "include", etc. used herein indicate the existence of the features, steps, operations and / or components, but do not exclude the existence or addition of one or more other features, steps, operations or components.

[0028] All terms (including technical and scientific terms) used herein have the meanings commonly understood by those skilled in the art unless otherwise defined. It should be noted that the terms used herein should be interpreted as having a meaning consistent with the context of this specification and should not be interpreted in an idealized or overly rigid manner.

[0029] When using expressions such as "at least one of A, B, and C, etc.", they should generally be interpreted according to the meaning of the expression commonly understood by those skilled in the art (for example, "a system having at least one of A, B, and C" should include but is not limited to a system having A alone, B alone, C alone, A and B, A and C, B and C, and / or A, B, C, etc.).

[0030] The embodiments of the present disclosure provide a network node verification method, device, equipment, medium and program product, which can be used in the field of financial technology or other fields. It should be noted that the network node verification method, device, equipment, medium and program product of the present disclosure can be used in the field of financial technology, and can also be used in any field other than the field of financial technology. The application field of the network node verification method, device, equipment, medium and program product of the present disclosure is not limited.

[0031] In the technical solution of the present disclosure, the user information (including but not limited to user personal information, user image information, user device information, such as location information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved are all information and data authorized by the user or fully authorized by all parties, and the collection, storage, use, processing, transmission, provision, disclosure and application of the relevant data comply with relevant laws, regulations and standards, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or refuse.

[0032] In the scenario of using personal information for automated decision-making, the methods, devices, and systems provided by the embodiments of the present disclosure provide users with corresponding operation portals for users to choose to agree or reject the automated decision-making results; if the user chooses to reject, the expert decision-making process will be entered. The expression "automated decision-making" here refers to the activity of automatically analyzing and evaluating a person's behavioral habits, interests and hobbies, or economic, health, credit status, etc. through computer programs, and making decisions. The expression "expert decision-making" here refers to the activity of making decisions by people who specialize in a certain field, have specialized experience, knowledge and skills, and have reached a certain level of professionalism.

[0033] The embodiment of the present disclosure provides a network node verification method, the network node includes a verification node and a plurality of communication nodes, the method includes: based on a plurality of first initial value keys, a random sequence is generated in each communication node in turn according to a predetermined order to obtain a first random sequence, and each first initial value key is stored in each communication node respectively. Based on a plurality of second initial value keys, a random sequence is generated in the verification node according to a predetermined order to obtain a second random sequence, and the second initial value key is determined based on the first initial value key stored in the verification node. The first random sequence is compared with the second random sequence. When the first random sequence is consistent with the second random sequence, it is determined that each communication node has passed the verification. The present disclosure uniformly performs the verification between multiple communication nodes through a specific verification node, and there is no need to perform bilateral verification between communication nodes during communication, thereby improving the verification efficiency of network nodes. At the same time, the method of generating a random sequence using an initial value key is a symmetric encryption method, which also greatly saves computing resources.

[0034] Figure 1The application scenario diagram of the network node verification method, apparatus, device, medium and program product according to the embodiments of the present disclosure is schematically shown.

[0035] like Figure 1 As shown, the application scenario 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 is used to provide a medium for communication links between the first terminal device 101, the second terminal device 102, the third terminal device 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links or optical fiber cables, etc.

[0036] The user can use the first terminal device 101, the second terminal device 102, and the third terminal device 103 to interact with the server 105 through the network 104 to receive or send messages, etc. Various communication client applications can be installed on the first terminal device 101, the second terminal device 102, and the third terminal device 103, such as shopping applications, web browser applications, search applications, instant messaging tools, email clients, social platform software, etc. (only for example).

[0037] The first terminal device 101, the second terminal device 102, and the third terminal device 103 may be various electronic devices having display screens and supporting web browsing, including but not limited to smart phones, tablet computers, laptop computers, desktop computers, and the like.

[0038] The server 105 may be a server that provides various services, such as a background management server (only as an example) that provides support for websites browsed by users using the first terminal device 101, the second terminal device 102, and the third terminal device 103. The background management server may analyze and process the received data such as user requests, and feed back the processing results (such as web pages, information, or data obtained or generated according to user requests) to the terminal device.

[0039] It should be noted that the network node verification method provided in the embodiment of the present disclosure can generally be executed by the server 105. Accordingly, the network node verification device provided in the embodiment of the present disclosure can generally be set in the server 105. The network node verification method provided in the embodiment of the present disclosure can also be executed by a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105. Accordingly, the network node verification device provided in the embodiment of the present disclosure can also be set in a server or server cluster that is different from the server 105 and can communicate with the first terminal device 101, the second terminal device 102, the third terminal device 103 and / or the server 105.

[0040] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. Any number of terminal devices, networks and servers may be provided according to implementation requirements.

[0041] The following will be based on Figure 1 The scene described by Figure 2~Figure 6 The network node verification method of the disclosed embodiment is described in detail.

[0042] Figure 2 The flowchart of the network node verification method according to the embodiment of the present disclosure is schematically shown.

[0043] According to an embodiment of the present disclosure, a network node includes a check node and a plurality of communication nodes, such as Figure 2 As shown, the network node verification method of this embodiment includes, for example, operations S210 to S240, and the method can be executed by a computer program on corresponding computer hardware.

[0044] In operation S210, based on a plurality of first initial value keys, random sequences are generated in each communication node in sequence according to a predetermined order to obtain a first random sequence, and each first initial value key is stored in each communication node respectively.

[0045] The network node system includes, for example, a verification node and a plurality of communication nodes, which work together to complete the subsequent verification process.

[0046] At the initial stage, the system has multiple first initial value keys, which are securely stored in each communication node. According to a predetermined order (for example, in ascending or descending order of node number), each communication node will generate a random sequence based on the first initial value key it stores. After this process, each communication node will generate a random sequence, and each random sequence is integrated in the above order to obtain the first random sequence.

[0047] For example, the generation of the first initial key may be completed by using a secure random number generator or a cryptographic algorithm (such as AES (Advanced Encryption Standard)). The generated first initial key is distributed to the corresponding communication node through a secure transmission method (such as encrypted communication) and stored in a secure storage area of ​​the node.

[0048] It is understandable that the initial key may be generated during initialization and distributed to each communication node, or may be pre-cured in each communication node.

[0049] For example, each communication node uses the first initial value key stored in its storage as a seed and calls a pseudo-random number generator to generate a random sequence of fixed length. In order to ensure the unpredictability of the random sequence, the pseudo-random number generator should have good statistical properties and a long period.

[0050] In operation S220, based on the plurality of second initial value keys, a random sequence is generated in the check node in a predetermined order to obtain a second random sequence, wherein the second initial value key is determined based on the first initial value key stored in the check node.

[0051] Similar to the communication node, the check node also participates in the generation of the random sequence, but it is based on multiple second initial value keys.

[0052] These second initial value keys are not given directly, but are determined based on one or more first initial value keys stored in the check node (which may be determined directly or obtained through some algorithm or function conversion). The check node also generates a random sequence according to the predetermined order, and finally obtains a second random sequence.

[0053] For example, the verification node uses the second initial value key determined by it as a seed and calls the same pseudo-random number generator as the communication node to generate a random sequence with the same length.

[0054] In operation S230, the first random sequence is compared with the second random sequence.

[0055] After all communication nodes and verification nodes have completed the generation of random sequences, the system will compare the first random sequence (from one of the communication nodes) with the second random sequence (from the verification node) to check whether the two are completely consistent.

[0056] For example, after generating the first random sequence, the corresponding communication node needs to send it to the verification node. This can be done through network communication, but attention should be paid to the security of the transmission process, such as using an encrypted communication protocol.

[0057] After receiving the first random sequence, the verification node compares it bit by bit with the second random sequence generated by itself. The verification node only receives the random sequence and does not participate in regular communication. The verification node is safe by default. Except for the verification node, other nodes do not verify the received information, but only perform simple calculations on the received random sequence. The communication process is simpler, and this scheme belongs to the symmetric encryption algorithm system. The computing efficiency is higher than that of the asymmetric encryption algorithm, and computing resources are also saved.

[0058] In operation S240, when the first random sequence is consistent with the second random sequence, it is determined that each communication node has passed verification.

[0059] If the first random sequence is completely consistent with the second random sequence, the system determines that each communication node has passed the verification, indicating that the key and random sequence generation process of these nodes is correct and the security of the network is guaranteed.

[0060] If the two do not match, further inspection or additional safety measures may be necessary.

[0061] This embodiment verifies the security of the communication node by generating a random sequence based on the initial key in each communication node and verification node, and performing a comparison. If the random sequence generated by each communication node is consistent with the random sequence generated by the verification node, it is confirmed that each communication node has passed the verification. This method utilizes the combination of randomness and key technology to improve the efficiency of security verification of network nodes.

[0062] Figure 3 A flowchart of a method for generating a first random sequence according to an embodiment of the present disclosure is schematically shown. Figure 2 In addition to the operations S210 to S240 described above, the operations S311 to S315 are also included. For the sake of brevity, the description of operations S210 to S240 is omitted here, and the subsequent related method embodiments are similar and will not be repeated.

[0063] According to the embodiments of the present disclosure, Figure 3 As shown, for example, through operations S311 to S315, random sequences are generated in each communication node in sequence according to a predetermined order based on multiple first initial value keys to obtain a first random sequence.

[0064] In operation S311, an initial value key in the first-order node is obtained.

[0065] First, the system identifies the first-ranked node among all communication nodes and obtains the first initial value key stored therein.

[0066] In a first random number generation sequence, each communication node forms a serial communication chain. The first priority node is the communication node that ranks first in the communication chain when the random sequence is generated according to the above predetermined order. Then, according to the predetermined order, the second priority node, the third priority node, and so on are in turn.

[0067] In operation S312, chaotic mapping is performed according to the initial key in the first sequence node to obtain a first binary sequence.

[0068] For example, using the initial key of the first-order node as input, a chaotic mapping function (such as Logistic mapping, Tent mapping, etc.) is called to generate a fixed-length binary sequence (01 sequence). This sequence is highly random and complex and difficult to predict.

[0069] In operation S313 , a second binary sequence of the second-ranked nodes is determined.

[0070] The second-ranked node uses the first initial value key stored in it to generate a binary sequence of the same length through the chaotic mapping function. This sequence is independent of the sequence of the first-ranked node in the initial stage.

[0071] In operation S314, an XOR operation is performed on the first binary sequence and the second binary sequence to obtain a fused binary sequence.

[0072] Next, a bit-by-bit XOR operation is performed on the first binary sequence of the first-order node and the second binary sequence of the second-order node. The result of the XOR operation is a new binary sequence that combines the information of the first two sequences while maintaining a high degree of randomness.

[0073] In operation S315, chaotic mapping and XOR operation are repeated in sequence for subsequent sequence nodes until multiple communication nodes are traversed to obtain a first random sequence.

[0074] For the subsequent sequence nodes, the system repeats the above chaotic mapping and XOR operation steps in sequence. Each node uses the first initial value key stored in it to generate a binary sequence, and performs XOR operation with the previous fused binary sequence to obtain a new fused binary sequence.

[0075] When all communication nodes complete the chaotic mapping and XOR operation, the final fused binary sequence is the first random sequence. This sequence contains the initial key information of all communication nodes, and due to the complexity of the chaotic mapping and XOR operation, it is difficult to be predicted or cracked.

[0076] Finally, the verification node will also generate a second random sequence based on its second initial key (the key, for example, corresponds to the first initial key in each communication node one by one). Then, the system compares the first random sequence with the second random sequence. If the two are consistent, it is determined that the verification of each communication node has passed; if they are inconsistent, further inspection or other security measures may be required.

[0077] This embodiment combines the complexity of chaotic mapping and the fusion of XOR operation to generate a highly random and unpredictable first random sequence. This method not only improves the security verification efficiency of network nodes, but also enhances the security and stability of the entire network system.

[0078] According to an embodiment of the present disclosure, the algorithm corresponding to the chaotic map is at least one-dimensional, and the dimension of the algorithm represents the dimension of the state space of the power system. When the algorithm is one-dimensional, the value of the system growth rate is between 3.5 and 4.

[0079] In a network node verification method, a specific one-dimensional chaotic mapping algorithm is used to generate a random sequence. The algorithm not only has a high degree of randomness and complexity, but also meets the specific requirements of chaotic mapping.

[0080] For example, the Logistic mapping algorithm can be used in chaos theory, which has extensive applications and in-depth research. The expression of the Logistic mapping is:

[0081]

[0082] Among them, x n is the state of the system at the nth moment, and r is the system growth rate, which determines the chaotic behavior of the system.

[0083] Figure 4 The bifurcation diagram of the logistic map according to the embodiment of the present disclosure is schematically shown.

[0084] According to the requirements of the chaos mapping algorithm, the value range of the system growth rate should be between 3.5 and 4. Figure 4 As shown, within this range, the Logistic map will exhibit typical chaotic behavior, that is, the system state will be highly random and unpredictable.

[0085] Accordingly, the random sequence generation process includes, for example:

[0086] First, the first initial value key of each communication node is converted into a real number between 0 and 1 as the initial state of the Logistic map.

[0087] Using the Logistic mapping algorithm, the initial state of each communication node is iterated to generate a binary sequence of fixed length. The number of iterations can be determined according to actual needs to ensure that the generated sequence has sufficient length and complexity.

[0088] In each iteration, the result of the Logistic map is converted into a binary number (for example, through threshold judgment, the result greater than 0.5 is converted to 1, and the result less than or equal to 0.5 is converted to 0). In this way, after multiple iterations, a binary sequence consisting of 0 and 1 can be generated.

[0089] For subsequent sequential nodes, the above steps of chaotic mapping and binary sequence generation can be repeated in sequence. Then, the binary sequences of each node can be fused using an XOR operation or other fusion methods to obtain a final first random sequence.

[0090] It is understandable that, in order to simplify the process, the binary sequence generated by each node may also be directly used as a part of the first random sequence.

[0091] This embodiment uses the chaotic behavior of Logistic mapping to generate binary sequences with high randomness and complexity. These sequences are not only difficult to predict and crack, but also meet the specific requirements of chaotic mapping. Through this method, the security verification efficiency of network nodes can be effectively improved, and the security and stability of the entire network system can be enhanced.

[0092] According to an embodiment of the present disclosure, multiple communication nodes constitute a communication node sequence, and the verification node communicates only with the last communication node in the communication node sequence to obtain a first random sequence. In the verification node, the first random sequence is compared with the second random sequence to implement verification of multiple communication nodes.

[0093] In some embodiments, the network system is composed of a plurality of communication nodes and a check node. Each communication node is provided with a unique first initial value key for subsequent chaotic mapping and random sequence generation.

[0094] According to the network topology or specific requirements, multiple communication nodes are arranged in a certain order to form a communication node sequence. The communication nodes in the sequence are sequentially subjected to chaotic mapping and XOR operation in a predetermined order to generate a first random sequence.

[0095] The first communication node in the communication node sequence uses its first initial value key to perform chaotic mapping to generate a binary sequence.

[0096] Subsequent communication nodes in the sequence use their respective first initial value keys to perform chaotic mapping in turn, and perform an XOR operation on the generated binary sequence and the sequence of the previous node to obtain a new fused binary sequence.

[0097] This process continues until the last communication node in the communication node sequence completes the chaotic mapping and XOR operation to obtain the final first random sequence.

[0098] In this embodiment, the check node communicates only with the last communication node in the communication node sequence. The last communication node sends the generated first random sequence to the check node through a secure communication channel.

[0099] The check node uses its second initial value key to perform chaotic mapping to generate a second random sequence.

[0100] It should be noted that the chaotic mapping algorithm and parameters used by the check node to generate the second random sequence should be consistent with the algorithm and parameters used by the communication node to generate the first random sequence to ensure comparability between the two.

[0101] The check node compares the received first random sequence with the second random sequence generated by it.

[0102] If the two are completely consistent, it means that all communication nodes have correctly generated the random sequence according to the predetermined rules, and no data tampering or loss has occurred during the communication process.

[0103] If the two are inconsistent, it indicates that there may be abnormal conditions such as communication node failure, data tampering or network attack, which requires further inspection or security measures.

[0104] If the verification node finds that the first random sequence is inconsistent with the second random sequence, the anomaly detection mechanism is immediately triggered. The system can notify the network administrator or security team through log records, alarm prompts, etc. for further investigation and processing.

[0105] Based on the results of anomaly detection, network administrators can take corresponding security measures, such as isolating faulty nodes, strengthening network communication encryption, and updating security policies.

[0106] At the same time, the chaotic mapping algorithms and parameters of the communication nodes and the verification nodes can be regularly checked and updated to improve the security and stability of the system.

[0107] This embodiment realizes effective verification of multiple communication nodes by constructing a communication node sequence, generating a random sequence using chaotic mapping and XOR operation, and a secure communication mechanism between the verification node and the communication node.

[0108] According to an embodiment of the present disclosure, there are multiple communication node sequences, each communication node sequence includes a portion of multiple communication nodes, and each communication node sequence is respectively provided with a corresponding check node.

[0109] In some embodiments, the plurality of communication nodes may be divided into a plurality of different communication node sequences according to network topology, business requirements or security policies. Each communication node sequence includes a portion of the plurality of communication nodes, and each communication node sequence may be provided with a corresponding check node.

[0110] In each communication node sequence, the communication nodes perform chaotic mapping and XOR operations in a predetermined order to generate their own first random sequences. The chaotic mapping algorithm and parameters are consistent in each sequence to ensure that the first random sequences generated between different sequences are comparable.

[0111] The last communication node of each communication node sequence sends the first random sequence generated by it to the corresponding check node.

[0112] The check node uses its second initial value key to perform chaotic mapping to generate a corresponding second random sequence. The length of these second random sequences should match the first random sequence received from the corresponding communication node sequence. Each check node compares the received first random sequence with its corresponding second random sequence.

[0113] The comparison can be done bit by bit or by calculating similarity indicators such as Hamming distance.

[0114] If all first random sequences are consistent with the corresponding second random sequences, it indicates that all communication node sequences have correctly generated random sequences according to the predetermined rules, and no data tampering or loss has occurred during the communication process.

[0115] For example, if there are too many nodes in a network, you can try to split them by dividing them into LANs. For example, 100 nodes can be divided into 10 small LANs, each of which has a verification node. These 10 verification nodes can also form a verification LAN separately and communicate with a central verification node, which can further improve network efficiency.

[0116] Since there are multiple communication node sequences, multiple verification nodes can process the verification tasks of these sequences in parallel, that is, each verification node can simultaneously receive different first random sequences from each communication node sequence, and simultaneously generate and compare multiple second random sequences.

[0117] Parallel verification can significantly improve verification efficiency, especially in large network systems.

[0118] It is understood that the communication node sequence can be dynamically added, deleted or reorganized according to changes in network topology, changes in business requirements or adjustments to security policies. This can be achieved through a configuration management interface or automated tools.

[0119] In order to further improve the complexity and security of the random sequence, a higher-dimensional chaotic mapping algorithm or a combination of multiple chaotic mapping algorithms can be used to increase the difficulty for attackers to crack the random sequence.

[0120] This embodiment realizes parallel verification of multiple communication node sequences by constructing multiple sequences containing some communication nodes and using multiple verification nodes to process verification tasks in parallel. This method not only improves the verification efficiency and security of the network system, but also provides flexible configuration and management options for network administrators.

[0121] According to an embodiment of the present disclosure, multiple communication nodes are verified according to a preset fixed period. Alternatively, the verification period is determined according to the size relationship between network traffic and a preset traffic threshold. Multiple communication nodes are verified according to the verification period. The verification period is negatively correlated with the network traffic.

[0122] In some embodiments, the check period of the network node may be adjusted using a fixed period or based on dynamic network traffic.

[0123] When the system is initialized, a fixed verification period (for example, every hour, every day, etc.) is preset to periodically verify the status of the communication nodes. Alternatively, one or more network traffic thresholds are set to determine the current high and low status of the network traffic.

[0124] For example, the verification node starts the verification process according to a preset fixed verification cycle. In each verification cycle, the verification node communicates with the communication node according to the method described in the above embodiment, generates and compares the random sequence to verify the correctness of the communication node.

[0125] For another example, a verification node or a dedicated traffic monitoring module monitors network traffic in real time. The traffic data may be the utilization rate of network bandwidth, the number or rate of data packets, etc.

[0126] Compare the real-time monitored network traffic with the preset traffic threshold.

[0127] If the network traffic is lower than a certain low threshold, it indicates that the network load is low and the verification cycle can be shortened to monitor the status of the communication nodes more frequently to ensure the security and stability of the network.

[0128] If the network traffic is higher than a certain high threshold, it indicates that the network load is high. The verification period can be appropriately extended to reduce the occupation of network resources by the verification process.

[0129] According to the real-time changes in network traffic, the verification cycle is dynamically adjusted. The verification cycle is negatively correlated with network traffic, that is, the higher the network traffic, the shorter the verification cycle; the lower the network traffic, the longer the verification cycle. The adjusted verification cycle should be within the preset reasonable range to avoid too frequent or too sparse verification.

[0130] According to the currently valid verification cycle (fixed cycle or dynamically adjusted cycle), the verification node performs the verification process. The verification process includes steps such as communicating with the communication node, generating and comparing random sequences, etc.

[0131] In addition, machine learning algorithms can be introduced to intelligently predict future network traffic trends based on historical traffic data and verification results, and adjust the verification cycle accordingly. This will further improve the adaptability and accuracy of the verification method.

[0132] For critical communication nodes or network environments with high security requirements, multi-level verification strategies can also be implemented.

[0133] For example, on the basis of fixed-period verification, random verification or verification based on specific events can be added to improve the coverage and reliability of verification.

[0134] This embodiment can not only perform verification according to a preset fixed period, but also dynamically adjust the verification period according to the real-time changes in network traffic to achieve a more efficient verification strategy. This method not only improves the security and stability of the network system, but also reduces the occupation of network resources by the verification process, providing network administrators with more flexible and intelligent verification options.

[0135] Figure 5 The flowchart of a network node verification method according to another embodiment of the present disclosure is schematically shown.

[0136] According to the embodiments of the present disclosure, Figure 5 As shown, the network node verification method of this embodiment also includes, for example, operations S510 to S520.

[0137] In operation S510, when the first random sequence is inconsistent with the second random sequence, a warning is sent to each communication node. And / or

[0138] In operation S520, when the first random sequence is inconsistent with the second random sequence, an exclusion check is performed on each communication node to determine an abnormal communication node.

[0139] In some embodiments, if it is found during the verification process that the first random sequence of any communication node is inconsistent with the corresponding second random sequence, the inconsistency detection mechanism is immediately triggered.

[0140] For example, the verification node sends a warning message to all communication nodes to inform them of the inconsistent verification results.

[0141] The warning message may contain the inconsistent communication node identification, a verification timestamp, and possibly an error code or description.

[0142] For another example, after sending a warning, the verification node may initiate an exclusion verification process to further determine which communication node(s) is abnormal.

[0143] Exclusion verification can be performed by repeating the basic verification process, or by performing it on each communication node individually, or by using other more sophisticated verification methods.

[0144] For example, when the check node finds that the first random sequence and the second random sequence are inconsistent, the abnormal node can be located by requiring each communication node to resend the 01 sequence after the communication node XOR to the check node. Assuming that there are four nodes ABCD in the network, and E is the check node, E can require ABCD to send 01 sequences A', AB', ABC' and ABCD' to E respectively after ABCD receives and processes them. Then the check node generates A'', AB'', ABC'' and ABCD'' according to the initial values ​​of each communication node stored in itself, and compares the received sequences. Assuming that the original C node in the network is replaced by an illegal C1 node, then the check node compares A' and A'', AB' and AB'' are consistent, but ABC' and ABC'' are inconsistent, and it can be located that there is a problem with the C node.

[0145] Once an abnormal communication node is identified, the verification node can isolate it from the network to prevent it from continuing to affect other nodes or the overall performance of the network.

[0146] At the same time, network administrators can receive notifications and take appropriate measures to handle abnormal nodes, such as repairing faults, updating software or hardware, etc.

[0147] In order to improve processing efficiency, an automated processing mechanism can be introduced, such as automatic isolation of abnormal nodes, automatic triggering of repair scripts, etc. This will reduce the intervention of network administrators and speed up the recovery of abnormal nodes.

[0148] Verification nodes should record the results of each verification and the abnormal handling process for subsequent analysis and auditing. By analyzing the log records, network administrators can identify potential problems in the network and take corresponding preventive measures.

[0149] Based on the above embodiment, this embodiment adds a warning mechanism and a verification elimination step when the verification results are inconsistent. This not only improves the security and stability of the network system, but also helps network administrators to more accurately locate and handle abnormal communication nodes, thereby reducing the risk of network interruption and service quality degradation caused by node failure.

[0150] According to an embodiment of the present disclosure, a network node verification method is applied to a local area network.

[0151] Figure 6The network architecture diagram schematically shows the network node verification method applied according to the embodiment of the present disclosure.

[0152] In some embodiments, Figure 6 As shown, suppose there are five nodes A, B, C, D, and E in a local area network, among which E is a verification node. When forming a local area network, the A, B, C, and D nodes solidify their respective chaotic initial value keys in the hardware system. The value cannot be read or modified. The E node solidifies and stores the chaotic initial value keys of the A, B, C, and D nodes.

[0153] Except for the check node, each node uses the initial key at fixed intervals to iteratively generate a string of 01 sequences through chaotic mapping, and sends the generated chaotic sequence in the order of ABCD.

[0154] Assume that the chaotic sequence generated by node A is A'. After receiving A', node B performs XOR operation on A' and the chaotic sequence B' generated by itself to obtain the new sequence AB' and send it to C. C follows the same steps to obtain the sequence ABC' and then sends it to D. D follows the same steps to obtain ABCD' and finally sends it to the check node E.

[0155] The verification node E uses the initial value keys of the four nodes solidified locally to generate four chaotic sequences A'', B'', C'', D'' according to the same rules at the same interval, and performs XOR calculation on the sequences in the same order as ABCD to obtain the verification sequence ABCD''. After receiving the sequence ABCD', it compares it with the verification sequence ABCD''.

[0156] If the comparison is consistent, it means that all nodes in the LAN are legal nodes and the communication in the LAN is safe. If the comparison is inconsistent, it means that there are illegal nodes in the LAN, and the verification node E issues a warning to all members of the LAN, indicating that the current LAN has been invaded.

[0157] During the entire authentication process, the security check of each cycle is completed by only one verification node, and other nodes in the local area network only perform chaotic mapping iterations and sequence XOR operations, which greatly improves communication efficiency and saves resources.

[0158] At the same time, based on the initial value sensitive characteristics of chaotic mapping, each node can ensure at least 10 30 The key space of the entire LAN is 10 30N , where N is the number of nodes in the LAN. The key space grows geometrically with the number of nodes in the LAN, which can effectively prevent brute force cracking.

[0159] In addition, the initial value key of the chaotic map only requires a small amount of storage space, and there is no key management problem in traditional symmetric encryption algorithms.

[0160] Based on the above network node verification method, the present disclosure also provides a network node verification device. Figure 7 The network node verification device is described in detail.

[0161] Figure 7 The structural block diagram of a network node verification device according to an embodiment of the present disclosure is schematically shown.

[0162] like Figure 7 As shown, the network node includes a verification node and multiple communication nodes. The network node verification device 700 of this embodiment includes, for example: a first generation module 710 , a second generation module 720 , a comparison module 730 and a determination module 740 .

[0163] The first generation module 710 is used to generate a random sequence in each communication node in a predetermined order based on multiple first initial value keys to obtain a first random sequence, and each first initial value key is stored in each communication node. In one embodiment, the first generation module 710 can be used to perform the operation S210 described above, which will not be repeated here.

[0164] The second generation module 720 is used to generate a random sequence in the check node based on multiple second initial value keys in a predetermined order to obtain a second random sequence, and the second initial value key is determined based on the first initial value key stored in the check node. In one embodiment, the second generation module 720 can be used to perform the operation S220 described above, which will not be repeated here.

[0165] The comparison module 730 is used to compare the first random sequence with the second random sequence. In one embodiment, the comparison module 730 can be used to perform the operation S230 described above, which will not be described in detail here.

[0166] The determination module 740 is used to determine that each communication node has passed the verification when the first random sequence is consistent with the second random sequence. In one embodiment, the determination module 740 can be used to perform the operation S240 described above, which will not be repeated here.

[0167] According to an embodiment of the present disclosure, any multiple modules of the first generation module 710, the second generation module 720, the comparison module 730 and the determination module 740 can be combined into one module for implementation, or any one of the modules can be split into multiple modules. Alternatively, at least part of the functions of one or more of these modules can be combined with at least part of the functions of other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first generation module 710, the second generation module 720, the comparison module 730 and the determination module 740 can be at least partially implemented as a hardware circuit, such as a field programmable gate array (FPGA), a programmable logic array (PLA), a system on a chip, a system on a substrate, a system on a package, an application specific integrated circuit (ASIC), or can be implemented by hardware or firmware such as any other reasonable way of integrating or packaging the circuit, or implemented in any one of the three implementation methods of software, hardware and firmware or in a suitable combination of any of them. Alternatively, at least one of the first generating module 710 , the second generating module 720 , the comparing module 730 and the determining module 740 may be at least partially implemented as a computer program module, and when the computer program module is executed, a corresponding function may be performed.

[0168] According to an embodiment of the present disclosure, the first generation module 710 includes an acquisition submodule, a mapping submodule, a determination submodule, a fusion submodule and a traversal submodule.

[0169] The acquisition submodule is used to obtain the initial value key in the first-order node.

[0170] The mapping submodule is used to perform chaotic mapping according to the initial value key in the first sequence node to obtain a first binary sequence.

[0171] The determination submodule is used to determine a second binary sequence of the second-ranked nodes.

[0172] The fusion submodule is used to perform an XOR operation on the first binary sequence and the second binary sequence to obtain a fused binary sequence.

[0173] The traversal submodule is used to repeat the chaotic mapping and XOR operation for the subsequent sequence nodes in sequence until a plurality of communication nodes are traversed to obtain the first random sequence.

[0174] According to an embodiment of the present disclosure, the network node verification device 700 further includes: an alarm module and an exclusion module.

[0175] The alarm module is used to send a warning to each communication node when the first random sequence is inconsistent with the second random sequence. And / or

[0176] The exclusion module is used to perform exclusion checks on each communication node respectively to determine the abnormal communication node when the first random sequence is inconsistent with the second random sequence.

[0177] Figure 8 A block diagram of an electronic device suitable for implementing a network node verification method according to an embodiment of the present disclosure is schematically shown.

[0178] like Figure 8 As shown, the electronic device 800 according to an embodiment of the present disclosure includes a processor 801, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 802 or a program loaded from a storage part 808 to a random access memory (RAM) 803. The processor 801 may include, for example, a general-purpose microprocessor (e.g., a CPU), an instruction set processor and / or a related chipset and / or a dedicated microprocessor (e.g., an application-specific integrated circuit (ASIC)), etc. The processor 801 may also include an onboard memory for caching purposes. The processor 801 may include a single processing unit or multiple processing units for performing different actions of the method flow according to an embodiment of the present disclosure.

[0179] In RAM 803, various programs and data required for the operation of electronic device 800 are stored. Processor 801, ROM 802 and RAM 803 are connected to each other via bus 804. Processor 801 performs various operations of the method flow according to the embodiment of the present disclosure by executing the program in ROM 802 and / or RAM 803. It should be noted that the program can also be stored in one or more memories other than ROM 802 and RAM 803. Processor 801 can also perform various operations of the method flow according to the embodiment of the present disclosure by executing the program stored in the one or more memories.

[0180] According to an embodiment of the present disclosure, the electronic device 800 may further include an input / output (I / O) interface 805, which is also connected to the bus 804. The electronic device 800 may further include one or more of the following components connected to the input / output (I / O) interface 805: an input portion 806 including a keyboard, a mouse, etc.; an output portion 807 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage portion 808 including a hard disk, etc.; and a communication portion 809 including a network interface card such as a LAN card, a modem, etc. The communication portion 809 performs communication processing via a network such as the Internet. A drive 810 is also connected to the input / output (I / O) interface 805 as needed. A removable medium 811, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 810 as needed, so that the computer program read therefrom is installed into the storage portion 808 as needed.

[0181] The present disclosure also provides a computer-readable storage medium, which may be included in the device / apparatus / system described in the above embodiments; or may exist independently without being assembled into the device / apparatus / system. The above computer-readable storage medium carries one or more programs, and when the above one or more programs are executed, the network node verification method according to the embodiment of the present disclosure is implemented.

[0182] According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium, for example, it may include but is not limited to: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, an apparatus or a device. For example, according to an embodiment of the present disclosure, the computer-readable storage medium may include the ROM 802 and / or RAM 803 described above and / or one or more memories other than ROM 802 and RAM 803.

[0183] The embodiment of the present disclosure also includes a computer program product, which includes a computer program, and the computer program contains program code for executing the method shown in the flowchart. When the computer program product is run in a computer system, the program code is used to enable the computer system to implement the network node verification method provided by the embodiment of the present disclosure.

[0184] The above functions defined in the system / device of the embodiment of the present disclosure are performed when the computer program is executed by the processor 801. According to the embodiment of the present disclosure, the system, device, module, unit, etc. described above can be implemented by a computer program module.

[0185] In one embodiment, the computer program may rely on tangible storage media such as optical storage devices, magnetic storage devices, etc. In another embodiment, the computer program may also be transmitted and distributed in the form of signals on a network medium, and downloaded and installed through the communication part 809, and / or installed from a removable medium 811. The program code contained in the computer program may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0186] In such an embodiment, the computer program can be downloaded and installed from the network through the communication part 809, and / or installed from the removable medium 811. When the computer program is executed by the processor 801, the above functions defined in the system of the embodiment of the present disclosure are performed. According to the embodiment of the present disclosure, the system, device, means, module, unit, etc. described above can be implemented by a computer program module.

[0187] According to an embodiment of the present disclosure, the program code for executing the computer program provided by the embodiment of the present disclosure can be written in any combination of one or more programming languages. Specifically, these computing programs can be implemented using high-level process and / or object-oriented programming languages, and / or assembly / machine languages. Programming languages ​​include, but are not limited to, Java, C++, python, "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, partially on the remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect through the Internet).

[0188] The flow charts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flow chart or block diagram can represent a module, a program segment, or a part of a code, and the above-mentioned module, program segment, or a part of a code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flow chart, and the combination of the boxes in the block diagram or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0189] It will be appreciated by those skilled in the art that the features described in the various embodiments of the present disclosure may be combined and / or combined in a variety of ways, even if such combinations or combinations are not explicitly described in the present disclosure. In particular, without departing from the spirit and teachings of the present disclosure, the features described in the various embodiments of the present disclosure may be combined and / or combined in a variety of ways. All of these combinations and / or combinations fall within the scope of the present disclosure.

[0190] The embodiments of the present disclosure are described above. However, these embodiments are only for illustrative purposes and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the various embodiments cannot be used in combination to advantage. Without departing from the scope of the present disclosure, those skilled in the art may make a variety of substitutions and modifications, which should all fall within the scope of the present disclosure.

Claims

1. A network node verification method, characterized in that: The network node includes a check node and a plurality of communication nodes, and the method includes: Based on a plurality of first initial value keys, a random sequence is generated in each of the communication nodes in sequence according to a predetermined order to obtain a first random sequence, and each of the first initial value keys is respectively stored in each of the communication nodes; Based on a plurality of second initial value keys, generating a random sequence in the check node in accordance with the predetermined order to obtain a second random sequence, wherein the second initial value key is determined based on the first initial value key stored in the check node; comparing the first random sequence with the second random sequence; When the first random sequence is consistent with the second random sequence, it is determined that each of the communication nodes has passed verification.

2. The method according to claim 1, characterized in that The generating of a random sequence in each of the communication nodes in sequence according to a predetermined order based on the multiple first initial value keys to obtain a first random sequence comprises: Get the initial value key in the first-order node; Performing chaotic mapping according to the initial value key in the first sequence node to obtain a first binary sequence; Determine a second binary sequence of the second-ranked nodes; performing an XOR operation on the first binary sequence and the second binary sequence to obtain a fused binary sequence; For subsequent sequence nodes, chaotic mapping and XOR operation are repeated in sequence until the plurality of communication nodes are traversed to obtain the first random sequence.

3. The method according to claim 2, characterized in that The algorithm corresponding to the chaotic map is an algorithm of at least one dimension, and the dimension of the algorithm represents the dimension of the state space of the power system; When the algorithm is one-dimensional, the value of the system growth rate is between 3.5 and 4.

4. The method according to claim 1, characterized in that: The multiple communication nodes constitute a communication node sequence, and the check node communicates only with the last communication node in the communication node sequence to obtain the first random sequence; In the verification node, the first random sequence is compared with the second random sequence to implement verification of the multiple communication nodes.

5. The method according to claim 4, characterized in that There are multiple communication node sequences, each of which includes a portion of the multiple communication nodes, and each of the communication node sequences is respectively provided with a corresponding check node.

6. The method according to claim 1, characterized in that Verify the plurality of communication nodes according to a preset fixed period; or Determine the verification period according to the relationship between the network traffic and the preset traffic threshold; Verifying the plurality of communication nodes according to the verification period; The verification period is negatively correlated with the network traffic.

7. The method according to claim 1, characterized in that The method further comprises: When the first random sequence is inconsistent with the second random sequence, sending a warning to each of the communication nodes; and / or In the case that the first random sequence is inconsistent with the second random sequence, an exclusion check is performed on each of the communication nodes to determine an abnormal communication node.

8. The method according to claim 1, characterized in that The method is applied to a local area network.

9. A network node verification device, characterized in that: The network node includes a check node and a plurality of communication nodes, and the device includes: A first generating module, configured to generate a random sequence in each of the communication nodes in sequence according to a predetermined order based on a plurality of first initial value keys to obtain a first random sequence, wherein each of the first initial value keys is stored in each of the communication nodes respectively; A second generating module is used to generate a random sequence in the check node according to the predetermined order based on a plurality of second initial value keys to obtain a second random sequence, wherein the second initial value key is determined based on the first initial value key stored in the check node; A comparison module, used for comparing the first random sequence with the second random sequence; A determination module is used to determine whether each of the communication nodes has passed verification when the first random sequence is consistent with the second random sequence.

10. An electronic device, comprising: one or more processors; a memory for storing one or more computer programs, It is characterized in that the one or more processors execute the one or more computer programs to implement the steps of the method according to any one of claims 1 to 8.

11. A computer-readable storage medium having a computer program or instruction stored thereon, characterized in that: When the computer program or instruction is executed by a processor, the steps of the method according to any one of claims 1 to 8 are implemented.

12. A computer program product comprising a computer program or instructions, characterized in that When the computer program or instruction is executed by a processor, the steps of the method according to any one of claims 1 to 8 are implemented.

Images