Polynomial point expressed low expansion ratio anti-quantum-attack file encryption and decryption method

Abstract

The invention relates to a polynomial point expressed low expansion ratio anti-quantum-attack encryption algorithm, and belongs to the field of computers. The algorithm comprises the following steps that S1 the relevant encryption parameters of an RLWE public key encryption scheme are set; S2 a public and private key pair is generated according to the encryption parameters; S3 a file to be encrypted is inputted to generate a plaintext, the plaintext space is expanded to reduce the ciphertext expansion ratio, and the plaintext is directly coded to the value of the polynomial value assignment point so as to reduce the computing complexity; S4 the file is encrypted through the encryption algorithm so as to generate the ciphertext; S5 the ciphertext is decrypted through the decryption algorithm so as to obtain the plaintext; and S6 the plaintext is converted into the binary stream and the original file is outputted. The new public key cipher system having high encryption efficiency, low ciphertext expansion ratio and actual usability is constructed so that the huge risk that the quantum algorithm possibly decodes the conventional public key cipher can be resisted.

Description

technical field [0001] The invention belongs to the field of computers, and relates to a file encryption and decryption method with low expansion rate and anti-quantum attack represented by polynomial points. Background technique [0002] With the development of quantum computers, there are already efficient quantum algorithms (such as Shor's algorithm) that can crack large integer decomposition problems and discrete logarithm problems. Encryption systems based on difficult problems in traditional number theory, such as RSA, DSA, and ECDSA, have been Quantum computers are broken, so there is an urgent need for a public-key encryption scheme that resists quantum attacks. The public-key encryption scheme based on the lattice difficulty problem has the advantage of resisting quantum attacks. Gentry proposed the BGV scheme in 2012 to realize the public key encryption scheme that resists quantum attacks. key encryption system, but it has the disadvantages of low efficiency and hi...

AI Technical Summary

Problems solved by technology

[0002] With the development of quantum computers, there are efficient quantum algorithms (such as Shor's algorithm) that can crack large integer decomposition problems and discrete logarithm problems. Encryption systems based on difficult problems in traditional number theory, such as RSA, DSA, and ECDSA, have been Quantum computers are broken, so there is an urgent need for a public-key encryption scheme that resists quantum attacks. The public-key encryption scheme based on lattice-difficult problems has the advantage of resisting quantum attacks. Gentry proposed the BGV scheme in 2012 to realize the public key encryption scheme against quantum attacks key encryption system, but it has the disadvantages of low efficiency and high ciphertext expansion rate. The encryption complexity of the BGV scheme is , the decryption complexity is , and the ciphertext expansion rate is about 1:64

Images