A Review Based Study of Key Exchange Algorithms (original) (raw)

Secure Session Key sharing Using Public Key Cryptography

In distributed systems, entities perform the predefined tasks distributively and have to communicate quite frequently. Confidentiality is the primary security requirement in such systems. There should be some secure mechanism whereby a pair of entities can securely communicate with each other. In most of the applications of distributed systems, computational and communication resources are limited and any such mechanism that ensures security of data under transmission should consider these computational and communicational constraints. Symmetric key cryptography emerges as one of the effective mechanisms to secure the data in distributed systems. The security of a symmetric key mechanism purely depends on the secrecy of the session key. In this paper, we have proposed a protocol for the sharing of session key between communicating entities securely. The proposed protocol secures the session through asymmetric key mechanism and once the session key is securely shared, the entities can communicate through the shared session key.

Analysis of Key Exchange Protocols using Session Keys

Security of information flowing through insecure network is becoming complicated with advent of internet and its usage. Encrypting information is one way of securing it from unauthorized access. This paper analyze techniques of exchanging key through which encryption is performed. We review the techniques on various parameters and find which technique is best suitable for use in mobile computers with limited processing power and battery capacity while efficiently working on wireless networks.

A New Scheme for Key Exchange

ijmer.com

Key management represents a major and the most sensitive part of cryptographic systems. It includes key generation, key distribution, key storage, and key deletion. It is also considered the hardest part of cryptography. Designing secure cryptographic algorithms is hard, and keeping the keys secret is much harder. Cryptanalysts usually attack both symmetric and public key cryptosystems through their key management. We introduce a protocol to exchange keys over insecure communication channel. This protocol generates keys for symmetric encryption, especially a key exchange based on Binary Decision Diagram.

A Study on Diffie-Hellman Key Exchange Protocols

International Journal of Pure and Apllied Mathematics, 2017

Securing network traffic has always been a must requirement for any network application that employs insecure communication channel. The reason is to provide protection for the transmitted data over the network against unauthorized disclosure and modification of the messages between communicating parties. A Key exchange protocol is the cryptographic primitive that can establish a secure communication. The first Key exchange protocol was introduced by Diffie-Hellman. The purpose of the Diffie-Hellman protocol is to enable two parties to securely exchange a session key which can then be used for next symmetric encryption of messages. However, Diffie-Hellman itself does not authenticate the communicating entities. In this paper, we study on Diffie-Hellman Key exchange protocol. Subsequently describe authenticated key exchange protocol and One-pass key exchange protocol, which are the variants of Diffie-Hellman protocol.

A Novel Password Protected Key Exchange Protocol

— Exchanging messages are more common thing lately. More number of people connects with each other in the network and (verifies someone's identity) each other while sharing their data. So users following so many rules of conduct for providing security to their data and the servers which they are storing their data. Due to all data storing in the single server, there is a chance to hack server data to be told (to people). This paper presents a solution to this problem such as (verifying someone's identity) process has to share by two servers. Client has to (verify someone's identity) in two servers like two step checking (for truth). It also includes (related to secret computer codes) ways of doing things to provide security for the data stored in the servers.

An Analysis Of Session Key Exchange Protocols

Information security has been one of the most important aspects in today’s technology driven world. By encrypting information we can secure information from unauthorized access, even in case where use has information he/she can not make out meaning of message unless they have a key to decrypt information. We review different techniques to exchange keys between different computers and try to find best suitable technique for mobile computers which have limited processing power and battery capacity while efficiently working on wireless network.

A Study on Asymmetric Key Exchange

2012

Key exchange protocols enable the use of sharedkey cryptography to protect transmitted data over insecure networks. The key exchange protocols are classified into i) symmetric ii) asymmetric (public key). Many public-key-based (asymmetric) key-exchange protocols already exist and have been implemented for a variety of applications and environments. We present a general framework for authentication problems and design principles of different asymmetric key exchange protocols. The analysis of these protocols also includes merits and demerits of each protocol. The study of these protocols emphasizes various observations that can motivate researchers in key management issues of networks.

Extended Diffie-Hellman Algorithm for Key Exchange and Management

2013

Since the publication of Diffie-Hellman algorithm for two-party key exchange in 1976, the concept of key exchange over the insecure communication channel has revolutionized totally. The purpose of algorithm is used to enable users to security exchange a key that can be used for subsequent encryption. The ability to dynamically and publicly establish a session key for secure communication between groups of participants is a foundation of many secure group applications, such as conference calls, distributed computation, and distributed databases. The very idea is based on using arithmetic calculations to transmit the shared session keys using a cost-effective and easy mechanism. The Diffie-Hellman algorithm provides better security against attacks like man-in-the-middle attacks. Due to such superior features Diffie-Hellman algorithm has been revised many times by several authors. Our proposed algorithm is also based on Diffie-Hellman algorithm, which uses a new technique for sharing s...

An Approach to Cryptosystem through a Proposed and Secured Protocol

International Journal of Computer Applications, 2012

The Diffie-Hellman key algorithm was the first proposed public key algorithm by which two parties can communicate with each other without having any prior knowledge of each other over an insecure communication channel proposed by Harn.et.al. Diffie-Hellman key exchange algorithm is the most famous algorithm to exchange keys over a network but it has some false and drawbacks. So in our work we have proposed a new agreement protocol based on key confirmation as well as Diffie-Hellman algorithm. This protocol also works on the elliptic curve cryptography in asymmetric encryption.