Share Your Research, Maximize Your Social Impacts
A Key Agreement Protocol Using Non-Abelian Group
Journal: International Journal of Advanced Networking and Applications (Vol.2, No. 04)Publication Date: 2011-01-05
Authors : Abhishek Dwivedi; D.B.Ojha;
Page : 780-783
Keywords : Non abelian group; braid group; root problem; key agreement; and security;
Source : Download
Find it from : Google Scholar
Abstract
This paper presents a key agreement protocol based on a non abelian group. It is proved that the proposed protocol meets
several security attributes under the assumption that the Root Problem (RP) in braid group is a hard problem.
Other Latest Articles
- The Impact of K-Factor on Wireless Link in Indian Semi-desert Terrain
- Different Aspects of Evolutionary Algorithms, Multi-Objective Optimization Algorithms and Application Domain
- Frame Based Symmetric Key Cryptography
- CBVANET: A Cluster Based Vehicular Adhoc Network Model for Simple Highway Communication
- A Survey on Clustering Algorithms for Heterogeneous Wireless Sensor Networks
Last modified: 2015-12-04 18:36:55