Simple, robust and secure data hiding based on CRT feature extraction and closed-loop chaotic encryption system (original) (raw)

Data hiding with security improvement using chaos cryptography algorithm

Stochastic Modeling & Applications, Special Issue on Innovative Research in Management, Applied Science and Engineering, 2022

This segment of the review paper provides a brief summary of the main concepts of chaos in data security along with reviewing the role of complexity theory in it. The purpose of the study includes discussion on using various techniques including sequence generation. Role of image encryption in providing data security. This paper employs chaos theory to analyze security vulnerability announcements. It demonstrates that there might be an underlying pattern to seemingly random events. Determining this pattern can lead to a better understanding of the order and structure of vulnerability frequency.

Separable Reversible Data Hiding using Chaotic Encryption and Histogram Shifting

— In recent years, the chaotic system based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. Likewise, a new technology called Reversible Data Hiding (RDH) has been gaining popularity since its inception in the beginning of twenty first century. Here we propose a new approach by clubbing the two different techniques for achieving an algorithm for secure image transfer while concealing some data in the communication and discloses only upon the verification of the authenticity of the destination node. Beauty of the proposed system is that at the content owner side, sequential processing of the two algorithms is mandatory whereas at receiver the reverse process can be done in any succession. Content owner first encrypts the image by using user defined key derived chaotic sequence with the help of standard logistic map function. Then the data hider embeds the data by histogram modification method. By exploiting the advantage of histogram shifting, this method can provide minimum bound of Peak Signal to Ratio (PSNR) value as 48.13 dB, which is much higher than the existing methods. Zero error in the retrieved information, higher quality of recovered cover image and directly decrypted marked stego-image, better embedding capacity and etc. are achieved with the proposed method.

A novel chaotic encryption technique for secure communication

Second IFAC Conference on Analysis and Control of Chaotic Systems (2009), 2009

In this work, a novel chaotic encryption technique is proposed to realize a secure communication system. In the proposed method, the message signal to be transmitted is first encrypted using a chaotic keystream and then masked with a chaotic signal. At the receiver end, the received chaotic signal is used for synchronization and to recover the encrypted signal. After applying the same keystream used in transmitter side, the message signal could be decrypted back. The main contribution of this work is generation of the keystream which is not part of the transmitter chaotic oscillator but is produced using an oscillator of different structure.

IRJET- A Secure and High-Capacity Data-Hiding Method using Arnold Transform and Chaotic Scrambling

IRJET, 2020

In the fast growing digital world, the protection and transmission of data securely is becoming huge challenge through an open medium like internet. There are several methods for information security process like Cryptography and Steganography. The different data hiding method are lossless compression, advanced encryption standard (AES), modified pixel value differencing (MPVD), and least significant bit (LSB) substitution is presented. In the lossless compression, Arithmetic coding was applied on a secret message to provide 22% higher embedding capacity. The hidden message which is compressed is then given to AES encryption for better security. After compression and encryption, the LSB substitution and MPVD are applied in this work. The proposed scheme is composed of Arnold scrambling and chaotic scrambling (SC-HAC).The security is considered by the proposed scheme which combines Arnold scrambling and Logistic scrambling to improve the encryption effect. Here, Arnold transform and chaotic scrambling is used to increase the SSIM value for better quality of compressed image.

Hiding of Speech based on Chaotic Steganography and Cryptography Techniques

The technique of embedding secret information into cover media, like image, video, audio and text called Steganography, so that only the sender and the authorized recipient who have a key can detect the presence of secret information. In this paper Steganography and Cryptography techniques of speech present with Chaos. Fractional order Lorenz and Chua systems that provides an expanded in key space are used to encrypt speech message. The large key space addition to all properties of randomness and nonlinearity which are possessed these chaotic systems ensure a highly robustness and security for cryptography process. As well as Modified Android Cat Map (MACM) offers additional space and security for steganography process. The irregular outputs of the MACM are used in this paper to embed a secret message in a digital cover image. The results show a large key sensitivity to a small change in the secret key or parameters of MACM. Therefore, highly security hiding for speech will be guaranteed by using this system

A New Approach For Chaotic Encrypted Data Hiding In Color Image

International Journal of Computer Applications, 2014

Sending encrypted messages frequently will draw the attention of third parties, i.e. crackers and hackers, perhaps causing attempts and revealing the original messages. In digital world, Steganography is introduced to hide the existence of the communication by concealing encryption message inside color image. This paper proposed a steganography algorithm that hides encrypted text in color image by using chaotic hybrid approach. First, the text will be encrypted by one of substitution encrypted methods then, the result will be hidden in a color image by using the chaotic equation (which is also used to create cipher text). Then, measurements PSNR, MSE and NC are used to calculate the effectiveness of the proposed method is described pictorially and also has been shown that a multilevel of security of data can be achieved.

Robust Secure and Blind Watermarking Based on DWT DCT Partial Multi Map Chaotic Encryption

The International journal of Multimedia & Its Applications, 2011

sub-bands using (DWT), each sub-band coefficients are relocated using Arnold transform to create a noiselike version, then apply partial encryption scheme using chaotic scrambled random number pattern bitwise XOR with the scrambled horizontal coefficients only and the shuffled approximation coefficients are divided into non-overlapping and equal sized blocks. Watermark embedding process is based on extracting the (DCT) middle frequencies of the encrypted approximation coefficients blocks. Comparison based threshold of the extracted DCT mid-band coefficients, watermark bits are embedded in the coefficients of the corresponding DCT middle frequencies. The experimental results show that the proposed algorithm is robust against common signal processing attacks. The proposed algorithm is able to reduce encryption to one quarter of the image information. Statistical and differential analyses are performed to estimate the security strength of the proposed algorithm. The results of the security analysis show that the proposed algorithm provides a high security level for real time application. DWT, DCT, Watermarking, Partial Encryption, Chaotic Encryption. Esam A. A. A. HAGRAS received the B.S. degrees in Electrical Engineering from faculty of engineering, Alexandria Univ., Egypt, in 1994, M.S. degrees in Electrical Engineering from Mansoura Univ., Egypt, in 2001, respectively. During 2005, he was on in Dept., of Electrical Engineering, faculty of engineering, Alexandria Univ. In Dec. 2007, he gets the PhD degree in information security in communications. His research interests in the field of information and multimedia security, chaotic cryptography, Hardware implementation of encryption algorithms on FPGA ,data compression, digital image watermarking, communication and wireless sensor network security. He has published more than ten papers on security and communications.

Improving random number generators by chaotic iterations application in data hiding

2010 International Conference on Computer Application and System Modeling (ICCASM 2010), 2010

In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated sequences can pass all the DieHARD statistical test suite. In addition, this generator behaves chaotically, as defined by Devaney. This makes our generator suitable for cryptographic applications. An illustration in the field of data hiding is presented and the robustness of the obtained data hiding algorithm against attacks is evaluated.

A Speech Cryptosystem Based on Chaotic Modulation Technique

The Egyptian Journal of Language Engineering, 2017

In this paper, an encryption approach for Speech communication based on direct chaotic modulation (non-autonomous modulation) is presented, in which speech signal is injected into one variable of the master system (using Lorenz system) without changing the value of any control parameter. This approach is based on the change of chaotic signal by injecting Speech samples into one variable in chaotic system and hence generating a new chaotic signal. The Speech signal is then extracted from the chaotic signal on the receiver side. Furthermore, a high dimension chaotic system is used, which increases the security of the encrypted signal. Non-autonomous modulation technique is suitable for securing real-time applications. A comparative study of approach and Speech masking technique is also presented. Experimental results show that non-autonomous methods give better performance than their chaotic masking counterparts when they are analyzed against Signal-to-Noise-Ratio (-38.55 dB vs.-35.51 dB), Segmental signal-to-Noise-Ratio (-38.91 dB vs.-35.84 dB), Log-Likelihood Ratio (0.89 vs. 0.80), and Correlation Coefficient Analysis (0.0345 vs. 0.021). Non-autonomous techniques overcome the chaotic masking break and considered more secure.

Simple and Efficient Chaotic Based Method of Message Cryptography

International Journal of Computer Science and Mobile Computing

A simple and easy to implement method of secret message cryptography will be introduced. The message to be encrypted-decrypted is to be converted to binary matrix, this matrix is to be reshaped to 16 columns matrix, and the contents of this matrix will be rearranged base on the contents of the generated indices key. A chaotic paramaters included in the private key will be used to run a chaotic logistic map model to generate a 16 elements chaotic key, this key will be sorted to get the required indices key. The proposed method will be flixeble and it will be used to encrypt-decrypt any message with any length. Changing the message or/and changing the key will not affect the method. The produced decrypted message will be sensitive to the selected PK, any changes in the private key in the decryption process will produce a carrupted unreadable message. The proposed method will be tested and implemented using various in sizes messages, the obtained result will be used to prove the sensit...