{'fraction_non_alphanumeric': 0.01794145420207743, 'fraction_numerical': 0.009442870632672332, 'mean_word_length': 4.921787709497207, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Robust Image Encryption Based on Double Hyper Chaotic Rabinovich System

an essential characteristic of chaotic systems is the difficulty in predicting the path of the chaotic time series and the size of the keyspace, which is very large compared to other encryption methods. This paper presents a new image encryption technique depending on a random bitstream generation method through a double Rabinovich hyperchaotic system. The proposed algorithm (Hyper Chaotic Rabinovich System (HCRS)) has been achieved in several ways. Each technique was examined in balanced and delay environments. Then an XOR operation will be done between the bits with the same index of the original image bits and the generated bits to obtain the encrypted image. The HCRS results showed that the balance in random bits between Zeros and Ones are equal in all proposed methods. The Pick Signal to Noise Ratio (PSNR) between the original and the encrypted images is (8.6262). The second significant result in this paper is that the keyspace is very large, more potent than 10ˆ288.