Exclusive-or Operation Research Articles

A novel image encryption algorithm based on hybrid chaotic maps using a key image

One of the most important data currently shared on the Internet is images of various sizes and types, gray and color, private and public, civilian and military, medical and scientific, commercial, and others. The biggest challenge and problem is the secure transmission of these images in this insecure environment. In this context, this paper proposes a new image encryption algorithm using a hybrid of three modified and improved chaotic one-dimensional (1D) maps to avoid the shortcomings of 1D maps and multidimensional (MD) maps. A key image is used to initialize the chaotic maps and is also used as a mask in the diffusion phase with the eXclusive OR (XOR) operator. The encryption process uses ExtraParam extracted from the original image, which is very sensitive to bit changes during the initialization of the chaotic maps. The proposed encryption process consists of two main phases: confusion and diffusion processes. The proposed image encryption algorithm has successfully passed numerous tests and cryptanalysis. We also measure the proposed algorithm with various analysis experiments such as histogram and entropy analysis, the number of pixel change rate (NPCR), the unified average changing intensity (UACI), the mean square error(MSE), the peak signal-to-noise ratio (PSNR) and Key Space. The experimental results and comparative analysis show that the proposed encryption algorithm has excellent performance, is strong enough to withstand various attacks, and provides excellent privacy to digital images.

Brain-inspired Cognition in Next-generation Racetrack Memories

Hyperdimensional computing (HDC) is an emerging computational framework inspired by the brain that operates on vectors with thousands of dimensions to emulate cognition. Unlike conventional computational frameworks that operate on numbers, HDC, like the brain, uses high-dimensional random vectors and is capable of one-shot learning. HDC is based on a well-defined set of arithmetic operations and is highly error resilient. The core operations of HDC manipulate HD vectors in bulk bit-wise fashion, offering many opportunities to leverage parallelism. Unfortunately, on conventional von Neumann architectures, the continuous movement of HD vectors among the processor and the memory can make the cognition task prohibitively slow and energy intensive. Hardware accelerators only marginally improve related metrics. In contrast, even partial implementations of an HDC framework inside memory can provide considerable performance/energy gains as demonstrated in prior work using memristors. This article presents an architecture based on racetrack memory (RTM) to conduct and accelerate the entire HDC framework within memory. The proposed solution requires minimal additional CMOS circuitry by leveraging a read operation across multiple domains in RTMs called transverse read (TR) to realize exclusive-or ( XOR ) and addition operations. To minimize the CMOS circuitry overhead, an RTM nanowire-based counting mechanism is proposed. Using language recognition as the example workload, the proposed RTM HDC system reduces the energy consumption by 8.6× compared to the state-of-the-art in-memory implementation. Compared to dedicated hardware design realized with an FPGA, RTM-based HDC processing demonstrates 7.8× and 5.3× improvements in the overall runtime and energy consumption, respectively.

SF-LAP: Secure M2M Communication in IIoT with a Single-Factor Lightweight Authentication Protocol

Machine-to-machine communication allows smart devices like sensors, actuators, networks, gateways, and other controllers to communicate with one another. The industrial Internet of things (IIoT) has become a vital component. Many industrial devices are connected to perform a task automatically in machine-to-machine communication, but they are not properly secured, allowing an adversary to compromise them against a variety of attacks due to communication system vulnerabilities. Recently, a secure lightweight authentication protocol (SLAP) was proposed by Panda et al. They asserted that every known attack that could happen in the IIoT is deterred by their suggested protocol. In this study, we prove that the SLAP protocol is vulnerable to desynchronization, impersonation, replay, and eavesdropping attacks. To prevent these attacks and enhance that protocol, we need to implement a secure authentication mechanism that ensures the security of communication. This paper proposed a secure M2M Communication in IIoT with a single-factor lightweight authentication protocol (SF-LAP). Single-factor authentication is a simple and secure way to communicate. It uses less power and communication overhead while providing a secure mechanism for conversation. In the machine-to-machine (M2M) scenario, the proposed protocol uses an exclusive-OR operation and a hashing function to ensure secure communication between the sensor and the controller. The proposed mechanism uses a secure preshared key and timestamp technique to protect and safeguard this connection against desynchronization attacks and eavesdropping attacks. We used Burrows Abadi Needham (BAN) Gong, Needham, and Yahalom (GNY) logic, and the automated validation of Internet security protocols applications (AVISPA) tool for formal verification and perform a security analysis as an informal verification to make sure the suggested protocol is secure. Analysis that shows the SF-LAP consumes the least computing and communication overhead and is more secure because it prevents desynchronization and eavesdropping attacks to all of the known attacks that are modification attacks, tracing attacks, impersonation, man-in-the-middle, and replay attacks.

Reversible data hiding in encrypted image with local-correlation-based classification and adaptive encoding strategy

In recent years, reversible data hiding in encrypted images has attracted more and more attention due to its wide application in secret information transmission and image content protection. In this paper, we propose a reversible data hiding scheme for encrypted image based on classification and multi-layer processing. The image owner utilizes a block-level encryption method, including block-level bitwise exclusive-or operation and block permutation, to obtain encrypted image such that the correlation of pixels in most blocks is preserved. Therefore, there provably exist identical consecutive high-order bit planes (ICHOBPs) from the most significant bit (MSB) where the number of ICHOBPs is defined as local correlation. Further, a local-correlation-based classification mechanism is proposed such that these blocks can be classified into different types. The data hider adopts multi-layer processing to fully exploit the local correlation in each block. First, ICHOBPs of each block are utilized as redundant space for data embedding. For those blocks with a small number of ICHOBPs, an adaptive coding strategy is proposed to improve embedding capacity. Especially for those blocks whose correlation is not well preserved, we propose a special processing method to exploit redundant space. Experimental results show that our method can effectively improve the embedding capacity than other similar ones with keeping high quality in security analysis.

A Lightweight and Anonymous Authentication and Key Agreement Protocol for Wireless Body Area Networks

As a major building block of Healthcare 4.0, wireless body area networks (WBANs) play an important role in collecting patient’s real-time physical phenomena through small wearable or implantable intelligent medical devices and communicating with remote medical experts using short-range wireless communication techniques. However, the challenges of securing information access are partly evidenced by the difficulty in designing secure and efficient security protocols. For example, existing authentication and key agreement schemes have either potential security vulnerabilities or high communication and computation overhead. In this article, we propose a lightweight and anonymous authentication and key agreement protocol, also called liteAuth, for WBANs. In our approach, mutual authentication and session key agreement are achieved using the Tinkerbell map-based random shuffling, physical unclonable function, one-way hash function, and bitwise exclusive OR operation. The security of liteAuth is first verified using the AVISPA tool, and then its cyber resilience is analyzed. In addition, we develop a real-world testbed, implement liteAuth and two existing schemes (i.e., PSLAP and HARCI), and conduct experiments for performance evaluation and analysis. Experimental results indicate that liteAuth can improve the performance of communication overhead and computation time as well as reduce energy consumption, while meeting all security requirements.

The Self-Shrinking Conflation Generator: A Proposed Improvement to the Self-Shrinking Generator

The backbone of many cybersecurity applications and algorithms require random numbers. One of the most commonly used pseudo-random number generators is the Linear Feedback Shift Register (LFSR), which is fast, computationally inexpensive, and has excellent statistical properties. Unfortunately LFSRs have a number of weaknesses, some of which were addressed by decimation-based sequence generators such as the self-shrinking generator (SSG). Regrettably, the SSG was also found to be vulnerable to attack. In this paper, we propose an improvement to the SSG called the self-shrinking conflation generator (SSCG). Our approach is based on the observation that what is discarded during the self-shrinking process of the SSG, is from a cryptographic perspective, just as good as that which is kept. By combining the bits the SSG would normally discard with those it retains, using the exclusive OR (XOR) operation, we create a modified SSG bitstream with several improved characteristics. To highlight these improvements, we provide some mathematical security analysis associated with this approach, apply the NIST statistical test suite to several different bitstreams created using LFSRs driven by different degree primitive polynomials, and compare our results to that of the SSG.

Color code encryption based on exclusive-OR operation and double random polarization encryption

Color code encryption based on exclusive-OR operation and double random polarization encryption

Performance Analysis and Optimization in Two-Way Cooperative NOMA Under Two-Phase Transmission Protocol

In this article, a novel two-phase transmission protocol is proposed to help the bidirectional transmission in a user-aid two-way cooperative nonorthogonal multiple access system, where superposition coding, bit-level Exclusive-Or operation, and successive interference cancellation (SIC) techniques are employed for improving the spectrum efficiency and throughput. Considering the residual interference generated in the practice process of decoding, both the perfect SIC and the imperfect SIC scenarios are discussed. Besides, the power allocation factor <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\alpha _{1}$</tex-math></inline-formula> and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\alpha _{2}$</tex-math></inline-formula> are optimized under the perfect SIC to reduce the total outage probability, whose closed-form expression is derived and verified by simulations. Also, the approximated outage performance is derived in imperfect SIC scenario. Furthermore, two other conventional two-phase protocols and one three-phase protocol are provided as the benchmark to compare the outage probability and throughput with the proposed protocol, which shows the superiority of the proposed two-phase protocol and power allocation.

Perancangan dan Implementasi Encoder dan Decoder CRC-8 untuk Pendeteksian Error pada Transmisi Data antar Perangkat IoT

Cyclic Redundancy Check (CRC) is a widely used error detection code in digital communication systems to detect errors in data transmitted between transmitter and receiver. With the development of Internet-of-Things (IoT) technology, where many devices communicate wirelessly, the application of error detection codes such as CRC is essential to obtain reliable communication. The computation of CRC can be implemented in hardware using a linear feedback shift register (LFSR) or in software with shift and bitwise exclusive OR (XOR) operations for polynomial division. Due to the frequent use of CRC in wireless communication for IoT, research for the design and implementation of CRC continues to this day. This study aims to design and implement the encoder and decoder of CRC-8 with generator polynomial 0x07 on IoT devices. Two algorithms for computing the CRC, namely bitwise computation using LFSR and another one using lookup tables, are implemented on the Arduino Uno R3 board. Two Arduino boards connected in serial were used to verify the encoder and decoder implementation in the data transmission and error detection process. The experiment results showed that the encoder could correctly calculate the CRC value from the input data. Furthermore, the computation using lookup tables takes about four times faster than the bitwise method but requires more memory. In contrast, the bitwise computation method requires less memory but slower computation time. When testing using input data of 128 characters, the bitwise-based encoder requires a computation time of 2.37 milliseconds, while the lookup table-based encoder utilizing a lookup table requires a computation time of 0.5 milliseconds. In the error detection test, the results demonstrated that the receiver could detect errors in the transmitted data with a percentage of 100%.

Weighted zigzag decodable fountain codes for unequal error protection

By combining bit-shift and exclusive-or operations, a weighted zigzag decodable fountain code is proposed to achieve an unequal error protection property. In the proposed scheme, the input symbols of different importance levels are first pre-coded into variable nodes using low-density parity-check codes. Then, bit-shift operations prior to exclusive-or are performed on the non-uniformly selected variable nodes to generate encoded symbols. An analysis of the erasure probabilities based on the and-or tree is further introduced. Simulation results show that by appropriately choosing the maximum bit-shift amount, the proposed weighted zigzag decodable fountain codes can successfully recover the more important input symbols prior to the less important ones.

Asymmetric image encryption algorithm based on a new three-dimensional improved logistic chaotic map

Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map (3D-ILM), an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman (RSA) is presented in this paper. In the first stage, a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence, Lyapunov exponent, and Shannon entropy. In the second stage, combined with the public key RSA algorithm, a new key acquisition mathematical model (MKA) is constructed to obtain the initial keys for the 3D-ILM. Consequently, the key stream can be produced depending on the plain image for a higher security. Moreover, a novel process model (NPM) for the input of the 3D-ILM is built, which is built to improve the distribution uniformity of the chaotic sequence. In the third stage, to encrypt the plain image, a pre-process by exclusive OR (XOR) operation with a random matrix is applied. Then, the pre-processed image is performed by a permutation for rows, a downward modulo function for adjacent pixels, a permutation for columns, a forward direction XOR addition-modulo diffusion, and a backward direction XOR addition-modulo diffusion to achieve the final cipher image. Moreover, experiments show that the the proposed algorithm has a better performance. Especially, the number of pixels change rate (NPCR) is close to ideal case 99.6094%, with the unified average changing intensity (UACI) close to 33.4634%, and the information entropy (IE) close to 8.

Deterministic secure quantum communication against collective noise

Collective noise is one of the main obstacles that reduce the efficiency of quantum communication. In this paper, we present two robust deterministic secure quantum communication (DSQC) schemes based on logical qubits. The first scheme employs a store-and-measure strategy along with the exclusive OR operation. Then we propose a second scheme without storage by exploiting hidden permutations and one-way hash functions. To achieve the performance of robustness against collective noise, both schemes take advantage of the compensability of decoherent-free subspace (DFS) for noise. Moreover, except for decoy qubits, all quantum states are used to convey the secret message. In addition, we provide a rigorous security analysis of potential attacks and prove the security of our protocols.

Experimental implementation of spike-based neuromorphic XOR operation based on polarization-mode competition in a single VCSOA.

We experimentally and numerically propose an approach for implementing spike-based neuromorphic exclusive OR (XOR) operation using a single vertical-cavity semiconductor optical amplifier (VCSOA). XOR operation is realized based on the neuron-like inhibitory dynamics of the VCSOA subject to dual-polarized pulsed optical injections. The inhibitory dynamics based on the polarization-mode competition effect are analyzed, and the inhibitory response can be obtained in a suitable range of wavelength detuning. Here, all input and output bits are represented by spikes that are compatible with the photonic spiking neural network. The experimental and numerical results show that XOR operation can be realized in two polarization modes by adjusting the time offset in the inhibitory window and setting defined reference thresholds. In addition, the influences of delay time and input intensity ratio on XOR operation are studied experimentally. This scheme is energy efficient because VCSOA neuromorphic photonics computing and information processing.

320 Gb/s all-optical logic operations based on two-photon absorption in carrier reservoir semiconductor optical amplifiers

When a train of optical pulses is injected, two-photon absorption (TPA)-induced pumping results in significant and fast gain and phase shifts in the carrier reservoir semiconductor optical amplifier (CR-SOA). Therefore, in this work, the effect of TPA on all-optical (AO) exclusive-OR (XOR), AND, NOT-OR (NOR), OR, NOT-AND (NAND), and exclusive-NOR (XNOR) logic operations using CR-SOAs is theoretically implemented for the first time at 320 Gb/s. The XOR, AND, NOR, NAND, and XNOR logic gates are implemented using the Mach-Zehnder interferometer, which has two symmetrical CR-SOAs in each of its two arms, whereas the OR logic gate is produced by combining a CR-SOA with a delayed interferometer. The quality factor (QF) and the associated bit error rate (BER) metrics are employed to evaluate the operations’ performance. The obtained simulation results indicate that when exploiting TPA in CR-SOAs the target Boolean functions can be executed with QF and BER that are more than acceptable than without TPA at a high speed up to 320 Gb/s. Various circuits of enhanced logic functionality, such as AO half-adder, latches, comparator, half-subtractor, and encoder can be implemented by combing the presented AO gates and hence exploiting the ultrafast TPA-induced gain and phase changes in CR-SOAs. Furthermore, the potential of CR-SOAs as nonlinear elements is systematically and thoroughly established for a wide suite of AO logic operations.

A novel zero-watermarking algorithm based on robust statistical features for natural images

In this paper, we develop a robust image zero-watermarking algorithm based on multiple circular statistical features. First of all, we detect stable feature points from the host image, and construct circular region partitions from the identified feature points, which contain the critical information of the host image. Second, the statistics and differences of circular region partitions are calculated, which contain both the local differences and the global information of the host image. Third, we apply discrete cosine transform (DCT) and singular value decomposition (SVD) in statistics and differences in order to construct the feature image. The stability of DCT and SVD further warrants the robustness of the algorithm. Moreover, Arnold transform is used to scramble the watermark image to enhance the security of the algorithm. Finally, we obtain the zero watermark by performing the exclusive-or (XOR) operation between the feature image and the scrambled watermark image, and the zero watermark is stored in the copyright authentication database for copyright authentication. Moreover, to combat geometric attacks, we develop a blind image correction algorithm without using the original image to accurately correct the attacked image. Numerous experiments and comparisons with the state-of-the-art (SOTA) watermarking algorithms confirm that the proposed algorithm affords good robustness against various attacks, such as filtering attacks, noise attacks, geometric attacks, and even a random combination of the above-stated attacks.

Artificial Noise Aided Secure Communications for Cooperative NOMA Networks

Non-orthogonal multiple access (NOMA) has been envisioned as a promising multiple access technique to improve spectral efficiency and provide massive connectivity in future wireless networks. However, the inherited security issues with NOMA should be carefully addressed to further exploit its potential benefits in NOMA enabled wireless networks. As such, we consider a cooperative NOMA network, where a source uses the NOMA to simultaneously communicate with a multi-antenna near-user and a far-user. While directly communicating with the near-user, the source employs multiple full-duplex (FD) decode-and forward (DF) relays to establish communication with the far-user in the presence of a passive eavesdropper. To address the eavesdropping in this cooperative NOMA network, we propose a new two-phase FD-based artificial noise (AN) scheme with different relay selection techniques. In the first phase, the selected FD relay emits AN to confuse the eavesdropper while receiving the superimposed signal from the source. In the second phase, the selected relay performs exclusive OR (XOR) operation on both the message intended to the far-user and the AN before broadcasting the resulting mixed signal. By utilizing null-space beamforming, self-interference cancellation techniques and DF-XOR cooperative protocol, the AN in the proposed scheme can be efficiently eliminated at the near-user and far-user as well as at the selected relay. However, the AN cannot be suppressed at the eavesdropper which serves the purpose of AN through degrading the decoding capability of the eavesdropper. We evaluate the performance of the proposed scheme in terms of security-reliability trade-off (SRT). For the AN-aided scheme with max-min and partial relay selection techniques, we theoretically derive the exact and asymptotic closed-form expressions of the outage probability and intercept probability. Numerical results have been provided to validate the derivations. In addition, the results reveal that the SRT of the near-user and far-user can be improved by increasing the number of antennas at the near-user and the number of relays.

SELWAK: A Secure and Efficient Lightweight and Anonymous Authentication and Key Establishment Scheme for IoT Based Vehicular Ad hoc Networks.

In recent decades, Vehicular Ad Hoc Networks (VANET) have emerged as a promising field that provides real-time communication between vehicles for comfortable driving and human safety. However, the Internet of Vehicles (IoV) platform faces some serious problems in the deployment of robust authentication mechanisms in resource-constrained environments and directly affects the efficiency of existing VANET schemes. Moreover, the security of the information becomes a critical issue over an open wireless access medium. In this paper, an efficient and secure lightweight anonymous mutual authentication and key establishment (SELWAK) for IoT-based VANETs is proposed. The proposed scheme requires two types of mutual authentication: V2V and V2R. In addition, SELWAK maintains secret keys for secure communication between Roadside Units (RSUs). The performance evaluation of SELWAK affirms that it is lightweight in terms of computational cost and communication overhead because SELWAK uses a bitwise Exclusive-OR operation and one-way hash functions. The formal and informal security analysis of SELWAK shows that it is robust against man-in-the-middle attacks, replay attacks, stolen verifier attacks, stolen OBU attacks, untraceability, impersonation attacks, and anonymity. Moreover, a formal security analysis is presented using the Real-or-Random (RoR) model.

A Modified Shamir Secret Sharing Scheme With Efficient Encoding

The Shamir secret sharing (SSS) scheme requires a Maximum Distance Separable (MDS) code, and in its most common implementation, a Reed-Solomon (RS) code is used. In this letter, we observe that the encoding procedure can be made simpler and faster by dropping the MDS condition and specifying the possible symbols that can be shared. In particular, the process can be made even faster by using array codes based on exclusive-or (XOR) operations instead of RS codes.

High performance optical image hiding based on computational ghost imaging with BCH error correction coding technique

The conventional image hiding scheme based on computational ghost imaging (CGI) has low-quality reconstructed watermark and unsatisfied security. In this paper, a high performance optical image hiding scheme is proposed to cope with these issues. The watermark is first read as a binary number sequence and processed by exclusive-OR operation with a random number sequence that generated by chaotic system. Thereafter, the result is coded with Bose-Chaudhuri-Hocquenghem error correction code and encrypted by the CGI system. Finally, the obtained cyphertext is quantified into two levels and hidden in the host image. Differing from other watermarking schemes, binary images, grayscale images and color images can be used as watermarks to be reconstructed losslessly, and a series of simulation results illustrate the feasibility and effectiveness of the proposed scheme.

A Formal Verification Based on Yu-Cao Delayed Chaotic Neural Network

Yu and Cao proposed “Cryptography based on delayed chaotic neural networks” in 2006. However, in 2009, Yang et al. pointed out the Yu-Cao scheme can not against chosen plaintext attack. Liu et al. studies exclusiveor logical operation very well, and provided Boolean algebra proofs in 2012. Ye et al. used Liu et al.’s method to reinterpret and analyze Yu-Cao scheme in 2018. In this paper the authors would like to give a formal verification by Galois field expression on the exclusive-or operation problem again. As this result, it makes more effective insecure to Yu-Cao algorithm.