Search

It is critical to safeguard confidential data, especially secret and private messages. This study introduces a novel data cryptography approach. The new approach will be capable of encrypting and decrypting any communication size. The suggested approach will use a sophisticated private key with a convoluted structure. The private key will have 5 components with a double data type to prevent guessing or hacking. The confidential data will produce two secret keys, the first of which will be taken from the image key. These keys will be vulnerable to slight changes in private key information. To maximize the approach's efficiency, the suggested method will deal with lengthy messages by splitting them into chunks. On the other hand, the chaotic logistic map model will be used to create the second key. The suggested technique will be implemented, and several sorts of analysis (sensitivity, quality, security, and speed analysis) will be undertaken to demonstrate the benefits of the proposed method. The quality metrics MSE, PSNR, and CC will be computed to validate the suggested method's quality. To illustrate the efficiency of the proposed technique, encryption and decryption times will be measured, and cryptography throughputs will be determined. Various PKs will be tried throughout the decryption process to demonstrate how sensitive the produced outputs are to changes in the private key. The suggested approach will be tested, and the results will be compared to the results of existing methods to demonstrate the improvement offered by the proposed method.

Source code authorship attribution is the task of identifying who develops the code based on learning based on the programmer style. It is one of the critical activities which used extensively in different aspects such as computer security, computer law, and plagiarism. This paper attempts to investigate source code authorship attribution by capturing natural language aspects of the code rather than only using minimal set of syntactic and stylistic code features as explored in the previous literature. It proposes an evolutionary feature selection model to improve the accuracy of authorship attribution by implementing two language models (uni-gram and bi-gram). The proposed approach uses K-Nearest Neighbor as a classifier and Genetic Algorithm as a feature selection technique. Two experiments have been demonstrated on a public Authorship Attribution dataset on GitHub, the experiments include various evolutionary feature selection models. Notably, the obtained results in both experiments were compared with the related studies, and show a significant improvement in terms of accuracy.

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 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 parameters: 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 enough secured based on using secret image, block size, and calculated Rotation Left Digits (RLD) for each block.

Colored digital images are one of the most important types of digital data to be used in many vital applications, which require a safe way to protect them from hacking operations and the danger of intruders and data thieves. This paper presents an effective and safe method for storing digitally colored images (CASDC). A high level of protection is provided through a complex secret key agreed upon between the sender and the receiver. The secret key consists of nine decimal digits (and can be increased as needed). These digits are processed to extract three values for each color of the three color channels. A left rotation process is performed for the value of each color to produce three new values, where an exclusion process is performed between them to obtain the encrypted value for the color. CASDC is evaluated against a wide range of images to calculate its throughput to show the extent to which this method fulfills encryption and decryption requirements. The Mean Square Error (MSE) values, Peak Signal Noise Ratio (PSNR), and Correlation Coefficient for the three primary channels of the RGB coloring system were analyzed. The practical results of the proposed method are compared with other standard methods such as Data Encryption Standard (DES), Tripple-DES (3DES), Advanced Encryption Standard (AES), and Blow Fish (BF). According to the obtained results, CASDC outperforms all standard methods in terms of efficiency by reducing the time of encryption and decryption and increasing the throughput of the corresponding process. Besides, CASDC is robust against breaks, as the attempts to break the private key will require hundreds of years in the best case.

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.