A Secure Image Encryption Algorithm Based on Rubik's Cube Principle

Journal of Electrical and Computer Engineering 03/2012; DOI: 10.1155/2012/173931


In the past few years, several encryption algorithms based on chaotic systems have been proposed
as means to protect digital images against cryptographic attacks. These encryption algorithms typically
uses relatively small key spaces and thus offers limited security, especially if they are one dimensional.
In this paper, we proposed a novel image encryption algorithm based on Rubik’s cube principle. The
original image is scrambled using the principle of Rubik’s cube. Then, XOR operator is applied to rows
and columns of the scrambled image using two secret keys. Finally, the experimental results and security
analysis show that the proposed image encryption scheme not only can achieve good encryption and
perfect hiding ability and resist to exhaustive attack, statistical attack and differential attack.

  • Source
    • "Where xi and yi are gray level value of two adjacent pixels, N is the number of pairs (xi, yi) and E(x) is the mean of xi and E(y) is the mean of yi [5] [6]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Images are widely used in many areas for various purposes. Some images may have confidential information, so security of secrete images is a major issue. Various image encryption algorithms provide security to images. However, traditional encryption techniques encode one image at a time, which leads to weak security in the encrypted image due to small size of the image. In this paper, an image encryption technique is imparted that concatenate four images of the same dimension into one and then produce single encrypted image. In result, encrypted image is more secure due to the large size. This encrypted image has high entropy and low correlation coefficient, so this encrypted image is more difficult to understand compared to four separated images. General Terms Image security and image processing
    Full-text · Article · Jul 2014 · International Journal of Computer Applications
  • Source
    • "Furthermore, UACI computes the variation in intensity of the corresponding pixel of the plainimage and the encrypted image [18]. If C1 and C2 are the two cipher image after and prior to 1 bit change in the original image, then NPCR and UACI can be calculated by following formula (7) and (8) respectively [24] "
    [Show abstract] [Hide abstract]
    ABSTRACT: Images excessively contribute to communication in this era of multimedia. When a user transfers images over an unsecured communication network, then the absolute protection is a challenging issue to conserve the confidentiality of images. Encryption is a method of retaining the secrecy of images. This paper provides the succinct introduction to the cryptography, moreover, includes a concise description of various elemental securities' criteria of the image encryption algorithms. This work presents the survey of diverse image encryption techniques and comparison of discrete image encoding approaches, at last discloses a conclusion and suggests future works. General Terms Image security, image encryption, image processing.
    Full-text · Article · Jul 2014 · International Journal of Computer Applications
  • Source
    • "In recent years, a number of encryption algorithms have been proposed to protect images. These encryption algorithms can be classified into several categories such as value transformation(Guo et al. 2010; R. Tao et al. 2010; Liu et al. 2011; Liu et al. 2011), pixel position permutation (Zunino 1998; Zhao and Gang 2002; Zhang and Liu 2011; Zhu et al. 2011), and chaotic systems (Wang et al. 2005; Huang and Nien 2009; Wang et al. 2010; Wang et al. 2011; Loukhaoukha et al. 2012). "
    [Show abstract] [Hide abstract]
    ABSTRACT: Background:. Image scrambling is a useful approach to secure the image data by scrambling the image into an unintelligible format. The relationship among the adjacent pixels of image is very high. Also, Most image scrambling algorithms apply one iteration level scrambling that cause a high possibility of occurs the weakness of visual leakage on the image scrambling algorithm which can be reflected by the corresponding scrambled image. Objectives: the objective of this paper is to develop a new efficient image scrambling algorithm by using the Rotation technique in order to break the relationship among image elements (pixels). Thus, to develop an efficient scheme to generate non fixed iteration in the image scrambling algorithm in order to eliminate the problem of visual leakage. Results: The results show that the correlation between image elements has been significantly decreased using the proposed technique, and higher entropy has been achieved. Furthermore, implies a high similarity and a good quality of the retrieved image compared to the original image. Conclusion: This paper proposes a new scramble algorithm which can be produced by a series of rotation the rows and the columns into six sub-image that attached to the faces of the virtual Rubik's cube. The first part of the algorithm aims to build a rotation table using hash function within scramble phase and descramble phase to generate a scrambled (rotated) image and the retrieved image. The second part of the algorithm uses the rotation table resulted from the first part of the algorithm to generate newly rotated image (Scrambled) in which the rows and the columns of the original image are rotated after divide it to six sub-image and attach then to the faces of the virtual Rubik's cube. This makes the scrambled images difficult to decode thus providing a high level of security protection for the images. The algorithm can be applied in the real-time applications since it is a straightforward process and easily implemented.
    Full-text · Article · Jan 2014
Show more