{'fraction_non_alphanumeric': 0.017921146953405017, 'fraction_numerical': 0.0017921146953405018, 'mean_word_length': 5.070652173913044, '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}}
An Image Encryption Scheme Based on Generalized Arnold Map and Chinese Remainder Theorem

A novel image encryption scheme comprising of one permutation process and one diffusion process is proposed. In the permutation process, the image sized is expanded to one sized by dividing the plain-image into two parts: one consisting of the higher 4bits and one consisting of the lower 4bits. The permutation operations are done row-by-row and column-by-column to increase the speed. The chaotic generalized Arnold map is utilized to generate chaotic sequence, which is quantized to shuffle the expanded image. The chaotic sequence for permutation process is dependent on plain-image and cipher keys, resulting in good key sensitivity and plain-image sensitivity. To achieve more avalanche effect and larger key space, Chinese Remainder Theorem is applied to diffuse the shuffled image. The key sensitivity and key space of the proposed image encryption have been analyzed as well. The experimental results suggest that the proposed image encryption scheme can be used for secure image and video communication applications.