A NEW MULTI PARTY KEY AGREEMENT PROTOCOL USING SEARCH PROBLEMS IN DISCRETE HEISENBERG GROUP.
Journal Title: Indian Journal of Computer Science and Engineering - Year 2012, Vol 3, Issue 1
Abstract
In this paper we present a multi-party Key Agreement Protocol (KAP) using some of the search problems such as Factorization Search Problem , Decomposition Search Problem Conjugacy Search Problem and Twisted Conjugacy Problem. We have chosen Discrete Heisenberg group as our platform group in the above search problems.
Authors and Affiliations
T. ISAIYARASI , DR. K. SANKARASUBRAMANIAN
Keywords
Related Articles
- EP ID EP103314
- DOI -
- Views 158
- Downloads 0
QOS PARAMETER ANALYSIS ON AODV AND DSDV PROTOCOLS IN A WIRELESS NETWORK
Wireless networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment. To imp...
ARTIFICIAL NEURAL NETWORK BASED DISCRIMINATION OF MINELIKE OBJECTS IN INFRARED IMAGES
An artificial neural network (ANN) model with a simple architecture containing a single hidden layer is presented to discriminate the landmine objects from the acquired infrared images. The proposed method consists of pr...
AN ALGORITHM FOR DIGITAL WATERMARKING OF STILL IMAGES FOR COPYRIGHT PROTECTION
The rapid expansion of the Internet has rapidly increased the availability of digital data such as audio, images and videos to the public and file sharing has become very convenient. As such, the problem of protecting mu...
THE MAIN FEATURE FOR SUCCESSFUL IMPLEMENTATION A DATA WAREHOUSE
Data warehousing is the leading and most reliable technology used today by companies for planning, forecasting, and management A lot has been done in this field regarding design and development of data warehouses and a l...
Comparative study of security parameters by Cloud Providers
Security is one of the major issues today around the world. Either it is a home user or Corporate User, a small PC or a Server System, nothing is totally secure, lots of issues have been raised regarding security. In thi...