A secure image encryption algorithm based on chaotic maps and SHA‐3

A novel compression-based 2D-chaotic sine map for enhancing privacy and security of biometric identification systems

Recently, due to the initial sensitivity, ergodicity, boundedness, and unpredictability of chaos, it has been widely used in the fields of secure communication, signal processing, chaotic synchronization, etc. Moreover, due to the low complexity of hardware implementation, widespread attention to one-dimensional (1D) chaotic maps has been paid from researchers. However, some existing 1D maps have simple chaotic behaviors and discrete chaotic intervals, which have significantly affected the practical application. To address these shortcomings, this paper proposes a 1D chaotic model based on the absolute value function and the cosine function called the cosine-coupled chaotic model (CCCM). It can use existing 1D chaotic maps as seed maps to construct a series of 1D chaotic maps with continuous chaotic intervals and complex chaotic behaviors. To verify the effectiveness of the CCCM, we first generate three new chaotic maps using the CCCM, and then their chaotic properties are analyzed by using various measures including Lyapunov exponent (LE), sample entropy (SE), correlation dimension (CD), 0-1 test and sensitivity. The experimental results confirm that the new chaotic maps have wider chaotic intervals and more complex chaotic behaviors than the corresponding seed maps and some other advanced chaotic maps. Then we use a field programmable gate array (FPGA) as the hardware platform for simple hardware implementations of the new chaotic maps. And a new pseudo-random number generator (PRNG) is introduced to verify practical applications of the new maps. Finally, experimental results show that the new chaotic maps can be implemented on FPGA and the proposed PRNG has strong random properties.

A novel devaney chaotic map with uniform trajectory for color image encryption

Image encryption based on chaotic maps is an important method for ensuring the secure communication of digital multimedia on the Internet. To improve the encryption performance and security of image encryption systems, a new image encryption algorithm is proposed that employs a compound chaotic map and random cyclic shift. First, a new hybrid chaotic system is designed by coupling logistic, ICMIC, Tent, and Chebyshev (HLITC) maps. Comparison tests with previous chaotic maps in terms of chaotic trajectory, Lyapunov exponent, and approximate entropy illustrate that the new hybrid chaotic map has better chaotic performance. Then, the proposed HLITC chaotic system and spiral transformation are used to develop a new chaotic image encryption scheme using the double permutation strategy. The new HLITC chaotic system is used to generate key sequences used in the image scrambling and diffusion stages. The spiral transformation controlled by the chaotic sequence is used to scramble the pixels of the plaintext image, while the XOR operation based on a chaotic map is used for pixel diffusion. Extensive experiments on statistical analysis, key sensitivity, and key space analysis were conducted. Experimental results show that the proposed encryption scheme has good robustness against brute-force attacks, statistical attacks, and differential attacks and is more effective than many existing chaotic image encryption algorithms.

The meaning of security is to protect something important from not authorized peoples. Cryptography is one of the security systems. Many applications could be used in the security systems like military applications, email, banking, information technology of database. The proposed system uses advanced encryption standard(AES) with secure hash algorithms(SHA-1) to produce a strong ciphertext. Moreover, this paper make the combination of (SHA-1) which is a one way encryption, as a key with (AES) algorithm which is a two way encryption as a ciphering generator to obtain confidentiality and integrity, In this paper presented implementation of Advanced Encryption Standard (AES) and Secure Hash (SHA-1) Algorithm by the use of FPGA Hardware card, However implementation of the AES algorithm and SHA-1 using LABVIEW environment with MATLAB system generator to generate stream data to FPGA hardware target. The output of the hash function is used as an input key for AES in order to improve data security, From the algorithms result of AES and SHA-1 obtained in FPGA, the system obtained how it is simple in modeling hashing and AES algorithms, generating hash codes and plain texts in (small and capital letters), symbols and numbers. The FPGA card used in this system (Spartan 3AN)with frequency (50%), the complete system take (1,147)size from the available space of (11,776) and accuracy (90%),the system work properly.

Recently, a fast and secure hash function SFHA - 256 has been proposed and claimed as more secure and as having a better performance than the SHA - 256. In this paper an improved version of SFHA - 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and improved SFHA-256. From the analysis it can be concluded that the newly proposed algorithm is more secure, efficient, and practical.

For a gray image, every row (column) can be seen as an irregular wave. Activated by the architecture of permutation-diffusion based image encryption scheme, a chaotic image encryption algorithm is proposed to change the representation of irregular waves in the plain-image. To reduce the high correlation, permutation for both rows and columns is taken in the first stage. Due to the transposition of pixels in row/column, wave shapes will be changed according to the pseudo-random sequences generated from chaotic map. Specifically, pixels in each wave (row or column) are divided into two groups by energy (a bigger one and a smaller one). Then different groups are employed to manipulate the production of chaotic sequence. As a result, the chosen-plaintext and known-plaintext attacks will be difficult due to the plain-image dependent keystream. In the second stage, wave-by-wave diffusion in column is carried out such that any tiny change in the plain-image spreads out uniformly to the whole cipher-image. The keystream used in diffusion is designed again dependent on the permuted image obtained from the first stage. In this way, the security of the proposed algorithm can be further strengthened compared with some existing algorithms. Related security analyses also show that our method can satisfy common requirements of secure communication for daily images.

The “information age” as often referred to the modern society, has become heavily dependent on information systems. As this dependency increases, the threat to information security has also gained ground. Societies need to cater for the security of information, and this has led to the development of different information security techniques most notable of which is cryptography. Cryptographic Hash functions are used to achieve a number of security goals like authenticity, digital signatures, pseudo-random number generation, digital steganography, digital time stamping. The strength of a cryptographic hash function can be summarized into its vulnerability to attack and computational time. This work therefore, reviews existing standard cryptographic hash functions, their construction and their application areas. The secured hash function (SHA) was selected and implemented based on its comparative worth over others. The implemented cryptographic hash function is evaluated for performance using a cryptographic evaluation standard.

In this paper, a new algorithm for designing one-way cryptographic hash function using chaotic Chirikov map is proposed. High sensitivity of Chirikov system makes it an ideal candidate for secure hash function design. In the proposed algorithm, the input message is split into a number of small blocks. The blocks are processed using chaotic map. The two intermediate hashes are generated using evolved control and input parameters. The two intermediate hash values are then employed to yield the final variable-length hash. The simulation and statistical analyses illustrate that the anticipated hash algorithm exhibits encouraging lineaments like high sensitivity to input messages and key, satisfactory confusion and diffusion attributes which verify the suitableness of proposed algorithm for the design of secure cryptographic variable-length hash functions.

This paper introduces a novel parameter-control framework to produce many new one-dimensional (1D) chaotic maps. It has a simple structure and consists of two 1D chaotic maps, in which one is used as a seed map while the other acts as a control map that controls the parameter of the seed map. Examples and analysis results show that these newly generated chaotic maps have more complex structures and better chaos performance than their corresponding seed and control maps.

New hashing technique based on SHA-3 (Secure Hash Algorithm-3) is introduced. Chaotic maps are used in this technique to enhance performance without losing security. Introduced algorithm was tested for resistance against collisions, statistical analysis of output sequences was performed, hashing performance was evaluated. The testing showed a low collision probability. The testing corresponds the standards of National Institute of Standards and Technology and showed that output sequences are close to random. Performance testing showed 60 % enhancement in comparison with plain SHA-3.

In this paper, a high-performance secure hash algorithm 3 (SHA-3) is proposed to handle massive amounts of data for applications such as edge computing, medical image encryption, and blockchain networks. This work not only focuses on the SHA-3 core as in previous works but also addresses the bottleneck phenomenon caused by transfer rates. Our proposed SHA-3 architecture serves as the hardware accelerator for personal computers (PC) connected via a peripheral component interconnect express (PCIe), enhancing data transfer rates between the host PC and dedicated computation components like SHA-3. Additionally, the throughput of the SHA-3 core is enhanced based on two different proposals for the KECCAK-f algorithm: re-scheduled and sub-pipelined architectures. The multiple KECCAK-f is applied to maximize data transfer throughput. Configurable buffer in/out (BIO) is introduced to support all SHA-3 modes, which is suitable for devices that handle various hashing applications. The proposed SHA-3 architectures are implemented and tested on DE10-Pro supporting Stratix 10 - 1SX280HU2F50E1VG and PCIe, achieving a throughput of up to 35.55 Gbps and 43.12 Gbps for multiple-re-scheduled-KECCAK-f-based SHA3 (MRS) and multiple-sub-pipelined-KECCAK-f-based SHA-3 (MSS), respectively.

Abstract: As digital technology continues to expand into every field, ensuring the integrity and authenticity of data has become increasingly essential. Cryptographic hash functions, especially the Secure Hash Algorithm (SHA) family, are instrumental in achieving these objectives. This review presents a detailed study of SHA-1, SHA-2, and SHA-3, discussing their algorithmic design, strengths, weaknesses, and applications in digital security. The paper provides comparative insights supported by research literature and explores recent advances in cryptanalysis and the challenges posed by quantum computing. Keywords: SHA, Cryptography, Hash Functions, SHA-1, SHA-2, SHA-3, Blockchain, Digital Signatures, Data Integrity, Post-Quantum Security

This paper shows a digital noise generator designed in FPGA, based on a variant of the one‐dimensional (1D) chaotic tent map (T‐1D). The T‐1D map is a piecewise linear 1D chaotic map that defines the statistical behavior of the generated sequences using its control parameter. In this way, the proposed noise generator is a highly competitive alternative in cryptographic systems when the statistical behavior of the sequences is closer to the uniform statistical distribution. The proposed system uses the inverted tent chaotic map (IT‐1D), which has the same statistical behavior as the T‐1D map. The fundamental algorithm used in this system was developed based on a 64‐bit double precision format according to the numerical representation of floating point numbers defined in the IEEE‐754 standard. The proposed system is analized using mechanical statistic tools and some statistical tests defined in the NIST 800‐22SP (USA) standard. The main contribution of this work is the possibility of generating binary sequence of pseudorandom appearance by a procedure implemented in an FPGA device that translates real numbers to natural numbers preserving the statistical properties of sequences of real numbers that can be generated with the tent chaotic map in its original definition domain.

RGB image encryption based on symmetric keys using Arnold transform, 3D chaotic map and affine hill cipher