A data security communication method of a 6G terahertz communication system

Abstract

The application discloses a data security communication method of a 6G terahertz communication system, and relates to the technical field of data processing, wherein a key generation strategy combining continuous randomization and multi-dimensional target optimization is used to generate all round keys of a symmetric encryption algorithm, so that each round key generated is kept to have maximum difference with previous keys in mathematical characteristics, linear correlation between the keys is reduced, the ability to resist differential analysis and linear analysis is enhanced, all round keys of the symmetric encryption algorithm are combined to form a total key, and fragmentation processing is performed on the total key; the fragmented key obtained through the fragmentation processing is encrypted and transmitted by using the public key of a receiver in the 6G terahertz communication system; even if part of the fragments are intercepted in the transmission process, an attacker cannot restore the complete key; and the total key can be obtained only after a sufficient number of fragments are collected and decrypted by combining the private key, so that the security of key distribution is improved, and the method is suitable for the complex environment of 6G terahertz communication.

Description

Technical Field

[0001] This application relates to the field of data processing technology, specifically to a data security communication method for a 6G terahertz communication system. Background Technology

[0002] With the rapid development of communication technology, the sixth-generation (6G) mobile communication system will focus on realizing communication applications in the terahertz (THz) band. Terahertz communication has extremely high spectrum bandwidth, enabling ultra-high-speed data transmission and meeting the needs of future massive device connections and ultra-large-capacity services. However, the high-frequency characteristics of terahertz communication also make its signal wavelength short and its coverage area small, making it highly susceptible to security threats such as interception and interference. In addition, the service scenarios of the 6G era pose a dual challenge to the real-time performance and security of data transmission. Traditional encryption algorithms often struggle to balance key generation efficiency and anti-attack capabilities. Currently, the security of commonly used symmetric encryption algorithms (such as AES (Advanced Encryption Standard) and DES (Data Encryption Standard)) highly depends on the randomness and diversity of round keys. If there is a strong linear correlation between round keys, or if the key generation process is easily predictable, attackers may be able to crack the keys through differential analysis or linear analysis, leading to data leakage. At the same time, traditional key distribution methods usually transmit keys directly, posing a risk of centralized key theft. Summary of the Invention

[0003] The purpose of this application is to provide a secure data communication method for a 6G terahertz communication system, solving the problem of low encryption security and easy data leakage in existing technologies. This application generates highly secure round keys through a strategy combining continuous randomization and multi-dimensional objective optimization, and combines fragmented transmission technology to effectively improve the anti-attack capability and security of data transmission in the 6G communication system.

[0004] This application is achieved through the following technical solution:

[0005] A data security communication method for a 6G terahertz communication system includes:

[0006] For the data to be transmitted by the sender in a 6G terahertz communication system, a first-round key corresponding to a symmetric encryption algorithm is randomly generated for the data to be transmitted;

[0007] Based on the first round key, a key generation strategy combining continuous randomization and multidimensional objective optimization is used to generate all round keys of the symmetric encryption algorithm;

[0008] Based on all the round keys of the symmetric encryption algorithm, the data to be sent is encrypted to obtain the encrypted data to be sent.

[0009] The master key is composed of all the round keys of the symmetric encryption algorithm, and the master key is then fragmented to obtain the fragmented key.

[0010] The fragmented key is encrypted and transmitted using the receiver's public key in a 6G terahertz communication system, and the encrypted data to be sent is transmitted to the receiver simultaneously, thus completing secure data communication.

[0011] In one possible implementation, based on the first round key, a key generation strategy combining continuous randomization and multidimensional objective optimization is used to generate all round keys of the symmetric encryption algorithm, including:

[0012] A continuous optimized solution space is determined based on the key length corresponding to the symmetric encryption algorithm, and all obtained round keys are initialized as the first round key;

[0013] Multiple candidate keys are randomly generated within the optimized solution space;

[0014] Based on all the round keys obtained, a multi-dimensional objective solution strategy is used to obtain the dissimilarity score corresponding to each candidate key;

[0015] Based on the dissimilarity scores corresponding to the candidate keys, the first target key is determined from all candidate keys;

[0016] Based on the first target key, the candidate key is randomized by sequentially employing a least squares random search strategy, an adaptive pulse transition search strategy, and a spiral fast solution strategy to determine the candidate key after randomization.

[0017] Determine whether the total number of randomizations of the candidate keys corresponding to the current round key is greater than or equal to the preset maximum number of randomizations. If so, determine the current round key based on the candidate keys after randomization. Otherwise, based on the candidate keys after randomization, return to the step of obtaining the dissimilarity score and proceed to the next candidate key processing process.

[0018] Determine if the total number of all obtained round keys is equal to the total number of rounds required by the symmetric encryption algorithm. If so, complete the generation of all round keys for the symmetric encryption algorithm; otherwise, return to the step of generating candidate keys and proceed to the next round of key generation.

[0019] In one possible implementation, determining a continuous optimized solution space based on the key length corresponding to the symmetric encryption algorithm includes:

[0020] Based on the key length required for each round of the symmetric encryption algorithm, the range of values ​​for binary data converted to decimal data under that key length is determined, thus obtaining a continuous optimized solution space.

[0021] In one possible implementation, based on all the acquired round keys, a multi-dimensional objective solution strategy is used to obtain the dissimilarity score corresponding to each candidate key, including:

[0022] Determine the total number of all acquired round keys to obtain the target round number;

[0023] For any candidate key, based on the target round number, the candidate key is dimensionally expanded to obtain the dimensionally expanded candidate key;

[0024] Obtain the degree of difference between all the acquired round keys and the candidate keys after dimensional expansion, and obtain the dissimilarity score corresponding to the candidate key.

[0025] In one possible implementation, determining a first target key based on the dissimilarity score corresponding to the candidate key among all candidate keys includes: determining the candidate key with the largest dissimilarity score among all candidate keys as the first target key.

[0026] In one possible implementation, based on the first target key, the candidate key is randomized sequentially using a least-squares random search strategy, an adaptive pulse transition search strategy, and a spiral fast solution strategy to determine the randomized candidate key, including:

[0027] Based on the first target key, the candidate key is first randomly updated using a least squares random search strategy to obtain the candidate key after the first random update;

[0028] An adaptive pulse transition search strategy is used to perform a second random update on the candidate key after the first random update, resulting in a candidate key after the second random update.

[0029] A spiral fast solution strategy is used to perform a third random update on the candidate key after the second random update, resulting in a candidate key after the third random update.

[0030] The candidate key after the third random update is used as the candidate key after randomization.

[0031] In one possible implementation, based on the first target key, the candidate key is randomly updated using a least-squares random search strategy to obtain the candidate key after the first random update, including:

[0032] For any candidate key, three different other candidate keys are randomly matched to it to obtain the first random key, the second random key and the third random key corresponding to the candidate key;

[0033] Based on the first random key, the second random key, and the third random key, the first least squares parameter and the second least squares parameter are obtained as follows:

[0034] ;

[0035] ;

[0036] ;

[0037] in, This represents the first least squares parameter corresponding to the m-th first random key. Let m represent the second least squares parameter corresponding to the m-th first random key, where m = 1, 2, ..., M, and M represents the total number of candidate keys randomly generated in the optimized solution space during each round of key acquisition. Indicates the first random key. This represents the second random key. Indicates the third random key. Indicates the first position coefficient. Indicates the second position coefficient. Indicates the third position coefficient. This represents the coefficient at position i, where i = 1, 2, 3; This represents the dissimilarity score of the i-th random key. The score represents the dissimilarity of the first target key. This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents a constant term and is set to 0.01.

[0038] Based on the first target key, the first least squares parameter, and the second least squares parameter, the candidate key is randomly updated first to obtain the candidate key after the first random update:

[0039] ;

[0040] in, This represents the m-th candidate key. Let m represent the m-th candidate key after the first random update. Indicates the first target key. Represents the natural constant.

[0041] In one possible implementation, an adaptive pulse transition search strategy is used to perform a second random update on the candidate key after the first random update, resulting in a candidate key after the second random update, including:

[0042] After the first random update, the candidate keys are randomly paired in pairs to obtain multiple pairs of paired keys;

[0043] For any pair of paired keys, the adaptive pulse transition velocity is obtained as follows:

[0044] ;

[0045] ;

[0046] ;

[0047] in, Indicates the adaptive pulse transition velocity. This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents an exponential function with base e. Represents a random number between (0, 1). This represents the initial value of the adaptive pulse transition velocity. The parameter representing the influence between the first and second paired keys. This indicates the dissimilarity score of the second paired key. Indicates the first pairing key. Indicates the second pairing key. express and The Euclidean distance between them Represents a constant term;

[0048] Based on the adaptive pulse transition speed, the first pairing key and the second pairing key are updated as follows:

[0049] ;

[0050] ;

[0051] in, This indicates the first pairing key after the update. This indicates the updated second pairing key. Indicates the dissimilarity score of the first paired key;

[0052] The updated first pairing key and the updated second pairing key are used together as candidate keys after the second random update.

[0053] In one possible implementation, a spiral fast solution strategy is used to perform a third random update on the candidate key after the second random update, resulting in a candidate key after the third random update, including:

[0054] ;

[0055] in, Let represent the candidate key after the nth second random update. Let represent the candidate key after the nth third random update, and b represent the spiral shape factor. ; This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents an exponential function with base e. Represents a random spiral direction factor between (0,1). This represents the first target key.

[0056] In one possible implementation, all round keys of the symmetric encryption algorithm are combined to form a master key, and the master key is fragmented to obtain a fragmented key, including:

[0057] Concatenate all round keys of the symmetric encryption algorithm into a single string in chronological order, and convert it to decimal to obtain the master key;

[0058] The master key is fragmented using a threshold secret sharing algorithm to obtain a fragmented key.

[0059] Compared with the prior art, this application has the following advantages and beneficial effects:

[0060] This application provides a data security communication method for a 6G terahertz communication system. It generates all round keys for a symmetric encryption algorithm using a key generation strategy combining continuous randomization and multi-dimensional objective optimization. This ensures that each generated round key maintains maximum mathematical difference from previous keys, reducing linear correlation between keys and enhancing resistance to differential and linear analysis. All round keys of the symmetric encryption algorithm are combined to form a master key, which is then fragmented. The fragmented key is encrypted and transmitted using the receiver's public key in the 6G terahertz communication system. Even if some fragments are intercepted during transmission, attackers cannot reconstruct the complete key. Only after collecting a sufficient number of fragments and decrypting them with the private key can the master key be obtained, thus improving the security of key distribution. This method is suitable for the complex environment of 6G terahertz communication. Attached Figure Description

[0061] To more clearly illustrate the technical solutions of the exemplary embodiments of this application, the accompanying drawings used in the embodiments will be briefly described below. It should be understood that the following drawings only show some embodiments of this application and should not be considered as a limitation of the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort. In the drawings:

[0062] Figure 1 A flowchart illustrating a data security communication method for a 6G terahertz communication system provided in this application embodiment; Detailed Implementation

[0063] To make the objectives, technical solutions, and advantages of this application clearer, the following detailed description is provided in conjunction with the embodiments and accompanying drawings. The illustrative embodiments and descriptions of this application are only for explaining this application and are not intended to limit this application.

[0064] like Figure 1 As shown in the figure, this application provides a data security communication method for a 6G terahertz communication system, including:

[0065] S101. For the data to be transmitted by the sender in the 6G terahertz communication system, randomly generate the first round key corresponding to the symmetric encryption algorithm for the data to be transmitted.

[0066] For example, the symmetric encryption algorithm can be set to AES (Advanced Encryption Standard). The key length of the AES algorithm is typically 128 bits, 192 bits, or 256 bits. The number of encryption rounds varies depending on the key length: a 128-bit key corresponds to 10 rounds, a 192-bit key to 12 rounds, and a 256-bit key to 14 rounds. Therefore, multiple rounds of keys need to be generated to support the operation of the AES algorithm. To generate subsequent rounds of keys, the original key generation method of the AES algorithm can be used to generate the first round of keys.

[0067] S102. Based on the first round key, generate all round keys of the symmetric encryption algorithm using a key generation strategy that combines continuous randomization and multidimensional objective optimization.

[0068] S103. Based on all the round keys of the symmetric encryption algorithm, the data to be sent is encrypted to obtain the encrypted data to be sent.

[0069] In the key generation process of the existing AES algorithm, the keys in multiple rounds often have a certain correlation, making the data encrypted by the AES algorithm vulnerable to cracking. This reduces the security of 6G terahertz communication and fails to meet the security requirements of 6G terahertz communication. Although asymmetric encryption algorithms can effectively improve data security, they are slow for encrypting large amounts of data, making it difficult to meet the timeliness requirements of 6G terahertz communication. Therefore, this application adopts a key generation strategy that combines continuous randomization and multi-dimensional objective optimization to generate all round keys of the symmetric encryption algorithm. Based on all round keys of the symmetric encryption algorithm, the data to be transmitted is encrypted, improving data security while ensuring the encryption speed requirement for large amounts of data, thus meeting the timeliness requirements of 6G terahertz communication.

[0070] S104. Combine all round keys of the symmetric encryption algorithm into a master key, and then fragment the master key to obtain a fragmented key.

[0071] In one possible implementation, the total key is composed of all round keys of the symmetric encryption algorithm, and the total key is fragmented to obtain a fragmented key. This includes: concatenating all round keys of the symmetric encryption algorithm into a string in chronological order and converting it to decimal to obtain the total key; and using a threshold secret sharing algorithm to fragment the total key to obtain the fragmented key.

[0072] A threshold secret sharing algorithm is used to fragment the master key and combine it with the recipient's public key for encrypted transmission. Even if some fragments are intercepted during transmission, attackers cannot recover the complete key. Only after collecting a sufficient number of fragments and decrypting them with the private key can the master key be obtained, thereby improving the security of key distribution and making it suitable for the complex environment of 6G terahertz communication.

[0073] S105. The fragmented key is encrypted and transmitted using the public key of the receiver in the 6G terahertz communication system, and the encrypted data to be sent is transmitted to the receiver at the same time, thus completing secure data communication.

[0074] Once the receiver obtains the fragmented key, it can use the threshold secret sharing algorithm to recover the master key. After converting the master key to the AES algorithm's corresponding base, it can be split according to the single-round key length of the AES algorithm to decode and obtain the multi-round key of the AES algorithm, thereby enabling the decryption of the encrypted data to be sent.

[0075] This application's embodiments construct a continuous optimized solution space and utilize a multi-dimensional objective solution strategy to calculate the dissimilarity score between candidate keys and existing keys, ensuring that each generated key maintains maximum mathematical difference from previous keys. This mechanism effectively reduces linear correlation between keys and enhances resistance to differential and linear analysis. Addressing the high security and low latency requirements of terahertz communication, the algorithm in this application's embodiments, while ensuring high strength, reduces unnecessary iteration costs through a continuous solution space and optimization strategy, effectively meeting the stringent requirements of 6G communication systems for secure data transmission.

[0076] In one possible implementation, based on the first round key, a key generation strategy combining continuous randomization and multidimensional objective optimization is used to generate all round keys of the symmetric encryption algorithm, including:

[0077] S102.1 Determine a continuous optimized solution space based on the key length corresponding to the symmetric encryption algorithm, and initialize all the obtained round keys as the first round key;

[0078] Optionally, in addition to the first round key, the second round key can also be randomly generated to avoid the problem of fixed convergence extrema caused by a single-dimensional solution space, thus expanding the single solution problem into a multi-dimensional solution problem and ensuring key randomness.

[0079] S102.2, Randomly generate multiple candidate keys within the optimized solution space;

[0080] S102.3. Based on all the round keys obtained, use a multi-dimensional objective solution strategy to obtain the dissimilarity score corresponding to each candidate key;

[0081] S102.4. Based on the dissimilarity scores corresponding to the candidate keys, determine the first target key from all candidate keys;

[0082] S102.5. Based on the first target key, the candidate key is randomized by sequentially employing the least squares random search strategy, the adaptive pulse transition search strategy, and the spiral fast solution strategy to determine the candidate key after randomization.

[0083] S102.6 Determine whether the total number of randomizations of the candidate keys corresponding to the current round key is greater than or equal to the preset maximum number of randomizations. If so, determine the current round key based on the candidate keys after randomization. Otherwise, based on the candidate keys after randomization, return to the step of obtaining the dissimilarity score (i.e., return to step S102.3) and enter the next candidate key processing process.

[0084] Setting the maximum number of randomizations to a small value allows the algorithm to converge to different local maxima or values ​​close to local maxima, thus ensuring the randomness of the generated keys and avoiding the problem of identical extrema caused by initially solving a single problem. For example, if setting the maximum number of randomizations to 100 satisfies the requirement of obtaining the global optimum, then setting the maximum number of randomizations to between 30 and 50 allows the algorithm to converge to a non-global optimum, while still effectively increasing the dissimilarity score and ensuring the difference and randomness between keys in all rounds.

[0085] S102.7 Determine whether the total number of all obtained round keys is equal to the total number of rounds required by the symmetric encryption algorithm. If yes, complete the generation of all round keys for the symmetric encryption algorithm. Otherwise, return to the step of generating candidate keys (i.e., return to step S102.2) and proceed to the next round of key generation process.

[0086] The key generation process provided in this application integrates three strategies: least squares random search, adaptive pulse transition search, and spiral fast solution. The least squares strategy utilizes population information for initial guidance, the adaptive pulse transition strategy avoids getting trapped in local optima by introducing speed and influence parameters, and the spiral fast solution strategy accelerates convergence in the later stages. This multi-stage collaborative search strategy ensures that the generated round keys have extremely high unpredictability and entropy.

[0087] In one possible implementation, determining a continuous optimized solution space based on the key length corresponding to the symmetric encryption algorithm includes:

[0088] Based on the key length required for each round of the symmetric encryption algorithm, the range of values ​​for binary data converted to decimal data under that key length is determined, thus obtaining a continuous optimized solution space.

[0089] For example, a continuous optimized solution space can be determined based on the key length of the symmetric encryption algorithm (e.g., 128 bits), mapping the numerical range of 128-bit binary data to a continuous decimal numerical space, and the decimal numerical space will serve as the optimized solution space.

[0090] In one possible implementation, based on all the acquired round keys, a multi-dimensional objective solution strategy is used to obtain the dissimilarity score corresponding to each candidate key, including:

[0091] Determine the total number of all acquired round keys to obtain the target round number.

[0092] For any candidate key, based on the target round number, the candidate key is dimension-expanded to obtain the dimension-expanded candidate key.

[0093] For example, if the target number of rounds is 5, it means that 5 rounds of keys have been obtained. Then, the candidate keys can be expanded into a 5-dimensional vector, where each element of the vector is a candidate key, thus obtaining the candidate keys after dimensional expansion.

[0094] Obtain the degree of difference between all the acquired round keys and the candidate keys after dimensional expansion, and obtain the dissimilarity score corresponding to the candidate key.

[0095] All the acquired round keys can be combined into a vector to obtain a reference vector. The cosine similarity or Euclidean distance between the reference vector and the candidate keys after dimensional expansion can be obtained to obtain the dissimilarity score corresponding to the candidate keys.

[0096] A multi-dimensional objective solution strategy is used to calculate the dissimilarity score between candidate keys and existing keys, ensuring that each generated round key maintains maximum mathematical difference from previous keys. This mechanism prevents attackers from deriving other round keys using known round keys, thus greatly increasing the difficulty of differential and linear analysis attacks and significantly improving the confusion and diffusion properties of the encryption algorithm.

[0097] In one possible implementation, determining a first target key based on the dissimilarity score corresponding to the candidate key among all candidate keys includes: determining the candidate key with the largest dissimilarity score among all candidate keys as the first target key.

[0098] In one possible implementation, based on the first target key, the candidate key is randomized sequentially using a least-squares random search strategy, an adaptive pulse transition search strategy, and a spiral fast solution strategy to determine the randomized candidate key, including:

[0099] Based on the first target key, the candidate key is first randomly updated using a least squares random search strategy to obtain the candidate key after the first random update;

[0100] An adaptive pulse transition search strategy is used to perform a second random update on the candidate key after the first random update, resulting in a candidate key after the second random update.

[0101] A spiral fast solution strategy is used to perform a third random update on the candidate key after the second random update, resulting in a candidate key after the third random update.

[0102] The candidate key after the third random update is used as the candidate key after randomization.

[0103] In one possible implementation, based on the first target key, the candidate key is randomly updated using a least-squares random search strategy to obtain the candidate key after the first random update, including:

[0104] For any candidate key, three different other candidate keys are randomly matched to it to obtain the first random key, the second random key and the third random key corresponding to the candidate key;

[0105] Based on the first random key, the second random key, and the third random key, the first least squares parameter and the second least squares parameter are obtained as follows:

[0106] ;

[0107] ;

[0108] ;

[0109] in, This represents the first least squares parameter corresponding to the m-th first random key. Let m represent the second least squares parameter corresponding to the m-th first random key, where m = 1, 2, ..., M, and M represents the total number of candidate keys randomly generated in the optimized solution space during each round of key acquisition. Indicates the first random key. This represents the second random key. Indicates the third random key. Indicates the first position coefficient. Indicates the second position coefficient. Indicates the third position coefficient. This represents the coefficient at position i, where i = 1, 2, 3; This represents the dissimilarity score of the i-th random key. The score represents the dissimilarity of the first target key. This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents a constant term and is set to 0.01.

[0110] Based on the first target key, the first least squares parameter, and the second least squares parameter, the candidate key is randomly updated first to obtain the candidate key after the first random update:

[0111] ;

[0112] in, This represents the m-th candidate key. Let m represent the m-th candidate key after the first random update. Indicates the first target key. Represents the natural constant.

[0113] The least squares random search strategy provided in this application combines the idea of ​​least squares to collect random information, which can enable candidate keys to quickly move towards regions with higher dissimilarity, avoid the inefficiency caused by blind random search, and speed up the generation of high-quality keys.

[0114] In one possible implementation, an adaptive pulse transition search strategy is used to perform a second random update on the candidate key after the first random update, resulting in a candidate key after the second random update, including:

[0115] After the first random update, the candidate keys are randomly paired in pairs to obtain multiple pairs of paired keys;

[0116] For any pair of paired keys, the adaptive pulse transition velocity is obtained as follows:

[0117] ;

[0118] ;

[0119] ;

[0120] in, Indicates the adaptive pulse transition velocity. This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents an exponential function with base e. Represents a random number between (0, 1). This represents the initial value of the adaptive pulse transition velocity. The parameter representing the influence between the first and second paired keys. This indicates the dissimilarity score of the second paired key. Indicates the first pairing key. Indicates the second pairing key. express and The Euclidean distance between them Represents a constant term;

[0121] Based on the adaptive pulse transition speed, the first pairing key and the second pairing key are updated as follows:

[0122] ;

[0123] ;

[0124] in, This indicates the first pairing key after the update. This indicates the updated second pairing key. Indicates the dissimilarity score of the first paired key;

[0125] The updated first pairing key and the updated second pairing key are used together as candidate keys after the second random update.

[0126] The adaptive pulse transition search strategy provided in this application simulates the neural pulse firing mechanism. By calculating the adaptive pulse transition velocity, it randomly perturbs the paired keys in both forward and reverse directions. The adaptive pulse transition velocity in the formula decays exponentially with iteration, while the perturbation amplitude is affected by the differences between candidate keys. When a candidate key gets trapped in a local peak with a low dissimilarity score, the pulse velocity provides a strong mutation force, forcibly pushing the candidate key out of that region. This nonlinear mutation gives the key generation process extremely strong anti-capture capability, ensuring that the candidate key population always maintains high diversity, thereby guaranteeing that the finally selected key has an extremely high entropy value.

[0127] In one possible implementation, a spiral fast solution strategy is used to perform a third random update on the candidate key after the second random update, resulting in a candidate key after the third random update, including:

[0128] ;

[0129] in, Let represent the candidate key after the nth second random update. Let represent the candidate key after the nth third random update, and b represent the spiral shape factor. ; This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents an exponential function with base e. Represents a random spiral direction factor between (0,1). This represents the first target key.

[0130] Compared to linear approximation, the spiral fast solution strategy provided in this application covers a wider surrounding area as it approaches the optimal solution, and the step size decreases exponentially with iteration. This means that the algorithm can precisely fine-tune near the optimal solution in the final stage, ensuring that the final generated round key is the point with the highest dissimilarity score in the current solution space, i.e., the mathematically global optimal solution, thus guaranteeing the dissimilarity between the generated round keys.

[0131] In addition, the maximum number of randomizations for a candidate key can be set to a random positive integer within a range (e.g., 50-500) to enhance randomness. Furthermore, limit-crossing processing can be performed on each candidate key iteration to ensure that the candidate key always remains within the valid range.

[0132] Those skilled in the art will understand that embodiments of the present invention can be provided as methods, systems, or computer program products. Therefore, the present invention can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code. The solutions in the embodiments of the present invention can be implemented using various computer languages, such as the object-oriented programming language Java and the interpreted scripting language JavaScript.

[0133] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0134] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0135] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0136] Although preferred embodiments of the invention have been described, those skilled in the art, upon learning the basic inventive concept, can make other changes and modifications to these embodiments. Therefore, the appended claims are intended to be interpreted as including both the preferred embodiments and all changes and modifications falling within the scope of the invention.

[0137] Obviously, those skilled in the art can make various modifications and variations to this invention without departing from its spirit and scope. Therefore, if these modifications and variations fall within the scope of the claims of this invention and their equivalents, this invention also intends to include these modifications and variations.

Claims

1. A data security communication method for a 6G terahertz communication system, characterized in that, include: For the data to be transmitted by the sender in a 6G terahertz communication system, a first-round key corresponding to a symmetric encryption algorithm is randomly generated for the data to be transmitted; Based on the first round key, a key generation strategy combining continuous randomization and multidimensional objective optimization is used to generate all round keys of the symmetric encryption algorithm; Based on all the round keys of the symmetric encryption algorithm, the data to be sent is encrypted to obtain the encrypted data to be sent. The master key is composed of all the round keys of the symmetric encryption algorithm, and the master key is then fragmented to obtain the fragmented key. The fragmented key is encrypted and transmitted using the public key of the receiver in a 6G terahertz communication system, and the encrypted data to be sent is transmitted to the receiver at the same time to complete secure data communication. Based on the first round key, a key generation strategy combining continuous randomization and multidimensional objective optimization is used to generate all round keys for the symmetric encryption algorithm, including: A continuous optimized solution space is determined based on the key length corresponding to the symmetric encryption algorithm, and all obtained round keys are initialized as the first round key; Multiple candidate keys are randomly generated within the optimized solution space; Based on all the round keys obtained, a multi-dimensional objective solution strategy is used to obtain the dissimilarity score corresponding to each candidate key; Based on the dissimilarity scores corresponding to the candidate keys, the first target key is determined from all candidate keys; Based on the first target key, the candidate key is randomized by sequentially employing a least squares random search strategy, an adaptive pulse transition search strategy, and a spiral fast solution strategy to determine the candidate key after randomization. Determine whether the total number of randomizations of the candidate keys corresponding to the current round key is greater than or equal to the preset maximum number of randomizations. If so, determine the current round key based on the candidate keys after randomization. Otherwise, based on the candidate keys after randomization, return to the step of obtaining the dissimilarity score and proceed to the next candidate key processing process. Determine if the total number of all obtained round keys is equal to the total number of rounds required by the symmetric encryption algorithm. If so, complete the generation of all round keys for the symmetric encryption algorithm; otherwise, return to the step of generating candidate keys and proceed to the next round of key generation. Based on all the round keys obtained, a multi-dimensional objective solution strategy is used to obtain the dissimilarity score corresponding to each candidate key, including: Determine the total number of all acquired round keys to obtain the target round number; For any candidate key, based on the target round number, the candidate key is dimensionally expanded to obtain the dimensionally expanded candidate key; Obtain the degree of difference between all the acquired round keys and the candidate keys after dimensional expansion, and obtain the dissimilarity score corresponding to the candidate key; Based on the first target key, the candidate key is randomized sequentially using a least-squares random search strategy, an adaptive pulse transition search strategy, and a spiral fast solution strategy to determine the randomized candidate key, including: Based on the first target key, the candidate key is first randomly updated using a least squares random search strategy to obtain the candidate key after the first random update; An adaptive pulse transition search strategy is used to perform a second random update on the candidate key after the first random update, resulting in a candidate key after the second random update. A spiral fast solution strategy is used to perform a third random update on the candidate key after the second random update, resulting in a candidate key after the third random update. The candidate key after the third random update is used as the candidate key after randomization. Based on the first target key, the candidate key is randomly updated using a least-squares random search strategy to obtain the candidate key after the first random update, including: For any candidate key, three different other candidate keys are randomly matched to it to obtain the first random key, the second random key and the third random key corresponding to the candidate key; Based on the first random key, the second random key, and the third random key, the first least squares parameter and the second least squares parameter are obtained as follows: ； ； ； in, This represents the first least squares parameter corresponding to the m-th first random key. Let m represent the second least squares parameter corresponding to the m-th first random key, where m = 1, 2, ..., M, and M represents the total number of candidate keys randomly generated in the optimized solution space during each round of key acquisition. Indicates the first random key. This represents the second random key. Indicates the third random key. Indicates the first position coefficient. Indicates the second position coefficient. Indicates the third position coefficient. This represents the coefficient at position i, where i = 1, 2, 3; This represents the dissimilarity score of the i-th random key. The score represents the dissimilarity of the first target key. This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents a constant term and is set to 0.

01. Based on the first target key, the first least squares parameter, and the second least squares parameter, the candidate key is randomly updated first to obtain the candidate key after the first random update: ； in, This represents the m-th candidate key. Let m represent the m-th candidate key after the first random update. Indicates the first target key. Represents the natural constant; An adaptive pulse transition search strategy is used to perform a second random update on the candidate keys after the first random update, resulting in candidate keys after the second random update, including: After the first random update, the candidate keys are randomly paired in pairs to obtain multiple pairs of paired keys; For any pair of paired keys, the adaptive pulse transition velocity is obtained as follows: ； ； ； in, Indicates the adaptive pulse transition velocity. This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents an exponential function with base e. Represents a random number between (0, 1). This represents the initial value of the adaptive pulse transition velocity. The parameter representing the influence between the first and second paired keys. This indicates the dissimilarity score of the second paired key. Indicates the first pairing key. Indicates the second pairing key. express and The Euclidean distance between them Represents a constant term; Based on the adaptive pulse transition speed, the first pairing key and the second pairing key are updated as follows: ； ； in, This indicates the first pairing key after the update. This indicates the updated second pairing key. Indicates the dissimilarity score of the first paired key; The updated first pairing key and the updated second pairing key are used together as the candidate key after the second random update; A spiral fast solution strategy is used to perform a third random update on the candidate keys after the second random update, resulting in candidate keys after the third random update, including: ； in, Let represent the candidate key after the nth second random update. Let represent the candidate key after the nth third random update, and b represent the spiral shape factor. ; This represents the total number of randomizations for the candidate keys corresponding to the current round key, where T represents the preset maximum number of randomizations. This represents an exponential function with base e. Represents a random spiral direction factor between (0,1). This represents the first target key.

2. The data security communication method for a 6G terahertz communication system according to claim 1, characterized in that, Determining a continuous optimized solution space based on the key length corresponding to the symmetric encryption algorithm includes: Based on the key length required for each round of the symmetric encryption algorithm, the range of values ​​for binary data converted to decimal data under that key length is determined, thus obtaining a continuous optimized solution space.

3. The data security communication method for a 6G terahertz communication system according to claim 1, characterized in that, Based on the dissimilarity scores corresponding to the candidate keys, the first target key is determined from all candidate keys, including: determining the candidate key with the largest dissimilarity score from all candidate keys as the first target key.

4. The data security communication method for a 6G terahertz communication system according to claim 1, characterized in that, The master key is composed of all round keys of the symmetric encryption algorithm, and the master key is then fragmented to obtain a fragmented key, including: Concatenate all round keys of the symmetric encryption algorithm into a single string in chronological order, and convert it to decimal to obtain the master key; The master key is fragmented using a threshold secret sharing algorithm to obtain a fragmented key.

Images