ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Journal Article
Publisher : Defence Science Journal, Defense Scientific Information and Documentation Centre,
Source : Defence Science Journal, Defense Scientific Information and Documentation Centre, Volume 66, Number 6, p.594-599 (2016)
Keywords : Authenticated key agreement, Computational diffie-hellman problems, Cryptography, Discrete logarithm problems, Encryption schemes, Higher-dimensional, Key establishments, One dimensional, Signature Scheme, Vector decompositions, Vector spaces, Vectors
Campus : Coimbatore
School : School of Engineering
Center : TIFAC CORE in Cyber Security
Department : Mathematics
Year : 2016
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. © 2016, DESIDOC.
Cite this Research Publication : I. Praveen, Rajeev, K., and Sethumadhavan, M., “An authenticated key agreement scheme using vector decomposition”, Defence Science Journal, vol. 66, pp. 594-599, 2016.