Homomorphic Encryption Based on Post-Quantum Cryptography

arXiv:2402.14193v1 Announce Type: new
Abstract: With the development of Shor's algorithm, some nondeterministic polynomial (NP) time problems (e.g. prime factorization problems and discrete logarithm problems) may be solved in polynomial time. In recent years, although some homomorphic encryption algorithms have been proposed based on prime factorization problems, the algorithms may be cracked by quantum computing attacks. Therefore, this study proposes a post-quantum cryptography (PQC)-based homomorphic encryption method which includes the homomorphic encryption function based on a code-based cryptography method for …

algorithm algorithms arxiv cracked cryptography cs.cr development encryption homomorphic encryption may post-quantum post-quantum cryptography prime problems quantum quantum cryptography shor