Security Enhancement of Wireless Sensor Networks: A Hybrid Efficient Encryption Algorithm Approach

Cryptographic Primitives that Resist Backdooring and Subversion

Now a day's everyone is using network to transmit the data. Even though the security has been increased the data is not still protected. So before sending the data through the network it has to encrypt so that data will be secured. In this paper to secure the data the combination of encryption algorithms is used that is known as hybrid encryption algorithm. It is the combination of symmetric (AES) and asymmetric (RSA) encryption algorithms. This hybrid encryption algorithm is to expand the security level to the data. For the encryption of sensitive data, both symmetric and asymmetric encryption techniques are important.

Security of information at this point becomes easier to be abused by another party when that information is sent and stored. To overcome these problems then do research to create an application that uses a hybrid method cryptosystem and digital signature. Methods in hybrid cryptosystem is done by combining the RC4 and RSA. Digital signature method is done by using a hash function SHA-512 with RSA algorithm approach. Applications that are built to perform encryption and decryption on files as well as improving security in sending data by hybrid cryptosystem and digital signature. Based on the research results of all the file types tested successfully encrypted and decrypted as well as the larger the file size, the longer the encryption and decryption process.

Cloud computing is expected to grow consider- ably in the future because it has so many advantages with regard to sale and cost, change management, next generation architectures, choice and agility. However, one of the principal concerns for users of the Cloud is lack of control and above all, data security. This paper considers an approach to encrypting information before it is 'placed' on the Cloud where each user has access to their own encryption algorithm, an algorithm that is based on a set of iterated function systems that outputs a chaotic number stream, designed to produce a cryptograph- ically secure cipher. We study cryptographic systems using finite-state approximations to chaos or 'pseudo-chaos' and develop an approach based on the concept of multi-algorithmic cryptography that exploits the properties of pseudo-chaos. Although such algorithms can be taken to be in the public domain in order to conform with the Kerchhoff-Shannon principal, i.e. the enemy knows the system, their combination can be used to secure data in a way that is unique to each user. This provides the potential for users of the Cloud to upload and transfer data in the knowledge that they are encrypting their data in a way that is algorithm as well key dependent, thereby defeating a known algorithm attack. This paper reports on one application of this approach called Crypstic in which the encryption engine is mounted on a USB memory stick and where the key is automatically generated by the characteristics of the plaintext/ciphertext file.

In this work, a new graph has been defined as a main point to design a new version of an asymmetric encryption scheme. This graph is formed based on the scalar multiplication operation on elliptic curve defined over a prime field, which is called an elliptic scalar multiplication (ESM) graph. Some mathematical facts to show the ESM graph is a complete graph are proved theoretically. On the complete elliptic scalar multiplication (CESM) graph, an asymmetric encryption algorithm has been implemented. Fast computations on the proposed algorithm are Z obtained through the matrices representation and determination of the minimum spanning tree (MST) to compute the ciphertext. More secure computations with the CESM graphic encryption algorithm in comparison with the previous asymmetric encryption algorithms. So, the CESM graphic asymmetric encryption algorithm is considered as a new sight for elliptic curve cryptographic usages.

Side-channel attacks are a prominent threat to the security of cryptographic implementations. Differently from the traditional black-box attacks, which exploit the inputs and outputs of cryptographic schemes, side-channel attacks partially access the inner working of the scheme as well, by observing the physical leakage emitted by the device executing cryptographic algorithms. A notable example is the class of power-analysis attacks, which exploits the power consumption of the underlying device to recover the secret keys of the implemented cryptosystem. Since their first presentation in the late 1990s, the problem of securing cryptographic systems in the presence of side-channel leakages received significant attention by the cryptographic community. In particular, the theory community has concentrated its research efforts on formally modeling the side-channel leakages and on designing cryptographic schemes \textit{provably} secure in such leakage models. However, conceiving a formal model that realistically captures possible physical leakages and constructing primitives sufficiently efficient to be deployed in practice are still challenging research objectives. This research area is usually referred to as leakage-resilient cryptography. In this dissertation, we examine three main research directions. The first one focuses on the technique of masking, which is the most popular approach to counteract power-analysis attacks. In this context, our work analyzes possible methods to improve the efficiency of masked implementations, with the goal of overcoming the decrease in performance, which is a common drawback of masking. In particular, we provide new and more efficient algorithms for the computation of basic operations in two kinds of masking schemes: the Boolean masking and the Inner Product masking. The second research direction of this work addresses the problem of formalizing security requirements for hardware implementations. While provable security of software-oriented masking has been studied since the origin of leakage resilient cryptography, the more complex task of formally proving the security of hardware-oriented masking is receiving attention by the community only recently. We discuss the different challenges of this field, and we introduce a new theoretical model, the robust probing model, capturing the conditions required for securely implementing complex algorithms in practice, providing a guide to practical implementers. Finally, the last part of this work is concerned with the protection of algorithms employed in lattice-based constructions, which are studied in the field of post-quantum cryptography. While several works investigate the application of masking schemes to standard cryptosystems, for most post-quantum schemes this is still an ongoing research. We contribute to this research area, by applying the masking countermeasure to a binomial sampler which is at the base of many lattice-based cryptosystems.

Aimed at the security authentication problem between Near Field Communication (NFC) devices, this paper uses the technology of asymmetric encryption algorithm, symmetric encryption algorithm, hash function, timestamp and survival period to improve the confidentiality, performance and security of the protocol. The symmetric encryption algorithm encrypts the transmission content, while the asymmetric encryption algorithm encrypts the shared key. The whole authentication process is secure, and the key distribution is secure. The improved NFC device authentication protocol can effectively resist the brute force attack, man-in-the-middle attack and replay attack in the authentication process, it can reduce the number of message transmission in the authentication process, improve the transmission efficiency, enhance the confidentiality, integrity, non-repudiation and improve the security of NFC device authentication.

A new LabVIEW simulation design was applied to provide a comparison study among several types of the most common symmetric and asymmetric encryption algorithms. Also, the comparison with advanced encryption package program was made. The results showed that the new LabVIEW simulation design had advantages in several points, where the evaluated time required for the encryption and decryption processes will be lesser than it values using advanced encryption package program.In this work, the symmetric encryption algorithms were used: AES (Advanced Encryption Standard), DES (Data Encryption Standard), 3DES (Triple Data Encryption Standard) and RC2 (Rivest Cipher) algorithms, while the asymmetric encryption algorithm used was the RSA (Rivest-Shamir-Aldeman) algorithm. The comparison had been achieved using different sizes of text files with different key sizes. The final results proved that the LabVIEW simulation design is better than the Advanced Encryption Package because it increased the algorithm’s performance by 65% in terms of speed and throughput, and for the algorithms’ comparison, the final results showed the effectiveness of AES algorithm over the other algorithms in terms of speed and throughput for the encryption and decryption processes.

With the development of informationization and the separation between data management departments and application departments, spatial data sharing becomes one of the most important objectives for the spatial information infrastructure construction, and spatial metadata management system, data transmission security and data compression are the key technologies to realize spatial data sharing. This paper discusses the key technologies for metadata based on data interoperability, deeply researches the data compression algorithms such as adaptive Huffman algorithm, LZ77 and LZ78 algorithm, studies to apply digital signature technique to encrypt spatial data, which can not only identify the transmitter of spatial data, but also find timely whether the spatial data are sophisticated during the course of network transmission, and based on the analysis of symmetric encryption algorithms including 3DES,AES and asymmetric encryption algorithm - RAS, combining with HASH algorithm, presents a improved mix encryption method for spatial data. Digital signature technology and digital watermarking technology are also discussed. Then, a new solution of spatial data network distribution is put forward, which adopts three-layer architecture. Based on the framework, we give a spatial data network distribution system, which is efficient and safe, and also prove the feasibility and validity of the proposed solution.

As the world keeps advancing, the need for automated interconnected devices has started to gain significance; to cater to the condition, a new concept Internet of Things (IoT) has been introduced that revolves around smart devicesʼ conception. These smart devices using IoT can communicate with each other through a network to attain particular objectives, i.e., automation and intelligent decision making. IoT has enabled the users to divide their household burden with machines as these complex machines look after the environment variables and control their behavior accordingly. As evident, these machines use sensors to collect vital information, which is then the complexity analyzed at a computational node that then smartly controls these devicesʼ operational behaviors. Deep learning‐based guessing attack protection algorithms have been enhancing IoT security; however, it still has a critical challenge for the complex industries’ IoT networks. One of the crucial aspects of such systems is the need to have a significant training time for processing a large dataset from the networkʼs previous flow of data. Traditional deep learning approaches include decision trees, logistic regression, and support vector machines. However, it is essential to note that this convenience comes with a price that involves security vulnerabilities as IoT networks are prone to be interfered with by hackers who can access the sensor/communication data and later utilize it for malicious purposes. This paper presents the experimental study of cryptographic algorithms to classify the types of encryption algorithms into the asymmetric and asymmetric encryption algorithm. It presents a deep analysis of AES, DES, 3DES, RSA, and Blowfish based on timing complexity, size, encryption, and decryption performances. It has been assessed in terms of the guessing attack in real‐time deep learning complex IoT applications. The assessment has been done using the simulation approach and it has been tested the speed of encryption and decryption of the selected encryption algorithms. For each encryption and decryption, the tests executed the same encryption using the same plaintext for five separate times, and the average time is compared. The key size used for each encryption algorithm is the maximum bytes the cipher can allow. To the comparison, the average time required to compute the algorithm by the three devices is used. For the experimental test, a set of plaintexts is used in the simulation—password‐sized text and paragraph‐sized text—that achieves target fair results compared to the existing algorithms in real‐time deep learning networks for IoT applications.

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.

In this paper, an image encryption algorithm using a key of length 64 bits is proposed. And as an enhancement of this technique, a unique 8-bit time-stamp is used prior encryption. Initially, the pixel data is separated into blocks and are then encrypted in a chained fashion. The encrypted blocks are then combined to form an encrypted image. Several graphical and mathematical experiments are performed to validate the enhanced security of the proposed technique.

Integrating the Internet of Things (IoT) in smart grids has revolutionized the energy sector, enabling real-time data collection and efficient energy distribution. However, this integration also introduces significant security challenges, particularly data encryption. Traditional encryption algorithms used in IoT are vulnerable to various attacks, and the advent of quantum computing exacerbates these vulnerabilities. To address the above challenges, this paper proposes a novel encryption mechanism, the Quantum-Resistant Hybrid Encryption for IoT (QRHE-IoT), designed to enhance the security of communications in IoT-enabled smart grids. QRHE-IoT combines the strengths of symmetric and asymmetric encryption algorithms and incorporates quantum-resistant algorithms to provide robust security. This paper explains the QRHE-IoT mechanism, its theoretical basis, and how it addresses the security challenges in smart grid communications. It also presents the results of tests conducted to evaluate the effectiveness of QRHE-IoT in a simulated smart grid environment. The proposed QRHE-IoT mechanism presents a promising solution to these challenges, offering robust security for smart grid communications in the face of emerging threats, including quantum computing.

This paper presents a survey on the current state-of-the-art in Wireless Sensor Network (WSN) Operating Systems (OSs). In recent years, WSNs have received tremendous attention in the research community, with applications in battlefields, industrial process monitoring, home automation, and environmental monitoring, to name but a few. A WSN is a highly dynamic network because nodes die due to severe environmental conditions and battery power depletion. Furthermore, a WSN is composed of miniaturized motes equipped with scarce resources e.g., limited memory and computational abilities. WSNs invariably operate in an unattended mode and in many scenarios it is impossible to replace sensor motes after deployment, therefore a fundamental objective is to optimize the sensor motes’ life time. These characteristics of WSNs impose additional challenges on OS design for WSN, and consequently, OS design for WSN deviates from traditional OS design. The purpose of this survey is to highlight major concerns pertaining to OS design in WSNs and to point out strengths and weaknesses of contemporary OSs for WSNs, keeping in mind the requirements of emerging WSN applications. The state-of-the-art in operating systems for WSNs has been examined in terms of the OS Architecture, Programming Model, Scheduling, Memory Management and Protection, Communication Protocols, Resource Sharing, Support for Real-Time Applications, and additional features. These features are surveyed for both real-time and non-real-time WSN operating systems.

Modern cryptography pushed forward the need of having provable security. Whereas ancient cryptography was only relying on heuristic assumptions and the secrecy of the designs, nowadays researchers try to make the security of schemes to rely on mathematical problems which are believed hard to solve. When doing these proofs, the capabilities of potential adversaries are modeled formally. For instance, the black-box model assumes that an adversary does not learn anything from the inner-state of a construction. While this assumption makes sense in some practical scenarios, it was shown that one can sometimes learn some information by other means, e.g., by timing how long the computation take. In this thesis, we focus on two different areas of cryptography. In both parts, we take first a theoretical point of view to obtain a result. We try then to adapt our results so that they are easily usable for implementers and for researchers working in practical cryptography. In the first part of this thesis, we take a look at post-quantum cryptography, i.e., at cryptographic primitives that are believed secure even in the case (reasonably big) quantum computers are built. We introduce HELEN, a new public-key cryptosystem based on the hardness of the learning from parity with noise problem (LPN). To make our results more concrete, we suggest some practical instances which make the system easily implementable. As stated above, the design of cryptographic primitives usually relies on some well-studied hard problems. However, to suggest concrete parameters for these primitives, one needs to know the precise complexity of algorithms solving the underlying hard problem. In this thesis, we focus on two recent hard-problems that became very popular in post-quantum cryptography: the learning with error (LWE) and the learning with rounding problem (LWR). We introduce a new algorithm that solves both problems and provide a careful complexity analysis so that these problems can be used to construct practical cryptographic primitives. In the second part, we look at leakage-resilient cryptography which studies adversaries able to get some side-channel information from a cryptographic primitive. In the past, two main disjoint models were considered. The first one, the threshold probing model, assumes that the adversary can put a limited number of probes in a circuit. He then learns all the values going through these probes. This model was used mostly by theoreticians as it allows very elegant and convenient proofs. The second model, the noisy-leakage model, assumes that every component of the circuit leaks but that the observed signal is noisy. Typically, some Gaussian noise is added to it. According to experiments, this model depicts closely the real behaviour of circuits. Hence, this model is cherished by the practical cryptographic community. In this thesis, we show that making a proof in the first model implies a proof in the second model which unifies the two models and reconciles both communities. We then look at this result with a more practical point-of-view. We show how it can help in the process of evaluating the security of a chip based solely on the more standard mutual information metric.