An Authenticated Key Agreement Scheme using Vector Decomposition

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 pape

Making serial number based authentication robust against loss of state

In this paper a novel method for making serial number based authentication protocols resilient against database failure is described. The method is applicable to the situation where a single server wishes to authenticate itself to a number of clients, but cannot reliably maintain a sequence number database. The solution has recently been included in a draft international standard for third generation mobile telecommunications, [1]