Query Result Set
Skip Navigation Links
   ActiveUsers:3471Hits:20985448Skip Navigation Links
Show My Basket
Contact Us
IDSA Web Site
Ask Us
Today's News
HelpExpand Help
Advanced search

  Hide Options
Sort Order Items / Page
KEY ESTABLISHMENT (1) answer(s).
 
SrlItem
1
ID:   149003


Authenticated key agreement scheme using vector decomposition / Praveen, I; Sethumadhavan, M; Rajeev, K   Journal Article
I. Praveen, K. Rajeev, M. Sethumadhavan Journal Article
0 Rating(s) & 0 Review(s)
Summary/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
        Export Export