{'fraction_non_alphanumeric': 0.02600140548137737, 'fraction_numerical': 0.009135628952916374, 'mean_word_length': 5.1645021645021645, '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}}
Efficient image encryption using two-dimensional enhanced hyperchaotic Henon map

Abstract. We develop a two-dimensional enhanced hyperchaotic Henon map (2D-EHHM) to overcome the problems of small chaotic range and poor security when the 2-D traditional Henon map is implemented in cryptosystems. The performance evaluations show that the 2D-EHHM has wider chaotic range, higher chaotic complexity, better ergodicity, and hyperchaotic behavior compared with certain existing chaotic maps. Based on the 2D-EHHM, we further design an efficient image encryption algorithm consisting of a multiple block substitution stage (MBSS) and a bidirectional-dynamic diffusion stage (BDDS). In the MBSS, a plain image is divided into several nonoverlapping multiple blocks to carry out permutation operation. In the BDDS, the scrambled image is redivided into nonoverlapping sub-blocks of the same size to be diffused dynamically in the forward and backward directions. Moreover, the SHA 512 function is employed to obtain a 512-bit plain image hash value treated as a raw key. A variable-length secret key (at least 128 bits), which is dynamically selected from the raw key and regarded as a valid key, is utilized to generate the initial values for the chaotic system. Simulation results and security analysis show that the proposed algorithm can resist various cryptanalytic attacks and can be applied to real-time data transmission.