A communication data secure transmission system and method
Through particle swarm optimization algorithm and encryption strategy evaluation function, the encryption strategy is dynamically adjusted and packet transmission is split, which solves the shortcomings of traditional communication data transmission methods in network attacks and environmental adaptability, and realizes efficient and secure communication data transmission.
Patent Information
- Application Number
- CN202410686256.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-05-30
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2044-05-30
Smart Images

Figure CN118487834B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of communication data transmission, and in particular to a communication data secure transmission system and method. Background Art
[0002] With the rapid development of information technology, the secure transmission of communication data has become increasingly important. In many application scenarios such as electric energy metering systems, identity authentication, and transaction interfaces, it is crucial to ensure the security, integrity, and authenticity of data transmission. However, traditional communication data transmission methods may face the risk of network attacks such as interception, tampering, or replay.
[0003] For example, traditional encryption methods may rely on fixed encryption algorithms and keys, which makes them vulnerable to targeted attacks. In addition, these methods may not be flexible enough to adapt to different communication environments and security requirements. Summary of the invention
[0004] The technical problem to be solved by the present invention is to overcome the deficiencies of the prior art and provide a communication data secure transmission system and method, which has high flexibility and adaptability and can be dynamically adjusted and optimized according to different communication environments and security requirements.
[0005] In order to solve the above technical problems, the basic concept of the technical solution adopted by the present invention is:
[0006] In a first aspect, a method for securely transmitting communication data comprises:
[0007] Set the size of the particle swarm and initialize the parameters representing the encryption strategy for each particle;
[0008] Define the evaluation function of the encryption strategy. According to the initialized particle swarm, search for the final encryption strategy in the strategy space. The position of each particle represents an encryption strategy. Each strategy is evaluated by the evaluation function to find the final encryption strategy.
[0009] Encrypting the communication data according to the final encryption strategy to obtain encrypted data;
[0010] Splitting the encrypted data to obtain multiple data packets;
[0011] Send data packets to each communication node through the network.
[0012] Further, the communication data is encrypted according to the final encryption strategy to obtain encrypted data, including:
[0013] According to the final encryption strategy, extract specific encryption parameters;
[0014] Configure the encryption environment according to specific encryption parameters, and use the specific encryption parameters to initialize the encryption library;
[0015] The communication data to be encrypted is input into the initialized encryption library, the encryption operation is performed, and the data is converted into ciphertext form to obtain the encrypted data.
[0016] Further, the encrypted data is split to obtain multiple data packets, including:
[0017] Determine clustering features and pre-process the encrypted data to extract each data packet and its corresponding feature value;
[0018] Determine the number of clusters k, and randomly determine k data packets as initial cluster centers;
[0019] For each data packet, calculate the distance between the data packet and each cluster center, and assign the distance to the corresponding cluster center;
[0020] For each cluster, calculate the average value of all data points in the cluster and set the average value as the new cluster center. Repeat the steps until the preset number of iterations is reached to obtain the clustering result.
[0021] According to the clustering results, the encrypted data is split into k data packet groups.
[0022] Furthermore, clustering features include the size of the data packet and the complexity of the encrypted data.
[0023] Further, the data packet is sent to each communication node through the network, including:
[0024] Assign an urgency label to each data packet based on its nature;
[0025] According to the urgency label of the data packet, the data packet is divided into different parts and the priority is configured for the data packet;
[0026] The data packets are sent to each communication node according to the priority.
[0027] Furthermore, the properties of the data packet include the hierarchical structure, encapsulation characteristics and independence of the data packet.
[0028] In a second aspect, a communication data secure transmission system includes:
[0029] The acquisition module is used to set the size of the particle swarm and initialize the parameters representing the encryption strategy for each particle; define the evaluation function of the encryption strategy, search for the final encryption strategy in the strategy space according to the initialized particle swarm, the position of each particle represents an encryption strategy, and each strategy is evaluated by the evaluation function to find the final encryption strategy;
[0030] The processing module is used to encrypt the communication data according to the final encryption strategy to obtain encrypted data; split the encrypted data to obtain multiple data packets; and send the data packets to each communication node through the network.
[0031] According to a third aspect, a computing device includes:
[0032] one or more processors;
[0033] The storage device is used to store one or more programs. When the one or more programs are executed by the one or more processors, the one or more processors implement the method described.
[0034] In a fourth aspect, a computer-readable storage medium stores a program, and when the program is executed by a processor, the method described is implemented.
[0035] After adopting the above technical scheme, the present invention has the following beneficial effects compared with the prior art.
[0036] The encryption strategy obtained by searching through the particle swarm optimization algorithm is globally optimized. Compared with traditional methods, it provides a higher level of data encryption protection and effectively reduces the risk of illegal interception and decryption of data. The present invention can dynamically adjust the encryption strategy according to different communication environments and security requirements. The particle swarm optimization algorithm allows extensive search in the strategy space to find the encryption method that best suits the current situation. The encrypted data is split into multiple data packets for transmission. This approach can make full use of network resources and realize parallel transmission, thereby reducing the overall transmission time and improving transmission efficiency.
[0037] By splitting and transmitting data packets independently, even if some data packets are lost or damaged during transmission, it will not affect the integrity of other data packets; distributing data packets to different communication nodes can balance the network load, avoid single point failures, and improve the stability and fault tolerance of the entire communication system. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. Some specific embodiments of the present application will be described in detail in an illustrative and non-restrictive manner with reference to the drawings. The same reference numerals in the drawings indicate the same or similar components or parts. It should be understood by those skilled in the art that these drawings are not necessarily drawn to scale. In the drawings:
[0039] Figure 1It is a schematic diagram of the flow of the communication data secure transmission method of the present invention.
[0040] Figure 2 It is a schematic diagram of the communication data secure transmission system of the present invention. DETAILED DESCRIPTION
[0041] The following embodiment of the present application takes the communication data secure transmission method as an example to explain the scheme of the present application in detail, but this embodiment cannot limit the protection scope of the present application.
[0042] like Figure 1 As shown, the present invention provides a communication data secure transmission method, comprising:
[0043] Step 11, setting the size of the particle swarm and initializing the parameters representing the encryption strategy for each particle;
[0044] Step 12, define the evaluation function of the encryption strategy, search for the final encryption strategy in the strategy space according to the initialized particle swarm, the position of each particle represents an encryption strategy, and each strategy is evaluated by the evaluation function to find the final encryption strategy; the calculation formula of the encryption strategy evaluation function is:
[0045]
[0046] Among them, K L Indicates the key length in bits; S F Indicates the safety record factor, ranging from 0 to 1; T B Indicates the base time, E i and D i They represent the encryption time and decryption time of the i-th test, C j represents the CPU utilization measured at the jth time, M k represents the memory usage of the kth measurement; n, m and / represent the number of measurements of encryption time, CPU utilization and memory usage respectively, α and β are adjustment coefficients, i and k are index variables, and x represents the encryption strategy;
[0047] Step 13, encrypting the communication data according to the final encryption strategy to obtain encrypted data;
[0048] Step 14, splitting the encrypted data to obtain multiple data packets;
[0049] Step 15: Send the data packet to each communication node through the network.
[0050] In an embodiment of the present invention, the particle swarm optimization algorithm and the evaluation function can be used to select the encryption strategy that best suits the current communication environment and security requirements. This method comprehensively considers multiple factors such as key length, security recording factor, encryption and decryption time, CPU utilization, memory occupancy rate, etc., to ensure that the selected encryption strategy achieves the optimal balance between security, performance and resource consumption. The key length and security recording factor in the evaluation function ensure that the selected encryption strategy has sufficient security. Longer keys and higher security recording factors mean stronger encryption protection, thereby reducing the risk of data being illegally accessed or tampered with. By measuring and optimizing encryption and decryption time, CPU utilization rate and memory occupancy rate, this method can ensure that while ensuring security, system resources will not be over-consumed or system performance will not be reduced. The combination of particle swarm optimization algorithm and evaluation function enables this method to flexibly adapt to different communication environments and security requirements. In addition, by splitting and distributing encrypted data, this method also has good scalability. Splitting encrypted data into multiple data packets for network transmission can realize parallel processing of data, thereby improving overall transmission efficiency. This distributed transmission method can also effectively reduce the load pressure of a single communication node and improve the stability and response speed of the entire communication system.
[0051] When specifically applied, this includes:
[0052] Determine the number of particles in the particle swarm, which is set according to the complexity of the problem and the required search accuracy; each particle represents a possible solution to the encryption strategy, so a set of parameters needs to be initialized for each particle. These parameters can also include the selection of encryption algorithm, key length, number of encryption rounds, encryption mode, etc. These parameters can be initialized by random generation or selection within a predefined range. For example, an AES encryption algorithm, a randomly generated key length and number of encryption rounds can be randomly assigned to each particle. Define the evaluation function of the encryption strategy, search for the final encryption strategy in the strategy space based on the initialized particle swarm, and use the particle swarm optimization algorithm (PSO) to search for the optimal encryption strategy in the strategy space. The position of each particle represents a parameter combination of an encryption strategy. In each iteration, the particle swarm will be updated according to the current position and speed to find a better position (i.e., a better encryption strategy); use the defined evaluation function to evaluate each encryption strategy, and the evaluation function will give a specific value to quantify the advantages and disadvantages of the encryption strategy. According to the return value of the evaluation function, the particle swarm will adjust its own position and speed, gradually approaching the optimal solution; after multiple iterations, the particle swarm will converge to one or several optimal positions, and the encryption strategies corresponding to these positions are the optimal solutions searched. One of these optimal solutions is selected as the final encryption strategy for the subsequent communication data encryption process.
[0053] In summary, step 11 and step 12 mainly use the particle swarm optimization algorithm to search and find the optimal encryption strategy in the strategy space. This method can comprehensively consider multiple factors, such as security, performance, and resource consumption, so as to find an encryption strategy that is both secure and efficient.
[0054] In a preferred embodiment of the present invention, the above step 13 may include:
[0055] Step 131, extracting specific encryption parameters according to the final encryption strategy;
[0056] Step 132, configuring the encryption environment according to specific encryption parameters, and using the specific encryption parameters to initialize the encryption library;
[0057] Step 133, input the communication data to be encrypted into the initialized encryption library, perform encryption operation, convert the data into ciphertext form, and obtain encrypted data.
[0058] In the embodiment of the present invention, step 131, analyze the final encryption strategy found by the particle swarm optimization algorithm, which will contain multiple encryption-related parameters and settings; extract specific encryption parameters from the final encryption strategy, which may include encryption algorithm type (such as AES, etc.), key length, encryption mode (such as CBC, etc.), initialization vector (IV), etc.; confirm whether the extracted encryption parameters are valid and meet security standards to ensure the correctness and security of the subsequent encryption process. Step 132, configure the corresponding encryption environment according to the extracted encryption parameters, which may include setting the working mode of the encryption library, selecting an appropriate encryption algorithm library (such as OpenSSL, etc.); use the extracted specific encryption parameters to initialize the selected encryption library. Step 133, prepare the communication data to be encrypted, ensure the integrity and correctness of the data, input the communication data to be encrypted into the already initialized encryption library, call the relevant functions of the encryption library to perform the encryption operation, the encryption library will convert the input plaintext data into ciphertext form to ensure the confidentiality of the data, and after the encryption is completed, obtain the encrypted data from the encryption library, which can now be safely transmitted or stored on the network.
[0059] In the embodiment of the present invention, the encryption strategy found by the particle swarm optimization algorithm ensures the optimization of encryption parameters, thereby improving the security of communication data. Using these parameters for encryption can more effectively prevent data from being illegally intercepted and decrypted. Since the encryption parameters are obtained through algorithm optimization according to specific needs and environments, this method has high flexibility and customizability. By optimizing encryption parameters and configuration, the encryption process can be carried out more efficiently, which can not only reduce the time required for encryption and decryption, but also reduce the consumption of system resources and improve overall performance.
[0060] In a preferred embodiment of the present invention, the above step 14 may include:
[0061] Step 141, determining clustering features, and preprocessing the encrypted data to extract each data packet and its corresponding feature value, the clustering features including the size of the data packet and the complexity of the encrypted data;
[0062] Step 142, determining the number of clusters k, and randomly determining k data packets as initial cluster centers;
[0063] Step 143, for each data packet, calculate the distance between the data packet and each cluster center, and assign the distance to the corresponding cluster center;
[0064] Step 144, for each cluster, calculate the average value of all data points in the cluster, and set the average value as the new cluster center, and repeat the steps until a preset number of iterations is reached to obtain a clustering result;
[0065] Step 145: split the encrypted data into k data packet groups according to the clustering result.
[0066] In the embodiment of the present invention, step 141 determines the features used for clustering, which mainly include the size of the data packet and the complexity of the encrypted data. The size of the data packet can be directly obtained, and the data complexity is measured by the entropy value; the encrypted data is cleaned to ensure the quality of the data, and each data packet and its corresponding feature value, i.e., the size of the data packet and the encryption complexity index, are extracted from the preprocessed data. The entropy value calculation formula is:
[0067] Among them, P(x i ) is the number of different bytes x in the byte stream. i The probability of occurrence, n is the number of different bytes, and P(x i). Step 142, based on the results of data analysis, determine the number k of categories into which the data packets are to be clustered, and randomly select k data packets from the data set as initial cluster centers. Step 143, for each data packet in the data set, calculate its distance from each cluster center. This distance can be calculated based on the Euclidean distance in the feature space. Each data packet is assigned to the cluster center with the closest Euclidean distance to form a preliminary clustering result. Step 144, for each cluster, calculate the average value of all data points in the feature space, set the average value of each cluster as the new cluster center, and repeat steps 143 and 144 until the preset number of iterations is reached to ensure the stability of the clustering. Step 145, based on the final clustering results, split the data set into k data packet groups, each group contains a cluster center and the data packets around it, and verify the split data packet groups to ensure that they meet the expected clustering effect. If necessary, they can be fine-tuned.
[0068] In the embodiment of the present invention, by clustering the data packets, data packets of similar size and data complexity can be grouped together, which helps to optimize the management and scheduling of data packets during network transmission, thereby improving transmission efficiency. The clustered data packet groups can be more easily processed and decrypted in batches at the receiving end, reducing the complexity and time cost of processing. By clustering and splitting data packets, it is possible to increase the difficulty for illegal interceptors to analyze and decrypt data.
[0069] In a preferred embodiment of the present invention, the above step 15 may include:
[0070] Step 151, assigning an urgency label to each data packet according to the nature of the data packet;
[0071] Step 152, dividing the data packet into different parts according to the urgency tag of the data packet, and configuring the priority for the data packet;
[0072] Step 153, sending the data packet to each communication node according to the priority; the properties of the data packet include the hierarchical structure, encapsulation characteristics and independence of the data packet.
[0073] In an embodiment of the present invention, step 151 analyzes the properties of each data packet, including examining the hierarchical structure of the data packet (such as whether it has different importance in the transport layer, network layer, etc.), encapsulation characteristics (such as whether the data packet contains critical information or just ordinary data), and independence (whether the data packet can be transmitted alone without affecting other data packets); according to the different properties of the data packets, define a set of urgency label systems. For example, three levels of "high", "medium" and "low" can be set, or a more detailed level system can be used. Based on the results of the data packet property analysis, a corresponding urgency label is assigned to each data packet. For example, a data packet containing critical control information may be marked as "high" urgency.
[0074] Step 152, if the data packet is large, it can be divided into smaller parts as needed for more flexible processing. According to the urgency tag of the data packet, a corresponding priority is configured for each data packet or part of the data packet, and a data packet with a high urgency will be given a higher priority.
[0075] Step 153, at the transmitting end, the data packets are placed into different transmission queues according to their priorities. High priority data packets will enter the priority transmission queue, and the network scheduler will schedule the transmission of data packets according to the priority of the queue. High priority data packets will be sent first to ensure that critical data can reach the destination node in time. Data packets are transmitted to each communication node through the network according to the configured priority. During the transmission process, network devices and nodes may perform different processing based on the priority of the data packets, such as forwarding high priority data packets first.
[0076] In the embodiment of the present invention, by assigning urgency labels and priorities to data packets, it is possible to ensure that key data is transmitted first in the network, reduce transmission delays, and improve the response speed and efficiency of the overall communication system. Allocating network resources according to the urgency and priority of data packets can more effectively utilize limited network bandwidth and processing capabilities, avoid network congestion and waste of resources. Prioritized transmission of key data helps reduce the risk of loss of important information, thereby improving the reliability and stability of the communication system.
[0077] Figure 2 As shown, an embodiment of the present invention further provides a communication data secure transmission system, comprising:
[0078] The acquisition module is used to set the size of the particle swarm and initialize the parameters representing the encryption strategy for each particle; define the evaluation function of the encryption strategy, search for the final encryption strategy in the strategy space according to the initialized particle swarm, the position of each particle represents an encryption strategy, and each strategy is evaluated by the evaluation function to find the final encryption strategy;
[0079] The processing module is used to encrypt the communication data according to the final encryption strategy to obtain encrypted data; split the encrypted data to obtain multiple data packets; and send the data packets to each communication node through the network.
[0080] It should be noted that the system is a system corresponding to the above method, and all implementation methods in the above method embodiment are applicable to this embodiment and can achieve the same technical effect.
[0081] The embodiment of the present invention further provides a computing device, comprising: a processor, a memory storing a computer program, wherein when the computer program is executed by the processor, the method described above is executed. All implementations in the above method embodiment are applicable to this embodiment and can achieve the same technical effect.
[0082] The embodiment of the present invention also provides a computer-readable storage medium storing instructions, which, when executed on a computer, enable the computer to execute the method described above. All implementations in the above method embodiment are applicable to this embodiment and can achieve the same technical effect.
[0083] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.
[0084] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0085] In the embodiments provided by the present invention, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.
[0086] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0087] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
[0088] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, ROM, RAM, magnetic disks, or optical disks.
[0089] In addition, it should be noted that in the apparatus and method of the present invention, it is obvious that each component or each step can be decomposed and / or recombined. These decompositions and / or recombinations should be regarded as equivalent schemes of the present invention. Moreover, the steps of performing the above-mentioned series of processing can naturally be performed in chronological order according to the order of description, but it is not necessary to perform them in chronological order, and some steps can be performed in parallel or independently of each other. For those of ordinary skill in the art, it is understood that all or any steps or components of the method and apparatus of the present invention can be implemented in any computing device (including processors, storage media, etc.) or a network of computing devices in hardware, firmware, software or a combination thereof, which can be achieved by those of ordinary skill in the art using basic programming skills after reading the description of the present invention.
[0090] Therefore, the purpose of the present invention can also be achieved by running a program or a group of programs on any computing device. The computing device can be a well-known general device. Therefore, the purpose of the present invention can also be achieved by simply providing a program product containing a program code that implements the method or device. That is to say, such a program product also constitutes the present invention, and the storage medium storing such a program product also constitutes the present invention. Obviously, the storage medium can be any well-known storage medium or any storage medium developed in the future. It should also be pointed out that in the device and method of the present invention, it is obvious that each component or each step can be decomposed and / or recombined. These decompositions and / or recombinations should be regarded as equivalent schemes of the present invention. In addition, the steps of performing the above-mentioned series of processing can naturally be performed in chronological order according to the order of description, but it is not necessary to perform them in chronological order. Some steps can be performed in parallel or independently of each other.
[0091] The above is a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
[0092] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit it. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or replace some or all of the technical features therein with equivalents. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present application.
Claims
1. A communication data secure transmission method, characterized in that: include: Set the size of the particle swarm and initialize the parameters representing the encryption strategy for each particle; Define the evaluation function of the encryption strategy. According to the initialized particle swarm, search for the final encryption strategy in the strategy space. The position of each particle represents an encryption strategy. Each strategy is evaluated by the particle swarm optimization algorithm and the evaluation function to find the final encryption strategy. The calculation formula of the evaluation function is: in, Indicates the key length in bits; Indicates the safety record factor, ranging from 0 to 1; Indicates the base time, and They represent the encryption time and decryption time of the i-th test respectively. represents the CPU utilization measured at the jth time, represents the memory usage of the kth measurement; n, m and Respectively represent the number of measurements of encryption time, CPU utilization and memory usage, and is the adjustment coefficient, i and k are index variables, x Indicates encryption strategy; Encrypting the communication data according to the final encryption strategy to obtain encrypted data; Splitting the encrypted data to obtain multiple data packets; Send data packets to each communication node through the network.
2. The communication data secure transmission method according to claim 1, characterized in that: The communication data is encrypted according to the final encryption strategy to obtain encrypted data, including: According to the final encryption strategy, extract specific encryption parameters; Configure the encryption environment according to specific encryption parameters, and use the specific encryption parameters to initialize the encryption library; The communication data to be encrypted is input into the initialized encryption library, the encryption operation is performed, and the data is converted into ciphertext form to obtain the encrypted data.
3. The communication data secure transmission method according to claim 2, characterized in that: The encrypted data is split to obtain multiple data packets, including: Determine clustering features and pre-process the encrypted data to extract each data packet and its corresponding feature value; Determine the number of clusters k, and randomly determine k data packets as initial cluster centers; For each data packet, calculate the distance between the data packet and each cluster center, and assign the distance to the corresponding cluster center; For each cluster, calculate the average value of all data points in the cluster and set the average value as the new cluster center. Repeat the steps until the preset number of iterations is reached to obtain the clustering result. According to the clustering results, the encrypted data is split into k data packet groups.
4. The communication data secure transmission method according to claim 3, characterized in that: Clustering features include the size of the data packets and the complexity of the encrypted data.
5. The communication data secure transmission method according to claim 4, characterized in that: Send data packets through the network to each communication node, including: Assign an urgency label to each data packet based on its nature; According to the urgency label of the data packet, the data packet is divided into different parts and the priority is configured for the data packet; The data packets are sent to each communication node according to the priority.
6. The communication data secure transmission method according to claim 5, characterized in that: The properties of the data packet include the hierarchical structure, encapsulation characteristics and independence of the data packet.
7. A communication data secure transmission system, the system is based on the method of claims 1-6, characterized in that: include: The acquisition module is used to set the size of the particle swarm and initialize the parameters representing the encryption strategy for each particle; define the evaluation function of the encryption strategy, search for the final encryption strategy in the strategy space according to the initialized particle swarm, the position of each particle represents an encryption strategy, and each strategy is evaluated by the evaluation function to find the final encryption strategy; The processing module is used to encrypt the communication data according to the final encryption strategy to obtain encrypted data; split the encrypted data to obtain multiple data packets; and send the data packets to each communication node through the network.
8. A computing device, characterized in that include: one or more processors; A storage device, used for storing one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 6.
9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a program, which, when executed by a processor, implements the method according to any one of claims 1 to 6.
