Bitwise XOR Research Articles

An Image-Encipherment Algorithm Using a Combination of a One-Dimensional Chaotic Map and a Three-Dimensional Piecewise Chaotic Map

One-dimensional and three-dimensional piecewise chaotic maps are used to propose an image-encipher technique in this article. First, the logistic map is used to construct the pseudo-random sequence. After that, this sequence is used to scramble the plain image. Next, the three-dimensional piecewise chaotic map has produced a mask of the chaotic sequence. After doing some preprocessing steps on the mask, a bit-wise XOR operation with the mask is applied to the shuffled image. The suggested algorithm is used to encipher and decipher a different range of images. To check the algorithm security and efficiency, the algorithm performance was calculated using multiple statistical tests and compared to several recent algorithms. Furthermore, numerical simulations and experimental data are also used to validate the proposed algorithm’s resistance to various attacks.

2D Lorentz Chaotic Model Coupled with Logistic Chaotic Model for Medical Image Encryption: Towards Ensuring Security for Teleradiology

Medical images play pivotal role in health care sector for disease diagnosis and therapeutic planning. Encryption algorithms are widely used in medical image processing for ensuring privacy in data transfer. This research work proposes a hybrid chaotic model, 2D Lorentz Chaotic model coupled with the Logistic chaotic model for the encryption/decryption of medical DICOM CT images. Prior to encryption, preprocessing was done by the median filter. The hybrid chaotic model scrambles the rows and columns of the image and bitwise XOR operation is carried out to generate the encrypted image. The performance metrics reveals the proficiency of the approach utilized in this research work, the mean PSNR value was 73.45, mean NPCR value was 99.99 and mean UACI value was 26.03. The hybrid encryption model outperforms the existing encryption techniques and paves the way towards the teleradiology applications. The encrypted image can be transferred through the cloud network and the receiver side node can decrypt the image. The decrypted image equality was found to be proficient for healthcare applications.

An Efficient Authenticated Key Agreement Scheme Supporting Privacy-Preservation for Internet of Drones Communications.

In recent years, due to the rapid development of Internet of things (IoTs), various physical things (objects) in IoTs are smart enough to make their own decisions without the involvement of humans. The smart devices embedded in a drone can sense, collect, and transmit real-time data back to the controller from a designated environment via wireless communication technologies. The mobility, flexibility, reliability and energy efficiency of drones makes them more widely used in IoT environments such as commercial, military, entertainment applications, traffic surveillance and aerial photography. In a generalized IoD architecture, we have communications among the drones in a flying zone, among the drones and the control server, and also among the drones and authorized user. IoD still has many critical issues that need to be addressed, such as data access being carried out through a public channel and battery operated drones. To address these concerns in IoD communications, in this paper, an efficient authentication and secure communication scheme with privacy preservation is proposed and it only uses secure one-way hash function and bitwise XOR operations when control server, drone and user mutually authenticate each other. After the successful authentication, both IoD-based participants can agree on a common session key to secure the subsequent communication messages. The widely accepted ProVerif and BAN logic analysis have been used to assure that the proposed scheme is provably secure against existing well-known security attacks and ensures privacy. Finally, a comparative analysis is presented to demonstrate the proposed scheme preserves efficiency when compared to existing competitive schemes.

An Efficient and Provably Secure Certificateless Protocol for Industrial Internet of Things

The Internet of Things (IoT) has a wide range of applications that influence the life of people expeditiously. In recent years, IoT becomes an emerging technology in a number of fields. Different devices with divergent functionality are applied in IoT to work in several domains. These domains include smart home, smart farming, and Industrial Internet of Things (IIoT). Among these territories, the IIoT obtains more attention. In an IIoT environment, a legitimate user can control and access devices remotely. Legitimate users can access real-time data and share confidential information. The information is transmitted via public communication channel, which can be vulnerable to security attacks. In this article, we present a provably secure multifactor authenticated key agreement scheme to offer security regarding transmission of data in IIoT environment. This scheme will support the legitimate user to remotely access the sensing devices. Our presented scheme uses only symmetric cryptographic, bitwise XOR operation, and hash function to be resource-constrained. Our scheme is found to be resource efficient through communication and computation analysis. The performance analysis illustrates that the cost of computation and communication of our scheme is comparatively low as compared to other relevant schemes. The formal and informal security analysis proved that our scheme is secure and efficient as it can withstand several known adversarial attacks. We have used some cryptographic operations like XOR and hashing to provide security and privacy to legitimate entities.

Multi-factor based session secret key agreement for the Industrial Internet of Things

Industrial Internet of Things (IIoT) is the main field of application of the Internet of Things (IoT). The high degree of autonomy and resource constraints of the IIoT network poses challenges to the security of IIoT. Enabling the legitimate users to securely and remotely access resource-constrained intelligent terminal nodes in an open wireless channel has become a challenge in the IIoT environment. User authentication and key agreement schemes have been proposed for different IoT application scenarios to solve this problem. However, most existing three-party authentication and key agreement schemes for remote users have high computational costs and do not consider sufficient security attributes, such as unlinkability and anonymity. To address the aforementioned problems, the proposed scheme uses the IIoT as the application scenario and proposes a novel three-factor authentication and lightweight remote user identity authentication key agreement. This scheme is effective for devices with limited resources because it mainly uses a one-way hash function and a bitwise XOR operation. The security of the proposed scheme is demonstrated under the real-or-random model via a rigorous formal security analysis.

Double-image compression and encryption scheme based on chaotic system and real-preserving multi-order discrete fractional Fourier transform

In order to reduce the amount of data transmission and key consumption, a double-image compression and encryption scheme based on chaotic system and real-preserving multi-order discrete fractional Fourier transform (RPMODFrFT) is proposed in this paper. It can compress and encrypt two images simultaneously, and the measurement matrix of compression sensing is controlled by 2D Logistic-Sine-Coupling map (2D-LSCM). After consolidating two compressed images into one image, the image is further encrypted by scrambling and 2D-LSCM controlled RPMODFrFT operation. At last, the bitwise XOR operation using 2D-LSCM with the initial value related to the plain image is carried out. The simulation results show that the proposed encryption-compression scheme has high security and robustness through a lot of attack analysis, i.e. differential attack analysis (NPCR > 99.6022% and UACI >33.5658%), entropy values (average 7.99710), statistical attack (correlation coefficient values are almost 0), noise attack and cropping attack.

A secure and lightweight anonymous mutual authentication scheme for wearable devices in Medical Internet of Things

Medical Internet of Things (MIoT) is an emerging area of IoT comprising of wearable sensor nodes having low-powered processors. Wearable nodes gather the physiological data of a patient and transmit this real-time information to the user over an insecure channel. There is a possibility that an attacker might gather the personal or medical information of a user that has been communicated over an insecure channel. Hence, security and privacy become a major concern in MIoT for a user in the last decade. To access the medical data in the resource-constraint environment, in the current manuscript, we propose a secure and lightweight anonymous mutual authentication scheme. Our scheme works utilizing only the basic symmetric cryptosystem techniques that include cryptographic hash functions in one direction and bitwise XOR operation. As a result, the proposed framework is lightweight and also efficient than the state-of-the-art. We have validated our proposed scheme based on BAN-Logic and shown the efficiency concerning functionality, storage requirements, computation complexity, and communication costs.

A lightweight authentication scheme with privacy preservation for vehicular networks

The vehicular ad-hoc network relies on wireless communication, thus exposing security and privacy-related issues. The primary security requirements in a vehicular network are vehicle authentication, message integrity, and privacy preservation. Most of the existing state-of-the-art security schemes heavily relied on infrastructural entities such as roadside units and trusted authorities to achieve authentication. Typically, frequent authentication involving infrastructural entities increases communication overhead. Besides, the existing solutions assume the usage of ideal tamper-proof devices for storing sensitive data, which is prone to physical and cloning attacks. In this context, we present a Physically Unclonable Function based Lightweight Authentication Scheme with privacy preservation for vehicle-to-vehicle communication in the vehicular network. Physically unclonable function adds an extra layer of security from cloning and physical attacks. The proposed method uses a two-tier approach consisting of trusted authority and vehicles for achieving authentication using lightweight bitwise XOR operations and one-way hash functions. The proposed scheme reduces the burden on infrastructural entities by performing authentication through vehicle-to-vehicle communication. Compared with state-of-the-art schemes, the proposed scheme's security and performance analysis demonstrates its effectiveness in meeting various security requirements while ensuring resilience against various known attacks and competitive communication and computation cost.

Improved Sine-Tangent chaotic map with application in medical images encryption

The attractive properties of ergodicity, unpredictability, and initial state sensitivity have made chaotic maps the go-to tools in many applications, including cryptography and cyber–physical systems. Despite this, two challenges arise when using chaos systems in cryptography: (i) some one-dimensional (1D) chaotic maps do not satisfy the unpredictability property, and (ii) although they exhibit a complex and chaotic behavior, high-dimensional (HD) chaotic maps incur higher computational complexity. To address these issues, this paper proposes a new 1D chaotic map dubbed the improved Sine-Tangent map (IST map) that is derived from of the Sine map, a tangent function, and a Chebyshev polynomial of the first kind. Relative to chaotic maps, the proposed IST map provides better unpredictability and ergodicity, a vast chaotic range, enhanced complex behavior, and competitive computational complexity. Based on the IST map, we also introduced an encryption scheme for securing medical images in telemedicine. It consists of two diffusion phases, i.e., a bitwise XOR operation and a bitwise expanded XOR (eXOR) operation, with an intermediated confusion one, i.e., random circular-shift. An overriding step is foremost first completed before performing these cryptography phases, i.e., key generation. The secret key of the IST map is updated using the sine and cosine values of the sum of pixels of the input image. This leads to a unique secret key for each image. That is, one-time chaotic sequences are produced for each input image. The cyclic pattern of the sine and cosine values of the sum of pixels provides a prominent sensibility to small changes in the input image. Thus, the proposed algorithm is capable of resisting any chosen/known plaintext attacks. A performance analysis shows that the proposed algorithm outperforms a set of state-of-the-art comparison algorithms and its variants based on Sine, SE, and ST maps since it allows the best performance/complexity trade-off.

Secure device-independent quantum bit-wise XOR summation based on a pseudo-telepathy game

Secure device-independent quantum bit-wise XOR summation based on a pseudo-telepathy game

A lightweight and flexible mutual authentication and key agreement protocol for wearable sensing devices in WBAN

Purpose A wireless body area network (WBAN) is a collection of sensing devices attached to a person’s body that is typically used during health care to track their physical state. This paper aims to study the security challenges and various attacks that occurred while transferring a person’s sensitive medical diagnosis information in WBAN. Design/methodology/approach This technology has significantly gained prominence in the medical field. These wearable sensors are transferring information to doctors, and there are numerous possibilities for an intruder to pose as a doctor and obtain information about the patient’s vital information. As a result, mutual authentication and session key negotiations are critical security challenges for wearable sensing devices in WBAN. This work proposes an improved mutual authentication and key agreement protocol for wearable sensing devices in WBAN. The existing related schemes require more computational and storage requirements, but the proposed method provides a flexible solution with less complexity. Findings As sensor devices are resource-constrained, proposed approach only makes use of cryptographic hash-functions and bit-wise XOR operations, hence it is lightweight and flexible. The protocol’s security is validated using the AVISPA tool, and it will withstand various security attacks. The proposed protocol’s simulation and performance analysis are compared to current relevant schemes and show that it produces efficient outcomes. Originality/value This technology has significantly gained prominence in the medical sector. These sensing devises transmit information to doctors, and there are possibilities for an intruder to pose as a doctor and obtain information about the patient’s vital information. Hence, this paper proposes a lightweight and flexible protocol for mutual authentication and key agreement for wearable sensing devices in WBAN only makes use of cryptographic hash-functions and bit-wise XOR operations. The proposed protocol is simulated using AVISPA tool and its performance is better compared to the existing methods. This paper proposes a novel improved mutual authentication and key-agreement protocol for wearable sensing devices in WBAN.

Construction of vector space and its application to facilitate bitwise XOR – Free operation to minimize the time complexity

In modern computing environments, speed of execution of any operations are gaining more attentions. The faster processing of the unit operations, opens the room for the applications such as cryptography, data communication etc. Hence, in this work a new software-oriented approach is proposed to use in the environments that requires faster executions. This proposed method speeds up the computations of the logical operations – bitwise XOR.This paper first elaborates on the procedure of how to construct the bitwise XOR vector space efficiently using recursive approach based on Pauli’s matrix. The corresponding time complexity for the construction of the bitwise XOR vector space is computed by master theorem and is O(log2(n/2n)). Later, the paper presents on the implementation of this bitwise XOR vector space constructed to facilitate the XOR – Free operations. For the evidential proof, the proposed bitwise XOR-free operations are implemented on standard key stream generation scheme, SNOW 3G. The average speed up gained by the bitwise XOR-Free operations on the SNOW 3G is 1.36x and the corresponding throughput attained is 21.85Mbps.

Fast Chaotic Image Encryption Algorithm Using a Novel Divide and Conquer Diffusion Strategy

To protect image privacy in real-time transmission, a fast chaotic image encryption algorithm using a novel divide and conquer diffusion strategy is proposed in this paper. Firstly, a fast pseudo-random sequence generator is constructed using 2D hyperchaotic systems. And by performing bitwise XOR operation between two integer sequences obtained from different systems, the final key stream used for diffusion will have better randomness and unpredictability. Secondly, to achieve divide and conquer diffusion, the plain image is divided into three parts, then a parallel CBC-based diffusion method can simultaneously act on upper and bottom parts (or left and right parts), which achieves a time complexity of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\boldsymbol {O}$ </tex-math></inline-formula> ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$W+H$ </tex-math></inline-formula> ). Moreover, within the diffusion process, the mechanism of information interaction on the central row or column further enhances avalanche effect to resist differential attack. Thirdly, the session key of the proposed algorithm is a mixture of the plain image’s hash value and a true random sequence, which not only improve plaintext sensitivity but also realize one-time pad. Finally, experimental results indicate the superiority of our algorithm to resist statistical, chosen-plaintext, entropy, and other common attacks. Furthermore, by comparison with previous works, our algorithm preforms much faster execution speed with only average of 0.08s to encrypt images of size <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$512\times 512$ </tex-math></inline-formula> , while it provide the same or even higher level of security. Therefore, the proposed algorithm can meet security and efficiency requirements of real-time communications of image data.

Network Coding- Based Energy-Efficient Geographic Routing Protocols in Wireless Sensor Networks Using XOR

Abstract: Energy awareness is an essential design issue in wireless sensor network. Therefore, attention must be given to the routing protocols since they might differ depending on the application and network architecture. It is desired to design the energy efficient routing protocols to conserve the power supply of sensor node and prolong its lifetime. In this paper Network Coding-Energy efficient geographic routing protocol (NC-EGRPM) in Wireless Sensor network is an energy efficient scheme which prolong the network life time using the mobile sinks. These algorithms focus on the efficiency of network coding, which could be adoptive, flexible, and intelligent enough to distribute the load among the sensor nodes that can enhance the network lifetime. By using NC (Network Coding), we propose an energy efficienct algorithm to handle uncertain level decision better than other models. We also use the concept of XOR encoding and decoding as a mechanism not only for enhancing energy efficiency but also for reducing the end-to-end-delay. XOR-based coding works on a hop-by-hop basis, i.e. packets encoded by a node are decoded by its neighbouring nodes. The idea is that each node v can combine packets using bitwise XOR operations in order to produce an encoded packet. We are implementing our proposed work using NS2 and measure its performance. Keywords: Network coding, XOR, NS2, WSN

Optimized Chaotic encrypted image based on continuous raster scan method

As the greatest effective method of protection of multimedia data is image encryption is extensively used in data hiding, security authentication and content protection. Nevertheless, the security and efficiency are still the key issues of image encryption algorithm. However, the existing image encryption techniques face the issues namely poor resistance to plaintext attacks, simple algorithmic structures and small key space. In order to overcome the problem of traditional techniques, a joint image encryption techniques of continuous raster Scan, Henon Chaotic Map and Chebyshev Chaotic Map are developed for providing a security of images. Initially, the continuous raster is used to scramble the pixels of each blocks, where images are partitioning an image into non overlapping blocks and starting point is randomly selected in Henon Chaotic Map to permute the block. To calculate a random matrix, Chebyshev Chaotic Map is used to generate the sequence based on the secret keys. Finally, bitwise XOR operation between the scrambled image and random matrix is conducted to obtain the encrypted image. The proposed method takes very less time for encryption. Simulation results show that the algorithm is efficient and usable for the security of the image encryption system.

LMAAS-IoT: Lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment

Internet of Things (IoT) is a network of interconnected smart devices which provides tremendous benefits and can be applied in various fields including, but not limited to, healthcare, monitoring, and transportation. Since late of 2019, the world faces coronavirus (COVID-19) which has harmful consequences in humans’ life and economy. Reducing human interaction is the most important health measure to avoid the spread of the infection. In this context, leveraging IoT and cloud-based technology help to remedy COVID-19 consequences by means of enabling individuals to manage their essential activities remotely with minimum engagement. However, sharing and gathering sensitive information over public insecure channel brings enormous security risks. To avoid these risks, we present a new practical lightweight multi-factor authentication and authorization scheme for real-time data access in IoT cloud-based environment, called LMAAS-IoT. Our scheme is suitable for, but not limited to, managing large scale systems such as health infrastructures. LMAAS-IoT is secure, efficient and strengthens user anonymity using dynamic index. Our design supports high scalability systems with efficient user registration process in which the legitimate user can access current as well as newly added system entities without further processes. We employed “one-way cryptographic hash functions” along with “bitwise XOR operations”. In addition, a fuzzy extractor algorithm is used at user side to verify user’s biometric information. LMAAS-IoT is analyzed for security with the help of the widely used “Real-Or-Random (ROR)” model; proof of correctness using BAN-logic; formal security verification using the broadly accepted “Automated Validation of Internet Security Protocols and Applications (AVISPA)” tool as well as the informal security analysis. LMAAS-IoT is also implemented using NS-3.31 simulator to demonstrate the practicability of our design. Finally, LMAAS-IoT provides more desired attributes and achieves mutual authentication with low computation and communication cost compared with other existing schemes.

A novel binary operator for designing medical and natural image cryptosystems

Image cryptosystems aim to secure the transmission of images in the presence of adversaries in the network. For ensuring confidentiality, images are encrypted to form unintelligible cipher images, the algorithms of which are much different from those for text data. Most image cryptosystems follow confusion–diffusion or complex architectures, which involves permutation and substitution of pixel values. Often these are done using chaotic maps and involve binary operations such as bitwise XOR, addition–subtraction, DNA operations, etc., each of which has certain limitations. Most of the cryptosystems for medical images proposed in the literature encrypt 8-bit compressed versions of the images rather than the standard 16-bit DICOM version, which results in loss of information. This paper presents a novel binary operation that can be used for all types of image cryptosystems — from DICOM medical to natural images using both conventional and DNA approaches. The use of this operation has been tested on a proposed DNA-based cryptosystem, which has novel steps for encryption to overcome the drawbacks of some existing ones. The cryptosystem has been tested on several images of varying pixel depth and dimensions, and the results obtained meet the standards of a secured image encryption system.

Logic could be learned from images

Logic reasoning is a significant ability of human intelligence and also an important task in artificial intelligence. The existing logic reasoning methods, quite often, need to design some reasoning patterns beforehand. This has led to an interesting question: can logic reasoning patterns be directly learned from given data? The problem is termed as a data concept logic. In this study, a learning logic task from images, called a LiLi task, first is proposed. This task is to learn and reason the logic relation from images, without presetting any reasoning patterns. As a preliminary exploration, we design six LiLi data sets (Bitwise And, Bitwise Or, Bitwise Xor, Addition, Subtraction and Multiplication), in which each image is embedded with a n-digit number. It is worth noting that a learning model beforehand does not know the meaning of the n-digit numbers embedded in images and the relation between the input images and the output image. In order to tackle the task, in this work we use many typical neural network models and produce fruitful results. However, these models have the poor performances on the difficult logic task. For furthermore addressing this task, a novel network framework called a divide and conquer model by adding some label information is designed, achieving a high testing accuracy.

Cryptanalysis of hybrid secure image encryption based on Julia set fractals and three-dimensional Lorenz chaotic map

Recently a hybrid secure image encryption scheme based on Julia set and three-dimensional Lorenz chaotic system was suggested. The offered scheme was based on the multiplicative operation carried out by Julia set fractals and bitwise XOR which was implemented by the trajectories obtained from the Lorenz chaotic system. This paper presents the cryptanalysis of the scheme through a chosen-plaintext attack by taking three different chosen images. In this work, a practical chosen-plaintext attack is performed which reveals that the cryptosystem depending on only multiplication and bitwise XOR operation can be effortlessly attacked. The results of the analysis performed on the retrieved image reflect the effectiveness of the chosen-plaintext attack which fruitfully produces the original image.

Security Analysis and Improvement of an Image Encryption Cryptosystem Based on Bit Plane Extraction and Multi Chaos.

This paper analyzes the security of image encryption systems based on bit plane extraction and multi chaos. It includes a bit-level permutation for high, 4-bit planes and bit-wise XOR diffusion, and finds that the key streams in the permutation and diffusion phases are independent of the plaintext image. Therefore, the equivalent diffusion key and the equivalent permutation key can be recovered by the chosen-plaintext attack method, in which only two special plaintext images and their corresponding cipher images are used. The effectiveness and feasibility of the proposed attack algorithm is verified by a MATLAB 2015b simulation. In the experiment, all the key streams in the original algorithm are cracked through two special plaintext images and their corresponding ciphertext images. In addition, an improved algorithm is proposed. In the improved algorithm, the generation of a random sequence is related to ciphertext, which makes the encryption algorithm have the encryption effect of a “one time pad”. The encryption effect of the improved algorithm is better than that of the original encryption algorithm in the aspects of information entropy, ciphertext correlation analysis and ciphertext sensitivity analysis.