| ID | 149003 |
| Title Proper | Authenticated key agreement scheme using vector decomposition |
| Language | ENG |
| Author | I. Praveen, K. Rajeev, M. Sethumadhavan ; Praveen, I ; Sethumadhavan, M ; Rajeev, K |
| Summary / Abstract (Note) | 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 |
| `In' analytical Note | Defence Science Journal Vol. 66, No.6; Nov 2016: p.594-599 |
| Journal Source | Defence Science Journal 2016-12 66, 6 |
| Key Words | Vector Decomposition Problem ; Distortion Eigenvector Space ; Key Establishment |