Encryption using vector decomposition problem (VDP) on higher dimensional vector spaces is a novel method in cryptography. Yoshida has shown that the VDP on a two-dimensional vector space is at least as hard as the computational Diffie-Hellman problem on a one-dimensional subspace under certain conditions. Steven Galbraith has shown that for certain curves, the VDP is at most as hard as the discrete logarithm problem on a one-dimensional subspace. Okomoto and Takashima proposed encryption scheme and signature schemes using VDP. An authenticated key agreement scheme using vector decomposition problem is proposed in this paper. © 2016, DESIDOC.
cited By 0
I. Praveen, Rajeev, K., and Sethumadhavan, M., “An authenticated key agreement scheme using vector decomposition”, Defence Science Journal, vol. 66, pp. 594-599, 2016.