An Application of Vector Decomposition problem in Public key Cryptography using homomarphic Encryption
I. Praveen, Madathil Sethumadhavan · 2013
It is known that the security of Public Key Cryptosystems can be based on Vector Decomposition Problem (VDP). In this paper, we analyze this problem. In practice, it was shown that the Computational Diffie- Hellmann Problem (CDHP) is equivalent to VDP for supersingular elliptic curves. Moreover, VDP on a higher genus curve is hard if CDHP is hard on its one dimensional subspace. We propose an encryption scheme, which is homomorphic in nature, based on VDP.