Image encryption based on bit-plane decomposition and random scrambling

Sun, Qiyu; Yan, Wenying; Huang, Jiangwei; Ma, Wenxin

doi:10.1109/cecnet.2012.6201673

Cited by 7 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A chaotic system is utilized to scramble the location of that particular binary image values, afterward, the scrambled image is reassembled to acquire the cipher image. In References 33‐35, initially, the chaos‐based system is utilized to arrange and scrambled the binary bit planes of an image, and later, those updated bit planes are joined to get cipher image having pixel intensity 2 0 to 2 8 .…”

Section: Introductionmentioning

confidence: 99%

Security of multimedia communication with game trick based fast, efficient, and robust color‐/gray‐scale image encryption algorithm

Khan

Han

Qian

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Freshly, an innumerable chaotic system based complex and more time‐consuming image encryption algorithms have been proposed. The majority of those have scrambling and diffusion like two phases or rounds before performing the actual encryption, which leads toward extra time consumption. So unlike those, this article presents a novel image encryption algorithm that is based on game trick. The proposed novel method is DNA based and it can accomplish dual function with one round, that is, scrambling for the bit planes and diffusion for the pixels, So we called it as DNA‐SPD. First of all, a random matrix equivalent to the size of the original image is generated through a python random array generator and seed value of the 512‐bit hexadecimal key of the original image. Second, it performs the pixel adaptive additions with MA between pixels of a plain image, random matrix, the integer value of the hash key entity, and the decimal number (DN). Third, it extracts each channel from the color image and convert it into the binary bit planes, then transformed it into the DNA bit planes through particular DNA rules. Finally, a universal DNA rule utilized to get back encrypted pixels. Various security analysis and comparison of projected results show that the proposed novel encryption method gives better results in a lesser amount of time. The proposed algorithm is robust against the well‐known and effective attacks, that is, known/chosen plaintext attacks, differential attacks, and the statistical attacks. Therefore, the proposed algorithm is more secure and reliable for the security of image communication.

show abstract

Section: Introductionmentioning

confidence: 99%

Security of multimedia communication with game trick based fast, efficient, and robust color‐/gray‐scale image encryption algorithm

Khan

Han

Qian

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…This is due to the introduction of bit-plane based image decomposition. [12] A contemporary technique was proposed, where the Red-Green-Blue sub-pixel values are shuffled for the given image, without disturbing the values of the sub-pixels. For an image of size m*n, this shuffling retains the image sub-pixels as such but with each pixel's components distributed to random locations resulting in a completely different component packed pixel.…”

Section: Literature Surveymentioning

confidence: 99%

Efficient technique for image cryptography using Sudoku Keys

Manimekalai

Karthikeyan

Mary

et al. 2022

Preprint

View full text Add to dashboard Cite

This Paper work proposes an Image cryptographic technique based on the Sudoku solution. The Sudoku solution can be reduced to a proper key clue by increasing the complexity level. The reduced clue for the Sudoku serves as the base key, which can be solved both at the Encryption and Decryption phase to reveal the Sudoku solution. Since a proper key clue leads to only one sudoku solution, the key is always stable. The Sudoku solution is expanded to the size of the Image to be encrypted using a sequence of expansion techniques. These techniques involve Number filling of the key matrix, Linear X-Y rotational shifting and Standard Zig zag pattern based reverse shifting. The derived cryptokey for an image dictates the details of positions to which the image pixels have to be shuffled. The shuffling is made at two levels namely Pixel level and Sub-Pixel (RGB) levels for an image, with the latter having more effective encryption. As this image encryption involves position shuffling in RGB layers, this technique falls under the Image scrambling method with partial diffusion. The Source and Encrypted images are analyzed for the crypto quality and thereby derive out the Performance metrics. The Distribution level of the source image pixels in the encrypted image is visually assessed by the absolute difference image. The Performance metrics reveal that the cryptography is more efficient, when the Sudoku is treated as a square matrix cryptokey and effectively used.

show abstract