Bitwise XOR Operation Research Articles

SEEMAKA: Secured Energy-Efficient Mutual Authentication and Key Agreement Scheme for Wireless Body Area Networks

With the empowerment of wireless networking technologies and medical sensors, WBAN is playing a major part in modern medical systems. As a key application of IoT, WBAN has shown swift growth and adoption in recent years because of its capabilities such as continuous and seamless monitoring of patients and collection of their biomedical data in real-time which is further used by doctors for clinical diagnosis and treatment. Despite numerous benefits, WBAN lacks a clear in-depth defense line because of the vulnerability caused by its openness and mobility raising issues like privacy leakage, complicated requirements and security concerns from unauthenticated or malicious adversaries. To alleviate the aforementioned issues and prevent adversaries from intimidating legitimate users or exploiting WBAN services, a secured energy-efficient mutual authentication, and key agreement scheme (SEEMAKA) for two-tier WBAN is propounded. In particular, SEEMAKA achieves desirable security features and thwarts different security attacks using fewer hash invocations and bitwise XOR operations, nicely meeting the need for sensor nodes equipped with limited capability. More importantly, the security of SEEMAKA is assessed through sound informal analysis as well as using Automated Validation of Internet Security Protocols and Applications (AVISPA). For verifying the correctness of SEEMAKA, widely-accepted Burrows–Abadi–Needham (BAN) Logic is used. For a better understanding, SEEMAKA is evaluated over NS2 along with counterpart schemes for End-to-End Delay and Throughput. Finally, a set of thorough relative analyses between SEEMAKA and other relevant schemes are performed and the outcomes manifest that SEEMAKA attains superior efficiency concerning processing overhead, energy dissipation, and security features. Relative to Li et al.’s scheme, SEEMAKA outperforms with a reduction of 2 XOR operations in processing cost at master node, includes master key update phase (to make the system safe from master node spoofing attack) and counters sensor node spoofing attack.

A secure image encryption scheme based on a novel 2D sine–cosine cross-chaotic (SC3) map

In this paper, we propose a new 2D sine–cosine cross-chaotic (SC3) map to design an image encryption scheme with high confusion and diffusion capability. We evaluate the maximum Lyapunov exponent (MLE) of the proposed SC3 map to measure its degree of sensitivity to initial conditions and perform bifurcation analysis to find the chaotic region. The proposed chaotic map generates two pseudo-random sequence $$R_1$$ and $$R_2$$ , which are used in confusion (permutation) and diffusion phase, respectively. The confusion layer is designed by shuffling the image pixels, and the diffusion layer is designed by bitwise XOR operation. The strength of the proposed image encryption scheme is evaluated against resistance to the statistical attack (information entropy, correlation coefficient, and histogram analysis), differential attack (NPCR and UACI), and sensitivity to the secret key. The experimental results of both security and performance analysis show that the proposed image encryption scheme is secure enough to resist all the existing cryptanalytic attack and efficient in terms of encryption time.

Image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellin transform

An image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellin transform (GARPFrMT) is proposed. The GARPFrMT was realized in the diffraction domain. The Gaussian aperture, like a soft aperture, improved the amount of light that passed through the lens compared to a hard aperture and reduced the light leakage at the edge of the lens, assisting to some extent in resisting direct attacks. In the proposed scheme, the reality-preserving transform was constructed in the diffraction domain to ensure that the cipher-text is real. The GARPFrMT is a nonlinear transformation used for eliminating potential insecurity existing in the linear image encryption system. In order to further enhance the security of the encryption system, an Arnold transform, and a bitwise XOR operation were employed for permutation and scrambling in the encryption process. Simulation results and theoretical analysis show that the proposed algorithm is feasible and capable of withstanding several common attacks.

Image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellin transform

An image encryption scheme based on a Gaussian apertured reality-preserving fractional Mellin transform (GARPFrMT) is proposed. The GARPFrMT was realized in the diffraction domain. The Gaussian aperture, like a soft aperture, improved the amount of light that passed through the lens compared to a hard aperture and reduced the light leakage at the edge of the lens, assisting to some extent in resisting direct attacks. In the proposed scheme, the reality-preserving transform was constructed in the diffraction domain to ensure that the cipher-text is real. The GARPFrMT is a nonlinear transformation used for eliminating potential insecurity existing in the linear image encryption system. In order to further enhance the security of the encryption system, an Arnold transform, and a bitwise XOR operation were employed for permutation and scrambling in the encryption process. Simulation results and theoretical analysis show that the proposed algorithm is feasible and capable of withstanding several common attacks.

LAKE-IoD: Lightweight Authenticated Key Exchange Protocol for the Internet of Drone Environment

A drone is an unmanned aerial vehicle, which is deployed in a particular Fly Zone (FZ), and used to collect crucial information from its surrounding environment to be transmitted to the server for further processing. Generally, a Mobile User (MU) is required to access the real-time information collected by the drone stationed in a specific FZ securely. Therefore, to ensure secure and reliable communications an Authenticated Key Exchange (AKE) protocol is imperative to the Internet of Drone (IoD) environment. An AKE scheme ensures only authentic MU to access IoD network resources. Upon successful authentication, MU and drone can set up a secret session key for secure communication in the future. This paper presents a novel Lightweight AKE Protocol for IoD Environment (LAKE-IoD), which first ensures the authenticity of MU and also renders session key establishment mechanism between MU and drone with the help of a server. LAKE-IoD is an AKE protocol, which is based on an authenticated encryption scheme AEGIS, hash function, and bit-wise XOR operation. Meticulous formal security verification by employing a software tool known as Scyther and informal security analysis demonstrates that LAKE-IoD is protected against different well-known active and passive security attacks. Additionally, Burrows-Abadi-Needham logic is applied to verify the logical completeness of LAKE-IoD. Furthermore, a comparison of LAKE-IoD with the related schemes shows that LAKE-IoD incurs less communication, computational and storage overhead.

An enhanced anonymous authentication protocol for wireless sensor networks

Nowadays, wireless sensor networks (WSNs) have played important roles in a variety of areas. However, the nature of wireless communications and restricted resources make it more likely to suffer from various kinds of attacks. As to this problem, many authentication protocols have been proposed recently to secure the communications in WSNs. Among these schemes, Singh et al.'s protocol shows great novelty. Unfortunately, we find in our current research that Singh et al.'s protocol still has the vulnerabilities to stolen/lost smart card attacks, privileged-insider attacks, the session key leakage attacks, and so on. To solve these problems, we first propose an enhanced anonymous authentication protocol by using Hash function and bitwise XOR operations based on Singh et al.'s protocol. Secondly, we conduct detailed security analysis to the proposed authentication protocol, and make security-feature comparisons with related protocols. In addition, we give formal proof and security verification of the proposed protocol by using Burrows-Abadi-Needham (BAN) logic and AVISPA tool, respectively. Finally, we give performance comparisons in terms of computing costs and communicating costs, respectively. Comparative summaries demonstrate that our protocol provides more extractive features and security guarantees with little increased overheads.

Image encryption algorithm based on new five-dimensional multi-ring multi-wing hyperchaotic system

The complex structure of hyperchaos and its complex dynamic behavior have a good application prospect in the fields of image encryption, digital watermarking and information security. Therefore, it has become very important to generate chaotic attractors with multi-vortex and multi-winged multi-rings with complex topologies. In this paper, we propose a new five-dimensional hyperchaotic system capable of generating multi-ring and multi-wing, and carry out theoretical analysis and numerical simulation experiments on some basic dynamic characteristics of the chaotic system. Such as equilibrium point, dissipation, Lyapunov exponent, bifurcation diagram, phase diagram and so on. In the process of encryption, first, we decompose the plaintext image matrix and the five chaotic sequences into an orthogonal matrix and an upper triangular matrix by QR decomposition. The five chaotic sequences generated by the chaotic system are respectively decomposed into an upper triangular matrix and a lower triangular matrix by the LU decomposition method. The upper triangular matrix decomposed by the QR decomposition method and the lower triangular matrix decomposed by the LU decomposition method are respectively added to obtain five discrete chaotic sequences. At the same time, the five discrete chaotic sequences are added to the upper triangular matrix decomposed by the LU decomposition method to obtain the final five discrete chaotic sequences. Secondly, the orthogonal matrix decomposed by the plaintext image matrix is multiplied by five orthogonal matrices decomposed by five chaotic sequences. At the same time, the elements in the upper triangular matrix decomposed by the plaintext image matrix are chaotically arranged by the chaotic sequence, and then the two matrices after the operation are multiplied. Finally, the multiplied matrix is chaotically placed on the bit by a chaotic sequence. Then use the chaotic sequence to perform a bitwise XOR operation to obtain the final encrypted image. The theoretical analysis and simulation results show that the algorithm has large key space and strong key sensitivity. It can effectively resist the attacks of statistical analysis and gray value analysis, and has good encryption effect on digital image encryption. This image encryption algorithm using a combination of conventional encryption and chaotic encryption does not have a defined plaintext ciphertext mapping relationship.

An enhanced anonymous authentication protocol for wireless sensor networks

Nowadays, wireless sensor networks (WSNs) have played important roles in a variety of areas. However, the nature of wireless communications and restricted resources make it more likely to suffer from various kinds of attacks. As to this problem, many authentication protocols have been proposed recently to secure the communications in WSNs. Among these schemes, Singh et al.'s protocol shows great novelty. Unfortunately, we find in our current research that Singh et al.'s protocol still has the vulnerabilities to stolen/lost smart card attacks, privileged-insider attacks, the session key leakage attacks, and so on. To solve these problems, we first propose an enhanced anonymous authentication protocol by using Hash function and bitwise XOR operations based on Singh et al.'s protocol. Secondly, we conduct detailed security analysis to the proposed authentication protocol, and make security-feature comparisons with related protocols. In addition, we give formal proof and security verification of the proposed protocol by using Burrows-Abadi-Needham (BAN) logic and AVISPA tool, respectively. Finally, we give performance comparisons in terms of computing costs and communicating costs, respectively. Comparative summaries demonstrate that our protocol provides more extractive features and security guarantees with little increased overheads.

LAM-CIoT: Lightweight authentication mechanism in cloud-based IoT environment

Internet of Things (IoT) becomes a new era of the Internet, which consists of several connected physical smart objects (i.e., sensing devices) through the Internet. IoT has different types of applications, such as smart home, wearable devices, smart connected vehicles, industries, and smart cities. Therefore, IoT based applications become the essential parts of our day-to-day life. In a cloud-based IoT environment, cloud platform is used to store the data accessed from the IoT sensors. Such an environment is greatly scalable and it supports real-time event processing which is very important in several scenarios (i.e., IoT sensors based surveillance and monitoring). Since some applications in cloud-based IoT are very critical, the information collected and sent by IoT sensors must not be leaked during the communication. To accord with this, we design a new lightweight authentication mechanism in cloud-based IoT environment, called LAM-CIoT. By using LAM-CIoT, an authenticated user can access the data of IoT sensors remotely. LAM-CIoT applies efficient “one-way cryptographic hash functions” along with “bitwise XOR operations”. In addition, fuzzy extractor mechanism is also employed at the user's end for local biometric verification. LAM-CIoT is methodically analyzed for its security part through the formal security using the broadly-accepted “Real-Or-Random (ROR)” model, formal security verification using the widely-used “Automated Validation of Internet Security Protocols and Applications (AVISPA)” tool as well as the informal security analysis. The performance analysis shows that LAM-CIoT offers better security, and low communication and computation overheads as compared to the closely related authentication schemes. Finally, LAM-CIoT is evaluated using the NS2 network simulator for the measurement of network performance parameters that envisions the impact of LAM-CIoT on the network performance of LAM-CIoT and other schemes.

Stateful Logic Operations in One-Transistor-One- Resistor Resistive Random Access Memory Array

Nonvolatile and cascadable stateful logic operations are experimentally demonstrated within a 1 k-bit one-transistor-one-resistor (1T1R) resistive random access memory (RRAM) array, where NAND gates serve as the building blocks. A robust dual-gate-voltage operation scheme is proposed. The effects of the transistor ON logic operation and the robustness to device parameter variations are discussed. The parallel 4-bit bitwise XOR operation is experimentally implemented in the 1T1R array by cascading NAND gates. This letter presents a feasible approach to in-memory computing for large-scale circuits.

Nonlinear optical multi-image encryption scheme with two-dimensional linear canonical transform

A nonlinear optical multi-image encryption scheme based on chaotic system and two-dimensional linear canonical transform (2D LCT) is designed. Firstly, the low-frequency sub-bands of the four grayscale images are extracted with the contourlet transform (CT), respectively. Then the four sub-bands are synthesized into a one-dimensional (1D) sequence, which is scrambled with a chaotic sequence produced by the two-dimensional (2D) logistic map. Subsequently, the image converted from the resulting 1D sequence is re-encrypted into a white noise-like image by phase truncation and phase reservation in the 2D LCT domain. Finally, the XOR operation based on the 2D logistic map is performed on the white noise-like image to yield the final ciphertext image. The parameters of the 2D LCT and the logistic map as the main keys enlarge the key space of the proposed multi-image encryption scheme. In addition, the keys regarded as the initial values of the chaotic systems are related to the original images. The phase truncation and the bitwise XOR operation, as nonlinear processes, improve the robustness of the presented multi-image encryption scheme against chosen-plaintext attack. Numerical simulation results demonstrate the validity and the reliability of the proposed optical multi-image encryption scheme with good performance.

Designing secure substitution boxes based on permutation of symmetric group

The strength of cryptosystems heavily relies on the substitution boxes. Cryptosystems with weak substitution boxes cannot resist algebraic attacks, linear and differential cryptanalysis. In this paper, first, we propose a strong algebraic structure for the construction of substitution boxes. The proposed substitution boxes have good algebraic properties and are able to resist against algebraic attacks. Second, we propose a new method for creating multiple substitution boxes with the same algebraic properties using permutation of symmetric group on a set of size 8 and bitwise XOR operation. Third, the proposed substitution boxes with the same algebraic properties are then applied to images and it is observed that the statistical properties of substituted images are different from each other. The simulation results and statistical and security analysis for the proposed substitution boxes are very competitive. Also, it is shown in this work that the proposed substitution boxes can resist differential and linear cryptanalysis and sustain algebraic attacks.

An image compression and encryption algorithm based on chaotic system and compressive sensing

For a linear image encryption system, it is vulnerable to the chosen-plaintext attack. To overcome the weakness and reduce the correlation among pixels of the encryption image, an effective image compression and encryption algorithm based on chaotic system and compressive sensing is proposed. The original image is first permuted by the Arnold transform to reduce the block effect in the compression process, and then the resulting image is compressed and re-encrypted by compressive sensing, simultaneously. Moreover, the bitwise XOR operation based on chaotic system is performed on the measurements to change the pixel values and a pixel scrambling method is employed to disturb the positions of pixels. Besides, the keys used in chaotic systems are related to the plaintext image. Simulation results verify the effectiveness and reliability of the proposed image compression and encryption algorithm with considerable compression and security performance.

Design of reliable storage and compute systems with lightweight group testing based non‐binary error correction codes

In this study, the authors propose a new group testing based (GTB) error control codes (ECCs) approach for improving the reliability of memory structures in computing systems. Compared with conventional single- and double-bit error correcting codes, the GTB codes provide higher reliability at the multi-byte error correction granularity. The proposed codes are cost-efficient in their encoding and decoding procedures. Instead of requiring multiplication or inversion over Galois finite field like most multi-byte ECC schemes, the proposed technique only involves bitwise XOR operations, therefore, significantly reducing the computation complexity and latency. For instance, to correct m errors in a Q-ary codeword of length N, where , the compute complexity is mere . The GTB codes trade redundancy for encoding and decoding simplicity, and are able to achieve better code rate than other ECCs of the same trade-off. The proposed GTB codes lend themselves well to designs with high reliability and low computation complexity requirements, such as storage systems with strong fault tolerance, or compute systems with straggler tolerance, and so on.

Image Encryption using DNA Coding and Hyperchaotic System

ABSTRACTThe paper proposes a grey scale image encryption scheme using six-dimensional Lorenz chaotic system. The key generating system uses a 32 character (256 bits) key as input. The system uses simple modular arithmetic and bitwise XOR operations followed by coupling a series of Lorenz six-dimensional systems to generate the key-stream. This generated key stream is used in the encryption and decryption algorithm of the plain image. The basic permutation and diffusion architecture, using the fundamental properties of modular arithmetic, bitwise XOR operations and DNA encoding/decoding technique, are executed to confuse the relationship between plain image and the ciphered image. The experimental results and security tests confirm that the proposed image encryption algorithm possess high security and can be a good candidate for practical image encryption.

A secure image encryption method using scan pattern and random key stream derived from laser chaos

Internet allows people in any corner of the world to share instantly all types of information. Secure sharing of sensitive multimedia data necessitates confidentiality service, which is offered by encipherment mechanism. In this paper, a fast and secure image encryption method using scan patterns and true random key streams is proposed. The scan pattern is used to scramble the original image by means of pixel permutation. The random key stream is generated employing a photonics based approach and then used to perform a bitwise XOR operation to get the encrypted image. The proposed method takes very less time for encryption and has substantial resistance with statistical, differential and entropy attacks.

Secure Remote User Authenticated Key Establishment Protocol for Smart Home Environment

The Information and Communication Technology (ICT) has been used in wide range of applications, such as smart living, smart health and smart transportation. Among all these applications, smart home is most popular, in which the users/residents can control the operations of the various smart sensor devices from remote sites also. However, the smart devices and users communicate over an insecure communication channel, i.e., the Internet. There may be the possibility of various types of attacks, such as smart device capture attack, user, gateway node and smart device impersonation attacks and privileged-insider attack on a smart home network. An illegal user, in this case, can gain access over data sent by the smart devices. Most of the existing schemes reported in the literature for the remote user authentication in smart home environment are not secure with respect to the above specified attacks. Thus, there is need to design a secure remote user authentication scheme for a smart home network so that only authorized users can gain access to the smart devices. To mitigate the aforementioned isses, in this paper, we propose a new secure remote user authentication scheme for a smart home environment. The proposed scheme is efficient for resource-constrained smart devices with limited resources as it uses only one-way hash functions, bitwise XOR operations and symmetric encryptions/decryptions. The security of the scheme is proved using the rigorous formal security analysis under the widely-accepted Real-Or-Random (ROR) model. Moreover, the rigorous informal security analysis and formal security verification using the broadly-accepted Automated Validation of Internet Security Protocols and Applications (AVISPA) tool is also done. Finally, the practical demonstration of the proposed scheme is also performed using the widely-accepted NS-2 simulation.

A two-stage rice-based lossless compression method for telemetry data

The article presents results of a study of a proposed lossless compression method for telemetry data. A two-stage scheme of lossless compression, consisting of decorrelation and entropy coding, is presented. In experiments, a bitwise XOR operation is implemented as a decorrelator and rice coding method as entropy coder. A comparison is performed between two compression methods: one is based only on rice coding method, while the other is based on the proposed method. The results are based on estimates of the gain in variance and entropy of the output signal from the decorrelator. In experiments, parameters of telemetry information of automatic control systems are studied, such as temperature, pressure and positioning data. Streams of telemetry frames, with different frame structures: one and two level of commutation, in IRIG-106 standard format, are formed and tested. Based on experimental results, conclusions are done for lossless telemetry data compression.

A recursive non-linear pre-encryption for opto-digital double random phase encoding

In this paper, we propose a recursive non-linear pre-encryption to be carried out digitally on the input image in the spatial domain before applying any double random phase encoding (DRPE). It consists of firstly scrambling the input image chaotically and then performing the bit-wise XOR operation recursively between two consecutive pixels following a given pattern. The starting two consecutive pixels are formed by the initial pixel in the pattern and a random eight-bit integer. The proposed pre-encryption-based DRPE image encryption system and existing DRPE cryptosystems are compared in terms of the sensitivity of the various encryption keys to decryption attacks.

Secure Three-Factor User Authentication Scheme for Renewable-Energy-Based Smart Grid Environment

Smart grid (SG) technology has recently received significant attention due to its usage in maintaining demand response management in power transmission systems. In SG, charging of electric vehicles becomes one of the emerging applications. However, authentication between a vehicle user and a smart meter is required so that both of them can securely communicate for managing demand response during peak hours. To address the above mentioned issues, in this paper, we propose a new efficient three-factor user authentication scheme for a renewable energy-based smart grid environment (TUAS-RESG), which uses the lightweight cryptographic computations such as one-way hash functions, bitwise XOR operations, and elliptic curve cryptography. The detailed security analysis shows the robustness of TUAS-RESG against various well-known attacks. Moreover, TUAS-RESG provides superior security with additional features, such as dynamic smart meter addition, flexibility for password and biometric update, user and smart meter anonymity, and untraceability as compared to other related existing schemes. The practical demonstration of TUAS-RESG is also proved using the widely accepted NS2 simulation.