Rabinovitch Hyper Chaotic Scrambling Based on Changing Pixels Values for Image Encryption

In recent years, digital image is an important personal data that must be preserved from breaches and espionage. Because of the frequent circulation of images and their transmission through the Internet and social networking, many researchers wrote about encrypting images using chaos. In this paper, an algorithm is proposed to generate random locations based on the Rabinovitch Hyper Chaotic Systems (RHCS), which is used to encrypt images in all available cases of the value of pixels Changing: such as Row-Row Scrambling, Column-Column Scrambling, Row-Column Scrambling, bits in each Pixel Scrambling. The simulation results proved that merging methods (row, column, and row-column) and without merge scrambling give good results regarding encryption strength and time process. Moreover, the key space is very big, in all methods is 2585, and in row column, approach 21170