An Authenticated Key Agreement Scheme using Vector Decomposition
Keywords:
Vector decomposition problem, distortion eigenvector space, key establishment
Abstract
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
Published
2016-10-31
How to Cite
Praveen, I., Rajeev, K., & Sethumadhavan, M. (2016). An Authenticated Key Agreement Scheme using Vector Decomposition. Defence Science Journal, 66(6), 594-599. https://doi.org/10.14429/dsj.66.10799
Section
Special Issue Papers
Copyright (c) 2016 Defence Science Journal
Where otherwise noted, the Articles on this site are licensed under Creative Commons License: CC Attribution-Noncommercial-No Derivative Works 2.5 India