Elliptic Curve Diffie-Hellman Research Articles

A Quantum-Resistant Identity Authentication and Key Agreement Scheme for UAV Networks Based on Kyber Algorithm

Unmanned aerial vehicles (UAVs) play a critical role in various fields, including logistics, agriculture, and rescue operations. Effective identity authentication and key agreement schemes are vital for UAV networks to combat threats. Current schemes often employ algorithms like elliptic curve cryptography (ECC) and Rivest–Shamir–Adleman (RSA), which are vulnerable to quantum attacks. To address this issue, we propose LIGKYX, a novel scheme combining the quantum-resistant Kyber algorithm with the hash-based message authentication code (HMAC) for enhanced security and efficiency. This scheme enables the mutual authentication between UAVs and ground stations and supports secure session key establishment protocols. Additionally, it facilitates robust authentication and key agreement among UAVs through control stations, addressing the critical challenge of quantum-resistant security in UAV networks. The proposed LIGKYX scheme operates based on the Kyber algorithm and elliptic curve Diffie–Hellman (ECDH) key exchange protocol, employing the HMAC and pre-computation techniques. Furthermore, a formal verification tool validated the security of LIGKYX under the Dolev–Yao threat model. Comparative analyses on security properties, communication overhead, and computational overhead indicate that LIGKYX not only matches or exceeds existing schemes but also uniquely counters quantum attacks effectively, ensuring the security of UAV communication networks with a lower time overhead for authentication and communication.

Enhancing Medical Image Security through a Novel Framework: Crypto-aware Elliptic Curve Diffie-hellman with Key Derivation Function

Enhancing Medical Image Security through a Novel Framework: Crypto-aware Elliptic Curve Diffie-hellman with Key Derivation Function

Two-Layered Multi-Factor Authentication Using Decentralized Blockchain in an IoT Environment.

Internet of Things (IoT) technology is evolving over the peak of smart infrastructure with the participation of IoT devices in a wide range of applications. Traditional IoT authentication methods are vulnerable to threats due to wireless data transmission. However, IoT devices are resource- and energy-constrained, so building lightweight security that provides stronger authentication is essential. This paper proposes a novel, two-layered multi-factor authentication (2L-MFA) framework using blockchain to enhance IoT devices and user security. The first level of authentication is for IoT devices, one that considers secret keys, geographical location, and physically unclonable function (PUF). Proof-of-authentication (PoAh) and elliptic curve Diffie-Hellman are followed for lightweight and low latency support. Second-level authentication for IoT users, which are sub-categorized into four levels, each defined by specific factors such as identity, password, and biometrics. The first level involves a matrix-based password; the second level utilizes the elliptic curve digital signature algorithm (ECDSA); and levels 3 and 4 are secured with iris and finger vein, providing comprehensive and robust authentication. We deployed fuzzy logic to validate the authentication and make the system more robust. The 2L-MFA model significantly improves performance, reducing registration, login, and authentication times by up to 25%, 50%, and 25%, respectively, facilitating quicker cloud access post-authentication and enhancing overall efficiency.

A Blockchain-Assisted Security Protocol for Group Handover of MTC Devices in 5G Wireless Networks.

In the realm of the fifth-generation (5G) wireless cellular networks, renowned for their dense connectivity, there lies a substantial facilitation of a myriad of Internet of Things (IoT) applications, which can be supported by the massive machine-type communication (MTC) technique, a fundamental communication framework. In some scenarios, a large number of machine-type communication devices (MTCD) may simultaneously enter the communication coverage of a target base station. However, the current handover mechanism specified by the 3rd Generation Partnership Project (3GPP) Release 16 incurs high signaling overhead within the access and core networks, which may have negative impacts on network efficiency. Additionally, other existing solutions are vulnerable to malicious attacks such as Denial of Service (DoS), Distributed Denial of Service (DDoS) attacks, and the failure of Key Forward Secrecy (KFS). To address this challenge, this paper proposes an efficient and secure handover authentication protocol for a group of MTCDs supported by blockchain technology. This protocol leverages the decentralized nature of blockchain technology and combines it with certificateless aggregate signatures to mutually authenticate the identity of a base station and a group of MTCDs. This approach can reduce signaling overhead and avoid key escrow while significantly lowering the risk associated with single points of failure. Additionally, the protocol protects device anonymity by encrypting device identities with temporary anonymous identity markers with the Elliptic Curve Diffie-Hellman (ECDH) to abandon serial numbers to prevent linkage attacks. The resilience of the proposed protocol against predominant malicious attacks has been rigorously validated through the application of the BAN logic and Scyther tool, underscoring its robust security attributes. Furthermore, compared to the existing solutions, the proposed protocol significantly reduces the authentication cost for a group of MTCDs during handover, while ensuring security, demonstrating commendable efficiency.

A hybrid key agreement scheme utilized elliptic curve Diffie-Hellman for IoT based advanced metering environment

A hybrid key agreement scheme utilized elliptic curve Diffie-Hellman for IoT based advanced metering environment

Wifi Pentesting Roadmap for Classic-Future Attacks and Defenses

The most advanced attack on the Wireless Fidelity (WIFI) network uses social engineering. The hacker makes portal captive and forces the victim for disconnecting to internet instead of entering the real password of the WIFI. In normal actions, asking WIFI password on the web interface is not the real process, but sometimes the victim is not experience enough on security and thinks that it is a technical problem. Also, the victim didn’t have internet connection due to the hard deauthentication and the select open access, which is not his WIFI network. The future generation of WIFI could be use a secure deauthentication. So, this article proposed how the actual attack will be processed, how is the secure deauthentication and how hacker could use this same attack with more secure network. Like conclusion, solutions to resolve this problem will be proposed. New hacking arsenal for replacing the deauthentication is the smart-jamming. With the secure deauthentication, reforging the packet for telling the victim to deauthenticate to the network will not be possible anymore. The smart-jamming select the frequency of the access point of the victim and jam only this specific frequency by sending a noise. In this scenario, the same effect of the first attack is still possible. For the best security of network, two solutions will be proposed: secure deauthentication and hopping frequency. A defensive proposition about secure deauthentication will be found in this article by using cryptographic key exchange like Diffie Hellman (DH), Elliptic Curve Diffie Hellman (ECDH) and Super Isogenies Diffie Hellman (CSIDH).

An image encryption method based on modified elliptic curve Diffie-Hellman key exchange protocol and Hill Cipher

Abstract Digital image protection is crucial since images often contain private and sensitive information in business, medical, and military. One of the best techniques for securing the content of these images is encryption. This article introduces a cryptosystem known as the elliptic curve Diffie-Hellman Hill Cipher (ECDHHC) that uses the modified eliptic curve Diffie-Hellman (ECDH) key exchange protocol to generate the shared secret key integrated with the Hill Cipher. An elliptic curve point-based secret shared key matrix using the ECDHHC, which will be used for encryption and decryption, is generated. Thereafter, the input image is split into a set of 8 × 8 submatrices and then changes the values of these matrices by multiplying each block with the secret shared key matrix. The encrypted image is constructed by merging all encrypted blocks. With this combination, the correlation between adjacent pixels in the ciphered image is effectively removed, and the level of unpredictability and uncertainty for the ciphered image is also enhanced. The suggested approach used the key space, entropy, histogram, antinoise attack, differential attack, and correlation coefficient to evaluate the performance of the encryption method. According to simulation findings, the proposed method offers a high level of security and efficiency, and resists attackers.

Enhancing IoT security using lightweight key management with PRESENT for resource-constrained devices

The increasing number of Internet of Things (IoT) devices in different areas has led to worries about their susceptibility to security risks because of their limited resources. This study aims to improve IoT security by utilizing a streamlined key management system based on the PRESENT block cipher algorithm. The proposed method is compared to TinyIKE and Elliptic Curve Diffie-Hellman (ECDH) using key parameters like Encryption Time, Decryption Time, Storage Usage, Energy Consumption, and Key Entropy. The paper’s introduction contextualizes the importance of securing IoT devices, highlighting the difficulties caused by their restricted computational capabilities. The research proposes using the PRESENT algorithm for key management systems because of its lightweight characteristics and compatibility with resource-limited environments. The proposed method will be thoroughly analyzed across different parameters to evaluate its performance in comparison to current solutions. The research shows that the suggested lightweight key management scheme using PRESENT is more effective than TinyIKE and ECDH in Encryption Time, Decryption Time, Storage Usage, Energy Consumption, and Key Entropy. The results demonstrate the effectiveness of the suggested approach in meeting the particular security needs of IoT devices with limited resources. This research enhances IoT security by proposing a lightweight key management method that efficiently tackles the issues caused by resource-limited devices. The comparative analysis demonstrates that the proposed method outperforms others, indicating its potential as an effective solution for securing IoT ecosystems in practical scenarios.

Integrated Shared Random Key Agreement Protocol for Wireless Sensor Network

The secured data transmission in Wireless Sensor Network (WSN) relies on effective key generation and secured sharing. The generated key must be random to enhance data confidentiality. The processes associated with the security in WSN must be designed at reduced computing time and communication cost. Our research work aims to design a novel lightweight key-sharing protocol that is needed for ensuring data confidentiality. The protocol must meet the constraints of WSN by being lightweight and consuming less energy. Security breaches in WSNs occur due to insecure keys. This can be overcome by generating shared keys which are generated once using the dynamic features of Sensor Nodes (SNs) when the Cluster Heads (CHs) are selected. In this research work, we have generated the Master Shared Key (MSK) at the transmitter node by forming a Galois Ring (GR) using WSN parameters and derived the Shared Random Key (SRK) using matched positions of exchanged Random Sequences (RSs). It is protected using a Physically Unclonable Function (PUF). The novelty lies in the SRK generation from MSK which is chosen at random from the polynomials generated during the formation of GR. The MSK is securely shared with the receiver node by encrypting using a Preloaded Key (PK). After this exchange, the key for encryption and decryption is derived by the transmitter and the receiver by exchanging RSs. The SRK is then encrypted using a key which is a unique fingerprint of the SN generated using PUF and stored in the SNs and the CHs to prevent node capture attack that occurs in WSN. Our proposed Shared Random Key Agreement Protocol (SRKAP) is comparable to the Localized Encryption and Authentication Protocol (LEAP) and performs better compared to the Elliptic Curve Diffie Hellman (ECDH) algorithm

Стандартизація еліптичних кривих: аналіз та впровадження в криптографічні протоколи

The purpose of the article is to consider the current state of elliptic cryptography, the prerequisites for its use, as well as the requirements of modern standards related to the use of elliptic cryptography The use of elliptic curves in cryptography is considered one of the most promising areas of development of modern security algorithms. This mathematical approach is based on the complexity of solving the discrete logarithm problem in a group of points of an elliptic curve over a finite field. The use of cryptography on elliptic curves allows you to ensure the security of data exchange using effective encryption algorithms and the creation of digital signatures (DI). This study examines elliptic curves for cryptographic purposes, and provides basic operations on the point group of elliptic curves. Special attention is paid to Elliptic curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature Algorithm (ECDSA) key exchange algorithms. The standards regulating the use of elliptic curves in cryptographic systems are also analyzed, and the advantages of this cryptographic paradigm compared to the main asymmetric algorithms are considered. Potential threats and vulnerabilities of cryptographic algorithms based on elliptic curves are investigated. Examples of popular standardized curves recommended by relevant organizations, such as NIST, used in real-world cryptographic applications are also provided. Elliptic curve cryptography (ECC) is currently one of the foundations for the development of modern public-key cryptographic algorithms. ECC has gained recognition in cryptography for providing a high level of security with shorter key lengths (compared to other cryptographic approaches), high speed, resource savings, and versatility, giving it an advantage over other methods such as RSA and others. It provides a secure network connection, generates secret keys for TLS servers and their clients, and is also used to create digital signatures that guarantee the authenticity of transactions in cryptocurrency systems.

The Hybrid Cryptographic Algorithms for Secure RFID Data Protection in The Internet of Things

RFID is often used by companies to identify employees and company assets, as well as in supermarkets to identify goods when shopping. In this increasingly sophisticated era, IoT technology has wide applications. The use of RFID technology in IoT networks may pose vulnerabilities to security and privacy because it contains sensitive information, and RFID data transmitted over communication channels is vulnerable to attacks. IoT technology has characteristics such as high autonomous data capture rate, network connectivity, and interoperability for services and applications. Therefore, this research aims to improve the security of RFID data by taking into account the characteristics of IoT. The method used is hybrid cryptography by combining AES (Advanced Encryption Standard) and ECDH (Elliptic-curve Diffie-Hellman) keys. AES, as a commonly used symmetric cryptography, is chosen to protect the data, while ECDH, as the latest asymmetric cryptography, is used for a faster and more efficient process compared to previous asymmetric methods. This study utilizes the Python programming language on Jupyter Notebook. The initial step of the study involved scanning the RFID data to be secured and configuring the key on ECDH. The subsequent process included encryption and decryption of the data. The study successfully tested the success of encryption and decryption on RFID UIDs. The test data includes the result display of the hybrid encryption, the encryption and decryption processing time, and the file size of the encryption (ciphertext) and decryption (decodetext). These results show an excellent level of security for RFID UIDs. Only those with a specific key can know the contents of the cipher. It should be noted that this study was only conducted at the program level and was not implemented on hardware. Therefore, the results can be a valuable reference for future research.

A novel color image encryption scheme using elliptic curve cryptography and hyperchaotic system

This paper develops an asymmetric color image encryption algorithm based on elliptic curve cryptography(ECC), five dimensions(5D) hyperchaotic system, and DNA dynamic coding. To embed the characteristics of original image in the image encryption algorithm, this algorithm builds a mathematical model to strengthen the connection between the original image, elliptic curve Diffie-Hellman(ECDH) algorithm and hyperchaotic system. The red, green and blue(RGB) channels of encrypted image is reshaped into a three dimensions(3D) matrix. Grouping and scrambling of 3D matrix is accomplished at pixel level, bit level and DNA level based on a 5D hyperchaotic system, which effectively enhances the cross-layer variation of images. Then, improved ECC is performed on the scrambled image where multiple elliptic curves and dynamic shared private keys can guarantee the forward secrecy of the image encryption algorithm. At last, the image is performed diffusion to obtain the final encrypted image. Simulation results and security analysis both indicate the image encryption algorithm has better performances in terms of key space, Shannon entropy, clipping attack resistance, etc.

IoT-Key Agreement Protocol Based on The Lowest Work-Load Versions of The Elliptic Curve Diffie-Hellman

A key agreement protocol (KAP) is a fundamental block in any cryptosystem since it ensures secure communication between two parties. Furthermore, KAP should include advanced features in limited-resource environments such as IoT, in which this protocol must be lightweight and efficient in consuming resources. Despite the Elliptic Curve Diffie-Hellman (ECDH) algorithm having often been considered efficient in providing an acceptable security degree with less resource consumption, it has suffered from weakness against Man-In-The-Middle Attacks (MITMA). This paper presents two versions of the Variant Elliptic Curve Diffie-Hellman (VECDH) algorithms as a key agreement protocol. The security analysis indicates that the proposed algorithm could be more robust compared to the MITMA, in addition to several security features. The proposed algorithms scale down the computation complexity by decreasing the arithmetic operations, to make the algorithms the lowest workload and suitable for application in restricted resource environments.

CPAHP: Conditional Privacy-Preserving Authentication Scheme With Hierarchical Pseudonym for 5G-Enabled IoV

As a representative application scenario of the Internet of Things (IoT), the Internet of Vehicles (IoV) plays an important function in the area of intelligent transportation. However, data traffic exchanged in IoV is usually correlated with plenty of sensitive information, thus leading to privacy leakage. Nevertheless, if all personal data about vehicles are completely protected, it will be hard to trace the real identities of malicious vehicles, which also raises other security issues in IoV. In addition, existing schemes are not fully suitable for 5G-enabled IoV due to their complex structure and high computation requirements. In order to realize more efficient communication and anonymous authentication of vehicles with superior security, we propose a conditional privacy-preserving authentication scheme with hierarchical pseudonyms (CPAHP) in 5G-enabled IoV, which is based on the elliptic curve Diffie-Hellman (ECDH) problem. Through the hierarchical pseudonym mechanism, CPAHP can protect the real identities and movement tracks of vehicles. Whereas, if vehicles have malicious behaviors, their real identities can be recovered through the corresponding pseudonyms. Furthermore, by taking advantage of a batch verification method, receivers can easily cope with a huge influx of messages in a short space of time. Moreover, by introducing blockchain technology, traffic information can be shared smoothly among all vehicles. Through the security analysis and performance evaluation, it is demonstrated that CPAHP can not only meet the security requirements but also provide higher computational efficiency.

Quantum Computers and Algorithms: A Threat to Classical Cryptographic Systems

Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecurity and high-profile cyber-attacks. In recent times, information security scientists and researchers had developed various cryptographic schemes that defeated attacks using the most sophisticated (in terms of processor speed) classical computer. However, this resistance will soon erode with the arrival of quantum computers. In this paper, we profiled quantum computers and quantum algorithms based on their widely believed threat against currently secure cryptographic primitives. We found that Grover’s and Shor’s quantum-based algorithms actually pose a threat to the continued security of symmetric cryptosystems (e.g. 128-bit AES) and asymmetric (public key) cryptosystems (e.g. RSA, Elgamal, elliptic curve Diffie Hellman (ECDH), etc.) respectively.We discovered that the source of the algorithms’ cryptanalytic power against the current systems, stems from the fact that they (Grover and Shor) both equipped their respective algorithms with a quantum circuit component that can execute the oracle in parallel by applying a single circuit to all possible states of an n-qubit input. With this exponential level of processing characteristic of quantum computers and quantum-based algorithms, it is easy for the current cryptosystems to be broken since the algorithms can existentially solve the underlying mathematical problems such as integer factorization, discrete logarithm problem and elliptic curve problem, which formed the basis of the security of the affected cryptosystems. Based on this realization and as part of our readiness for a post quantum era, we explored other mathematical structures (lattices, hashes, codes, isogenies, high entropy-based symmetric key resistance, and multivariate quadratic problems) whose hardness could surpass the cryptanalytic nightmare posed by quantum computers and quantum-based algorithms. Our contribution is that, based on the findings of this research work, we can confidently assert that all hope is not lost for organizations heavily relying on protocols and applications like HTTPS, TLS, PGP, Bitcoin, etc., which derived their security from the endangered cryptosystems.

An Authenticated Group Shared Key Mechanism Based on a Combiner for Hash Functions over the Industrial Internet of Things

The Industrial Internet of Things (IIoT) provides internet connectivity for instruments, digital machines, and any other manufactured object to enable intelligent industrial operations to achieve high productivity. Securing communications between IIoT devices remains a critical and challenging issue due to the resource-constrained and processing capabilities of sensing devices. Moreover, the traditional group shared key might implement complex mathematical operations that are not suitable for the limited recourse capability of the IIoT device. Furthermore, the standard Diffie–Hellman (DH) and elliptic curve Diffie–Hellman (ECDH), which are the most suited for tiny devices, only work between a pair of IIoT devices, while they are not designed to work among a group of IIoT devices. This paper proposes an authenticated group shared key (AGSK) mechanism that allows a set of industrial objects to establish a common session key over the IIoT. The proposed AGSK utilizes the combiner for the hash function and digital signature, which is implemented in IIoT devices. Additionally, the random oracle model has been used to prove the security of AGSK, while the IIoT adversary model has been used to analyze the AGSK countermeasures against cyberattacks. The results of the performance evaluation showed that the efficiency of the AGSK was reduced by 41.3% for CPU computation time, 45.7% for storage cost, and 40% less power consumption compared to the baseline group key management algorithms.

Smart healthcare system using integrated and lightweight ECC with private blockchain for multimedia medical data processing.

Cloud-based Healthcare 4.0 systems have research challenges with secure medical data processing, especially biomedical image processing with privacy protection. Medical records are generally text/numerical or multimedia. Multimedia data includes X-ray scans, Computed Tomography (CT) scans, Magnetic Resonance Imaging (MRI) scans, etc. Transferring biomedical multimedia data to medical authorities raises various security concerns. This paper proposes a one-of-a-kind blockchain-based secure biomedical image processing system that maintains anonymity. The integrated Healthcare 4.0 assisted multimedia image processing architecture includes an edge layer, fog computing layer, cloud storage layer, and blockchain layer. The edge layer collects and sends periodic medical information from the patient to the higher layer. The multimedia data from the edge layer is securely preserved in blockchain-assisted cloud storage through fog nodes using lightweight cryptography. Medical users then safely search such data for medical treatment or monitoring. Lightweight cryptographic procedures are proposed by employing Elliptic Curve Cryptography (ECC) with Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature (ECDS) algorithm to secure biomedical image processing while maintaining privacy (ECDSA). The proposed technique is experimented with using publically available chest X-ray and CT images. The experimental results revealed that the proposed model shows higher computational efficiency (encryption and decryption time), Peak to Signal Noise Ratio (PSNR), and Meas Square Error (MSE).

Securing Critical User Information over the Internet of Medical Things Platforms Using a Hybrid Cryptography Scheme

The application of the Internet of Medical Things (IoMT) in medical systems has brought much ease in discharging healthcare services by medical practitioners. However, the security and privacy preservation of critical user data remain the reason the technology has not yet been fully maximized. Undoubtedly, a secure IoMT model that preserves individual users’ privacy will enhance the wide acceptability of IoMT technology. However, existing works that have attempted to solve these privacy and insecurity problems are not space-conservative, computationally intensive, and also vulnerable to security attacks. In this paper, an IoMT-based model that conserves the privacy of the data, is less computationally intensive, and is resistant to various cryptanalysis attacks is proposed. Specifically, an efficient privacy-preserving technique where an efficient searching algorithm through encrypted data was used and a hybrid cryptography algorithm that combines the modification of the Caesar cipher with the Elliptic Curve Diffie Hellman (ECDH) and Digital Signature Algorithm (DSA) were projected to achieve user data security and privacy preservation of the patient. Furthermore, the modified algorithm can secure messages during transmission, perform key exchanges between clients and healthcare centres, and guarantee user authentication by authorized healthcare centres. The proposed IoMT model, leveraging the hybrid cryptography algorithm, was analysed and compared against different security attacks. The analysis results revealed that the model is secure, preserves the privacy of critical user information, and shows robust resistance against different cryptanalysis attacks.

Implication of Lightweight and Robust Hash Function to Support Key Exchange in Health Sensor Networks

Internet of Things (IoT) applications are critical for the fast delivery of health information/data in different environments. The wireless sensor network (WSN) can be used within IoT applications to collect this information in the electronic-health sector. However, the essential drawback of WSN and health applications is ensuring that patient and healthcare provider data/information is protected. In addition, exchanging keys and joining the network is the first/most important line of defense to protect health information. Amid all this, the previous search has introduced many key exchange protocols but still suffers from security and performance issues for WSNs and user devices. In this research, we propose a new protocol for exchanging keys and joining the network using security algorithms that are Elliptic-curve Diffie–Hellman (ECDH) and QUARK hash (qh). We focused on applying lightweight and high-security techniques to reduce the burden on WSN resources, by adopting a solid methodological approach to support security first and performance second. The security analysis is simulated with the Scyther tool, and the results indicate that our protocol is able to block key exchange attacks known in the existing research. Furthermore, we carried out a comparison with the results of the recent search in terms of performance, our protocol provides better performance results than the results of the existing search.

A Provable Secure Cybersecurity Mechanism Based on Combination of Lightweight Cryptography and Authentication for Internet of Things

Internet of Things devices, platform programs, and network applications are all vulnerable to cyberattacks (digital attacks), which can be prevented at different levels by using cybersecurity protocol. In the Internet of Things (IoT), cyberattacks are specifically intended to retrieve or change/destroy sensitive information that may exceed the IoT’s advantages. Furthermore, the design of a lightweight cybersecurity mechanism experiences a critical challenge that would perfectly fit resource-constrained IoT devices. For instance, identifying the compromised devices and the users’ data and services protection are the general challenges of cybersecurity on an IoT system that should be considered. This paper proposes a secure cybersecurity system based on the integration of cryptography with authentication (ELCA) that utilizes elliptic curve Diffie–Hellman (ECDH) to undertake key distribution while the weak bits problem in the shared secret key is resolved. In this paper, three systems of integration are investigated, while ELCA proposes secure integration between authentication and encryption to facilitate confidentiality and authenticity transfer messages between IoT devices over an insecure communication channel. Furthermore, the security of ELCA is proven mathematically using the random oracle model and IoT adversary model. The findings of the emulation results show the effectiveness of ELCA performance in terms of a reduced CPU execution time by 50%, reduced storage cost by 32–19.6%, and reduced energy consumption by 41% compared to the baseline cryptographic algorithms.