4 research outputs found

    A Complex Matrix Private Key to Enhance the Security Level of Image Cryptography

    No full text
    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

    Protecting Digital Images Using Keys Enhanced by 2D Chaotic Logistic Maps

    No full text
    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

    Building a Secure Image Cryptography System using Parallel Processing and Complicated Dynamic Length Private Key

    Get PDF
    A method of color images cryptography will be introduced, programmed, and tested. The proposed method is based on using a digital color image as an image key; this image is to be kept secret without transmission. The proposed method will provide a high level of images protection based on the complicated and complex private key used in cryptography, this key will be changed when replacing the image key, or changing the data block size, or changing the color channel. The proposed method will be compared with other standard methods of data cryptography, and it will be shown how this method will improve the efficiency of data cryptography by minimizing the encryption-decryption time, the obtained results will be compared with the standard method of data cryptography to show the speedup achieved by the proposed method. It will be shown how to execute the proposed method in parallel, 2, 4, and 8 threads will be used to execute the method and the associated speedup will be calculated. The proposed method will protect the data by providing a high level of security, this can be achieved by using a variable-length private key, the private key length and content will depend on the selected image key, selected color matrix, and the selected block size. The block size used in the proposed method will be variable and it will be shown that the proposed method will satisfy the quality requirements by providing good value for Mean Square Error (MSE), and Peak Signal to Noise Ratio (PSNR
    corecore