Elliptic Curve Diffie-Hellman Algorithm Research Articles

Implementing Enhanced Security in the Zigbee Joining Process Using Elliptic Curve Diffie–Hellman Algorithm

Implementing Enhanced Security in the Zigbee Joining Process Using Elliptic Curve Diffie–Hellman Algorithm

Compact and High Speed Point Multiplication Architecture for Elliptic Curve Diffie-Hellman Algorithm on Reconfigurable Computing

Compact and High Speed Point Multiplication Architecture for Elliptic Curve Diffie-Hellman Algorithm on Reconfigurable Computing

RETRACTED ARTICLE: Advanced resilient data consigning mechanism for mobile adhoc networks

Routing in network is a classic issue to be solved. To route the data among the nodes without any interruptions and without getting yield in any kind of malicious attack is a tedious task. Though there exist many routing techniques which were near success in the past some part of the problems are always left unsolved. Trust-based routing techniques and the bio-inspired path is connecting techniques area embedded together to solve this. The security of the proposed technique is given a big significance, which takes care of the rest of the key points. Initially, when a node tries to enter into the network which was already secured and confined by trustable nodes, we provide a two-way security check both from the new node and from the host node. This is made possible by applying digital signature algorithm, hash message authentication code, and message-digest algorithms for signature generations, hash value generation, and its corresponding encrypt and decrypt procedure. Elliptic curve Diffie–Hellman algorithm is used for certificate verification, after which the node is provided with the broadcast key. In the case of routing, ant colony optimization is applied to detect the best path for routing from root to destiny, and this path is again verified by trust frameworks and certain calculations. This highly secured verification and authentication process make the proposed advanced resilient data consigning mechanism (ARDC) stand out from the existing routing mechanisms. The proposed ARDC mechanism is analyzed against various network frameworks as throughput, packet loss, overhead, delivery ratio, delivery latency, and hop count and path reliability to prove its effectiveness. Further, the routing capability is also analyzed by comparing it against traditional DSR, destination-sequenced distance-vector and open shortest path first protocols.

A Well-Organized Safeguarded Access on Key Propagation by Malleable Optimization in Blend With Double Permutation

With the rapid developments occurring in cloud computing and services, there has been a growing trend of using the cloud for large-scale data storage. This has led to a major security dispute on data handling. Thus, the process can be overcome by utilizing an efficient shielded access on a key propagation (ESAKP) technique along with an adaptive optimization algorithm for password generation and performing double permutation. The password generation is done by adaptive ant lion optimization (AALO) which tackles the problem of ineffiency. This build has stronger security which needs an efficient selection property by eliminating the worst fit in each iteration. The optimized password is utilized by an adaptive vignere cipher for efficient key generation in which adaptiveness is employed to prevent the dilemma of choosing the first letter of alphabet which in turn reduces the computation time and improves the security. Additionally, there is a need to encrypte the symmetric key asymmetrically with a Elliptic Curve-Diffie Hellman algorithm (EC-DH) with a double stage permutation which produces a scrambling form of data adding security to the data.

Fuzzy Genetic Elliptic Curve Diffie Hellman Algorithm for Secured Communication in Networks

More computations have to be done through less powerful mobile devices which includes ultra modern wearables. The huge overhead lies in the processing of the humongous key space each and computation of the intelligible message. The uniqueness of the elliptic curve cryptography (ECC) lies in the processing of data using shorter keys which are capable to achieve the performance of long key requirement of RSA. In order to reduce the overhead involved in the computation of less powerful mobile devices the fuzzy genetic elliptic curve Diffie Hellman is proposed in this paper. The intelligent rules are used for ranking during key selection process, multi attribute decision making model with fuzzy reasoning for obtaining keys and genetic algorithms for effective optimization of computation in ECC contributes to obtain the proposed FGECDH algorithm.

Applying Diffie-Hellman Algorithm to Solve the Key Agreement Problem in Mobile Blockchain-based Sensing Applications

Mobile blockchain has achieved huge success with the integration of edge computing services. This concept, when applied in mobile crowd sensing, enables transfer of sensor data from blockchain clients to edge nodes. Edge nodes perform proof-of-work on sensor data from blockchain clients and append validated data to the chain. With this approach, blockchain can be performed pervasively. However, securing sensitive sensor data in a mobile blockchain (client/edge node architecture) becomes imperative. To this end, this paper proposes an integrated framework for mobile blockchain which ensures key agreement between clients and edge nodes using Elliptic Curve Diffie-Hellman algorithm. Also, the framework provides efficient encryption of sensor data using the Advanced Encryption Standard algorithm. Finally, key agreement processes in the framework were analyzed and results show that key pairing between the blockchain client and the edge node is a non-trivial process.

10 Gbit/s ethernet passive optical network certification scheme based on number theory research unit signature algorithm

The article is mainly to solve the security problems existing in ethernet passive optical network. The most obvious thing is that when optical network unit (ONU) is registered, to prevent attackers from eavesdropping and camouflage, we need mutual authentication between the optical line terminal and ONU to ensure the legality of both sides. To solve this problem, this paper designs a bidirectional authentication scheme based on number theory research unit signature algorithm (NTRUSign), using NTRUSign algorithm for authentication, can avoid impersonation attacks but could not prevent the middle eavesdropping attacks, so the data encryption algorithm AES using the traditional transmission of encrypted. Elliptic curve Diffie–Hellman algorithm is used to carry out key exchange, as the key to the subsequent data transmission, and can be completed in the ONU registration process without the need of third-party participation. The analysis results show that this method improves the reliability of identity authentication and data transmission security.

Security Architecture for the Cloud Integrated Internet of Things

Objectives: To design efficient hybrid architecture for data security is applied for securing communication link between two user/senders by considering symmetric key algorithm and asymmetric key algorithm. Methods/ Analysis: A highly efficient architectures for data security is applied for securing communication link between two user/senders in cloud integrated Internet of Things (IoT). Data is encrypted with Advanced Encryption Standard (AES) algorithm and Elliptical Curve Cryptography (ECC) concept is used for securing the secret key between user/ sender and system/receiver. In this architecture authentication is provided by Elliptic Curve Diffie Hellman algorithm between user/sender and system/receiver. The efficient hybrid architecture is implemented on Field Programmable Gate Array (FPGA) and is scripted in verilog Hardware Description language (HDL).Findings: According to the IoT concept, Radio Frequency Identification (RFID) and Wireless Sensor Networks (WSN) meet new challenges related to large volume of data. The physical things in an IoT are generally identified by WSN or RFID before connecting with each other. Once identified, they can interchange data between them. Cloud computing provides virtual infrastructure for storing, analyzing, and virtualization large data in client delivery. Data transferring like storing and retrieving from cloud by different user/senders should be secure from Men in the Middle (MIM) attack of information. The outcomes obtained shows that the efficient cryptosystem with encryption and decryption has a minimum period of 18.060ns with the maximum achievable frequency of 55.371MHz on Xilinx Virtex-5 (XC5VLX50T-1FF1136).Novelty/ Improvement: In this paper ECC algorithm is for providing security communication between user/senders and system/receiver. ECC encryption is used for encrypting the request of user/senders connected to the receiver. The file in the system/receiver is accessed by the user/sender and the file is encrypted by system/receiver using user/ sender’s public key. When uploading the files system/receiver encrypts the file using AES encryption algorithm or while downloading the file from data storage the system/receiver decrypts the data or file using AES algorithm.

VANET에서 ECDH 기반 그룹키를 이용한 그룹간 인증 설계

본 논문에서는 안전한 V2V 통신과 V2I 통신을 보장하는 ECDH(Elliptic Curve Diffie Hellman) 기반 그룹키를 제안하였다. 본 논문에서 제안하는 ECDH기반 그룹키는 AAA 서버를 사용하지 않고 차량과 차량사이의 그룹키인 VGK(Vehicular Group Key), 차량 그룹 사이의 그룹키인 GGK(Globak Group Key), 그리고 차량과 RSU사이의 그룹키인 VRGK(Vehicular and RSU Group Key)를 ECDH 알고리즘을 이용하여 생성한다. 차량과 RSU 사이의 그룹키인 VRGK는 현재 RSU에서 다음 RSU에게로 RGK(RSU Group Key)로 암호화하여 안전한 채널을 통하여 전달하기 때문에 완벽한 순방향 기밀(Perfect Forward Secrecy) 보안 서비스가 제공된다. 또한, 메시지를 전송한 차량이 해당 그룹의 구성원인지를 그룹키 이용하여 확인함으로써 Sybil공격을 탐지할 수 있다. 그리고 그룹간의 안전한 통신으로 불필요한 네트워크 트래픽이 발생하지 않으므로 메시지 전송 시간 및 서버의 오버헤드를 줄일 수 있다. This paper proposes a group key design based on ECDH(Elliptic Curve Diffie Hellman) which guarantees secure V2V and V2I communication. The group key based on ECDH generates the VGK(Vehicular Group key) which is a group key between vehicles, the GGK(Global Group Key) which is a group key between vehicle groups, and the VRGK(Vehicular and RSU Group key) which is a group key between vehicle and RSUs with ECDH algorithm without an AAA server being used. As the VRGK encrypted with RGK(RSU Group Key) is transferred from the current RSU to the next RSU through a secure channel, a perfect forward secret security is provided. In addition, a Sybil attack is detected by checking whether the vehicular that transferred a message is a member of the group with a group key. And the transmission time of messages and the overhead of a server can be reduced because an unnecessary network traffic doesn't happen by means of the secure communication between groups.

Elliptic curve cryptography based authenticated key agreement with pre-shared password

Based on elliptic curve Diffie-Hellman algorithm, an Elliptic Curve Authenticated Key Agreement (ECAKA) protocol with pre-shared password is proposed. Its security relies on the Elliptic Curve Discrete Logarithm Problem (ECDLP). It provides identity authentication, key validation and perfect forward secrecy, and it can foil man-in-the-middle attacks.