A data encryption method and system based on quantum computing resistance

Abstract

The present invention relates to the field of data security technology, and discloses a data encryption method and system based on anti-quantum computing, the method comprising: obtaining text data, letter data and image data, performing a first elliptic curve homology encryption according to the text data to obtain text encryption features, performing a second elliptic curve homology encryption according to the letter data to obtain letter encryption features, performing a third elliptic curve homology encryption according to the image data to obtain image encryption features, performing data integration according to the text encryption features, letter encryption features and image encryption features to obtain an encrypted data set, performing a first encryption according to the encrypted data set to obtain a first encryption element, performing a second encryption according to the first encryption element to obtain a second encryption element, and sending the second encryption element to a data recipient. The method can improve the security of encrypted data and the ability to resist quantum computing attacks.

Description

Technical Field

[0001] The present invention relates to the field of data security technology, and in particular to a data encryption method and system based on quantum computing resistance. Background Art

[0002] With the continuous development of quantum computing technology, it has become an important research direction in the fields of computer science, physics and information security. Quantum computers use quantum bits for calculations, and through principles such as quantum superposition and entanglement, they can show advantages far beyond classical computers when dealing with certain types of problems. For example, quantum computing has significant potential in the fields of large-scale data search, optimization problems and complex calculations.

[0003] Existing classical encryption systems face huge security threats. Traditional symmetric and asymmetric encryption methods rely on the guarantee of computational difficulty, while quantum computers can efficiently crack these encryption systems, threatening the security of information. Although quantum encryption technology offers the potential to solve this problem, there are still some technical obstacles in practical application. The imperfection and openness of quantum communication channels lead to loopholes in quantum key distribution, and quantum encryption technology faces limitations in key generation rate, transmission efficiency, and key storage.

[0004] The rapid development of quantum computing technology has posed an unprecedented threat to traditional encryption technology. Currently, widely used symmetric and asymmetric encryption methods, such as AES and RSA, rely on the unbreakable nature of classical computing problems in cryptography. These encryption methods, which were once considered secure, have become extremely vulnerable to the threat of quantum computing. This requires a new encryption method in the field of data security technology to resist quantum computing attacks. Summary of the invention

[0005] The present invention provides a data encryption method and system based on anti-quantum computing to improve the security of encrypted data and the ability to resist quantum computing attacks.

[0006] In a first aspect, in order to solve the above technical problems, the present invention provides a data encryption method based on quantum computing resistance, comprising:

[0007] Acquire data to be encrypted; wherein the data to be encrypted includes: text data, letter data and image data;

[0008] Performing first elliptic curve homology encryption on the text data to obtain text encryption features;

[0009] Performing second elliptic curve homology encryption according to the letter data to obtain a letter encryption feature;

[0010] Performing third elliptic curve homology encryption according to the image data to obtain image encryption features;

[0011] Filling the text encryption feature, letter encryption feature and image encryption feature to a predetermined standard length respectively, and integrating the data in a predetermined order to obtain an encrypted data set;

[0012] Performing a first encryption on the encrypted data set to obtain a first encryption element;

[0013] A second encryption is performed based on the first encryption element to obtain a second encryption element, and the second encryption element is sent to a data recipient.

[0014] Preferably, the first elliptic curve homology encryption is performed according to the text data to obtain the text encryption feature, including:

[0015] Input the text data into a hash function to obtain a hexadecimal text data hash value;

[0016] Convert the hexadecimal text data hash value into a decimal text data hash value;

[0017] Generate a first coordinate according to the decimal text data hash value to obtain a first elliptic curve horizontal coordinate;

[0018] The abscissa of the first elliptic curve is calculated by the following formula:

[0019] ;

[0020] in, is the abscissa of the first elliptic curve, For decimal text data Bit hash value, The length of the hash value of the decimal text data;

[0021] Substituting the abscissa of the first elliptic curve into the equation of the first elliptic curve to obtain the ordinate on the first elliptic curve;

[0022] Wherein, the first elliptic curve equation is:

[0023] ;

[0024] in, is the ordinate on the first elliptic curve, , and is the first elliptic curve extension parameter;

[0025] Integrate the ordinate on the first elliptic curve and the abscissa on the first elliptic curve to obtain a point on the first elliptic curve;

[0026] A hash calculation is performed based on the points on the first elliptic curve to obtain text encryption features.

[0027] Preferably, performing second elliptic curve homology encryption according to the letter data to obtain letter encryption features includes:

[0028] Input the letter data into a hash function to obtain a hexadecimal letter data hash value;

[0029] Convert the hexadecimal letter data hash value into a decimal letter data hash value;

[0030] Generate a second coordinate according to the decimal letter data hash value to obtain a second elliptic curve horizontal coordinate;

[0031] The abscissa of the second elliptic curve is calculated by the following formula:

[0032] ;

[0033] in, is the abscissa of the second elliptic curve, Decimal alphanumeric data Hash value, The length of the hash value of the decimal letter data;

[0034] Substitute the abscissa of the second elliptic curve into the equation of the second elliptic curve to obtain the ordinate on the second elliptic curve;

[0035] Wherein, the second elliptic curve equation is:

[0036] ;

[0037] in, is the ordinate on the second elliptic curve, , and is the second elliptic curve extension parameter;

[0038] Integrate the ordinate on the second elliptic curve and the abscissa on the second elliptic curve to obtain a point on the second elliptic curve;

[0039] A hash calculation is performed according to the points on the second elliptic curve to obtain a letter encryption feature.

[0040] Preferably, performing third elliptic curve homology encryption according to the image data to obtain image encryption features includes:

[0041] Extracting data based on the image data to obtain image binary data;

[0042] Inputting the image binary data into a hash function to obtain a hexadecimal image data hash value;

[0043] Convert the hexadecimal image data hash value into a decimal image data hash value;

[0044] Generating a third coordinate according to the decimal image data hash value to obtain a third elliptic curve horizontal coordinate;

[0045] The abscissa of the third elliptic curve is calculated by the following formula:

[0046] ;

[0047] in, is the abscissa of the third elliptic curve, Image data in decimal Hash value, The length of the image data hash value in decimal format;

[0048] Substituting the abscissa of the third elliptic curve into the equation of the third elliptic curve to obtain the ordinate on the third elliptic curve;

[0049] Wherein, the third elliptic curve equation is:

[0050] ;

[0051] in, is the ordinate on the third elliptic curve, , and Extended parameters for the third elliptic curve;

[0052] Performing data integration according to the ordinate on the third elliptic curve and the abscissa on the third elliptic curve to obtain a point on the third elliptic curve;

[0053] A hash calculation is performed according to the points on the third elliptic curve to obtain image encryption features.

[0054] Preferably, the text encryption feature, letter encryption feature and image encryption feature are filled to a predetermined standard length respectively, and data integration is performed in a predetermined order to obtain an encrypted data set, including:

[0055] According to the text encryption feature, padding the first data to a predetermined standard length to obtain text encrypted data;

[0056] According to the letter encryption feature, the second data is filled to a predetermined standard length to obtain letter encryption data;

[0057] According to the image encryption feature, padding the third data to a predetermined standard length to obtain image encryption data;

[0058] According to the text encryption data, letter encryption data and image encryption data, data combination is performed in a predetermined order to obtain an encrypted data set.

[0059] Preferably, performing a first encryption according to the encrypted data set to obtain a first encryption element comprises:

[0060] According to the encrypted data set, a matrix is ​​constructed to obtain an encrypted data matrix;

[0061] Using the LLL algorithm on the encrypted data matrix to obtain a public key matrix;

[0062] Generating a first encryption element according to the public key matrix to obtain a first encryption element;

[0063] The first encryption element is obtained by the following formula:

[0064] ;

[0065] in, is the first encryption element, is the public key matrix, is a random vector, is the perturbation vector.

[0066] Preferably, performing a second encryption according to the first encryption element to obtain a second encryption element, and sending the second encryption element to a data recipient comprises:

[0067] Obtaining an initial security key;

[0068] Using the PBKDF2 algorithm on the initial security key to obtain a security key matrix;

[0069] Adding the security key matrix to the first encryption element to obtain a second encryption element, and sending the second encryption element to a data recipient;

[0070] The second encryption element is calculated by the following formula:

[0071] ;

[0072] in, is the second encryption element, is the first encryption element, is the security key matrix.

[0073] In a second aspect, the present invention provides a data encryption method system based on anti-quantum computing, comprising:

[0074] A data acquisition module, which acquires data to be encrypted; wherein the data to be encrypted includes: text data, letter data and image data;

[0075] A first elliptic curve homology encryption module, used for performing first elliptic curve homology encryption according to the text data to obtain a text encryption feature;

[0076] A second elliptic curve homology encryption module, used for performing a second elliptic curve homology encryption according to the letter data to obtain a letter encryption feature;

[0077] A third elliptic curve homology encryption module, used for performing third elliptic curve homology encryption according to the image data to obtain image encryption features;

[0078] A data integration module, used to fill the text encryption feature, letter encryption feature and image encryption feature to a predetermined standard length respectively, and integrate the data in a predetermined order to obtain an encrypted data set;

[0079] A first encryption element module performs a first encryption according to the encrypted data set to obtain a first encryption element;

[0080] The encrypted data sending module performs a second encryption based on the first encryption element to obtain a second encryption element and sends it to a data recipient.

[0081] In a third aspect, the present invention also provides an electronic device, comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein when the processor executes the computer program, the data encryption method based on anti-quantum computing as described above is implemented.

[0082] In a fourth aspect, the present invention also provides a computer-readable storage medium, which includes a stored computer program, wherein when the computer program is running, the device where the computer-readable storage medium is located is controlled to execute any one of the above-mentioned data encryption methods based on quantum computing resistance.

[0083] Compared with the prior art, the present invention has the following beneficial effects: obtaining data to be encrypted; wherein the data to be encrypted includes: text data, letter data and image data, performing a first elliptic curve homology encryption according to the text data to obtain text encryption features, performing a second elliptic curve homology encryption according to the letter data to obtain letter encryption features, performing a third elliptic curve homology encryption according to the image data to obtain image encryption features, performing data integration according to the text encryption features, letter encryption features and image encryption features to obtain an encrypted data set, performing a first encryption according to the encrypted data set to obtain a first encryption element; performing a second encryption according to the first encryption element to obtain a second encryption element, and sending the second encryption element to a data recipient. The method obtains text data, letter data and image data, generates text encryption features, letter encryption features and image encryption features through elliptic curve homology encryption, integrates these encryption features into an encrypted data set, performs a first and a second encryption on the encrypted data set to obtain a second encryption element and sends it to the data recipient, thereby improving the security of encrypted data and the ability to resist quantum computing attacks. BRIEF DESCRIPTION OF THE DRAWINGS

[0084] Figure 1 It is a schematic diagram of the flow of a data encryption method based on quantum computing resistance provided by the first embodiment of the present invention;

[0085] Figure 2 It is a schematic diagram of a data encryption system based on quantum computing that is provided in the second embodiment of the present invention. DETAILED DESCRIPTION

[0086] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0087] Reference Figure 1 The first embodiment of the present invention provides a data encryption method based on quantum computing resistance, comprising the following steps:

[0088] S11, obtaining data to be encrypted;

[0089] S12, performing a first elliptic curve homology encryption on the text data to obtain a text encryption feature;

[0090] S13, performing second elliptic curve homology encryption according to the letter data to obtain a letter encryption feature;

[0091] S14, performing third elliptic curve homology encryption according to the image data to obtain image encryption features;

[0092] S15, filling the text encryption feature, letter encryption feature and image encryption feature to a predetermined standard length respectively, and integrating the data in a predetermined order to obtain an encrypted data set;

[0093] S16, performing a first encryption according to the encrypted data set to obtain a first encryption element;

[0094] S17: Perform a second encryption based on the first encryption element to obtain a second encryption element, and send the second encryption element to a data recipient.

[0095] In step S11, the data to be encrypted is obtained; wherein the data to be encrypted includes: text data, letter data and image data.

[0096] It is worth noting that in the data encryption method based on quantum-resistant computing, obtaining the data to be encrypted is the first step of the entire encryption process to ensure the accuracy and consistency of the data in subsequent steps. The process of obtaining text data begins with extracting data from user input or external files. When a user enters text in an application, website, or other interactive terminal, the system directly captures the input data and converts it into a standard format that can be processed by the computer. For file-type data, the system first reads the file content. Whether it is a text file, Word document, or other text format, the character information in it will be extracted through the corresponding file parser. All acquired text data will be converted into a unified UTF-8 character encoding format. UTF-8 is a widely used character encoding format that ensures the compatibility of characters between different platforms and operating systems, and avoids garbled or loss of data due to inconsistent encoding. The converted data will be used as input for the encryption process to ensure the accuracy of subsequent processing. The system will also verify the data to ensure that the data has not been damaged or changed during the extraction process.

[0097] The acquisition process of alphabetic data is similar to that of text data, but alphabetic data is mainly composed of characters such as letters, numbers, and symbols, including user names, passwords, identifiers, or other information composed of letters and numbers. This type of data is obtained through user input, and the system extracts the corresponding data from the user's input interface through a data extraction algorithm. If the alphabetic data exists in the file, the system will extract the alphabetic data in the file and convert it to the UTF-8 encoding format to ensure format consistency and compatibility. The converted alphabetic data will be verified to ensure that there is no loss or error, and it is ready for subsequent encryption operations.

[0098] The acquisition of image data is different from that of text and letter data. Image data comes from image files uploaded by users or images taken in real time by cameras. The system first reads the binary data of the image file, parses the image format, and extracts the pixel information of the image. Regardless of whether the image format is JPEG, PNG, or other formats, the system will convert it into a standard image data format to ensure that no information is lost during the processing. In the process of acquiring image data, the system will perform necessary preprocessing on the image, such as scaling, cropping, or color space conversion, to adapt to the requirements of subsequent encryption algorithms. After acquisition, the image data will be stored in a standard format to ensure that the quality of the image and the integrity of the information are not affected. These image data will then be used in subsequent encryption steps to ensure the security and accuracy of the data during the encryption process.

[0099] In step S12, a first elliptic curve homology encryption is performed on the text data to obtain text encryption features, including:

[0100] Input the text data into a hash function to obtain a hexadecimal text data hash value;

[0101] Convert the hexadecimal text data hash value into a decimal text data hash value;

[0102] Generate a first coordinate according to the decimal text data hash value to obtain a first elliptic curve horizontal coordinate;

[0103] The abscissa of the first elliptic curve is calculated by the following formula:

[0104] ;

[0105] in, is the abscissa of the first elliptic curve, For decimal text data Bit hash value, The length of the hash value of the decimal text data;

[0106] Substituting the abscissa of the first elliptic curve into the equation of the first elliptic curve to obtain the ordinate on the first elliptic curve;

[0107] Wherein, the first elliptic curve equation is:

[0108] ;

[0109] in, is the ordinate on the first elliptic curve, , and is the first elliptic curve extension parameter;

[0110] Integrate the ordinate on the first elliptic curve and the abscissa on the first elliptic curve to obtain a point on the first elliptic curve;

[0111] A hash calculation is performed based on the points on the first elliptic curve to obtain text encryption features.

[0112] It is worth mentioning that in the data encryption method based on anti-quantum computing, the encryption of text data is achieved through the first elliptic curve homology encryption. This process includes multiple specific steps, from the generation of hash values ​​to the calculation of elliptic curves, and finally obtaining the encryption characteristics.

[0113] First, the system inputs the text data to be encrypted into the hash function. The hash function processes the input data and converts each character in the text into a corresponding hash value through a certain algorithm. The text data is converted into a hexadecimal hash value, which accurately represents the content of the input text data and is used for subsequent encryption operations.

[0114] Next, the system converts the obtained hexadecimal hash value to a decimal value. The purpose of this conversion is to make the hash value compatible with the mathematical calculations of the elliptic curve, which is convenient for the subsequent encryption process. The specific operation is to convert each bit of the hexadecimal value into the corresponding decimal value and compose the complete decimal hash value in sequence. During the conversion process, each hexadecimal value will be multiplied by different powers of 16 to ensure that the converted decimal value can accurately reflect the size and structure of the original hash value. The converted decimal hash value will be used as input to calculate the horizontal coordinate of the first elliptic curve.

[0115] The decimal hash value obtained will be used as a parameter to substitute into the calculation formula of the first elliptic curve horizontal coordinate. The specific calculation method of the formula is ,in Represents the hash value of decimal literal data , is the length of the hash value, is the calculated elliptic curve abscissa. Through this formula, the system calculates the decimal hash value bit by bit, associates each hash value with its position in the decimal system, and thus obtains the first elliptic curve abscissa. The calculation result of each abscissa will determine the structure of the elliptic curve and subsequent encryption characteristics.

[0116] After the abscissa is calculated, the system substitutes it into the equation of the first elliptic curve to calculate the corresponding ordinate. The standard equation of the first elliptic curve is ,in is the calculated horizontal coordinate, is the vertical coordinate, , and It is an extended parameter of the elliptic curve, which affects the shape of the curve. The system substitutes the horizontal coordinate value into the elliptic curve equation, performs a series of mathematical calculations, and obtains the corresponding vertical coordinate value. The vertical coordinate and the horizontal coordinate together determine a point on the elliptic curve, which represents the position of the text data in the elliptic curve.

[0117] After calculating the horizontal and vertical coordinates on the elliptic curve, the system will integrate the two coordinates to obtain a unique point on the elliptic curve. This point is used as an encrypted representation of the text data and contains the encryption information of the text data. The system then performs a hash calculation on this point to generate the final encryption feature of the text data. This encryption feature is a unique identifier generated by the elliptic curve algorithm, which can effectively protect the original text data from unauthorized access or tampering.

[0118] Through this series of operations, the system not only converts text data into points on the elliptic curve, but also ensures that the encryption process has the ability to resist quantum computing. Since quantum computing can break through the security of traditional encryption algorithms, and elliptic curve homology encryption has strong resistance to quantum attacks, this encryption method provides effective security protection for text data. These encryption features will be used in subsequent encryption processes to ensure the security of data during transmission and storage.

[0119] In step S13, a second elliptic curve homology encryption is performed according to the letter data to obtain a letter encryption feature, including:

[0120] Input the letter data into a hash function to obtain a hexadecimal letter data hash value;

[0121] Convert the hexadecimal letter data hash value into a decimal letter data hash value;

[0122] Generate a second coordinate according to the decimal letter data hash value to obtain a second elliptic curve horizontal coordinate;

[0123] The abscissa of the second elliptic curve is calculated by the following formula:

[0124] ;

[0125] in, is the abscissa of the second elliptic curve, Decimal alphanumeric data Hash value, The length of the hash value of the decimal letter data;

[0126] Substitute the abscissa of the second elliptic curve into the equation of the second elliptic curve to obtain the ordinate on the second elliptic curve;

[0127] Wherein, the second elliptic curve equation is:

[0128] ;

[0129] in, is the ordinate on the second elliptic curve, , and is the second elliptic curve extension parameter;

[0130] Integrate the ordinate on the second elliptic curve and the abscissa on the second elliptic curve to obtain a point on the second elliptic curve;

[0131] A hash calculation is performed according to the points on the second elliptic curve to obtain a letter encryption feature.

[0132] It is worth noting that in the data encryption method based on quantum-resistant computing, the encryption of letter data is performed through the second elliptic curve homology encryption. This process starts with the hashing of the letter data and obtains the encryption characteristics through elliptic curve calculation. First, the system inputs the letter data into the hash function. The hash function converts the letter data into a unique hexadecimal hash value, which represents the integrity of the letter data. The hash value is a digital representation of the letter data and can be used for subsequent encryption operations. The hexadecimal hash value generated by the hash function has a fixed length, which can ensure that the letter data can be processed consistently in any environment.

[0133] Next, the system converts the obtained hexadecimal hash value and converts it into a decimal value. The purpose of this conversion process is to convert the hash value from hexadecimal format to decimal format for compatibility with the mathematical calculations of the elliptic curve. The specific operation is to convert each hexadecimal character to decimal, multiply the value of each character by its position in the hash value, and then perform a weighted sum according to the power of 16. The converted decimal letter data hash value will be used as a parameter for the next step of the elliptic curve abscissa calculation.

[0134] After obtaining the decimal letter data hash value, the system will use this value to calculate the horizontal coordinate of the second elliptic curve. At this time, the system uses the following formula for calculation: In this formula, is the abscissa of the second elliptic curve, is the decimal alphanumeric hash value , is the length of the decimal hash value of the letter data. Through this formula, the system calculates each horizontal coordinate bit by bit according to the hash value of the letter data and its position in the hash value. The horizontal coordinate value will determine the shape of the elliptic curve and the subsequent encryption process.

[0135] After obtaining the abscissa of the second elliptic curve, the system substitutes it into the equation of the second elliptic curve to calculate the ordinate. The form of the equation of the second elliptic curve is: ,in represents the vertical coordinate, is the abscissa of the second elliptic curve, , and are the extended parameters of the second elliptic curve. These extended parameters are pre-set and affect the specific shape of the elliptic curve. After substituting the horizontal coordinate value into the equation, the system will perform the corresponding mathematical operation to obtain the vertical coordinate value.

[0136] Once the horizontal and vertical coordinates on the second elliptic curve are calculated, the system will integrate the two coordinates to obtain a point on the second elliptic curve. This point represents the unique position of the letter data on the elliptic curve and contains the encryption information of the letter data. Then, the system will perform a hash calculation on the point on the elliptic curve to generate the encryption feature of the letter data. This encryption feature is the final result of the letter data in the elliptic curve encryption, which is unique and effectively protects the letter data from unauthorized access or tampering.

[0137] Through this series of steps, the letter data is encrypted and protected by the second elliptic curve homology encryption, and the encryption process is ensured to be resistant to quantum computing. Since quantum computers can crack traditional encryption algorithms, and elliptic curve homology has significant advantages in anti-quantum computing, this method provides strong security for letter data. These encryption features will serve as the basis for subsequent data transmission and storage, ensuring the security and integrity of letter data in the entire system.

[0138] In step S14, a third elliptic curve homology encryption is performed according to the image data to obtain image encryption features, including:

[0139] Extracting data based on the image data to obtain image binary data;

[0140] Inputting the image binary data into a hash function to obtain a hexadecimal image data hash value;

[0141] Convert the hexadecimal image data hash value into a decimal image data hash value;

[0142] Generating a third coordinate according to the decimal image data hash value to obtain a third elliptic curve horizontal coordinate;

[0143] The abscissa of the third elliptic curve is calculated by the following formula:

[0144] ;

[0145] in, is the abscissa of the third elliptic curve, Image data in decimal Hash value, The length of the image data hash value in decimal format;

[0146] Substituting the abscissa of the third elliptic curve into the equation of the third elliptic curve to obtain the ordinate on the third elliptic curve;

[0147] Wherein, the third elliptic curve equation is:

[0148] ;

[0149] in, is the ordinate on the third elliptic curve, , and Extended parameters for the third elliptic curve;

[0150] Data integration is performed according to the ordinate on the third elliptic curve and the abscissa on the third elliptic curve to obtain a point on the third elliptic curve.

[0151] It is worth noting that in the data encryption method based on quantum computing resistance, the encryption of image data is implemented through the third elliptic curve homology encryption. This process includes image data extraction, hash calculation to elliptic curve operation, and finally obtains the image encryption feature. First, the system extracts the image data to be encrypted and obtains the binary data of the image. The image data is stored in binary format, which contains all the pixel information and color values ​​of the image. The system reads the binary content of the image file and extracts all valid data, including the size, resolution, pixel value and color depth of the image.

[0152] Next, the system feeds the image's binary data into a hash function for processing. The hash function transforms the image data and generates a unique hexadecimal hash value that corresponds to a specific representation of the image data. This hash value has a fixed length and uniquely represents the contents of the image. The hexadecimal hash value generation process ensures the integrity of the image data and provides unchangeable original data for subsequent encryption steps.

[0153] After obtaining the hexadecimal hash value, the system will convert it to a decimal image data hash value. The purpose of this conversion operation is to make the hash value compatible with the mathematical calculations of the elliptic curve. Specifically, the system converts each hexadecimal digit into its corresponding decimal value and weights it by multiplying it by different powers of 16 to obtain a complete decimal hash value. The converted decimal image data hash value will be used as input to continue the subsequent elliptic curve calculations.

[0154] After obtaining the decimal image data hash value, the system uses the hash value to generate the horizontal coordinate of the third elliptic curve. The system uses the formula Calculate the horizontal coordinate, where is the abscissa of the third elliptic curve, is the decimal hash value of the image data , is the length of the decimal image data hash value. Through this formula, the system calculates the horizontal coordinate value corresponding to each bit of the hash value, thereby generating a complete third elliptic curve horizontal coordinate.

[0155] After obtaining the horizontal coordinate, the system substitutes it into the equation of the third elliptic curve and calculates the corresponding vertical coordinate. The third elliptic curve equation is in the form of ,in represents the vertical coordinate, is the calculated horizontal coordinate, , and Is the extended parameter of the third elliptic curve. Extended parameter , and The specific shape of the elliptic curve and the security of the encryption process are determined. The system substitutes the horizontal coordinate into the equation and calculates to obtain the vertical coordinate. .

[0156] After calculating the horizontal and vertical coordinates of the third elliptic curve, the system integrates the two coordinate values ​​to obtain a point on the third elliptic curve. This point represents the position of the image data in the elliptic curve and contains the encryption information of the image. Finally, the system performs a hash calculation on the point to obtain the encryption feature of the image. This encryption feature will serve as the unique identifier of the image data in the encryption system, which can effectively prevent the image data from being tampered with or cracked during transmission or storage.

[0157] Through this series of calculation processes, the image data is strongly encrypted through the third elliptic curve homology encryption, ensuring the security of the data in a quantum computing environment. This encryption process can not only effectively prevent the cracking of traditional encryption methods, but also has the ability to resist quantum computing attacks, ensuring that the image data remains secure and complete during the encryption process. These encryption features will play an important role in the subsequent data transmission and storage process, protecting image data from unauthorized access and tampering.

[0158] In step S15, the text encryption feature, letter encryption feature and image encryption feature are filled to a predetermined standard length respectively, and data integration is performed in a predetermined order to obtain an encrypted data set, including:

[0159] According to the text encryption feature, padding the first data to a predetermined standard length to obtain text encrypted data;

[0160] According to the letter encryption feature, the second data is filled to a predetermined standard length to obtain letter encryption data;

[0161] According to the image encryption feature, padding the third data to a predetermined standard length to obtain image encryption data;

[0162] According to the text encryption data, letter encryption data and image encryption data, data combination is performed in a predetermined order to obtain an encrypted data set.

[0163] It is worth noting that in the data encryption method based on quantum computing, the data integration step combines the text encryption features, letter encryption features and image encryption features into a unified encrypted data set. The core purpose of this process is to ensure that the lengths of these three encryption features are consistent through padding operations so that they can be smoothly combined to form a complete encrypted data set.

[0164] First, the system performs the first data filling according to the text encryption feature. The text encryption feature is the encryption result obtained through elliptic curve encryption, and is the feature data generated after hash processing. In order to ensure that all data has a consistent length, the system will fill the text encryption feature and expand it to a predetermined standard length. The purpose of this filling operation is to ensure that the text data can be aligned with the letter encryption feature and image encryption feature in the subsequent integration of the encrypted data set, avoiding processing problems caused by inconsistent data length. The filled text encryption data will meet the requirements of the entire encryption process and ensure the smooth progress of subsequent steps.

[0165] Next, the letter encryption feature also needs to be filled with the second data. The letter encryption feature is also the encryption result obtained through elliptic curve encryption. The system will fill the letter encryption feature to ensure that its length is consistent with the text encryption data. Adjustments during the filling process will be made according to the encryption requirements of the letter data to ensure that the filled letter encryption data can be seamlessly merged with the text and image encryption data. Through this filling step, the letter encryption data is consistent in length with other encrypted data, preparing for the subsequent combination of encrypted data sets.

[0166] Then, the image encryption feature also needs to be filled with the third data. Due to its large data volume and complexity, the encryption feature of the image data will also be filled to ensure that the length of the image encryption data is the same as the text and letter encryption data. This step is also to ensure that the image data can be consistent with the position of other data types in the encrypted data set, thereby avoiding data processing problems caused by inconsistent lengths. The system will properly fill the image encryption feature so that the image encryption data can match the text and letter data, completing the integration of the entire encrypted data set.

[0167] Once the text encryption data, letter encryption data and image encryption data are filled, the system combines these data to form the final encryption data set. In this process, the system will merge these three types of data together in a predetermined order to ensure that each encryption feature occupies the appropriate position in the encryption data set. Through this data combination, the encryption information of text, letter and image encryption features can be fully integrated to form a structured encryption data set. This encrypted data set can maintain the integrity and security of the information during subsequent transmission and storage, ensuring that the data is not tampered with or destroyed throughout its life cycle.

[0168] Through these operations, the system can effectively combine the encryption features of text, letters and image data into a standardized encryption data set, providing a unified and secure data structure for subsequent encryption operations. This integration process not only ensures the integrity and consistency of the encrypted data set, but also improves the ability of the entire encryption method to resist quantum computing attacks, ensuring the security and reliability of data in a quantum computing environment.

[0169] In step S16, a first encryption is performed according to the encrypted data set to obtain a first encryption element, including:

[0170] According to the encrypted data set, a matrix is ​​constructed to obtain an encrypted data matrix;

[0171] Using the LLL algorithm on the encrypted data matrix to obtain a public key matrix;

[0172] Generating a first encryption element according to the public key matrix to obtain a first encryption element;

[0173] The first encryption element is obtained by the following formula:

[0174] ;

[0175] in, is the first encryption element, is the public key matrix, is a random vector, is the perturbation vector.

[0176] It is worth noting that, based on the encrypted data set, the system will construct an encrypted data matrix. The construction of the encrypted data matrix depends on the arrangement and distribution of the encrypted data set. This matrix contains all the data to be encrypted and is arranged according to certain rules so that it can be effectively processed in the subsequent encryption process. By representing the encrypted data set in a matrix, the data is normalized and provides a structured basis for the encryption step.

[0177] Next, the system uses the LLL algorithm to process the constructed encrypted data matrix. The LLL algorithm is an algorithm for lattice-based calculations that can find a set of basis vectors so that the length of the lattice corresponding to the basis vectors is as small as possible. In encryption, the LLL algorithm is mainly used to optimize the construction of the public key matrix. By transforming the vectors in the encrypted data matrix to conform to certain mathematical properties, the strength of encryption is enhanced. Through the LLL algorithm, the system generates a public key matrix. The public key matrix is ​​a key component in the encryption process, which will determine how the encrypted data interacts with the private key.

[0178] The process of generating random vectors is a key step in the encryption method. The purpose of the random vector is to ensure that each encryption operation has enough randomness so that the encryption result is different each time it is executed, thereby avoiding the same encryption data from producing the same encryption result. When generating random vectors, the system will obtain data from a pseudo-random number generator according to the security requirements of the encryption system. In order to improve the security of encryption, the generated random numbers will be sampled from a high-quality random source, such as a hardware random number generator to ensure its unpredictability.

[0179] Specifically, assume that the security requirement of the encryption system is to resist attacks, such as preventing inference from known encrypted text. To meet this requirement, the system uses entropy sources from the operating system and hardware platform, such as temperature sensors, keyboard input, or network latency, as random sources. These sources can provide high entropy inputs to ensure that the generated random vectors are highly unpredictable. The system uses these high entropy input data through a hash function or a pseudo-random number generation algorithm to generate a random vector , each element of the vector is calculated based on the above source data, ensuring that the vector generated in each encryption operation is different.

[0180] Generate perturbation vectors through lattice-based encryption algorithms Lattice-based encryption is a well-known encryption method that is resistant to quantum computing. The system uses the random vector generation method in the lattice-based algorithm to calculate the perturbation vector. For example, the system generates a perturbation vector by constructing a high-dimensional lattice and perturbing the lattice. This lattice-based perturbation generation method relies on the structural characteristics of the lattice, making the small adjustments of the perturbation vector during the encryption process more complicated and difficult to reverse.

[0181] Through these steps, the random vector and the perturbation vector Will be applied to the public key matrix In the process, the first encryption element is generated Specifically, the first encryption element It is through the formula Calculated, where is the public key matrix, is a random vector, is the perturbation vector. This encryption element It is used to protect encrypted data and ensure that the data is not cracked or tampered with during transmission and storage. Through this process, the system effectively enhances the security of data, especially in the face of quantum computing attacks, relying on the unpredictability of random vectors and perturbation vectors to make the encryption process more robust.

[0182] Through this specific generation process, the system can ensure that encrypted data has sufficient security protection in the era of quantum computing. The generation of random vectors and perturbation vectors is closely related to the security requirements of the encryption system, which determine how to generate unpredictable random numbers through high entropy sources and fine-tune the data through perturbations to improve the security of encryption and the ability to resist quantum computing attacks.

[0183] In step S17, performing a second encryption according to the first encryption element to obtain a second encryption element, and sending the second encryption element to a data recipient, including:

[0184] Obtaining an initial security key;

[0185] Using the PBKDF2 algorithm on the initial security key to obtain a security key matrix;

[0186] Adding the security key matrix to the first encryption element to obtain a second encryption element, and sending the second encryption element to a data recipient;

[0187] The second encryption element is calculated by the following formula:

[0188] ;

[0189] in, is the second encryption element, is the first encryption element, is the security key matrix.

[0190] It is worth noting that in the data encryption method based on quantum computing resistance, the second encryption step generates a second encryption element by combining the initial security key with the first encryption element and sends it to the data recipient. The purpose of this process is to enhance the encryption strength and ensure the security of the encrypted data during transmission and storage. Next, we explain the specific operation of this step in detail.

[0191] First, the system obtains the initial security key. The initial security key is a core element in the encryption process. It is used to generate the encryption key matrix and provide additional protection in subsequent encryption operations. The initial security key is generated by the key generation module of the encryption system. Taking the secure random number generator as an example, the system obtains high entropy sources from the hardware and operating system, such as the system's temperature sensor data and random behavior of user input, which can provide unpredictable randomness and ensure the strength of the key. From these high entropy sources, the system can generate an initial security key as the basis for subsequent encryption operations. To further ensure security, the generated key is processed by a hash algorithm to ensure the uniqueness and strength of the key.

[0192] Next, the system processes the initial security key using the PBKDF2 algorithm to generate a security key matrix. PBKDF2 is a common key derivation algorithm that is widely used in cryptographic applications. It generates a more complex and crack-resistant key by performing multiple iterative hash calculations on the initial key. In the PBKDF2 algorithm, the system takes the initial security key as input, combines it with a random salt value, and performs multiple hash operations. This process not only increases the complexity of the calculation, but also ensures that even if an attacker obtains part of the key information, he cannot reversely calculate the complete key. Ultimately, the output of the PBKDF2 algorithm is the security key matrix, which will serve as a key part of the subsequent encryption process.

[0193] After having the security key matrix, the system combines it with the first encryption element to generate the second encryption element. The first encryption element has been generated through the public key matrix and the random vector, which provides preliminary encryption protection for the data. The second encryption further enhances the security of the data by adding the security key matrix to the first encryption element. The generation formula of the second encryption element is: in, is the first encryption element, is the security key matrix, The second encryption element is generated. Through this formula, the system adds the security key matrix to the first encryption element to generate the second encryption element. The purpose of this addition operation is to add additional security to the encrypted data on the basis of the original encryption. Since the security key matrix is ​​generated by the PBKDF2 algorithm, it contains highly complex randomness and unpredictability, so the generation of the second encryption element has stronger anti-attack capabilities, especially the ability to prevent quantum computing cracking.

[0194] Finally, the second encryption element is sent to the data recipient. After receiving the second encryption element, the data recipient will use the corresponding decryption key and decryption algorithm to decrypt and restore the original data. Since the second encryption element has been enhanced by multiple encryptions and key matrices, its anti-attack ability is greatly enhanced, which can effectively protect the security of data during transmission.

[0195] Through this process, the system not only enhances the security of data through encryption algorithms and key matrices, but also ensures that the encryption process can resist the potential threats brought by quantum computing. The application of the PBKDF2 algorithm in key generation improves the complexity and anti-attack capability of encryption keys, making the encrypted data still highly secure in a quantum computing environment. The generation step of the second encryption element provides stronger protection for the entire encryption system, ensuring that data is not tampered with or cracked during transmission and storage.

[0196] Reference Figure 2 The second embodiment of the present invention provides a data encryption method system based on anti-quantum computing, including:

[0197] A data acquisition module, which acquires data to be encrypted; wherein the data to be encrypted includes: text data, letter data and image data;

[0198] A first elliptic curve homology encryption module, used for performing first elliptic curve homology encryption according to the text data to obtain a text encryption feature;

[0199] A second elliptic curve homology encryption module, used for performing a second elliptic curve homology encryption according to the letter data to obtain a letter encryption feature;

[0200] A third elliptic curve homology encryption module, used for performing third elliptic curve homology encryption according to the image data to obtain image encryption features;

[0201] A data integration module, used to fill the text encryption feature, letter encryption feature and image encryption feature to a predetermined standard length respectively, and integrate the data in a predetermined order to obtain an encrypted data set;

[0202] A first encryption element module performs a first encryption according to the encrypted data set to obtain a first encryption element;

[0203] The encrypted data sending module performs a second encryption based on the first encryption element to obtain a second encryption element and sends it to a data recipient.

[0204] It should be noted that a data encryption system based on quantum computing resistance provided in an embodiment of the present invention is used to execute all process steps of a data encryption method based on quantum computing resistance in the above embodiment. The working principles and beneficial effects of the two correspond one to one, and therefore will not be repeated here.

[0205] The embodiment of the present invention further provides an electronic device. The electronic device includes: a processor, a memory, and a computer program stored in the memory and executable on the processor, such as a first encryption metaprogram. When the processor executes the computer program, the steps in the above-mentioned data encryption method based on quantum computing are implemented, such as Figure 1 Alternatively, when the processor executes the computer program, the functions of the modules / units in the above-mentioned device embodiments are realized, such as the encrypted data sending module.

[0206] Exemplarily, the computer program may be divided into one or more modules / units, which are stored in the memory and executed by the processor to implement the present invention. The one or more modules / units may be a series of computer program instruction segments capable of implementing specific functions, which are used to describe the execution process of the computer program in the electronic device.

[0207] The electronic device may be a computing device such as a desktop computer, a notebook, a PDA, and a smart tablet. The electronic device may include, but is not limited to, a processor and a memory. Those skilled in the art will appreciate that the above components are merely examples of electronic devices and do not constitute a limitation on the electronic device. The electronic device may include more or fewer components than the above components, or may combine certain components, or different components. For example, the electronic device may also include input and output devices, network access devices, buses, etc.

[0208] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the electronic device, and uses various interfaces and lines to connect various parts of the entire electronic device.

[0209] The memory can be used to store the computer program and / or module, and the processor realizes various functions of the electronic device by running or executing the computer program and / or module stored in the memory, and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area can store data created according to the use of the mobile phone (such as audio data, a phone book, etc.), etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0210] Wherein, if the module / unit integrated in the electronic device is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Wherein, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium. It should be noted that the content contained in the computer-readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electric carrier signals and telecommunication signals.

[0211] It should be noted that the device embodiments described above are merely schematic, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. In addition, in the accompanying drawings of the device embodiments provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, which may be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art may understand and implement it without paying any creative effort.

[0212] The specific embodiments described above further illustrate the purpose, technical solutions and beneficial effects of the present invention. 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. It is particularly pointed out that for those skilled in the art, any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the scope of protection of the present invention.

Claims

1. A data encryption method based on quantum computing, characterized in that: include: Acquire data to be encrypted; wherein the data to be encrypted includes: text data, letter data and image data; Performing first elliptic curve homology encryption on the text data to obtain text encryption features; Performing second elliptic curve homology encryption according to the letter data to obtain a letter encryption feature; Performing third elliptic curve homology encryption according to the image data to obtain image encryption features; Filling the text encryption feature, letter encryption feature and image encryption feature to a predetermined standard length respectively, and integrating the data in a predetermined order to obtain an encrypted data set; Performing a first encryption according to the encrypted data set to obtain a first encryption element specifically includes: According to the encrypted data set, a matrix is ​​constructed to obtain an encrypted data matrix; the encrypted data matrix is ​​subjected to an LLL algorithm to obtain a public key matrix; according to the public key matrix, a first encryption element is generated to obtain a first encryption element; Performing a second encryption according to the first encryption element to obtain a second encryption element, and sending the second encryption element to a data recipient, specifically includes: Obtain an initial security key; use the PBKDF2 algorithm on the initial security key to obtain a security key matrix; add the security key matrix to the first encryption element to obtain a second encryption element.

2. The data encryption method based on quantum computing resistance according to claim 1 is characterized in that: The step of performing first elliptic curve homology encryption according to the text data to obtain text encryption features includes: Input the text data into a hash function to obtain a hexadecimal text data hash value; Convert the hexadecimal text data hash value into a decimal text data hash value; Generate a first coordinate according to the decimal text data hash value to obtain a first elliptic curve horizontal coordinate; The abscissa of the first elliptic curve is calculated by the following formula: x i =h i ·16 n-i-1 ; Among them, x i is the abscissa of the first elliptic curve, h i is the hash value of the ith digit of the decimal text data, and n is the length of the hash value of the decimal text data; Substituting the abscissa of the first elliptic curve into the equation of the first elliptic curve to obtain the ordinate on the first elliptic curve; Wherein, the first elliptic curve equation is: y i 2 =x i 3 +a1x i 2 +a2x i +b2; Among them, y i is the ordinate on the first elliptic curve, a1, a2 and b2 are the extended parameters of the first elliptic curve; Integrate the ordinate on the first elliptic curve and the abscissa on the first elliptic curve to obtain a point on the first elliptic curve; A hash calculation is performed based on the points on the first elliptic curve to obtain text encryption features.

3. The data encryption method based on quantum computing resistance according to claim 1 is characterized in that: The step of performing second elliptic curve homology encryption according to the letter data to obtain a letter encryption feature includes: Input the letter data into a hash function to obtain a hexadecimal letter data hash value; Convert the hexadecimal letter data hash value into a decimal letter data hash value; Generate a second coordinate according to the decimal letter data hash value to obtain a second elliptic curve horizontal coordinate; The abscissa of the second elliptic curve is calculated by the following formula: j i =u i ·16 o-i-1 ; Among them, j i is the abscissa of the second elliptic curve, u i is the hash value of the ith digit of the decimal alphabetic data, and o is the length of the hash value of the decimal alphabetic data; Substitute the abscissa of the second elliptic curve into the equation of the second elliptic curve to obtain the ordinate on the second elliptic curve; Wherein, the second elliptic curve equation is: <h2 style=";text-align:left;direction:ltr">f<h2 style=";text-align:left;direction:ltr"> i <h2 style=";text-align:left;direction:ltr"> 2 <h2 style=";text-align:left;direction:ltr"> =j<h2 style=";text-align:left;direction:ltr"> i <h2 style=";text-align:left;direction:ltr"> 3 <h2 style=";text-align:left;direction:ltr"> +a3j<h2 style=";text-align:left;direction:ltr"> i <h2 style=";text-align:left;direction:ltr"> 2 <h2 style=";text-align:left;direction:ltr"> +a4j<h2 style=";text-align:left;direction:ltr"> i <h2 style=";text-align:left;direction:ltr"> +b3; Among them, f i is the ordinate on the second elliptic curve, a3, a4 and b3 are the extended parameters of the second elliptic curve; Integrate the ordinate on the second elliptic curve and the abscissa on the second elliptic curve to obtain a point on the second elliptic curve; A hash calculation is performed according to the points on the second elliptic curve to obtain a letter encryption feature.

4. The data encryption method based on quantum computing resistance according to claim 1 is characterized in that: The step of performing third elliptic curve homology encryption according to the image data to obtain image encryption features includes: Extracting data based on the image data to obtain image binary data; Inputting the image binary data into a hash function to obtain a hexadecimal image data hash value; Convert the hexadecimal image data hash value into a decimal image data hash value; Generating a third coordinate according to the decimal image data hash value to obtain a third elliptic curve horizontal coordinate; The abscissa of the third elliptic curve is calculated by the following formula: t i =e i ·16 m-i-1 ; Among them, t i is the abscissa of the third elliptic curve, e i is the i-th hash value of the image data in decimal, and m is the length of the hash value of the image data in decimal; Substituting the abscissa of the third elliptic curve into the equation of the third elliptic curve to obtain the ordinate on the third elliptic curve; Wherein, the third elliptic curve equation is: l i 2 =t i 3 +a5t i 2 +a6t i +b4; Among them, l i is the ordinate on the third elliptic curve, a5, a6 and b4 are the extended parameters of the third elliptic curve; Performing data integration according to the ordinate on the third elliptic curve and the abscissa on the third elliptic curve to obtain a point on the third elliptic curve; A hash calculation is performed according to the points on the third elliptic curve to obtain image encryption features.

5. The data encryption method based on quantum computing resistance according to claim 1 is characterized in that: The text encryption feature, letter encryption feature and image encryption feature are filled to a predetermined standard length respectively, and data integration is performed in a predetermined order to obtain an encrypted data set, including: According to the text encryption feature, padding the first data to a predetermined standard length to obtain text encrypted data; According to the letter encryption feature, the second data is filled to a predetermined standard length to obtain letter encryption data; According to the image encryption feature, padding the third data to a predetermined standard length to obtain image encryption data; According to the text encryption data, letter encryption data and image encryption data, data combination is performed in a predetermined order to obtain an encrypted data set.

6. The data encryption method based on quantum computing resistance according to claim 1 is characterized in that: The first encryption element is obtained by the following formula: c = A·r+e; Among them, c is the first encryption element, A is the public key matrix, r is the random vector, and e is the perturbation vector.

7. The data encryption method based on quantum computing resistance according to claim 1 is characterized in that: The second encryption element is calculated by the following formula: <h2 style=";text-align:left;direction:ltr">M2 = M1 + K<h2 style=";text-align:left;direction:ltr"> d <h2 style=";text-align:left;direction:ltr"> ; Among them, M2 is the second encryption element, M1 is the first encryption element, K d is the security key matrix.

8. A data encryption method system based on quantum computing resistance, characterized in that: include: A data acquisition module, which acquires data to be encrypted; wherein the data to be encrypted includes: text data, letter data and image data; A first elliptic curve homology encryption module, used for performing first elliptic curve homology encryption according to the text data to obtain a text encryption feature; A second elliptic curve homology encryption module, used for performing a second elliptic curve homology encryption according to the letter data to obtain a letter encryption feature; A third elliptic curve homology encryption module, used for performing third elliptic curve homology encryption according to the image data to obtain image encryption features; A data integration module, used to fill the text encryption feature, letter encryption feature and image encryption feature to a predetermined standard length respectively, and integrate the data in a predetermined order to obtain an encrypted data set; The first encryption element module performs a first encryption according to the encrypted data set to obtain a first encryption element, specifically comprising: According to the encrypted data set, a matrix is ​​constructed to obtain an encrypted data matrix; the encrypted data matrix is ​​subjected to an LLL algorithm to obtain a public key matrix; according to the public key matrix, a first encryption element is generated to obtain a first encryption element; The encrypted data sending module performs a second encryption according to the first encryption element to obtain a second encryption element and sends the second encryption element to a data receiving party, specifically comprising: Obtain an initial security key; use the PBKDF2 algorithm on the initial security key to obtain a security key matrix; add the security key matrix to the first encryption element to obtain a second encryption element.

9. An electronic device, characterized in that: It includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, and when the processor executes the computer program, it implements the data encryption method based on quantum computing anti-as claimed in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored computer program, wherein when the computer program is executed, the device where the computer-readable storage medium is located is controlled to execute the data encryption method based on quantum computing resistance as described in any one of claims 1 to 7.

Images