Data encryption and decryption method and device

Abstract

The present invention discloses a data encryption and decryption method and device, which relates to the fields of big data analysis and data encryption technology. The method comprises: dividing a data text into a preset number to obtain multiple segmented texts; generating multiple interference texts; encrypting the segmented texts and the interference texts based on a text encryption public key; adding a category tag number to each encrypted text based on a category encryption key; generating sending location information of the segmented encrypted texts with sequence numbers in the current round based on a preset current time parameter, a current sending number parameter, and a random number generated in the current round; assigning ungenerated sending location information to the sequence number of each interference encrypted text; and encrypting and sending the encrypted texts, encryption sequence numbers, category encryption keys, and category tag numbers arranged according to the sending location information to a data recipient based on a segmented encryption public key. The present invention is used to effectively enhance the security of data encryption.

Description

Technical Field

[0001] The present invention relates to the field of big data analysis and data encryption technology, and in particular to a method and device for encrypting and decrypting data. Background Art

[0002] This section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. No statement herein is admitted to be prior art by virtue of its inclusion in this section.

[0003] With the advent of the big data era, computing power has exploded, especially with the recent emergence of quantum computers, which boast virtually unlimited computing power. Current encryption algorithms rely on the principle that unauthorized third parties, if they misunderstand the encryption key, can only use brute force to decrypt it. This requires ensuring that the computing power required for forced decryption far exceeds the current technological limit.

[0004] Under these objective conditions, traditional asymmetric encryption methods or encryption technologies derived from them will no longer have the absolute security advantage after quantum computers achieve universal computing in the future. Therefore, how to upgrade encryption algorithms under existing technical conditions so that brute force encryption methods relying solely on increasing computing power become infeasible has become an important research direction for addressing the confidentiality crisis brought about by the growth of computing power.

[0005] Existing asymmetric encryption technologies primarily leverage the information asymmetry between encryption and decryption, achieving very low encryption costs when the key is known and prohibitively high decryption costs when the key is not. However, with the increasing availability of quantum computers, the increasing computing power, and the potential for a quantum computing explosion in the future, asymmetric encryption algorithms that traditionally rely on complex decryption calculations to enhance security and confidentiality may face the risk of gradual failure, rapidly degrading the security of encrypted data. Summary of the Invention

[0006] An embodiment of the present invention provides a data encryption method for effectively enhancing the security of data encryption and addressing the problems in the prior art caused by increased computing power and the potential threat of quantum computing. The method includes:

[0007] Segmenting the data text into a preset number to obtain a plurality of segmented texts; generating a plurality of interference texts; encrypting the segmented texts and the interference texts based on a text encryption public key to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts;

[0008] Based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for the data receiver to identify the data text using the segment encryption private key corresponding to the segment encryption public key;

[0009] Adding a sequence number to each segmented encrypted text and interference encrypted text; generating, for the sequence number of each segmented encrypted text, sending location information of the segmented encrypted text with the sequence number in the current round based on a random number generated in the current round; encrypting the set of sending location information in each round based on the text encryption key to obtain an encrypted sequence number of the segmented encrypted text; assigning the ungenerated sending location information to the sequence number of each interference encrypted text; and randomly encrypting the set of sequence numbers of each interference encrypted text to obtain an encrypted sequence number of the interference encrypted text;

[0010] An embodiment of the present invention further provides a data encryption device for effectively enhancing the security of data encryption and addressing the problems in the prior art caused by the increase in computing power and the potential threat of quantum computing. The device includes:

[0011] A text processing module is used to divide the data text into a preset number of parts to obtain a plurality of divided texts; generate a plurality of interference texts; and encrypt the divided texts and the interference texts based on a text encryption public key to obtain a plurality of divided encrypted texts and a plurality of interference encrypted texts;

[0012] A category encryption module, configured to add a category tag number to each segmented encrypted text and interference encrypted text based on a category encryption key; the category tag number is used by a data receiver to identify the data text using a segmented encryption private key corresponding to the segmented encryption public key;

[0013] The sequence number processing module is configured to add a sequence number to each segmented encrypted text and interference encrypted text; for each sequence number of the segmented encrypted text, generate sending location information of the segmented encrypted text with the sequence number in the current round based on the random number generated in the current round; encrypt the set of sending location information in each round based on the text encryption key to obtain an encrypted sequence number of the segmented encrypted text; assign the ungenerated sending location information to the sequence number of each interference encrypted text; and randomly encrypt the set of sequence numbers of each interference encrypted text to obtain an encrypted sequence number of the interference encrypted text;

[0014] The encryption sending module is used to encrypt and send the segmented encrypted text and interference encrypted text arranged by sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number to the data recipient based on the segmented encryption public key.

[0015] An embodiment of the present invention provides a data decryption method to effectively enhance the security of data encryption and address the problems in the prior art caused by increased computing power and the potential threat of quantum computing. The method includes:

[0016] Receive encrypted data sent by the data recipient;

[0017] Determine a category decryption key corresponding to the category encryption key using the segment encryption private key; identify multiple segmented ciphertexts in the encrypted data using the category decryption key according to the category tag number in the encrypted data;

[0018] Using a text encryption private key, decrypt multiple segmented encrypted texts to obtain multiple segmented texts;

[0019] Using the text encryption private key, the encrypted sequence number of the split encrypted text in the encrypted transmission data is decrypted to obtain the transmission location information of the split encrypted text;

[0020] The data text is restored based on the sending position information of the divided encrypted text and the plurality of divided texts.

[0021] An embodiment of the present invention further provides a data decryption device for effectively enhancing the security of data encryption and addressing the problems in the prior art caused by increased computing power and the potential threat of quantum computing. The device includes:

[0022] A data receiving module is used to receive encrypted data sent by a data receiver;

[0023] A segment decryption module is used to determine a category decryption key corresponding to the category encryption key using the segment encryption private key; using the category decryption key, based on the category tag number in the encrypted transmission data, to identify multiple segmented encrypted texts in the encrypted transmission data;

[0024] A text decryption module is used to decrypt multiple segmented encrypted texts using a text encryption private key to obtain multiple segmented texts;

[0025] The sending location decryption module is used to decrypt the encrypted sequence number of the split encrypted text in the encrypted sending data using the text encryption private key to obtain the sending location information of the split encrypted text;

[0026] The data text restoration module is used to restore the data text based on the sending location information of the segmented encrypted text and the multiple segmented texts.

[0027] An embodiment of the present invention further provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned data encryption and decryption method when executing the computer program.

[0028] An embodiment of the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program implements the above-mentioned data encryption and decryption method.

[0029] An embodiment of the present invention further provides a computer program product, which includes a computer program. When the computer program is executed by a processor, it implements the above-mentioned data encryption and decryption method.

[0030] In the embodiment of the present invention, a data text is divided into a preset number to obtain a plurality of segmented texts; a plurality of interference texts are generated; based on a text encryption public key, the segmented texts and the interference texts are encrypted to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts; based on a category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for a data receiver to identify the data text with a segmented encryption private key corresponding to a segmented encryption public key; a sequence number is added to each segmented encrypted text and interference encrypted text; for the sequence number of each segmented encrypted text, a sequence number of the segmented encrypted text with the sequence number in the current round is generated according to a random number generated in the current round. Sending position information; Based on the text encryption key, encrypt the set of sending position information in each round to obtain the encryption sequence number of the segmented encrypted text; assign the ungenerated sending position information to the sequence number of each interference encrypted text; randomly encrypt the set of sequence numbers of each interference encrypted text to obtain the encryption sequence number of the interference encrypted text; Based on the segmented encryption public key, encrypt the segmented encrypted text and the interference encrypted text arranged by the sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number, and send them to the data recipient, thereby encrypting the original data text in segments and performing rounds. The position of the text is scrambled to increase the difficulty of the algorithm to decipher; by adding meaningless interference text to the segmented text, the complexity of the encrypted information is increased, and the segmented text and the interference text are encrypted together, which increases the difficulty of cracking. Even if a small part is cracked, the original text cannot be directly understood; the category encryption key and dual-key segmented encryption mode are introduced, in which the category tag number helps to distinguish the original text fragment and the interference text, and relies on the receiver's private key for identification, which not only improves the security of data encryption, but also ensures that only the receiver with the correct key can accurately identify the real information, effectively resisting the identification attempt of a third party without the key; by encrypting the sending of position information, the arrangement order of the segmented text is further guaranteed not to be It can be easily revealed that even if the location information is intercepted, its true meaning cannot be interpreted without the corresponding key, which increases the security of the overall system. In addition, the present invention alleviates the problem that the existing technology of asymmetric encryption is prone to security threats due to the increase in quantum computing power. The present invention uses multi-dimensional and dynamically changing encryption strategies, as well as fine management and obfuscation of data fragments, so that without complete encrypted data, it is impossible to reverse the private key cracking by computing power, and without private key identification interference information, it is impossible to obtain complete encrypted data, which effectively enhances the security of data encryption, responds to the problems in the existing technology caused by the increase in computing power and the potential threat of quantum computing, and avoids the risk of encryption method failure due to the breakthrough increase in supercomputer computing power. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for the embodiments or the description of the prior art. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative work. In the drawings:

[0032] Figure 1 A schematic diagram of a data encryption method according to an embodiment of the present invention;

[0033] Figure 2 This is a specific example diagram of a data encryption method according to an embodiment of the present invention;

[0034] Figure 3 This is a specific example diagram of a data encryption method according to an embodiment of the present invention;

[0035] Figure 4 This is a schematic structural diagram of a data encryption device according to an embodiment of the present invention;

[0036] Figure 5 Schematic diagram of a data decryption method according to an embodiment of the present invention;

[0037] Figure 6 This is a structural example diagram of a data decryption device according to an embodiment of the present invention;

[0038] Figure 7 Schematic diagram of a computer device used for data encryption and decryption in an embodiment of the present invention. DETAILED DESCRIPTION

[0039] To make the purpose, technical solutions and advantages of the embodiments of the present invention more clear, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. Here, the exemplary embodiments of the present invention and their descriptions are used to explain the present invention, but are not intended to limit the present invention.

[0040] The term "and / or" herein simply describes an association relationship, indicating that three relationships can exist. For example, A and / or B can represent the existence of A alone, the simultaneous existence of A and B, and the existence of B alone. In addition, the term "at least one" herein refers to any combination of at least two of any one or more of a plurality of items. For example, "at least one of A, B, and C" can represent any one or more elements selected from the set consisting of A, B, and C.

[0041] In the description of this specification, the terms "include", "including", "have", "contain", etc. are all open terms, which mean including but not limited to. The descriptions with reference to the terms "one embodiment", "a specific embodiment", "some embodiments", "for example", etc. mean that the specific features, structures or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic expressions of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures or characteristics described can be combined in a suitable manner in any one or more embodiments or examples. The order of steps involved in each embodiment is used to schematically illustrate the implementation of the present application, and the order of steps therein is not limited and can be appropriately adjusted as needed.

[0042] The acquisition, storage, use, and processing of data in the technical solution of this application are in compliance with the relevant provisions of national laws and regulations. The information collected in this application is 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 relevant data are in compliance with the relevant laws, regulations and standards of relevant countries and regions, and necessary confidentiality measures are taken, which do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or refuse. In addition, this application provides users with corresponding operation entrances for users to choose to agree or refuse the results of automated decision-making. If the user chooses to refuse, they can enter the expert decision-making process.

[0043] It should be noted that in the embodiments of the present application, some software, components, models and other existing solutions in the industry may be mentioned. For example, some existing software tools, components, algorithm models or other well-known solutions in other technical fields may be cited. They should be regarded as exemplary, and their purpose is only to illustrate the feasibility of the implementation of the technical solution of the present application. These references should be understood as typical examples, and their core purpose is to explain and verify the rationality and feasibility of the implementation of the technical solution proposed in the present application. However, it does not mean that the applicant has or will necessarily use the solution. Such references do not imply that the applicant has actually adopted these existing solutions, or will inevitably adopt these methods in the future during its technical implementation. In other words, these references only serve to illustrate the nature of the invention, to help understand the relationship between the innovation of the present application and the prior art and its transcendence, and do not constitute an endorsement or reliance statement on a specific prior art product.

[0044] Data encryption is a crucial component of security. Any business, organization, or individual requires encryption technology to prevent the leakage of confidential and private information during transmission. Encryption algorithms primarily include symmetric and asymmetric encryption. Symmetric encryption uses the same encryption and decryption processes, making it easier to crack ciphertext without a decryption key through brute force, but offering poor security. Asymmetric encryption leverages information asymmetry, making encryption easier. However, the computational cost of brute force decryption is prohibitively high under current technology, making it a popular choice. The RSA algorithm is a prime example.

[0045] However, with the advent of the big data era, human computing power has shown explosive growth, especially with the emergence of quantum computers in recent years, which have almost unlimited computing power limits. Under these objective conditions, traditional RSA encryption or encryption technologies derived from it will no longer have the absolute security advantage after quantum computers achieve universal computing in the future. Therefore, how to upgrade encryption algorithms under existing technical conditions so that brute force encryption methods relying solely on increased computing power become infeasible has become an important research direction for coping with the confidentiality crisis brought about by the growth of computing power.

[0046] Existing asymmetric encryption technologies primarily leverage the information asymmetry between encryption and decryption, achieving very low encryption costs when the key is known and prohibitively high decryption costs when the key is not. However, as quantum computers become increasingly common, the practical upper limit of computing power will increase significantly while computing power costs will decrease significantly. Under these circumstances, the security advantages of traditional asymmetric algorithms, which rely solely on the cost of decryption computing power, will gradually disappear. New encryption algorithms should be sought that no longer rely solely on the complexity of required computing power. Instead, multi-layered and multi-dimensional decryption protection barriers should be constructed. For example, encrypting the original plaintext in segments, scrambling the order of the segments before encrypting them, and adding meaningless interference fields for enhanced protection are all effective research directions for enhancing encryption security.

[0047] In order to solve the above problems, the inventors realized that in the face of the increasing level of computing power and the possible explosion of quantum computing power in the future, the asymmetric encryption algorithms that traditionally rely on complex decryption calculations to improve security and confidentiality may be at risk of gradually becoming ineffective in the future. It is necessary to increase the diversity of algorithm structures and improve the reliability of encryption algorithms by implementing multi-dimensional algorithm anti-decryption mechanisms. Therefore, the inventors provide a data encryption and decryption method in the embodiments of the present invention to effectively enhance the security of data encryption and address the problems in the existing technology caused by the increase in computing power and the potential threat of quantum computing, see Figure 1 , the method may include:

[0048] Step 101: Encrypting the segmented text and the interference text based on a text encryption public key to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts;

[0049] Step 102: Based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used by the data receiver to identify the data text using the segment encryption private key corresponding to the segment encryption public key;

[0050] Step 103: Adding a sequence number to each segmented encrypted text and interference encrypted text; for each segmented encrypted text sequence number, generating the sending location information of the segmented encrypted text with the sequence number in the current round based on the random number generated in the current round; encrypting the set of the sending location information in each round based on the text encryption key to obtain the encrypted sequence number of the segmented encrypted text; assigning the ungenerated sending location information to the sequence number of each interference encrypted text; and randomly encrypting the set of the sequence numbers of each interference encrypted text to obtain the encrypted sequence number of the interference encrypted text;

[0051] Step 104: Based on the segmented encryption public key, the segmented encrypted text and the interference encrypted text arranged by the sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number are encrypted and sent to the data recipient.

[0052] In the embodiment of the present invention, a data text is divided into a preset number to obtain a plurality of segmented texts; a plurality of interference texts are generated; based on a text encryption public key, the segmented texts and the interference texts are encrypted to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts; based on a category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for a data receiver to identify the data text with a segmented encryption private key corresponding to a segmented encryption public key; a sequence number is added to each segmented encrypted text and interference encrypted text; for the sequence number of each segmented encrypted text, a sequence number of the segmented encrypted text with the sequence number in the current round is generated according to a random number generated in the current round. Sending position information; Based on the text encryption key, encrypt the set of sending position information in each round to obtain the encryption sequence number of the segmented encrypted text; assign the ungenerated sending position information to the sequence number of each interference encrypted text; randomly encrypt the set of sequence numbers of each interference encrypted text to obtain the encryption sequence number of the interference encrypted text; Based on the segmented encryption public key, encrypt the segmented encrypted text and the interference encrypted text arranged by the sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number, and send them to the data recipient, thereby encrypting the original data text in segments and performing rounds. The position of the text is scrambled to increase the difficulty of the algorithm to decipher; by adding meaningless interference text to the segmented text, the complexity of the encrypted information is increased, and the segmented text and the interference text are encrypted together, which increases the difficulty of cracking. Even if a small part is cracked, the original text cannot be directly understood; the category encryption key and dual-key segmented encryption mode are introduced, in which the category tag number helps to distinguish the original text fragment and the interference text, and relies on the receiver's private key for identification, which not only improves the security of data encryption, but also ensures that only the receiver with the correct key can accurately identify the real information, effectively resisting the identification attempt of a third party without the key; by encrypting the sending of position information, the arrangement order of the segmented text is further guaranteed not to be It can be easily revealed that even if the location information is intercepted, its true meaning cannot be interpreted without the corresponding key, which increases the security of the overall system. In addition, the present invention alleviates the problem that the existing technology of asymmetric encryption is prone to security threats due to the increase in quantum computing power. The present invention uses multi-dimensional and dynamically changing encryption strategies, as well as fine management and obfuscation of data fragments, so that without complete encrypted data, it is impossible to reverse the private key cracking by computing power, and without private key identification interference information, it is impossible to obtain complete encrypted data, which effectively enhances the security of data encryption, responds to the problems in the existing technology caused by the increase in computing power and the potential threat of quantum computing, and avoids the risk of encryption method failure due to the breakthrough increase in supercomputer computing power.

[0053] During specific implementation, the data text is first divided into a preset number of parts to obtain a plurality of segmented texts; and a plurality of interference texts are generated.

[0054] In the embodiment, the data text is subdivided into multiple small segments, and this process is performed based on a pre-set number N, where N is a parameter determined based on a comprehensive consideration of data security requirements and system performance. The purpose of segmentation is to break up the original information so that each segmented text becomes an independent and incomplete unit. Such processing can effectively disperse information. Even if a single segmented text is intercepted, its content is not understandable, which greatly increases the difficulty for illegal visitors to parse the information. The segmentation process can be implemented based on the number of characters, the number of words, or specific logical breakpoints to ensure the balance and randomness of each segment after segmentation, thereby further improving security.

[0055] To further confuse the audience, the present invention introduces a large amount of meaningless interference text. These interference texts are unrelated to the original information, but are difficult to distinguish from the segmented text fragments in appearance. The methods for generating interference text can be diverse, for example, using a random character generator, a pseudo-random number sequence, or a text string constructed based on a specific algorithm. The number of interference texts T is usually much larger than the number of segmented texts M, which can significantly increase the total amount of the final encrypted ciphertext, making it difficult for unauthorized third parties to filter out truly meaningful information from the massive data even if they attempt brute force cracking. In addition, the length of the interference text can be consistent with the segmented text to ensure consistency in subsequent encryption and reorganization processes.

[0056] In specific implementation, the data text is divided into a preset number to obtain multiple segmented texts; after generating multiple interference texts, the segmented texts and the interference texts are encrypted based on the text encryption public key to obtain multiple segmented encrypted texts and multiple interference encrypted texts.

[0057] Specifically, in this embodiment, the original text is first meticulously segmented into a predetermined number of fragments. This operation not only disperses sensitive information and reduces the impact of a single leak, but also lays the foundation for subsequent encryption and obfuscation operations. The segmentation process follows established rules, ensuring that the segmented text fragments can both independently carry information and restore the integrity of the original text after correct reassembly.

[0058] Next, to further enhance the complexity and security of the encrypted message, multiple meaningless interference texts are generated. These interference texts are completely unrelated to the original message in content, but their appearance and structure are similar to the segmented text fragments, thereby confusing potential attackers. By adding a large amount of interference text, the total amount of encrypted information is significantly increased, making it difficult for illegal intruders to distinguish between real information and interference items and significantly increasing the cost and difficulty of brute force cracking.

[0059] Subsequently, all segmented texts and the generated interference texts are encrypted using the public key, a key component of asymmetric encryption technology. Each segmented text is encrypted using the public key, converting it into ciphertext, resulting in multiple segmented encrypted texts. Similarly, each interference text is processed using the same public key encryption method, generating a series of interference ciphertexts. This public key-based encryption method ensures that only the legitimate recipient holding the corresponding private key can decrypt the information. Even if an unauthorized third party intercepts the encrypted data, it is difficult to directly decipher the original content.

[0060] During specific implementation, after encrypting the segmented text and the interference text based on the text encryption public key to obtain multiple segmented encrypted texts and multiple interference encrypted texts, a category tag number is added to each segmented encrypted text and interference encrypted text based on the category encryption key; the category tag number is used for the data recipient to identify the data text using the segmented encryption private key corresponding to the segmented encryption public key.

[0061] In the embodiment, after the segmented text and the interference text are encrypted using the text encryption public key, a unique category tag number is added to each encrypted segmented text and interference text. The purpose of this design is to enhance the recognition and security of data transmission and ensure that the recipient can accurately identify the real original data fragments from a large number of encrypted information. The generation of the category tag number is based on a specially designed category encryption key. This key operates in parallel with the traditional segmented encryption public key / private key system and is designed specifically for the identification of data fragments. In specific implementation, each segmented encrypted text and each interference encrypted text are assigned a category tag number derived from the category encryption key. These numbers are like "identity tags" for each data fragment. They not only contain an indication of the original text information to which the fragment belongs, but also have anti-tampering properties to ensure the integrity of the data and the authenticity of the source.

[0062] The recipient, using their private key for segmented encryption, can efficiently identify and verify these category marker numbers. The private key acts as the key to unlocking information security, enabling the recipient to accurately locate and extract the segmented encrypted text that truly belongs to the original text from a collection of encrypted text mixed with real data and interference information. This process relies on the specific mathematical relationship between the category marker number and the segmented encryption private key, ensuring that only the legitimate recipient can correctly identify and reconstruct the data. Even if any unauthorized third party obtains the encrypted data, they will not be able to correctly identify the information contained in the category marker number due to lack of the necessary private key, and thus will not be able to reconstruct the meaningful original text.

[0063] In addition, to further confuse the public, the design of the category tag number also includes the disguise of the interference text, ensuring that even if the category tag number is cracked, unauthorized third parties will not be able to distinguish between real data fragments and interference fragments based on this alone, thereby greatly increasing the difficulty and complexity of illegal decryption and realizing another barrier to data protection.

[0064] In one embodiment, the class encryption key is a randomly generated prime number;

[0065] Based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text, including:

[0066] Based on the randomly generated prime number, for each segmented encrypted text, selecting a value whose remainder processing of the randomly generated prime number is zero; and using the value as a category tag number added to the segmented encrypted text;

[0067] Based on the randomly generated prime number, for each interference encrypted text, a value whose result of taking the remainder of the randomly generated prime number is not zero is selected; and the value is used as a category tag number added to the interference encrypted text.

[0068] In this embodiment, a class encryption key is introduced. This key is randomly generated using a strict mathematical algorithm, ensuring it is a prime number. This key provides a highly secure classification basis for subsequent encrypted text segmentation and interference information injection. A specific implementation method of the present invention involves using this randomly generated class encryption key to assign a unique class tag number to each segmented encrypted text block and intentionally inserted interference encrypted text, thereby enhancing information obfuscation and security.

[0069] The specific operation steps are as follows: For each separate encrypted text segment, a modulo operation is performed to select the values ​​whose modulo operation with the randomly generated class encryption prime number equals zero. These values ​​are assigned as the class tag number of the segmented encrypted text. This process ensures that the legitimate recipient can quickly identify the text segment containing the real information through the mathematical properties associated with the private key they hold.

[0070] At the same time, a similar but opposite strategy is employed for each interference encrypted text: a value whose modulo operation with the corresponding encryption prime number is not equal to zero is selected as its category label. This design cleverly leverages mathematical differences to ensure that the interference information and the true information are distinguishable in their classification labels, making this distinction extremely difficult for unauthorized third parties.

[0071] In summary, the class encryption key based on randomly generated prime numbers proposed in the present invention and its application in the classification marking of encrypted text and interference text not only greatly enhances the encryption depth of information, but also effectively improves the ability to resist brute force decryption attempts, thereby ensuring the high security and privacy protection of communication content.

[0072] In one embodiment, based on the randomly generated prime number, for each segmented encrypted text, selecting a value whose remainder processing of the randomly generated prime number is zero includes:

[0073] For each segmented encrypted text, randomly select a first preset number of prime numbers that are greater than the randomly generated prime number; and use the product of the randomly selected prime number and the randomly generated prime number as the value resulting from a remainder processing of the randomly generated prime number being zero;

[0074] For each interference encrypted text, a value whose result of performing remainder processing on the randomly generated prime number is not zero is selected, including:

[0075] For each interference encrypted text, a second preset number of prime numbers greater than the randomly generated prime number are randomly selected; and the product of the randomly selected prime numbers is used as a non-zero value resulting from a remainder processing of the randomly generated prime number.

[0076] In order to enhance the security of the encryption system, the present invention implements an innovative random prime number integration method. M The generation of R uses the product of the base key and the subsequent 1000 consecutive independent random prime numbers to ensure the complexity and randomness of the key expansion. M+1 ...R M+T This process involves multiplying 1001 newly randomly selected random prime numbers. This design is independent of the categorical encryption key and increases the difficulty of pattern recognition. By combining a large number of irregularly selected prime numbers with multiple randomization steps, this method effectively increases the obfuscation level of encrypted data. Without the categorical encryption key, it is difficult for an adversary to parse the correct information fragment, greatly enhancing the depth of information security protection.

[0077] In one embodiment, based on the randomly generated prime number, for each segmented encrypted text, selecting a value whose remainder processing of the randomly generated prime number is zero includes:

[0078] A prime number that is a first preset number of prime numbers away from the randomly generated prime number is used as a first target prime number; for each segmented encrypted text, a value for which a remainder processing of the first target prime number is zero is selected;

[0079] Based on the randomly generated prime number, for each interference encrypted text, selecting a value whose result of performing remainder processing on the randomly generated prime number is not zero, including:

[0080] A prime number that has a second preset number of prime numbers between it and the randomly generated prime number is used as a second target prime number; for each interference encrypted text, a value whose remainder processing result is not zero is selected for the second target prime number.

[0081] In the above embodiment, in order to further strengthen the classification and obfuscation mechanism of encrypted information, randomly generated prime numbers are used as the core basis to implement differentiated processing for segmented encrypted text and interference encrypted text. The specific operation details are as follows:

[0082] First, for each encrypted text segment, the present invention employs an innovative screening mechanism. This mechanism determines a first target prime number, located after the randomly generated prime number, and separated by a predetermined first number of prime numbers. Then, for each encrypted text segment, a modulo operation is performed on the first target prime number, carefully selecting those values ​​that yield zero as the unique category identifier for that segment. This step ensures that legitimate recipients can accurately identify authentic data segments from encrypted information using specialized mathematical logic, while presenting an insurmountable obstacle for unauthorized intruders.

[0083] Secondly, for each interfering encrypted text, we adopted a similar but opposite strategy, aiming to further confuse the reader and increase the difficulty of cracking. Specifically, a second target prime number was selected, the distance between this prime number and the randomly generated prime number being a predetermined second number of primes. For each interfering text fragment, a modulo operation with respect to the second target prime number was performed, and the value resulting from the operation was deliberately selected as its category label. This design cleverly distinguishes the interference information from the real information in terms of labeling, while making it extremely difficult for unauthorized individuals to discern valid information from the mixed encrypted data.

[0084] In summary, through the above-mentioned sophisticated mathematical operations, the present invention not only enhances the classification logic of encrypted data, but also significantly improves the security protection level of information, ensuring that the encrypted content can maintain a high degree of confidentiality and integrity even in the face of powerful computing power challenges.

[0085] During specific implementation, based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for the data recipient to identify the data text with the segmented encryption private key corresponding to the segmented encryption public key, and then a sequence number is added to each segmented encrypted text and interference encrypted text respectively; for the sequence number of each segmented encrypted text, the sending position information of the segmented encrypted text with the sequence number in the current round is generated according to the random number generated in the current round; based on the text encryption key, the set of the sending position information in each round is encrypted to obtain the encrypted sequence number of the segmented encrypted text; the sending position information that has not been generated is assigned to the sequence number of each interference encrypted text; the set of sequence numbers of each interference encrypted text is randomly encrypted to obtain the encrypted sequence number of the interference encrypted text.

[0086] In this embodiment, the key steps of the enhanced encryption process involve multi-layered strategy design to ensure high security and cracking resistance in information transmission. The specific operational process is as follows: First, using a dedicated category encryption key, each segmented encrypted text and interference encrypted text is carefully classified and assigned a unique category tag number. The introduction of this tag number is intended to enable the data recipient to use the segment encryption private key corresponding to the segment encryption public key to efficiently identify which text data segments are authentic and which are intentionally inserted interference information, laying the foundation for subsequent data reconstruction.

[0087] Furthermore, for each classified encrypted text segment and the marked interference encrypted text, a sequence number is systematically assigned to each text segment. The present invention employs a dynamic generation strategy for the sequence number of each encrypted text segment. This strategy comprehensively considers the preset current time parameter, the cumulative number of transmissions parameter, and the random number generated by the random number generator in the current round. Based on these three factors, the exact transmission location information of the sequence number in this round is calculated. Notably, the total amount of transmission location information is equal to the sum of the segmented text and the interference text, ensuring that all segments have corresponding location information.

[0088] Next, the text encryption key is used to encrypt the set of sending location information for all encrypted text segments in each round to generate an encrypted sequence number. This step effectively hides the true order of the data. Simultaneously, the remaining sending location information not assigned to the encrypted text segments is assigned to the sequence numbers of the interference encrypted texts. Using a random encryption algorithm, the order information of the interference texts is further obscured to generate the encrypted sequence numbers, making it more difficult for unauthorized intruders to parse the actual text sequence.

[0089] Through the above steps, the present invention not only achieves high-intensity segmented encryption of data, but also incorporates a dynamically adjusted sequence number and position information encryption mechanism, greatly improving the security level of information transmission and ensuring that even in the face of increasingly powerful computing power challenges, the encryption system can still maintain its inherent security and reliability.

[0090] In one embodiment, the total number of sent position information is the sum of the number of segmented texts and interference texts;

[0091] For each sequence number of the encrypted text segment, the sending location information of the encrypted text segment with the sequence number in the current round is generated according to the random number generated in the current round, including:

[0092] For each sequence number of the encrypted text segment, the sending position information of the encrypted text segment with the sequence number in the current round is generated according to the preset current time parameter, the current sending number parameter and the random number generated in the current round.

[0093] In one embodiment, for each sequence number of the encrypted text segment, the sending position information of the encrypted text segment with the sequence number in the current round is generated according to the preset current time parameter, the current sending number parameter and the random number generated in the current round, such as Figure 3 Shown, including:

[0094] Step 301: If the sending location information of the encrypted text segment with the sequence number generated in the current round is the same as the sending location information of the encrypted text segment with the sequence number generated in the previous round, the sending location information is incremented by a preset number of digits to obtain an updated sending location information value;

[0095] Step 302: If the updated value of the sending location information is the same as the sending location information of the segmented encrypted text with the same sequence number in the previous round, the above operation is repeated until the updated value of the sending location information is different from the sending location information of the segmented encrypted text with the same sequence number in the previous round.

[0096] Step 303: Update the sending location information to a value that serves as the sending location information of the segmented encrypted text with the sequence number in the current round.

[0097] In the embodiment, the sequence number assigned to each encrypted text segment and the generation of its sending location information are intended to further enhance the randomness and unpredictability of encrypted communication. The specific operation follows the following steps:

[0098] First, a calculation is performed based on a series of pre-defined parameters, including but not limited to the current timestamp, the cumulative number of transmissions in this communication, and a random number independently generated in the current round, to determine the transmission location of the encrypted text segment corresponding to the sequence number in this round. This calculation process is designed to utilize the combination of these dynamic factors to ensure that each transmission location is highly random and unique.

[0099] However, to prevent encrypted text segments with the same sequence number from being assigned to the same sending location in consecutive rounds, the present invention incorporates an efficient conflict resolution mechanism. Specifically, if the sending location information generated by a segment with the same sequence number in the current round overlaps with the location information in the previous round, the system automatically increments the sending location by a preset number of bits to generate a so-called sending location information update value. This incrementing operation is intended to immediately avoid location duplication and make it more difficult for unauthorized third parties to track the original data distribution pattern.

[0100] If the incremented send location still matches the previous send location, the increment operation is repeated until a new send location is obtained that does not duplicate the send location of the encrypted text segmented with that sequence number in all previous rounds. This process ensures that even in the extremely unlikely event of a location conflict, there is a reliable mechanism to immediately correct it, maintaining the uniqueness and random distribution of the send locations.

[0101] Ultimately, the updated location information obtained through the conflict detection and correction process is officially confirmed as the exact location information for the encrypted segment with the specified sequence number in the current round. This series of carefully designed operations not only greatly enhances the transmission security of encrypted information, but also effectively prevents potential attackers from using historical communication data to predict the current location, fundamentally improving the robustness and security of the encryption system.

[0102] In one embodiment, it further includes:

[0103] If the updated value of the sending position information obtained by repeatedly performing the above operation is the maximum value of the sending position information, and the maximum value of the sending position information is the sending position information in the previous round, the above operation of obtaining the updated value of the sending position information is restarted from the minimum value of the sending position information until the sending position information that was not generated in the previous round is determined.

[0104] In an embodiment, in response to possible extreme situations, that is, in the process of continuously increasing the location information update value to resolve location conflicts, if the update value reaches the preset maximum sending location limit, and this maximum value has been used in the previous round, a cyclic backtracking strategy is adopted to ensure the uniqueness and continuity of the sent location information.

[0105] Specifically, if the generated send location information update value is detected to be equal to the preset maximum send location information threshold, and this maximum value has already been occupied in a previous round, the send location information search starting point will be automatically reset to the minimum value, that is, a new send location information update value will be re-generated from the beginning of the send location information sequence. This process ensures that even if the send location resources appear to be exhausted, a send location that has not been allocated in all previous rounds can still be explored and assigned through recycling, thereby maintaining the security isolation and obfuscation level of information transmission.

[0106] The introduction of this looping mechanism not only effectively avoids the problem of resource exhaustion in transmitting location information, but also further enhances the complexity of encrypted communication, posing a more severe challenge to potential attackers. This makes it difficult for attackers to accurately predict or infer the true order of information, even in the face of highly optimized analysis algorithms. This ensures the security and integrity of data during transmission, fully demonstrating the innovation and practicality of this invention in the field of encryption technology.

[0107] In one embodiment, it further includes:

[0108] After generating the sending location information of the segmented encrypted text with the sequence number in the current round, a data dictionary carrying the association relationship between the segmented encrypted text and the sending location information is generated based on the segmented encrypted text and the sending location information of each round.

[0109] In a specific embodiment, the present invention further includes the step of generating a data dictionary that associates the current location code with the segment information. Specifically, this step, immediately following the generation of the sending location information for each encrypted segment in the current round, aims to establish an efficient indexing mechanism that not only assigns a unique sending location information to each segmented encrypted text segment, but also creates a comprehensive data dictionary that records the mapping between each segment's encrypted content and its specific sending location.

[0110] The construction process of this data dictionary fully considers information security, ensuring that even if some data is intercepted or analyzed during transmission, attackers cannot easily decipher the true order and content of the segmented text. The internal associations within the data dictionary are set using advanced encryption logic, binding the segment numbers to their random distribution in the encrypted information stream. This binding relationship is completely hidden and difficult to crack from the outside world. The recipient, with the corresponding decryption key and decoding rules, can quickly identify and restore the correct order of these segmented texts and then reconstruct the original information. Unauthorized third parties cannot restore the original appearance of the information due to lack of the necessary decryption methods and understanding of the data dictionary structure.

[0111] The introduction of this data dictionary not only improves the flexibility and efficiency of encrypted communications, but also significantly enhances the robustness of the overall encryption system. Even in the face of increasing computing power and advanced analytical techniques, the encryption method of the present invention can still maintain its excellent defensive performance and ensure the secure transmission of sensitive information.

[0112] During specific implementation, based on the text encryption key, the set of sending position information in each round is encrypted to obtain the encryption sequence number of the split encrypted text; the set of sequence numbers of each interference encrypted text is randomly encrypted to obtain the encryption sequence number of the interference encrypted text, and then based on the segmented encryption public key, the split encrypted text and interference encrypted text arranged by the sending position information, the encryption sequence number of the split encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number are encrypted and sent to the data recipient.

[0113] In the embodiment, the public key of segmented encryption is used to encrypt the carefully arranged segmented encrypted text and interference encrypted text, their respective encryption sequence numbers, and the category encryption key and category tag number used for category identification, forming a comprehensive encryption package. This series of data is securely transmitted to the predetermined data recipient after encryption, ensuring the integrity and confidentiality of the information during the transmission process. The implementation of this comprehensive encryption strategy not only strengthens the protection of core information, but also effectively responds to potential decryption attempts by introducing randomness and dynamic changes. In particular, it provides a more stable and adaptable security guarantee for data communication, especially for the possible surge in computing power or the threat of quantum computing technology in the future.

[0114] The following is a specific example to illustrate the specific application of the method of the present invention. The goal of this example is to further upgrade the encryption algorithm based on traditional asymmetric encryption. The mainstream concept of current encryption algorithms is to force unauthorized third parties to decrypt the key through brute force calculations if they misunderstand the encryption key. In this case, it is only necessary to ensure that the computing power required for forced decryption far exceeds the computing power limit under current technical conditions. However, computing power technology is constantly evolving. To prevent the current encryption algorithm from being rendered ineffective due to a major breakthrough in computing power at some point in the future, such as the emergence of universal quantum computers, it is necessary to construct a new multi-dimensional decryption prevention mechanism that does not rely solely on the difficulty of forced decryption.

[0115] In order to explain the design idea of ​​this patent more clearly, the RSA algorithm in asymmetric encryption technology is used as an example for explanation, but this does not mean that the new encryption technology of the present invention can only be upgraded for this asymmetric encryption method. The idea of ​​the embodiment is specifically described as follows: Figure 2 As shown:

[0116] 1. Asymmetric encryption RSA algorithm.

[0117] The RSA algorithm is a classic asymmetric algorithm. Its core design theory is based on the arithmetic properties related to factorization and remainder operations in number theory. Simply put, this algorithm can ensure that users can easily encrypt and decrypt text when they have the key. However, if an unauthorized third party wants to brute force the ciphertext to restore the original text without the key, the computing power required will take more than 100 trillion years based on the current level of supercomputer technology, making it physically irreversible.

[0118] Specifically, RSA will design a pair of keys, namely the public key and the private key, which are a set of number pairs, marked as public key (E, N) and private key (D, N). The public key is used to encrypt the original text, and the private key is used to decrypt it. It should be noted that E and N are public, but the private key D is not public and only known to the user. The core of the RSA encryption algorithm is to digitize a piece of plain text and encode it into a code replaced by numbers. Note that encoding the plain text into a digital code does not belong to the encryption part. This encoding may be a certain public and universal encoding method. If the original text has ten words, encoded into numbers (x1, x2, ..., x 10 ), then we can start the real encryption process, and convert (x1, x2, ..., x 10 ) respectively Processing, marking the processing results as:

[0119]

[0120] Where % is the remainder operator, for example 7%5=2.

[0121] (y1,y2,…,y 10 ) is the encrypted ciphertext. The RSA encryption algorithm can ensure that the receiver receives the ciphertext (y1, y2, ..., y 10 ) and then undergo the decryption process Then we can get (x1,x2,…,x 10 ), that is:

[0122]

[0123] Then the receiver will (x1,x2,…,x 10 ) can be decoded in a public way to get the original text. In this process, unauthorized third parties can only intercept the encrypted ciphertext in the middle, that is, (y1,y2,…,y 10 ), if there is no key (D, N), we can only use a supercomputer to try to decrypt all possible Ds. The number theory system combined with the relevant properties of Euler's theorem can theoretically prove that as long as the value of N is large enough (for example, greater than 1024 bits), the brute force decryption time required is on the order of trillions of years.

[0124] Therefore, unless there are major breakthroughs in computing power, the security of this encryption algorithm is very high. However, the emergence of quantum computers could potentially change this situation. While scientists have yet to assess the upper limit of quantum computing speed, it could be a trillion times faster than current supercomputers. If a universal quantum computer were to become available, encryption algorithms that currently require trillions of years to decipher could very well be decrypted in seconds. Therefore, it is necessary to upgrade encryption in other areas, ensuring that encryption security is not solely based on the high computing power requirements of the decryption algorithm. Therefore, the present inventors have designed a unique new encryption logic.

[0125] 2. Dual-key segmented encryption:

[0126] Segmented encryption is an important means to improve encryption security. For a piece of text, suppose it is encoded into a number (x1, x2, ..., x N ), N is the length of the text, then directly asymmetric encryption of the text encoding number is not secure enough, here we use the dual-key segmented encryption mode, the specific design ideas are as follows:

[0127] (1) The so-called dual-key encryption is different from the traditional encryption method that uses only one set of public and private keys for encryption. Here, there are two sets of public and private keys, marked as the text encryption public key and text encryption private key (E1, N1) and (D1, N1) for text encryption, and the segment encryption public key and segment encryption private key (E2, N2) and (D2, N2) for segment encryption.

[0128] The original text (x1, x2, ..., x N ) is cut into several segments, assuming that there are M segments, and the length of each segment is K, then N = M × K. So (x1, x2, ..., x N ) is split into:

[0129] K1=(x1,x2,…,x K )、K2=(x K+1 ,x K+2 ,…,x 2K ),……,K M =

[0130] (x N-K+1 ,x N-K+2 ,…,x K ).

[0131] The public key (E1, N1) used to encrypt the text of each segment after segmentation is non-compositely encrypted.

[0132] (2) After the division, K1...K M The category tag number is assigned to each segment, which is a string of codes. The category tag number of each segmented segment can be combined with the recipient's segmented encryption private key (D2, N2) to calculate a fixed value of 0, indicating that these segments come from the same original code. After obtaining the unique identifier, a large number of interfering text codes can be added with K1...K M Mixed, these distracting text codes are marked as Among them, T is much larger than M. The length of each segment in K1...K M Any one of them is the same, that is, the length is K, and it also has a category tag number. The difference is that the category tag number of the interference text is combined with the recipient's private key to calculate a result that is not 0. This shows that these interference texts The value of existence is K1...K M Mixing makes it impossible for unauthorized third parties to find the original code (x1, x2, ..., x N )'s constituent segments K1...K M The specific operations are as follows:

[0133] Mark K1...KM The category number is R1...R M , while marking The category number is R M+1 ...R M+T , these category numbers are composed of a string of numbers. Here we generate a category decryption key D * , D * is a randomly generated prime number, R1…R M Based on D * The selection principle is to make R m %D * =0,m=1,2,…,M, that is, the selected R1…R M Can be decrypted by the class key D * divisible by R M+1 ...R M+T The selection principle is R h %D * >0,h=M+1,M+2,…,M+T, that is, the selected R M+1 ...R M+T Cannot be decrypted by class key D * Divisible.

[0134] When performing encryption, D * and all text and category tag numbers R m , m=1,2,…,M+T together with the public key (E2,N2) to encrypt and send, so that the recipient (receiver) receives the ciphertext and the encrypted key D * After that, you can decrypt D2 with your own segmented encrypted private key (D2, N2). * , and then mark the category number R for each fragment in the ciphertext m , m=1,2,…,M+T, it is possible to determine which are the original text encrypted information and which are just interference information, so as to directly remove the interference information fragments used for protection.

[0135] It should be noted that, in order to further increase safety, R1…R M and R M+1 ...R M+T The generation process of R1…R M It uses the key D * Multiply it by the next 1000 random prime numbers, and R M+1 ...R M+T The one used is D * The next 1001 random prime numbers are multiplied together to obtain *There are infinite random prime numbers after that, and there is no specific pattern in selecting prime numbers. As long as the hacker does not crack the segmented encryption private key (D2, N2), it is impossible to calculate the category of each text fragment, and it is impossible to know which of the massive encrypted fragments is the correct and useful information.

[0136] Specifically, in order to deepen the encryption security level and increase the difficulty of cracking, this solution M and subsequent R M+1 ...R M+T Specifically, R1……R M Each category tag number in is obtained by key D * This strategy ensures that even adjacent elements have complex mathematical relationships, and this relationship is based on the product of a large number of highly random prime numbers, which greatly increases uncertainty.

[0137] And for R M+1 ...R M+T In this part, a different strategy is adopted. Although the product of 1001 random prime numbers is used to construct each category label number, it is not directly related to the key D. * Instead of multiplying, use the key D directly * This design further confuses the generated pattern, making it impossible for an attacker to directly reverse-engineer the prime number sequence or determine the true identity of the text fragment even if they master certain pattern features.

[0138] Because prime numbers are chosen without specific patterns and are theoretically infinite in number, unless an attacker can successfully crack the private key used to create the segmented encryption, they will face an almost inexhaustible number of prime number combinations, making it impossible to accurately determine which segments represent the original information and which are intentionally inserted interference. This not only effectively hides truly valuable data fragments, but also makes it nearly impossible to discern information within the vast amount of encrypted fragments. This significantly enhances the resistance of encrypted communications to decryption, providing a powerful defense against potential future threats such as quantum computing.

[0139] 3. Wheel sorting mechanism.

[0140] The design ideas of segmented encryption have been introduced above, but segmentation alone is far from enough, because this segmented encryption itself still does not significantly improve the anti-decryption ability of encryption technology. The robustness of encryption can be improved exponentially through the nesting of double-key combinations, but if the computing power grows exponentially, this nested encryption will still fail. At the same time, the previous segmented encryption only solves the problem of how to identify the original text fragments among many interference fragments, and does not involve how to reorder and combine the fragments. It should be noted that even if the decrypted original text is obtained, if the fragments cannot be recombined in the correct order, the transmission will still be invalid. This requires the design of a wheel sorting mechanism, which can not only enable users to perform encrypted transmission normally and efficiently, but also truly ensure that even if unauthorized third parties increase computing power for brute force cracking, they will fail because they cannot sort the fragments correctly. Therefore, the wheel sorting mechanism in this section is the core of the entire encryption method.

[0141] Following the previous notation, each segment is assigned a sequential number, i.e. K1, ..., K M Numbered 1 to M, at the same time Numbered M+1,…,M+T.

[0142] K1, ..., K M as well as The sorting position can only be selected from 1 to M+T.

[0143] During encrypted transmission, the fragment number information cannot be directly encrypted and transmitted. Otherwise, once an unauthorized third party cracks the fragment number, the previous segment encryption and interference information will lose their protection. It is necessary to design a set of numbering order scrambling methods that can change over time and ensure that the numbering scrambling method cannot be easily cracked. To meet this requirement, the following numbering scrambling algorithm can be designed:

[0144] (1) For K1, ..., K M It is known that the numbers are 1 to M, and the number scrambling method needs to be determined based on the current time interval and the current number of transmissions. These two determining factors are called decision data 1 and decision data 2, marked as N_1 and N_2 respectively.

[0145] The so-called current time refers to the time interval from the current date to a fixed time point accurate to the second. For example, assuming that the current time is 00:00:00 on January 1, 2000, and the selected fixed time is 00:00:00 on January 1, 1900, then the current time interval is (100×365+25)×24×60×60=3155760000 seconds. If it is less than 1 second, it will be counted as 1 second. Therefore, 3155760000 is the decision data 1 for sorting and shuffling, that is, N_1.

[0146] The current number of times the sender has sent the encrypted ciphertext is N_2.

[0147] (2) The sorting and scrambling algorithm designed by the present invention starts from K1, and the calculation formula of its position is to randomly generate a number U_1 from 0-M, and do (U_1 N_2 +N_1)%(M+T) processing will generate a number between 1 and M+T, which is the position code w_1 of segment K1; then generate a random number U_2 from 0-M for K2 again, and do (U_2 N_2 +N_1)%(M+T) processing generates position code w_2.

[0148] If the generated position code w_2 is the same as w_1, the next unoccupied number will be used as the position code w_2.

[0149] If all the following position codes are occupied, the smallest unoccupied number is selected from 1 as the numerical code, and so on, K1, ..., K M The location code.

[0150] The data dictionary is constructed by matching the location code with its subscript, i.e., the number, one to one:

[0151]

[0152] Represents segments K1, ..., K M Where are they located between 1 and M+T, 1≤w1,…,w M ≤M+T. M The location information {w1,…,w M} is marked as W0, and the remaining positions {1,2,…,M+T}-{w1,…,w M Randomly assigned to interference segments The location information of the interference segment is marked as W1.

[0153] (3) Next, W0 will be encrypted using the public key (E1, N1) for text encryption. After receiving the information, the recipient can decrypt it using the private key (D1, N1). W1 is randomly encrypted using any method. It is sufficient to ensure that the data in W1 is different from the data in W0 after encryption. In this way, after receiving the ciphertext, the recipient will parse out meaningless garbled code by decrypting the ciphertext of W1 using the private key (D1, N1). The recipient only needs to decode the position information into the corresponding fragments of 1-M and sort and combine them to complete the reassembly of the fragments and obtain the complete original text.

[0154] This encryption design introduces two uncontrollable variables during the encryption phase: the current time and the number of times messages are sent. This makes the order of the fragments more random, but has no effect on the sender and receiver, and only makes it more difficult for unauthorized third parties to decipher the ciphertext.

[0155] At the same time, if an unauthorized third party wants to use ultra-high computing power to brute-force crack the private key, they need to have the complete corresponding public key encrypted ciphertext as a sample for reverse deduction. However, the position information of the large number of interference fragments introduced is randomly encrypted. If the unauthorized third party wants to know which samples are public key encrypted, they must first obtain the private key to remove the interference samples. Otherwise, the ciphertext samples that are not public key encrypted will become impurities, causing the reverse deduction to fail. This puts the unauthorized third party in a logical dilemma when cracking the ciphertext. This circular protection mechanism ensures that even if the computing power increases dramatically, it will not be able to find the computational entry point for cracking, thus rendering the cracking strategy of simply increasing computing power ineffective.

[0156] Finally, due to K1, ..., K M The position codes are generated using a reciprocating mechanism. When a position code is occupied, it will be postponed. If it is postponed to the last digit, it will start over from the beginning. This mechanism is very similar to the revolver of a revolver, ensuring that the positions are generated randomly without confusion. The vacant positions are filled in a continuous cycle, so it is called a revolver sorting mechanism.

[0157] 4. The encrypted ciphertext is integrated and sent out.

[0158] The aforementioned double key segmented encryption information, category number encryption information, segments K1...K M The encrypted information of the position number and the random encrypted information of the interference item fragment position are integrated together to form a unified ciphertext and sent to the recipient, thereby completing the ciphertext sending process. After the recipient receives the ciphertext, it can decrypt it according to the corresponding two sets of keys.

[0159] Of course, it is understandable that the above detailed process may have other variations, and all relevant variations should fall within the scope of protection of the present invention.

[0160] In the embodiment of the present invention, a data text is divided into a preset number to obtain a plurality of segmented texts; a plurality of interference texts are generated; based on a text encryption public key, the segmented texts and the interference texts are encrypted to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts; based on a category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for a data receiver to identify the data text with a segmented encryption private key corresponding to a segmented encryption public key; a sequence number is added to each segmented encrypted text and interference encrypted text; for the sequence number of each segmented encrypted text, a sequence number of the segmented encrypted text with the sequence number in the current round is generated according to a random number generated in the current round. Sending position information; Based on the text encryption key, encrypt the set of sending position information in each round to obtain the encryption sequence number of the segmented encrypted text; assign the ungenerated sending position information to the sequence number of each interference encrypted text; randomly encrypt the set of sequence numbers of each interference encrypted text to obtain the encryption sequence number of the interference encrypted text; Based on the segmented encryption public key, encrypt the segmented encrypted text and the interference encrypted text arranged by the sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number, and send them to the data recipient, thereby encrypting the original data text in segments and performing rounds. The position of the text is scrambled to increase the difficulty of the algorithm to decipher; by adding meaningless interference text to the segmented text, the complexity of the encrypted information is increased, and the segmented text and the interference text are encrypted together, which increases the difficulty of cracking. Even if a small part is cracked, the original text cannot be directly understood; the category encryption key and dual-key segmented encryption mode are introduced, in which the category tag number helps to distinguish the original text fragment and the interference text, and relies on the receiver's private key for identification, which not only improves the security of data encryption, but also ensures that only the receiver with the correct key can accurately identify the real information, effectively resisting the identification attempt of a third party without the key; by encrypting the sending of position information, the arrangement order of the segmented text is further guaranteed not to be It can be easily revealed that even if the location information is intercepted, its true meaning cannot be interpreted without the corresponding key, which increases the security of the overall system. In addition, the present invention alleviates the problem that the existing technology of asymmetric encryption is prone to security threats due to the increase in quantum computing power. The present invention uses multi-dimensional and dynamically changing encryption strategies, as well as fine management and obfuscation of data fragments, so that without complete encrypted data, it is impossible to reverse the private key cracking by computing power, and without private key identification interference information, it is impossible to obtain complete encrypted data, which effectively enhances the security of data encryption, responds to the problems in the existing technology caused by the increase in computing power and the potential threat of quantum computing, and avoids the risk of encryption method failure due to the breakthrough increase in supercomputer computing power.

[0161] As described above, the present invention has the following beneficial effects:

[0162] 1. Deeply transform the asymmetric encryption algorithm, increase the difficulty of deciphering the algorithm by encrypting the original text in segments and scrambling the order, and design a unique wheel-type sorting and segmentation algorithm for the scrambled order to ensure that the sorting changes are not repeated.

[0163] 2. Meaningless interference text is added to the segmented original text to protect the original text encryption. A unique identification method is designed for the interference text to ensure that the recipient can find all original text fragments from the complex encrypted ciphertext during decryption. Even if an unauthorized third party without the decryption key intercepts the ciphertext, it will not be able to find the original ciphertext from the huge interference text and splice it together.

[0164] 3. Combining a wheel sorting mechanism, segmented encryption, and randomized encryption of interference fragments: Without the complete encrypted data, it is impossible to reverse the private key cracking with computing power, and without the private key identifying interference information, it is impossible to obtain the complete encrypted data. This creates a chicken-and-egg dilemma for unauthorized third parties trying to crack the ciphertext, preventing the risk of encryption methods becoming ineffective simply due to a breakthrough in supercomputer computing power.

[0165] The present invention also provides a data encryption and decryption device, as described in the following embodiments. Since the principle of the problem solved by the device is similar to that of the data encryption and decryption method, the implementation of the device can refer to the implementation of the data encryption and decryption method, and the repeated parts will not be repeated.

[0166] The embodiment of the present invention also provides a data encryption device to effectively enhance the security of data encryption and address the problems caused by the increase in computing power and the potential threat of quantum computing in the existing technology, such as Figure 4 As shown, the device includes:

[0167] The text processing module 401 is configured to divide the data text into a predetermined number of divided texts, generate a plurality of interference texts, and encrypt the divided texts and the interference texts based on a text encryption public key to obtain a plurality of divided encrypted texts and a plurality of interference encrypted texts.

[0168] The class encryption module 402 is configured to add a class tag number to each segmented encrypted text and interference encrypted text based on the class encryption key; the class tag number is used by the data receiver to identify the data text using the segment encryption private key corresponding to the segment encryption public key;

[0169] The sequence number processing module 403 is configured to add a sequence number to each segmented encrypted text and interference encrypted text; generate, for the sequence number of each segmented encrypted text, the sending location information of the segmented encrypted text with the sequence number in the current round based on the random number generated in the current round; encrypt the set of the sending location information in each round based on the text encryption key to obtain an encrypted sequence number for the segmented encrypted text; assign the ungenerated sending location information to the sequence number of each interference encrypted text; and randomly encrypt the set of sequence numbers of each interference encrypted text to obtain an encrypted sequence number for the interference encrypted text.

[0170] The encryption sending module 404 is used to encrypt and send the segmented encrypted text and interference encrypted text arranged by sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number to the data recipient based on the segmented encryption public key.

[0171] In one embodiment, the class encryption key is a randomly generated prime number;

[0172] Based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text, including:

[0173] Based on the randomly generated prime number, for each segmented encrypted text, selecting a value whose remainder processing of the randomly generated prime number is zero; and using the value as a category tag number added to the segmented encrypted text;

[0174] Based on the randomly generated prime number, for each interference encrypted text, a value whose result of taking the remainder of the randomly generated prime number is not zero is selected; and the value is used as a category tag number added to the interference encrypted text.

[0175] In one embodiment, the total number of sent position information is the sum of the number of segmented texts and interference texts;

[0176] For each sequence number of the encrypted text segment, the sending location information of the encrypted text segment with the sequence number in the current round is generated according to the random number generated in the current round, including:

[0177] For each sequence number of the encrypted text segment, the sending position information of the encrypted text segment with the sequence number in the current round is generated according to the preset current time parameter, the current sending number parameter and the random number generated in the current round.

[0178] In one embodiment, based on the randomly generated prime number, for each segmented encrypted text, selecting a value whose remainder processing of the randomly generated prime number is zero includes:

[0179] For each segmented encrypted text, randomly select a first preset number of prime numbers that are greater than the randomly generated prime number; and use the product of the randomly selected prime number and the randomly generated prime number as the value resulting from a remainder processing of the randomly generated prime number being zero;

[0180] For each interference encrypted text, a value whose result of performing remainder processing on the randomly generated prime number is not zero is selected, including:

[0181] For each interference encrypted text, a second preset number of prime numbers greater than the randomly generated prime number are randomly selected; and the product of the randomly selected prime numbers is used as a non-zero value resulting from a remainder processing of the randomly generated prime number.

[0182] In one embodiment, for each sequence number of the encrypted text segment, based on a preset current time parameter, a current number of transmission parameters, and a random number generated in the current round, the sending position information of the encrypted text segment with the sequence number in the current round is generated, including:

[0183] If the sending location information of the segmented encrypted text with the sequence number generated in the current round is the same as the sending location information of the segmented encrypted text with the sequence number in the previous round, the sending location information is incremented by a preset number of digits to obtain an updated sending location information value;

[0184] If the updated value of the sending location information is the same as the sending location information of the segmented encrypted text with the same sequence number in the previous round, the above operation is repeated until the updated value of the sending location information is different from the sending location information of the segmented encrypted text with the same sequence number in the previous round;

[0185] The sending position information update value is used as the sending position information of the segmented encrypted text with the sequence number in the current round.

[0186] In one embodiment, it further includes:

[0187] If the updated value of the sending position information obtained by repeatedly performing the above operation is the maximum value of the sending position information, and the maximum value of the sending position information is the sending position information in the previous round, the above operation of obtaining the updated value of the sending position information is restarted from the minimum value of the sending position information until the sending position information that was not generated in the previous round is determined.

[0188] In one embodiment, it further includes:

[0189] After generating the sending location information of the segmented encrypted text with the sequence number in the current round, a data dictionary carrying the association relationship between the segmented encrypted text and the sending location information is generated based on the segmented encrypted text and the sending location information of each round.

[0190] In the embodiment of the present invention, a data text is divided into a preset number to obtain a plurality of segmented texts; a plurality of interference texts are generated; based on a text encryption public key, the segmented texts and the interference texts are encrypted to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts; based on a category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for a data receiver to identify the data text with a segmented encryption private key corresponding to a segmented encryption public key; a sequence number is added to each segmented encrypted text and interference encrypted text; for the sequence number of each segmented encrypted text, a sequence number of the segmented encrypted text with the sequence number in the current round is generated according to a random number generated in the current round. Sending position information; Based on the text encryption key, encrypt the set of sending position information in each round to obtain the encryption sequence number of the segmented encrypted text; assign the ungenerated sending position information to the sequence number of each interference encrypted text; randomly encrypt the set of sequence numbers of each interference encrypted text to obtain the encryption sequence number of the interference encrypted text; Based on the segmented encryption public key, encrypt the segmented encrypted text and the interference encrypted text arranged by the sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number, and send them to the data recipient, thereby encrypting the original data text in segments and performing rounds. The position of the text is scrambled to increase the difficulty of the algorithm to decipher; by adding meaningless interference text to the segmented text, the complexity of the encrypted information is increased, and the segmented text and the interference text are encrypted together, which increases the difficulty of cracking. Even if a small part is cracked, the original text cannot be directly understood; the category encryption key and dual-key segmented encryption mode are introduced, in which the category tag number helps to distinguish the original text fragment and the interference text, and relies on the receiver's private key for identification, which not only improves the security of data encryption, but also ensures that only the receiver with the correct key can accurately identify the real information, effectively resisting the identification attempt of a third party without the key; by encrypting the sending of position information, the arrangement order of the segmented text is further guaranteed not to be It can be easily revealed that even if the location information is intercepted, its true meaning cannot be interpreted without the corresponding key, which increases the security of the overall system. In addition, the present invention alleviates the problem that the existing technology of asymmetric encryption is prone to security threats due to the increase in quantum computing power. The present invention uses multi-dimensional and dynamically changing encryption strategies, as well as fine management and obfuscation of data fragments, so that without complete encrypted data, it is impossible to reverse the private key cracking by computing power, and without private key identification interference information, it is impossible to obtain complete encrypted data, which effectively enhances the security of data encryption, responds to the problems in the existing technology caused by the increase in computing power and the potential threat of quantum computing, and avoids the risk of encryption method failure due to the breakthrough increase in supercomputer computing power.

[0191] The embodiment of the present invention provides a data decryption method to effectively enhance the security of data encryption and address the problems caused by the increase in computing power and the potential threat of quantum computing in the existing technology, such as Figure 5 As shown, the method includes:

[0192] Step 501: receiving encrypted data sent by a data recipient;

[0193] Step 502: Determine a class decryption key corresponding to the class encryption key using the segment encryption private key; and use the class decryption key to identify multiple segmented ciphertexts in the encrypted data according to the class identification number in the encrypted data.

[0194] Step 503: decrypt the multiple encrypted text segments using the text encryption private key to obtain multiple text segments;

[0195] Step 504: Using the text encryption private key, decrypt the encrypted sequence number of the encrypted text segment in the encrypted transmission data to obtain the transmission location information of the encrypted text segment;

[0196] Step 505: Restore the data text based on the sending location information of the segmented encrypted text and the multiple segmented texts.

[0197] In the above embodiment, the decryption method is based on a data encryption technology, which aims to securely restore information encrypted by the data encryption party. The specific steps are as follows:

[0198] First, the decryption party receives a ciphertext data packet that has undergone complex encryption processing from the data receiver. The data packet contains segmented encrypted original text segments, interference segments, and corresponding control information.

[0199] Using the segment encryption private key, the decryptor can determine and obtain the corresponding category decryption key. This step is based on the dual-key mechanism used in the encryption process, ensuring that only the legitimate recipient can correctly identify and classify the encrypted text.

[0200] By applying the category decryption key, the decryptor can identify the multiple encrypted text segments that carry category identification numbers from the ciphertext. These numbers help distinguish which original text segments need to be decrypted and which are interference items, laying the foundation for subsequent processing.

[0201] The decryption party then uses the private key to decrypt the identified encrypted segments one by one, restoring the original segmented text. This step ensures the recovery of the data content, but the text segments are still in a scrambled state.

[0202] Furthermore, the encrypted sequence numbers are decrypted using the text encryption private key. These numbers indicate the correct position of each segmented text in the original text. This step is crucial for ultimately restoring the complete original text.

[0203] Finally, based on the decrypted text segments and their corresponding location information, the decryptor can reassemble all the segments in the correct order, thereby fully restoring the original data text. This process involves using location information to sort and splice the segmented text to ensure the integrity and readability of the information.

[0204] In summary, this decryption method effectively reverses the encryption process through a series of carefully designed steps, which not only ensures the secure transmission of information, but also overcomes the complexity introduced by segmentation, encryption, sorting disruption, and interference information, and achieves accurate and unambiguous decryption of encrypted data.

[0205] The following is an example to illustrate the above data decryption method: In the data decryption method embodiment of the present invention, the data decryption party must follow strict steps to restore the original data text according to the encryption process described above, ensuring accurate and lossless restoration of the information. The specific implementation steps are as follows:

[0206] 1. Receive and initially parse the ciphertext: The decryptor first receives the encrypted data packet sent by the encryptor via a secure channel. This data packet includes the segmented ciphertext, the scrambled ciphertext, the encryption sequence number, the category tag number, and necessary auxiliary information (such as the encrypted form of the category encryption key). The decryptor uses the private key corresponding to the segmented encryption public key to decrypt the category encryption key for use in subsequent steps.

[0207] 2. Identify and classify text fragments: The decryptor uses the decrypted category decryption key to identify the category marker numbers in the encrypted data. By calculating the mathematical relationship (e.g., modulo operation) between each text fragment and the category decryption key, the decryptor can distinguish between the actual segmented encrypted text and the scrambled encrypted text, ensuring that only the actual data fragments are decrypted.

[0208] 3. Decrypt the segmented text: The decryptor uses the private key that encrypted the identified segmented text to decrypt it one by one. This step restores the original content of the segmented text, but the order of these text segments is not restored at this time.

[0209] 4. Decrypt and apply the position information: Next, the decryptor uses the private key that encrypted the text to decrypt the encrypted sequence number, thereby obtaining the sending position information of the segmented text. This position information indicates the correct order of the segmented text in the original text. If there is a mechanism to handle position conflicts (such as the rule of backward deferred when encountering repeated positions), the decryptor must reverse the parsing according to the same rules to ensure the correct application of the position information.

[0210] 5. Reconstructing the original data: Based on the decrypted segmented text and its corresponding location information, the decryptor reorders the data segments. This step may involve sorting the segments according to a location information dictionary, reconstructing the segments in the correct order, and eliminating any interfering text to fully restore the original data.

[0211] 6. Integrity verification: To ensure the integrity of the decrypted data, the decryptor can further calculate the hash value of the restored original text and compare it with the hash value attached when sending to verify whether the data has been tampered with during transmission.

[0212] Through the detailed steps described above, the decryptor can efficiently and accurately recover the original information from the encrypted data. The entire process not only relies on the safekeeping of the private key, but also makes full use of dynamic factors such as time and number of transmissions, as well as the complexity of mathematical algorithms, effectively preventing unauthorized access and information tampering, and ensuring the security and reliability of data transmission.

[0213] In an embodiment of the decryption method of the present invention, the data receiver first receives an encrypted data packet sent by the sender. This data packet contains carefully designed encrypted segmented text, interference encrypted text, and their corresponding encryption sequence numbers, category identifiers, and so on. The decryption process is meticulously designed to restore the original data text while ensuring its integrity and security. The data receiving module first ensures the secure receipt of the encrypted data, including the encrypted segmented text, interference text, and their respective encryption sequence numbers and category identifiers. Using the segmented encryption private key, the decryption module first decrypts the category identifiers to identify the authentic data segmented text and the interference text. This process relies on the category encryption key, ensuring that only the legitimate recipient can accurately distinguish between them. Using the text encryption private key, the decryption module decrypts the encrypted sequence numbers of the segmented text and obtains the sending location information of the segmented text. The key to this step is that even if the location information is intercepted, without the correct key, it remains undecipherable, enhancing security. Based on the decrypted sending location information, the data text restoration module reorganizes the segmented text and interference text into their original order, removing the interference text and reconstructing the complete data text. This process effectively counters any attack that attempts to reconstruct the original text by analyzing location information. The decryption method of the present invention uses a dynamically adjusted algorithm for generating transmission location information, combined with current time parameters and the number of transmissions, to ensure that each encrypted data position arrangement is unique. Even if the same data is sent at different times, its encrypted layout will be significantly different, greatly increasing the difficulty of cracking. Even in the face of the potential threat of quantum computing, since it requires cracking not only a single key but also the location information and category tags of each segment, as well as the overall dynamic structure, this significantly increases the complexity of cracking and ensures data security. Through this multi-dimensional decryption process, the present invention not only overcomes the vulnerability of traditional asymmetric encryption algorithms to increased computing power, especially quantum computing, but also establishes a solid defense by combining category tags with dual-key segmented encryption and dynamic encryption of location information. This method ensures that the security of data encryption does not rely solely on the difficulty of decryption computing power. Instead, through a series of complex and interdependent mechanisms, unauthorized access to the encrypted information without the private key is difficult to reconstruct the meaningful original text, even if it obtains partial encrypted information. This effectively protects against the potential impact of increased computing power and quantum computing on encryption technology.

[0214] The embodiment of the present invention also provides a data decryption device to effectively enhance the security of data encryption and address the problems caused by the increase in computing power and the potential threat of quantum computing in the existing technology, such as Figure 6 As shown, the device includes:

[0215] The data receiving module 601 is used to receive encrypted data sent by the data receiving party;

[0216] The segment decryption module 602 is configured to determine a class decryption key corresponding to the class encryption key using the segment encryption private key; and to identify multiple segmented ciphertexts in the encrypted data using the class decryption key according to the class identification number in the encrypted data.

[0217] A text decryption module 603 is used to decrypt the multiple encrypted text segments using a text encryption private key to obtain multiple text segments;

[0218] The sending location decryption module 604 is used to decrypt the encrypted sequence number of the encrypted text segment in the encrypted sending data using the text encryption private key to obtain the sending location information of the encrypted text segment;

[0219] The data text restoration module 605 is used to restore the data text based on the sending location information of the segmented encrypted text and the multiple segmented texts.

[0220] In a specific embodiment of this invention, the proposed "data decryption device" is a highly integrated and highly secure system specifically designed to combat the growing computing power challenges and potential threats of quantum computing. Through a sophisticated modular design, the device ensures that encrypted data can be decrypted securely and efficiently. Its specific structure and functions are as follows:

[0221] 1. Data receiving module

[0222] This module, serving as the front-end of the device, is responsible for receiving encrypted data packets transmitted by the data sender over a secure network channel. These packets contain key information such as the encrypted segmented text, interference text, category identifier, and encryption sequence number. The data receiving module must ensure data integrity and provide accurate input for subsequent decryption operations.

[0223] 2. Segment decryption module

[0224] This module uses the segmented encryption private key as the startup key and, through built-in algorithmic logic, derives the category decryption key. This process, based on asymmetric encryption principles, ensures key security and uniqueness. After obtaining the category decryption key, the module analyzes the category marker numbers within the encrypted data, using this as a clue to identify the actual data segmentation encrypted text and the obfuscated interference text, laying the foundation for accurate decryption.

[0225] 3. Text decryption module

[0226] Using the actual encrypted text segments obtained from the segment decryption module, this module decrypts them one by one using the private key that encrypted the text, converting the encrypted text segments back into plaintext. This process, based on an asymmetric encryption algorithm, ensures that only the legitimate recipient can perform the decryption operation.

[0227] 4. Send location decryption module

[0228] This module, similarly relying on the private key used to encrypt the text, decrypts the encrypted sequence numbers associated with the encrypted text segments within the encrypted data. The resulting decrypted location information provides crucial guidance for restoring the correct data sequence. Through decryption, the device can determine the correct location of each segment within the original data, preparing for final text reconstructive work.

[0229] 5. Data text restoration module

[0230] Based on the location information obtained from the location decryption module, this module rearranges the individual segments into the correct order. This process precisely places all segments in their proper locations, while eliminating any interfering text, ultimately restoring the original, unencrypted data. Furthermore, to ensure the integrity of the decrypted data, the module can integrate verification mechanisms, such as comparing the data hash values ​​before and after decryption, to verify whether the data has been tampered with during transmission.

[0231] In summary, the data decryption device of the present invention, through the collaborative operation of the above-mentioned modules, not only ensures the secure decryption of encrypted data, but also effectively improves the reliability and security of data transmission, especially in the context of increased computing power and quantum computing challenges, providing an advanced solution for data protection.

[0232] An embodiment of the present invention further provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned data encryption and decryption method when executing the computer program.

[0233] An embodiment of the present invention provides an embodiment of a computer device for implementing all or part of the above-mentioned data encryption and decryption method. The computer device specifically includes the following contents:

[0234] A processor, a memory, a communications interface, and a bus; wherein the processor, the memory, and the communications interface communicate with each other via the bus; the communications interface is used to implement information transmission between related devices; the computer device can be a desktop computer, a tablet computer, a mobile terminal, etc., but this embodiment is not limited thereto. In this embodiment, the computer device can be implemented with reference to the embodiment for implementing the data encryption and decryption method and the embodiment for implementing the data encryption and decryption device, the contents of which are incorporated herein and repeated parts are not repeated.

[0235] Figure 7 1 is a schematic block diagram of the system structure of the computer device 1000 according to an embodiment of the present application. Figure 7 As shown, the computer device 1000 may include a central processor 1001 and a memory 1002; the memory 1002 is coupled to the central processor 1001. Figure 7 is exemplary; other types of structures may also be used to supplement or replace this structure to implement telecommunication functions or other functions.

[0236] In one embodiment, the data encryption and decryption functions may be integrated into the central processing unit 1001. The central processing unit 1001 may be configured to perform the following control:

[0237] Segment the data text into a preset number to obtain a plurality of segmented texts; generate a plurality of interference texts;

[0238] Encrypting the segmented text and the interference text based on a text encryption public key to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts;

[0239] Based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for the data receiver to identify the data text using the segment encryption private key corresponding to the segment encryption public key;

[0240] Adding a sequence number to each segmented encrypted text and interference encrypted text; generating, for the sequence number of each segmented encrypted text, sending location information of the segmented encrypted text with the sequence number in the current round based on a random number generated in the current round; encrypting the set of sending location information in each round based on the text encryption key to obtain an encrypted sequence number of the segmented encrypted text; assigning the ungenerated sending location information to the sequence number of each interference encrypted text; and randomly encrypting the set of sequence numbers of each interference encrypted text to obtain an encrypted sequence number of the interference encrypted text;

[0241] Based on the segmented encryption public key, the segmented encrypted text and interference encrypted text arranged by sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number are encrypted and sent to the data recipient.

[0242] or,

[0243] Receive encrypted data sent by the data recipient;

[0244] Determine a category decryption key corresponding to the category encryption key using the segment encryption private key; identify multiple segmented ciphertexts in the encrypted data using the category decryption key according to the category tag number in the encrypted data;

[0245] Using a text encryption private key, decrypt multiple segmented encrypted texts to obtain multiple segmented texts;

[0246] Using the text encryption private key, the encrypted sequence number of the split encrypted text in the encrypted transmission data is decrypted to obtain the transmission location information of the split encrypted text;

[0247] The data text is restored based on the sending position information of the divided encrypted text and the plurality of divided texts.

[0248] In another embodiment, the data encryption and decryption device can be configured separately from the central processing unit 1001. For example, the data encryption and decryption device can be configured as a chip connected to the central processing unit 1001, and the data encryption and decryption function can be realized under the control of the central processing unit.

[0249] like Figure 7 As shown, the computer device 1000 may further include: a communication module 1003, an input unit 1004, an audio processor 1005, a display 1006, and a power supply 1007. It is worth noting that the computer device 1000 does not necessarily have to include Figure 7 In addition, the computer device 1000 may also include all components shown in Figure 7 For components not shown, reference may be made to the prior art.

[0250] like Figure 7 As shown, the central processing unit 1001 is sometimes also referred to as a controller or an operation control unit, and may include a microprocessor or other processor device and / or logic device. The central processing unit 1001 receives inputs and controls the operations of various components of the computer device 1000 .

[0251] Memory 1002 may be, for example, one or more of a cache, flash memory, hard drive, removable media, volatile memory, non-volatile memory, or other suitable devices. It may store the aforementioned device-related information and may also store programs that execute the relevant information. The CPU 1001 may execute the programs stored in memory 1002 to implement information storage or processing.

[0252] Input unit 1004 provides input to CPU 1001. Input unit 1004 may be, for example, a keypad or touch input device. Power supply 1007 is used to provide power to computer device 1000. Display 1006 is used to display objects such as images and text. This display may be, for example, an LCD display, but is not limited thereto.

[0253] The memory 1002 may be a solid-state memory, such as a read-only memory (ROM), random access memory (RAM), or SIM card. Alternatively, it may be a memory that retains information even when power is off, can be selectively erased, and is provided with more data. Examples of such memory are sometimes referred to as EPROMs. The memory 1002 may also be some other type of device. The memory 1002 includes a buffer memory 1021 (sometimes referred to as a buffer). The memory 1002 may include an application / function storage unit 1022 for storing application programs and function programs or processes used by the central processing unit 1001 to execute the operations of the computer device 1000.

[0254] The memory 1002 may also include a data storage unit 1023 for storing data, such as contacts, digital data, pictures, sounds, and / or any other data used by the computer device. The driver storage unit 1024 of the memory 1002 may include various driver programs for the computer device for communication functions and / or for executing other functions of the computer device (such as messaging applications, address book applications, etc.).

[0255] The communication module 1003 is a transmitter / receiver 1003 that sends and receives signals via the antenna 1008. The communication module (transmitter / receiver) 1003 is coupled to the central processor 1001 to provide input signals and receive output signals, which may be the same as the case of a conventional mobile communication terminal.

[0256] Based on different communication technologies, multiple communication modules 1003 can be provided in the same computer device, such as a cellular network module, a Bluetooth module, and / or a wireless local area network module. The communication module (transmitter / receiver) 1003 is also coupled to a speaker 1009 and a microphone 1010 via an audio processor 1005 to provide audio output via the speaker 1009 and receive audio input from the microphone 1010, thereby implementing common telecommunication functions. The audio processor 1005 may include any suitable buffer, decoder, amplifier, etc. Furthermore, the audio processor 1005 is coupled to the central processing unit 1001, enabling local recording via the microphone 1010 and playback of stored audio via the speaker 1009.

[0257] An embodiment of the present invention further provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program implements the above-mentioned data encryption and decryption method.

[0258] An embodiment of the present invention further provides a computer program product, which includes a computer program. When the computer program is executed by a processor, it implements the above-mentioned data encryption and decryption method.

[0259] In the embodiment of the present invention, a data text is divided into a preset number to obtain a plurality of segmented texts; a plurality of interference texts are generated; based on a text encryption public key, the segmented texts and the interference texts are encrypted to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts; based on a category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for a data receiver to identify the data text with a segmented encryption private key corresponding to a segmented encryption public key; a sequence number is added to each segmented encrypted text and interference encrypted text; for the sequence number of each segmented encrypted text, a sequence number of the segmented encrypted text with the sequence number in the current round is generated according to a random number generated in the current round. Sending position information; Based on the text encryption key, encrypt the set of sending position information in each round to obtain the encryption sequence number of the segmented encrypted text; assign the ungenerated sending position information to the sequence number of each interference encrypted text; randomly encrypt the set of sequence numbers of each interference encrypted text to obtain the encryption sequence number of the interference encrypted text; Based on the segmented encryption public key, encrypt the segmented encrypted text and the interference encrypted text arranged by the sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number, and send them to the data recipient, thereby encrypting the original data text in segments and performing rounds. The position of the text is scrambled to increase the difficulty of the algorithm to decipher; by adding meaningless interference text to the segmented text, the complexity of the encrypted information is increased, and the segmented text and the interference text are encrypted together, which increases the difficulty of cracking. Even if a small part is cracked, the original text cannot be directly understood; the category encryption key and dual-key segmented encryption mode are introduced, in which the category tag number helps to distinguish the original text fragment and the interference text, and relies on the receiver's private key for identification, which not only improves the security of data encryption, but also ensures that only the receiver with the correct key can accurately identify the real information, effectively resisting the identification attempt of a third party without the key; by encrypting the sending of position information, the arrangement order of the segmented text is further guaranteed not to be It can be easily revealed that even if the location information is intercepted, its true meaning cannot be interpreted without the corresponding key, which increases the security of the overall system. In addition, the present invention alleviates the problem that the existing technology of asymmetric encryption is prone to security threats due to the increase in quantum computing power. The present invention uses multi-dimensional and dynamically changing encryption strategies, as well as fine management and obfuscation of data fragments, so that without complete encrypted data, it is impossible to reverse the private key cracking by computing power, and without private key identification interference information, it is impossible to obtain complete encrypted data, which effectively enhances the security of data encryption, responds to the problems in the existing technology caused by the increase in computing power and the potential threat of quantum computing, and avoids the risk of encryption method failure due to the breakthrough increase in supercomputer computing power.

[0260] It will be understood by those skilled in the art that embodiments of the present invention may be provided as methods, systems, or computer program products. Thus, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Furthermore, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0261] The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, as well as combinations of processes and / or blocks in the flowcharts 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, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowcharts and / or block diagrams. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0262] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0263] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0264] The specific embodiments described above further illustrate the objectives, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above description is only a specific embodiment of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A data encryption method, characterized in that: Applicable to data encryption, including: Segmenting the data text into a preset number to obtain a plurality of segmented texts; generating a plurality of interference texts; encrypting the segmented texts and the interference texts based on a text encryption public key to obtain a plurality of segmented encrypted texts and a plurality of interference encrypted texts; Based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text; the category tag number is used for the data receiver to identify the data text using the segment encryption private key corresponding to the segment encryption public key; Adding a sequence number to each segmented encrypted text and interference encrypted text; generating, for the sequence number of each segmented encrypted text, sending location information of the segmented encrypted text with the sequence number in the current round based on a random number generated in the current round; encrypting the set of sending location information in each round based on the text encryption key to obtain an encrypted sequence number for the segmented encrypted text; assigning the ungenerated sending location information to the sequence number of each interference encrypted text; and randomly encrypting the set of sequence numbers of each interference encrypted text to obtain an encrypted sequence number for the interference encrypted text. Based on the segmented encryption public key, the segmented encrypted text and interference encrypted text arranged by sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number are encrypted and sent to the data recipient.

2. The method according to claim 1, wherein The class encryption key is a randomly generated prime number; Based on the category encryption key, a category tag number is added to each segmented encrypted text and interference encrypted text, including: Based on the randomly generated prime number, for each segmented encrypted text, selecting a value whose remainder processing of the randomly generated prime number is zero; and using the value as a category tag number added to the segmented encrypted text; Based on the randomly generated prime number, for each interference encrypted text, a value whose result of taking the remainder of the randomly generated prime number is not zero is selected; and the value is used as a category tag number added to the interference encrypted text.

3. The method according to claim 2, wherein Based on the randomly generated prime number, for each segmented encrypted text, selecting a value whose remainder processing of the randomly generated prime number is zero, including: For each segmented encrypted text, randomly select a first preset number of prime numbers that are greater than the randomly generated prime number; and use the product of the randomly selected prime number and the randomly generated prime number as the value resulting from a remainder processing of the randomly generated prime number being zero; For each interference encrypted text, a value whose result of performing remainder processing on the randomly generated prime number is not zero is selected, including: For each interference encrypted text, a second preset number of prime numbers greater than the randomly generated prime number are randomly selected; and the product of the randomly selected prime numbers is used as a non-zero value resulting from a remainder processing of the randomly generated prime number.

4. The method according to claim 1, wherein For each sequence number of the encrypted text segment, the sending location information of the encrypted text segment with the sequence number in the current round is generated according to the preset current time parameter, the current sending number parameter and the random number generated in the current round, including: If the sending location information of the segmented encrypted text with the sequence number generated in the current round is the same as the sending location information of the segmented encrypted text with the sequence number in the previous round, the sending location information is incremented by a preset number of digits to obtain an updated sending location information value; If the updated value of the sending location information is the same as the sending location information of the segmented encrypted text with the same sequence number in the previous round, the above operation is repeated until the updated value of the sending location information is different from the sending location information of the segmented encrypted text with the same sequence number in the previous round; The sending position information update value is used as the sending position information of the segmented encrypted text with the sequence number in the current round.

5. The method according to claim 4, wherein Also includes: If the updated value of the sending position information obtained by repeatedly performing the above operation is the maximum value of the sending position information, and the maximum value of the sending position information is the sending position information in the previous round, the above operation of obtaining the updated value of the sending position information is restarted from the minimum value of the sending position information until the sending position information that was not generated in the previous round is determined.

6. The method according to claim 1, wherein The total number of sent position information is the sum of the number of segmented texts and interference texts; For each sequence number of the encrypted text segment, the sending location information of the encrypted text segment with the sequence number in the current round is generated according to the random number generated in the current round, including: For each sequence number of the encrypted text segment, the sending position information of the encrypted text segment with the sequence number in the current round is generated according to the preset current time parameter, the current sending number parameter and the random number generated in the current round.

7. The method according to claim 1, wherein Also includes: After generating the sending location information of the segmented encrypted text with the sequence number in the current round, a data dictionary carrying the association relationship between the segmented encrypted text and the sending location information is generated based on the segmented encrypted text and the sending location information of each round.

8. A data encryption device, characterized in that: Applicable to data encryption, including: A text processing module is used to divide the data text into a preset number of parts to obtain a plurality of divided texts; generate a plurality of interference texts; and encrypt the divided texts and the interference texts based on a text encryption public key to obtain a plurality of divided encrypted texts and a plurality of interference encrypted texts; A category encryption module, configured to add a category tag number to each segmented encrypted text and interference encrypted text based on a category encryption key; the category tag number is used by a data receiver to identify the data text using a segmented encryption private key corresponding to the segmented encryption public key; The sequence number processing module is configured to add a sequence number to each segmented encrypted text and interference encrypted text; for each sequence number of the segmented encrypted text, generate sending location information of the segmented encrypted text with the sequence number in the current round based on the random number generated in the current round; encrypt the set of sending location information in each round based on the text encryption key to obtain an encrypted sequence number of the segmented encrypted text; assign the ungenerated sending location information to the sequence number of each interference encrypted text; and randomly encrypt the set of sequence numbers of each interference encrypted text to obtain an encrypted sequence number of the interference encrypted text; The encryption sending module is used to encrypt and send the segmented encrypted text and interference encrypted text arranged by sending position information, the encryption sequence number of the segmented encrypted text, the encryption sequence number of the interference encrypted text, the category encryption key, and the category tag number to the data recipient based on the segmented encryption public key.

9. A method for decrypting data, characterized in that: Applicable to data decryption, including: Receive encrypted data sent by the data recipient; Determine a category decryption key corresponding to the category encryption key using the segment encryption private key; identify multiple segmented ciphertexts in the encrypted data using the category decryption key according to the category tag number in the encrypted data; Using a text encryption private key, decrypt multiple segmented encrypted texts to obtain multiple segmented texts; Using the text encryption private key, the encrypted sequence number of the split encrypted text in the encrypted transmission data is decrypted to obtain the transmission location information of the split encrypted text; The data text is restored based on the sending position information of the divided encrypted text and the plurality of divided texts.

10. A data decryption device, characterized in that: Applicable to data decryption, including: A data receiving module is used to receive encrypted data sent by a data receiver; A segment decryption module is used to determine a category decryption key corresponding to the category encryption key using the segment encryption private key; using the category decryption key, based on the category tag number in the encrypted transmission data, to identify multiple segmented encrypted texts in the encrypted transmission data; A text decryption module is used to decrypt multiple segmented encrypted texts using a text encryption private key to obtain multiple segmented texts; The sending location decryption module is used to decrypt the encrypted sequence number of the split encrypted text in the encrypted sending data using the text encryption private key to obtain the sending location information of the split encrypted text; The data text restoration module is used to restore the data text based on the sending location information of the segmented encrypted text and the multiple segmented texts.

11. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the computer program, the method of any one of claims 1 to 7 or claim 9 is implemented.

12. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method of any one of claims 1 to 7 or claim 9 is implemented.

13. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the method of any one of claims 1 to 7 or claim 9 is implemented.

Images