TRIPARTITE KEY AGREEMENT PROTOCOL USING TRIPLE DECOMPOSITION SEARCH PROBLEM


TRIPARTITE KEY AGREEMENT PROTOCOL USING TRIPLE DECOMPOSITION SEARCH PROBLEM

 T.Isaiyarasi 1 , Dr.K.Sankarasubramanian 2

1Research Scholar, Bharathiar University &Assistant Professor Department of Mathematics, Valliammai Engineering College S.R.M.Nagar ,Kattankulathur, Tamil Nadu -603203, India
 2Research Supervisor, Bharathiar University & Professor, Department of Mathematics, Sri Sairam Engineering College. SaiLeo Nagar –West Tambaram ,Tamilnadu-600044 ,India

ABSTRACT

A Key Agreement Protocol is a tool by which two parties can share a common key for their subsequent communication .Many cryptographic protocols are based on the hardness of Integer Factorization and Discrete Logarithm Problem. Very few Protocols are based on search problems in non – abelian groups. In this paper we present a Tripartite Key Agreement Protocol Using Triple Decomposition Search Problem using which three parties may agree on a common shared key in two rounds. We have chosen Discrete Heisenberg group and three cyclic sub groups as our platform to apply the above protocol.

KEY WORDS

Search Problems, Non –abelian group, Key Agreement Protocol, Triple Decomposition Search Problem ,Discrete Heisenberg Group.


SOURCE URL

 https://wireilla.com/papers/ijcis/V2N3/2312ijcis04.pdf

VOLUME LINK

https://wireilla.com/ijcis/vol2.html


Comments

Post a Comment

Popular posts from this blog

Implementation of a New Methodology to Reduce the Effects of Changes of Illumination in Face Recognition-based Authentication Andres

Image
Implementation of a New Methodology to Reduce the Effects of Changes of Illumination in Face Recognition-based Authentication Andres  Alarcon-Ramirez, and Mohamed F. Chouikha  Department of Electrical Engineering, Howard University, Washington DC ABSTRACT   In this paper, the study of the effects of illumination changes in the process of face recognition is discussed. Additionally, a new methodology that integrates Single-Scale Retinex (SSR) and Scale Invariant Feature Transform (SIFT) is presented. The proposed methodology addresses the problem of illumination changes in face recognition-based authentication systems. To do this, the SSR transform eliminates the component of luminance from the face image and recovers the reflectance component which is invariant to illumination changes; then, the SIFT transform detects interest points from the reflectance component of the face image. The interest points are features rich in information and may be used to ...
Read more

A DEFENSE MECHANISM FOR CREDIT CARD FRAUD DETECTION

Image
A DEFENSE MECHANISM FOR CREDIT CARD FRAUD DETECTION   M.Sasirekha , Sumaiya Thaseen   and Saira Banu School of Computing Science and Engineering, VIT University, Tamil Nadu, India. ABSTRACT Computer security is one of the key areas where lot of research is being done. Many intrusion detection techniques are proposed to ensure the network security, protect network resources and network infrastructures. Intrusion detection systems (IDS) attempt to detect attacks by gathering network data and analyze the information from various areas to identify the possible intrusions. This paper proposes a defense mechanism combining three approaches such as anomaly, misuse and decision making model to produce better detection accuracy and a decreased false positive rate. The defense mechanism can be built to detect the attacks in credit card system using Hidden Markov approach in the anomaly detection module. The credit card holder’s behaviours are taken as attributes and t...
Read more

DYNAMIC VALIDITY PERIOD CALCULATION OF DIGITAL CERTIFICATES BASED ON AGGREGATED SECURITY ASSESSMENT

Image
DYNAMIC VALIDITY PERIOD CALCULATION OF DIGITAL CERTIFICATES BASED ON AGGREGATED SECURITY ASSESSMENT  Alexander Beck, Jens Graupmann, Frank Ortmeier Computer Systems in Engineering, Otto-von-Guericke-University, Magdeburg, Germany  ABSTRACT  The paper proposes a method based on different security-related factors to dynamically calculate the validity period of digital certificates. Currently validity periods are most often defined statically without scientific justification. This approach is not sufficient to objectively consider the actual need for security. Therefore the approach proposed in this paper considers relevant security criteria in order to calculate a meaningful validity period for digital certificates. This kind of security assessment can be executed periodically in order to dynamically respond to changing conditions. Especially in the context of complex systems and infrastructures that have an increased need for security, privacy and availab...
Read more