R-LWE-based public key encryption method

Abstract

The invention provides an R-LWE-based public key encryption method. The R-LWE-based public key encryption method comprises the following steps: randomly generating public parameters and private parameters required by participants, generating a key by each participant according to the public parameter and the private parameter, and designing a secure encryption scheme and a secure decryption scheme of the CCA according to the key. According to the method, the public key size and the ciphertext expansion rate can be effectively reduced, and public ciphertext integrity verification is supported.

Description

technical field [0001] The invention belongs to the technical field of information security, and in particular relates to an R-LWE-based public key encryption method, a non-transitory computer-readable storage medium and a computer device. Background technique [0002] With the rapid development of quantum computer research and development, traditional public key cryptography schemes are facing serious challenges. Shor's RSA and Proos / Zalka's ECDLP algorithms can solve discrete logarithm and large factorization problems in polynomial time in the quantum computing environment, thus shaking the foundation of traditional public key encryption schemes. Therefore, cryptographers around the world are devoting themselves to finding practical public-key cryptographic schemes that are resistant to quantum attacks. At present, multivariate public-key cryptosystems, lattice-based cryptographic algorithms, cryptographic algorithms based on coding problems, and hash-based cryptographic ...

AI Technical Summary

Problems solved by technology

Unfortunately, the public key scheme designed based on LWE uses a large matrix, resulting in too large public key size, high ciphertext expansion rate, and low efficiency. Even if it can resist quantum attacks, it cannot be practically applied.

Images