In recent years, the chaotic logistic map key (CLMK) has been widely used for image encryption due to its ability to generate random and unpredictable sequences of numbers. The CLMK algorithm uses the chaotic logistic map to generate a key stream, which is then used to encrypt the plaintext image. This study proposes an image encryption scheme based on CLMK, Collatz Conjecture, and indexing techniques; it uses a private key of a 15-digit size that is parsed in a novel way to generate a considerable keyspace reaches up to 297. The Collatz Conjecture generator is used to create variable length sequences that are used to generate the Chaotic parameters $r_{1}$ , $r_{2}$ , $x_{1}$ , and $x_{2}$ ; these parameters are used to create a 2D CLMK for encrypting each color channel and a 1D vector that is used for permeation, both confusion and diffusion are performed in four consecutive rounds to ensure the robustness of the proposed approach. The random sequences generated by the Collatz Conjecture were tested for randomness using the NIST benchmark randomness test suit, and they passed most tests. The proposed method is robust against all the well-known attacks, including differential attacks, white Gaussian noise attacks, Salt-and-pepper noise attacks, clipping attacks, occlusion attacks, and known plaintext attacks. Various experiments were conducted to evaluate the performance of the proposed method in terms of encryption time, throughput, and several image quality metrics. The results indicate that the proposed method is efficient regarding encryption time, and throughput enhancement can reach up to 3.34 times the state-of-the-art chaotic encryption methods.

Standard methods used in the encryption and decryption process are implemented to protect confidential data. These methods require many arithmetic and logical operations that negatively affect the performance of the encryption process. In addition, they use private keys of a specific length, in addition to the fixed length of the data block used in encryption, which may provide the possibility of penetration of these methods, thus decreasing the level of security. In this research paper, a new method of digital image cryptography is introduced. This method is based on using a color image as an $image\_key$ to generate a sophisticated matrix private key (MPK) that cannot be hacked. The proposed method uses an initial state to set the required parameters, with secret information needed to generate the private key. The data-block size is variable, and the complicity of the MPK depends on the number of selected rounds and the data-block size. The proposed method is appropriate for publication in Symmetry because it employs a symmetrical complex matrix key to encrypt and decrypt digital images. The proposed method is simple yet very efficient in terms of throughput and scalability. The experiments show that the proposed method meets the quality requirements and can speed up the encryption–decryption process compared with standard methods, including DES, 3DES, AES, and Blowfish.

Due to the availability of several social media platforms and their use in sending text messages, it is necessary to provide an easy and safe way to protect messages from being hacked especially in the presence of intruders and data thieves, and taking into consideration that most of those messages are confidential and personal, it is necessary to provide an easy and safe way to protect messages from being hacked. In this research paper, a simple and easy method of message cryptography will be proposed. The method divides a message into blocks with fixed sizes. The block size ranges from 2 to 60. The method uses a secret color image to generate an array with a size equal to the number of resulted blocks. The array will then be used as a private key. Each element of the private key will be used to calculate the number of rotation digits for the associated block in order to apply block rotation left operation. The proposed method will be examined using the parameter’s Mean Square Error (MSE), Peak Signal to Noise Ratio (PSNR), Correlation Coefficient (CC), and throughput. The proposed method will be compared with other standard methods of message cryptography, such as Data Encryption Standard (DES), Triple-DES (3DES), Advanced Encryption Standard (AES), and Blow Fish (BF). Experimental results show that the proposed method is secured enough based on using secret image, block size, and calculated Rotation Left Digits (RLD) for each block.

This research paper presents a novel digital color image encryption approach that ensures high-level security while remaining simple and efficient. The proposed method utilizes a composite key r and x of 128-bits to create a small in-dimension private key (a chaotic map), which is then resized to match the color matrix dimension. The proposed method is uncomplicated and can be applied to any image without any modification. Image quality, sensitivity analysis, security analysis, correlation analysis, quality analysis, speed analysis, and attack robustness analysis are conducted to prove the efficiency and security aspects of the proposed method. The speed analysis shows that the proposed method improves the performance of image cryptography by minimizing encryption–decryption time and maximizing the throughput of the process of color cryptography. The results demonstrate that the proposed method provides better throughput than existing methods. Overall, this research paper provides a new approach to digital color image encryption that is highly secure, efficient, and applicable to various images.

This paper presents an integrated chaos-based algorithm for image encryption that combines the chaotic Hénon map and chaotic logistic map (CLM) to enhance the security of digital image communication. The proposed method leverages chaos theory to generate cryptographic keys, utilizing a 1D key from the logistic map generator and a 2D key from the chaotic Hénon map generator. These chaotic maps produce highly unpredictable and complex keys essential for robust encryption. Extensive experiments demonstrate the algorithm’s resilience against various attacks, including chosen-plaintext, noise, clipping, occlusion, and known-plaintext attacks. Performance evaluation in terms of encryption time, throughput, and image quality metrics validates the effectiveness of the proposed integrated approach. The results indicate that the chaotic Hénon–logistic map integration provides a powerful and secure method for safeguarding digital images during transmission and storage with a key space that reaches up to $2^{200}$. Moreover, the algorithm has potential applications in secure image sharing, cloud storage, and digital forensics, inspiring new possibilities.

Predicting the value of one or more variables using the values of other variables is a very important process in the various engineering experiments that include large data that are difficult to obtain using different measurement processes. Regression is one of the most important types of supervised machine learning, in which labeled data is used to build a prediction model, regression can be classified into three different categories: linear, polynomial, and logistic. In this research paper, different methods will be implemented to solve the linear regression problem, where there is a linear relationship between the target and the predicted output. Various methods for linear regression will be analyzed using the calculated Mean Square Error (MSE) between the target values and the predicted outputs. A huge set of regression samples will be used to construct the training dataset with selected sizes. A detailed comparison will be performed between three methods, including least-square fit; Feed-Forward Artificial Neural Network (FFANN), and Cascade Feed-Forward Artificial Neural Network (CFFANN), and recommendations will be raised. The proposed method has been tested in this research on random data samples, and the results were compared with the results of the most common method, which is the linear multiple regression method. It should be noted here that the procedures for building and testing the neural network will remain constant even if another sample of data is used.