An Authenticated Key Agreement Scheme using Vector Decomposition

  • I. Praveen TIFAC CORE in Cyber Security, Amrita School of Engineering,Amrita Vishwa Vidyapeetham, Amrita University,Coimbatore, India
  • K. Rajeev TIFAC CORE in Cyber Security, Amrita School of Engineering,Amrita Vishwa Vidyapeetham, Amrita University,Coimbatore, India
  • M. Sethumadhavan TIFAC CORE in Cyber Security, Amrita School of Engineering,Amrita Vishwa Vidyapeetham, Amrita University,Coimbatore, India
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

Author Biographies

I. Praveen, TIFAC CORE in Cyber Security, Amrita School of Engineering,Amrita Vishwa Vidyapeetham, Amrita University,Coimbatore, India
Mr Praveen I. received his Master’s in Mathematics from Cochin University of Science and Technology. Presently he is working as Assistant Professor in the department of Mathematics, Amrtia Vishwa Vidyapeetham (University), Coimbatore. His research interests include: Pairing based cryptography and elliptic curve cryptography.
K. Rajeev, TIFAC CORE in Cyber Security, Amrita School of Engineering,Amrita Vishwa Vidyapeetham, Amrita University,Coimbatore, India
Mr Rajeev K. received his Master’s from University of Calicut. He currently serves as Research Associate at TIFAC CORE in Cyber Security, Amrtia Vishwa Vidyapeetham (University), Coimbatore. His areas of interests are Pairing based cryptography and cryptographic boolean functions.
M. Sethumadhavan, TIFAC CORE in Cyber Security, Amrita School of Engineering,Amrita Vishwa Vidyapeetham, Amrita University,Coimbatore, India
Dr M. Sethumadhavan received his PhD (Number Theory) from Calicut Regional Engineering College. Currently, he is working as a Professor in the Department of Mathematics and Computer Science, Amrita VishwaVidyapeetham (University), Coimbatore.
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