Homomorphic Encryption Based on Post-Quantum Cryptography
Author:
- 14 December 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
The development of Shor's algorithm makes it possible to solve some of the problems that are currently NP-intermediate, e.g. the prime factorization problem and discrete logarithm problem, in polynomial time. Hence, the homomorphic encryption algorithms that are designed based on prime factorization may be vulnerable to quantum computing attacks. Considering the post-quantum cryptography, this study proposes a homomorphic encryption method which is devised based on nonnegative matrix factorization (NMF) owing to the NP-hardness of the NMF problem and constructs the homomorphic encryption function through the code-based cryptography method for withstanding the quantum computing attacks. The feasibility of the proposed method is demonstrated by the derived mathematical models coupled with some calculation examples illustrating the detailed method steps. Our conducted experiments show that the proposed method has a shorter encryption/decryption time than the mainstream cryptographic algorithms based on the RSA or elliptic-curve cryptography.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Elliptic Curve Cryptography; Applications, challenges, recent advances, and future trends: A comprehensive surveyComputer Science Review, 2022
- Securing communications between things against wormhole attacks using TOPSIS decision-making and hash-based cryptography techniques in the IoT ecosystemWireless Networks, 2022
- Status report on the third round of the NIST Post-Quantum Cryptography Standardization process2022
- Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error ValuesIEEE Open Journal of the Communications Society, 2022
- Post-Quantum Lattice-Based Cryptography ImplementationsACM Computing Surveys, 2019
- Forty years of attacks on the RSA cryptosystem: A brief surveyJournal of Discrete Mathematical Sciences and Cryptography, 2019
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997