Curve Diffie-Hellman Key Exchange Research Articles

Authenticated Public Key Elliptic Curve Based on Deep Convolutional Neural Network for Cybersecurity Image Encryption Application.

The demand for cybersecurity is growing to safeguard information flow and enhance data privacy. This essay suggests a novel authenticated public key elliptic curve based on a deep convolutional neural network (APK-EC-DCNN) for cybersecurity image encryption application. The public key elliptic curve discrete logarithmic problem (EC-DLP) is used for elliptic curve Diffie-Hellman key exchange (EC-DHKE) in order to generate a shared session key, which is used as the chaotic system's beginning conditions and control parameters. In addition, the authenticity and confidentiality can be archived based on ECC to share the EC parameters between two parties by using the EC-DHKE algorithm. Moreover, the 3D Quantum Chaotic Logistic Map (3D QCLM) has an extremely chaotic behavior of the bifurcation diagram and high Lyapunov exponent, which can be used in high-level security. In addition, in order to achieve the authentication property, the secure hash function uses the output sequence of the DCNN and the output sequence of the 3D QCLM in the proposed authenticated expansion diffusion matrix (AEDM). Finally, partial frequency domain encryption (PFDE) technique is achieved by using the discrete wavelet transform in order to satisfy the robustness and fast encryption process. Simulation results and security analysis demonstrate that the proposed encryption algorithm achieved the performance of the state-of-the-art techniques in terms of quality, security, and robustness against noise- and signal-processing attacks.

A Comprehensive Survey on Lightweight Asymmetric Key Cryptographic Algorithm for Resource Constrained Devices

Elliptic Curve Cryptography, being a popular lightweight asymmetric key cryptographic algorithm that is widely adapted to meet high security requirement of resource constrained devices, were surveyed in this work. Further, ECC-based ElGamal cryptosystem, Elliptic Curve Digital Signature Algorithm, and Elliptic Curve Diffie Hellman Key Exchange Algorithm have been comprehensively reviewed with its characteristics and preferred applications. In addition, few related work are analyzed and suggestions for suitable target applications were provided. Moreover, ECC being a popular asymmetric key cryptographic technique is reported to be modeled using Vivado tool for various target implementation on FPGA devices. Techniques that enhances throughput, area, and computation time that caters for IoT applications were also reviewed. Design implementations on the advanced FPGA boards for IoT device/similar applications were also analyzed and compared.

Group Security Authentication and Key Agreement Protocol Built by Elliptic Curve Diffie Hellman Key Exchange for LTE Military Grade Communication

4G mobile communication is a global technology. Therefore, it is essential to enforce confidentiality between mobile users and their networks. This paper presents a Group Security Authentication and Key Agreement Protocol Built by Elliptic Curve Diffie Hellman Key Exchange (GSAKA-ECDHKE) to overcome and address the LTE networks Evolved Packet System Authentication and Key Agreement Protocol (EPS-AKA) protocol flaws and vulnerabilities. GSAKA-ECDHKE is presented for 4G mobile military group communications to provide security, confidentiality, and privacy while the users and networks authenticate. By embedding the Group Commander (GC) role in the EPS-AKA protocol to control the member authentication in the group. GSAKA-ECDHKE protocol is based on Elliptic Curve Diffie Hellman Key Exchange (ECDHKE) and hash function to generate and share secret Elliptic Curve (EC) key to encrypt and protect the routing authentication parameters. The Automated Validation of Internet Security Protocols and Applications (AVISPA) tool is used for security analysis and formal verification. AVISPA demonstrated that GSAKA-ECDHKE had overcome various known security attacks such as Man In The Middle (MITM), replay attacks, and Denial of Services (DoS) attacks, satisfying the evaluated security requirements. Additionally, the suggested protocol provides the lowest communication overheads compared to the existing group-based AKA protocols.

Cryptanalysis of elliptic curve hidden number problem from PKC 2017

In PKC 2017, the elliptic curve hidden number problem (EC-HNP) was revisited in order to rigorously assess the bit security of the elliptic curve Diffie–Hellman key exchange protocol. In this paper, we solve EC-HNP by using the Coppersmith technique which combines the idea behind the second lattice method of Boneh, Halevi and Howgrave-Graham for solving the modular inversion hidden number problem. We show that the hidden point in EC-HNP can be recovered asymptotically if about half of the most significant bits of the x-coordinates of the corresponding points are given. A similar result is also obtained for the least significant bits. We provide better bounds than the one in the work of PKC 2017, which needs about 5/6 of the bits as a result of a rigorous algorithm. However, our solution is based on a heuristic assumption. We verify the validity of our heuristic algorithm by computer experiments.

Security Analysis and Improvements of Session Key Establishment for Clustered Sensor Networks

WSN (wireless sensor network) is one of the main technologies in IoT (Internet of Things) applications or services. To date, several schemes have been proposed to establish a pair-wise key between two nodes in WSN, and most of them are designed to establish long-term keys used throughout the network lifetime. However, in the near future, if WSN will be used for information infrastructures in various fields such as manufacturing, distribution, or public facilities management and its life cycle can be as long as that of other common networks, it will definitely be advantageous in terms of security to encrypt messages using session keys instead of long-term keys. In this paper, we propose a session key establishment scheme for clustered sensor networks that is based on elliptic curve Diffie-Hellman (ECDH) key exchange and hash chain. The proposed scheme eliminates vulnerabilities of existing schemes for WSN and has improved security. The proposed scheme is efficient in terms of energy costs compared to related schemes.

Seladg: Secure Energy Efficient Location Aware Data Gathering Approach for Wireless Sensor Networks

Abstract Recent trends in wireless sensor networks leads to the development of new protocols for data gathering. In this paper, a secure energy efficient location aware data gathering approach is introduced to secure data gathering. An Elliptic Curve Diffie Hellman Key Exchange (ECDHKE) algorithm is utilized for key generation and key exchange between the sensor nodes to maintain security and prevent the data from malicious nodes. The performance of the proposed scheme is validated in terms of packet drop, throughput, energy consumption, residual energy and network lifetime. The proposed scheme achieves better performance than the existing EEHA and SMART schemes.