4,241 research outputs found

    A Novel Image Encryption Using an Integration Technique of Blocks Rotation Based on the Magic Cube and the AES Algorithm

    Get PDF
    In recent years, several encryption algorithms have been proposed to protect digital images from cryptographic attacks. These encryption algorithms typically use a relatively small key space and therefore, provide safe, especially if they are of a dimension. In this paper proposes an encryption algorithm for a new image protection scheme based on the rotation of the faces of a Magic Cube. The original image is divided into six sub-images and these sub-images are divided amongst a number of blocks and attached to the faces of a Magic Cube. The faces are then scrambled using rotation of the Magic Cube. Then the rotated image is fed to the AES algorithm which is applied to the pixels of the image to encrypt the scrambled image. Finally, experimental results and security analysis show that the proposed image encryption scheme not only encrypts the picture to achieve perfect hiding, but the algorithm can also withstand exhaustive, statistical and differential attacks

    Yet Another Pseudorandom Number Generator

    Get PDF
    We propose a novel pseudorandom number generator based on R\"ossler attractor and bent Boolean function. We estimated the output bits properties by number of statistical tests. The results of the cryptanalysis show that the new pseudorandom number generation scheme provides a high level of data security.Comment: 5 pages, 7 figures; to be published in International Journal of Electronics and Telecommunications, vol.63, no.

    A Differential Cryptanalysis of Yen-Chen-Wu Multimedia Cryptography System (MCS)

    Full text link
    At ISCAS'2005, Yen et al. presented a new chaos-based cryptosystem for multimedia transmission named "Multimedia Cryptography System" (MCS). No cryptanalytic results have been reported so far. This paper presents a differential attack to break MCS, which requires only seven chosen plaintexts. The complexity of the attack is O(N), where NN is the size of plaintext. Experimental results are also given to show the real performance of the proposed attack.Comment: 22 pages, 5 figure
    corecore