Hellman Algorithm Research Articles

Hybridized Data Encoding based Encryption and Diffie Hellman Decryption for Security Enhancement

Information security is extremely important because the modification and interception of the data can lead to loss of data integrity, confidentiality, and availability. The encryption process is a critical component of classic standard encryption techniques such as advanced encryption, standard block ciphers, and data encryption standards. The traditional algorithm requires increased power consumption and memory. Therefore, there is a need to develop an efficient cryptographic operation to promote better security. The encryption process is performed using the Hybridized Data Encoding (HDE) model. Here, the optimal keys can be selected using the Chaotic Coati optimization algorithm (ChCoA). The decryption process can be performed using the Enhanced Diffie Hellman algorithm (EDHA). The resulting achievements will include effective encryption and decryption algorithms that together strengthen data security, facilitate secure data exchange, and provide superior protection against data vulnerabilities. By implementing the proposed work in the Matlab working platform, the performances in terms of encryption time, decryption time, processing time and throughput are analyzed. The proposed model achieved a throughput of 249.1093 (kb/s) and a processing time of 0.55 (sec).

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

Secure Messaging Using Post-Quantum Key Sharing Based on CSIDH and Fujisaki-Okamoto Transform

Preserving the confidentiality of information exchanges relies fundamentally on an end-to-end encryption system, involving the use of a secret key to secure the entire communication. However, with the imminent emergence of quantum computing, threats to traditional encryption systems are multiplying. This is where post-quantum key sharing, in particular the Commutative Super Isogenies Diffie Hellman (CSIDH) algorithm, comes in. The CSIDH uses the ideal of some class number to a morphism of elliptic curve for calculating the shared key. It offers an innovative solution for secure key generation between two users, while providing a robust defense against potential attacks from quantum computers, whose computing power is redefining the limits of cryptographic security, based on the mathematical foundations of elliptic curves and isogeny. This technological advance represents an essential pillar in preserving the confidentiality of communications, in a context where security challenges are constantly evolving. Combining with Fujisaki-Okamoto transform, socket, and Linux; a chat application over python could be created for transmitting secure messages.

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

High-performance montgomery modular multiplier with NTT and negative wrapped convolution

Modular multiplication plays a crucial role in modern cryptography. Montgomery modular multiplication(MMM), one of the most classic and practical modular multiplication algorithms, has been widely used in cryptographic algorithms such as RSA, Diffie–Hellman algorithm, and Elliptic Curve Cryptography. In this paper, we incorporate negative wrapped convolution (NWC) into the FFT-based Montgomery modular multiplication to avoid the issue of zero-padding and use carry-save arithmetics for parallel computation. By utilizing coefficient pairs (pos_part and neg_part), we reconstruct the final result and eliminate the restrictions imposed by nega-cyclic parts. Moreover, Karatsuba-like algorithm is introduced for building fine-grained large integer multipliers. We have modified the parameter specifications for our design to meet requirements from diverse application scenarios. We implement the design on Xilinx Virtex-7 FPGA under different conditions and compare the results with the state-of-the-art MMM designs. The comparisons confirm that our design has the following characteristics: low latency for process, competitive area-latency-product(ALP), efficient DSP usage, and constant delay, which enhances security against timing attacks.

Smart grid environment using block chain-based key agreements

Smart grids are one of the main difficulties to ensuring system security is the access verify the huge amount of terminal devices and intelligent gateways. Therefore, a new key management method that is more efficient, secure, and cheap to compute is required for smart grids. However, the majority of existing research is unable to strike a compromise between computational burden and security. To eliminate these advantages, a novel Secure Key Exchange (SKE) mechanism for low computational cost and data security in blockchain-based smart grids has been proposed in this research. In addition to including a blockchain-based key exchange, the proposed SKE architecture also includes layers for management, power, transmission, intelligent gateway, and user (UL). Transmitter substations, power plants, dispatching centers, and transmission stations have all added layers to blockchain technology. The proposed SKE technique consists of four stages: joining, departing using the Diffie Hellman algorithm, authentication, establishment, registration and initialization. The MATLAB simulator has been updated to include the recommended method. The effectiveness of the recommended approach has been assessed in relation to particular metrics like computation and security analysis. In comparison to DPPDA, MAS, and DBACP-IoTSG approaches, the proposed SKE protocol extends the lowest computational cost by 2.1 %, 4.5 %, and 13.1 %, and is more secure, accordingly.

Secure Cloud Storage Privacy-Preserving In Public Auditing

Cloud computing is a technology that is both efficient and cost-effective, thanks to its low maintenance requirements. This paper implemented a approach is used to share group resources across cloud users. Regrettably, as a result of the frequent differences in participation, the issue of sharing information in a multi-owner manner while also preserving privacy and information from a trusted cloud continues to be a challenging one. During the course we put into place a safe method of data sharing among multiple owners using the Diffe- Hellman algorithm that are cloud-based and applicable to rotating groups. By leveraging techniques like as group signature and dynamic broadcast encryption, any user of the cloud has the ability to anonymously share data with other users. In the meanwhile, the number of users whose access has been revoked does not have any impact on the storage overhead or encryption computation costs associated with our system. In addition, employ rigorous proofs to investigate the scheme's level of safety, and conduct tests to verify the scheme's usefulness.

Authentication of WSN for Secured Medical Data Transmission Using Diffie Hellman Algorithm

The applications of wireless sensor network (WSN) exhibits a significant rise in recent days since it is enveloped with various advantageous benefits. In the medical field, the emergence of WSN has created marvelous changes in monitoring the health conditions of the patients and so it is attracted by doctors and physicians. WSN assists in providing health care services without any delay and so it plays predominant role in saving the life of human. The data of different persons, time, places and networks have been linked with certain devices, which are collectively known as Internet of Things (IOT); it is regarded as the essential requirement of people in recent days. In the health care monitoring system, IOT plays a magnificent role, which has produced the real time monitoring of patient’s condition. However the medical data transmission is accomplished quickly with high security by the routing and key management. When the data from the digital record system (cloud) is accessed by the patients or doctors, the medical data is transferred quickly through WSN by performing routing. The Probabilistic Neural Network (PNN) is utilized, which authenticates the shortest path to reach the destination and its performance is identified by comparing it with the Dynamic Source Routing (DSR) protocol and Energy aware and Stable Routing (ESR) protocol. While performing routing, the secured transmission is achieved by key management, for which the Diffie Hellman key exchange is utilized, which performs encryption and decryption to secure the medical data. This enables the quick and secured transmission of data from source to destination with improved throughput and delivery ratio.

Вдосконалення методів генерації ключів шифрування за допомогою дивних атракторів

The urgency of the work is determined by the need to transfer confidential information through open communication channels. Such information can be of two types: symmetric encryption keys and directly informational messages that are encrypted with encryption keys. The article deals with the problem of improving the transmission of closed information over open channels using the Diffie- Hellman algorithm. The improvement is due to the introduction of a new type of one-sided function based on the numerical solution of the system of ordinary differential equations describing the dynamics of the phase coordinate movement of the strange attractor. For this purpose, the classic Diffie-Hellman algorithm based on the one-sided function of the discrete logarithm was considered. The required properties of one-sided functions in the general case were considered. Next, the peculiarities of algorithm modification in the case of transition to a one-sided function based on the use of a strange attractor were considered. It is assumed that at the beginning of the operation of the modified algorithm, through a secret channel, the exchange parties (agents) exchange information regarding the properties of the strange attractor to be used, namely, the definition of the differential equations describing the dynamics of a strange attractor, the values of the parameters of the equations, the initial integration conditions and the integration step (for methods with a constant step of integration). After that, all exchanges are conducted exclusively through open channels. The paper also considers the case of information exchange between more than two agents, in particular, the approach of hiding the number of agents participating in the exchange. Approbation of the method is carried out and intermediate and final results of the one-sided function based on strange attractors are given. Possibilities regarding partial disclosure by agents of certain parameters of the use of one-way functions are discussed. But at the same time, the safety of revealing such information is justified in the general case (both in the classical and in the modified Diffie-Hellman method). It was determined that depending on the needs of users, the complexity of the encryption keys can be increased by changing the initial parameters of the attractor, which will also allow controlling speed of key generation and encryption in general. The software that implements the proposed modified algorithm is implemented in three programming languages, C#, Python, and MatLab. This made it possible to perform a comparative analysis of the results and consciously choose the programming language of individual parts of the software to optimize the encryption key generation process for specific conditions.

Secure and efficient routing protocol for low-power and lossy networks for IoT networks

R outing p rotocol for l ow p ower and l ossy (RPL) is destined to support the specific requirements of l ow p ower and l ossy n etworks (LLN). This type of network suffers from the problem of determining and securing a routing protocol to best suit an environment. This article aims to present a new version of the efficient and secure RPL protocol. The proposed scheme consists of two parts : i) Proposing a new o bjective f unction (OF) based RPL which combines three nodes and links metrics are: e xpected r etransmission n umber (ETX), h ope c ount (HC), and the residual energy in order to have a precise decision to c hoose the optimal way to the des tination. ii) To securing the new efficient RPL protocol by combining an improved Diffie - Hellman (DH) algorithm for a robust key exchange model with k eyed - h ash m essage a uthentication c ode (HMAC) to ensure the authentication and integrity of RPL data exchan ged. To verify the level of security, we apply a formal verification using AVISPA tool which indicate that the s ecure and e fficient RPL (SE-RPL) achieve all security requirements. Simulation results on the Contiki platform illustrate that our proposed is m ore efficient in terms of p acket d elivery r atio (PDR) and energy compared to others standard OF.

Privacy Preservation Authentication Model for a Secure Infrastructure over Vehicular Communications

Vehicle Ad-hoc Networks (VANET) are considered among recent wireless communication technologies. Nowadays, vehicles are no more than simple means of transport, they are endowed with a source of intelligence through their interaction with the road environment due to embedded equipment on board vehicles and integrated into stations along roads and highways. The mechanisms of security and protection of messages exchanged in VANET, thus preserving the privacy of users and satisfying the various security requirements, are a prerequisite for the deployment of vehicle networks. Increasingly, several research have been proposed to improve protocols for maintaining security and preserving privacy. This paper presents a hierarchical revocable infrastructure based privacy preservation authentication protocol for vehicles that involves authentication of each vehicle and the corresponding Road Side Unit (RSU) by a Certification Authority (CA). The proposed protocol used Elliptic Curve Diffie Hellman (ECDH) algorithm for reliable key exchange and Edwards-curve Digital Signature Algorithm (EdDSA) to speed up the execution of the authentication process especially at the key management level, message signing and verification of this signature. On the other hand, the creation of sub-lists of revoked certificates based on vehicle type makes it possible to minimize the response time by looking for a certificate if it is revoked or not. Our solution was checked by the security verification tool, Automated Validation of Internet Security Protocols and Applications (AVISPA), which indicated that it is a very secure level. Performance analysis illustrates that the protocol greatly saves computation resources.

Dual Authentication for Payment Request Verification Over Cloud using Bilinear Dual Authentication Payments Transaction Protocol

There has been a recent explosion in the number of mobile network payment gateways that enable users to access services through a variety of devices. Mobile payment gateway security is complicated by a number of difficult-to-solve issues. As digital technology has progressed over the last decade, mobile payment mechanisms have gained a lot of interest. In the internet industry, these standards might have a significant impact on service quality. However, the most important aspect to consider when using these systems is their accountability, which assures confidence between the parties engaged in the financial transactions. Mobile payments may be easy, quick and secure. On the other hand, they may be rather pricey and are still susceptible to problems caused by technology. Specifically, mobile payments won't be able to go through at all if there are any problems with the host phone. For this reason, in this article a mobile payment mechanism that uses secure bilinear dual authentication. Using Bullet hash Maximum distance separable (MDS) and the mutate Hellman algorithm, our payment protocol incorporates all of the essential security characteristics to establish confidence between the parties. To put it another way, accountability is assured by mutual authentication and non-repudiation. Conflicts that may emerge in the course of a payment transaction may be resolved using our strategy. Scyther is used to test our suggested protocol's empirical performance.

Multicast Through Device to Device Communication Using Enhanced Diffie–Hellman Algorithm

The mobile device demand has been increased and it is estimated that in upcoming 10 years, the wireless cellular demand will increase up to 500 times. And it is not possible only with the cellular networks to satisfy this huge demand. To meet the huge requirement from the mobile end user, 5G networks enabled device to device communication can be applied. Device to Device (D2D) connection is the direct link among the two devices without the intervention of main station. Thus, D2D reduces the latency. And 5G are supported for the high data rates. Furthermore, for efficient transmission, multicast device to device communication is used. Multicast distrubutes the messages to multiple users of the restricted geographical area. Trustworthy communication is necessary for multicast D2D communication. Enhanced Diffie–Hellman algorithm is used for the trustworthiness.

Video Conference Software Inplementation Based on Data Encryption Using Elliptic Curves

Article is devoted to the development of free program services for video conferencing. Proposed system eliminates security flaws found in other developments. Analysis of security model development using elliptic curves and secret key transfer using Diffie–Hellman algorithm is carried out. Currently, video communication software is used everywhere. Main task of such software applications is help to people communicate with colleagues, relatives and friends at great distances. However, it is very important that their conversation remains confidential, otherwise any information said can get to third parties, and then – cost of leaking personal information can change from damage done to one person to damage done to entire states. Therefore, it is so important to use only software products that have passed certification process when communicating where information with limited access will be used. Software tool has been developed that allows creating secure video conferences with ECIES encryption algorithm on elliptic curves, which allows holding conferences without fear of being compromised. Thus, proposed application significantly increases users security, their personal data, as well as confidentiality of their conversations. Developed software product can be used to conduct secure video conference.

A two‐layer attack‐robust protocol for IoT healthcare security

The majority of studies in the field of developing identification and authentication protocols for Internet of Things (IoT) used cryptographic algorithms. Using brain signals is also a relatively new approach in this field. EEG signal-based authentication algorithms typically use feature extraction algorithms that require high processing time. On the other hand, the dynamic nature of the EEG signal makes its use for identification/authentication difficult without relying on feature extraction. This paper presents an EEG-and fingerprint-based two-stage identification-authentication protocol for remote healthcare, which is fast, robust, and multilayer-based. A modified Euclidean distance pattern matching method is proposed to match the EEG signal in the identification stage due to its dynamic nature. The authentication stage is also an optimized method with the Genetic Algorithm (GA), which utilizes a modified Diffie–Hellman algorithm. Due to the vulnerability of the Diffie–Hellman algorithm to different types of attacks, the parameters used for this algorithm are extracted from the fingerprint and the EEG signal of the patient to provide a fast and robust authentication method. The proposed method is evaluated using data from patients with spinal cord injuries. Simulating results demonstrated high identification and authentication accuracy of the proposed method. Furthermore, it is extremely fast and efficient.

Sensing as a service in Internet of Things: Efficient authentication and key agreement scheme

Internet of Things (IoT) sensing capabilities are now available as a public service. This new model, called sensing as a service (S2aaS), allows data owners to sell and/or exchange data with consumers interested in large open markets. However, the openness of the service industry makes the IoT-based S2aaS model more susceptible to malicious attacks. In this article, we propose a simple, efficient, and secure key agreement scheme for IoT-based S2aaS model. Users in the proposed system can securely and quickly access public services through a simple website rather than a traditional smart card. To simulate a real S2aaS environment, the cloud is treated as an untrusted node in the proposed method, and not all channels are secure. The fuzzy extractor and elliptic-curve Diffie–Hellman algorithms are used in conjunction with symmetric encryption and hash functions to establish a secure key agreement and data exchange session. In critical and frequent intervals, heavy processes are avoided. The proposed scheme's security has been informally analyzed and formally proven using the Automated Validation of Internet Security Protocols and Applications tool. The results show that our scheme satisfies the security requirements.

Data transmitted encryption for clustering protocol in heterogeneous wireless sensor networks

In this paper, we propose a novel encryption schema (ECDH – RSA) based on Elliptic Curves Diffie – Hellman algorithm (ECDH) and RSA algorithm to secure transmitted data in Heterogeneous Wireless sensor networks (HWSNs). The proposed encryption is built under Cheesboard Clustering Routing Method (CCRM). The CCRM used to balancing node energy consumption. To achieve good scalability and performance by deploying a small number of powerful high-end sensors in addition to a large number of lowend sensors. ECDH is used to exchange public and private keys due to its ability to provide high security with small key size. The proposed encryption key is 176-bit and is produced by combining it’s key, node identification number, and distance to its cluster head (CH). To reduce energy consumption of CH, RSA encryption is used to allow CH to aggregate the encrypted data without having to decrypt them. We demonstrated that the proposed method is capable to work with different sensing environments that need to capture text data as well as images. The Simulation results demonstrated that our proposed method greatly improve the network performance in terms of energy consumption and highest paths.

Additional Security using Three-Pass Protocol and Pohlig-Hellman

Data and information protection is usually done by encrypting sensitive data and information using cipher keys or symmetric algorithms. This includes using what is known as “cipher keys,” which are used in systems that require two parts, a sender’s and receiver’s part, which is a special system that needs to be assembled, and a location where data is sent to or stored. The Three-Pass Protocol and Pohlig Hellman Algorithm solves a key distribution problem in symmetric and asymmetric cryptography, allowing senders and receivers to process encryption and decryption due to lack of key distribution processes.

Consensus Mechanism of IoT Based on Blockchain Technology

Applying blockchain technology to the Internet of Things (IoT) remains a huge challenge. To meet the actual needs of IoT, a lightweight and high-throughput consensus mechanism, combined with blockchain technology, is proposed in this study. Blockchain nodes use the Diffie–Hellman algorithm for key negotiation. Sensors and blockchain nodes can use the shared key to generate HMAC (Hash-based Message Authentication Code) signatures for sensor-aware transactions and use the Verifiable Random Function to implement block nodes. Offline fast election, which is the node that wins the election, becomes the block node. Machine learning methods are also introduced to identify or remove outliers in the sensor data before such data are uploaded to the chain. Experimental results show that the system throughput synchronously increases as the test load increases. Moreover, when the test load is 800 tps, the system throughput reaches the maximum, close to 600 tps. When the test load exceeds 800 tps, the actual system throughput starts to drop, and approximately 90% of transactions have a delay time within 5000 ms. This method can be used in a lightweight IoT system.

All-optical encryption in 80-Gbps next-generation passive optical network stage 2

Passive optical network broadcasts extensive data to subscribers. However, they are vulnerable to various security attacks. The main objective of our work is to assess the information security aspects at the physical layer of next-generation passive optical network stage 2 (NG-PON2). Our paper focuses on the security issues faced by NG-PON2, and we propose an encryption method using the all-optical exclusive-OR gate. The proposed simulation architecture of symmetric 80-Gbps NG-PON2 is based on array waveguide grating. Further, we verified the inherent security of the NG-PON2 system through an eavesdropping attempt at an optical network unit (ONU). For this, we used a key exchange mechanism using the Diffie–Hellman algorithm for sharing individual unique keys between every ONU and the optical line terminal. The simulation results show that the presented technique provides secure broadband services in the access network. The transmitted data are encrypted to ensure confidentiality on the multipoint fiber connection. We have evaluated the transmission performance of the proposed set up and achieved acceptable results in terms of Q-factor (7.12 dB) and bit error rate of (5.26 × 10 − 13). The bits in the optical domain, which are sent to the first ONU, are also compared with the received optical bits at the receiving ONU. The correct reception of the bits at the intended ONU and the inability of malicious ONUs to eavesdrop the data of other ONUs validates the scheme.