Abstract
Homomorphic Encryption (HE) is one of the most popular technologies which assists forkeeping the confidentiality and privacy of user data on cloud storage. It can apply a mathematicalcomputation to the ciphertext and return the result as if the operation was performedon the corresponding plaintext. Many of algorithms are known as a class of thisinterested technology, one of them is Paillier cryptosystem. This paper offers two solutions(MPEA-A and MPEA-B) for Paillier’s cryptosystem bottleneck problem which causesdelay in Paillier decrypting procedures. MPEA-A and MPEA-B algorithms are based onthe Chinese Reminder Theorem CRT with appended principles to achieve the desired goal.Practical implementations are applied to the proposed algorithms, The results show that thetwo algorithms succeeded in reducing the decryption time with various ratios. The practicalimplementation proved that MPEA-A can be useful for encrypting with a medium Paillierkey size, whereas MPEA-B is preferred for encrypting in a large key size value.
NETL
NSTL
Springer Nature