Secure Parallel Image Cryptographic Hash Function Using a Novel 2D High-Randomness Hyperchaotic Map

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

For image data, the processing of each pixel using a cryptographic hash function is linear, and the existing cryptographic hash function lacks parallel processing of image width and height. In order to improve the computational efficiency and ensure the security of the hash function in image cryptography, we design a 2D hyperchaotic map, whose good chaotic dynamics and randomness fully meet the needs of the hash function. Based on the proposed mapping, we propose an image-specific chaotic hash function for confusion diffusion and extraction in both width and height dimensions in parallel. The designed hash function of image cryptography can set some common hash lengths and also support the setting of key. For image data, the proposed method has higher computational efficiency than other common hash functions and has good encryption security and anti-collision characteristics.

Cite

CITATION STYLE

APA

Qi, M., & Wang, D. (2025). Secure Parallel Image Cryptographic Hash Function Using a Novel 2D High-Randomness Hyperchaotic Map. Mathematics, 13(11). https://doi.org/10.3390/math13111890

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free