An efficient schema of a special permutation inside of each pixel of an image for its encryption

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The development of communications and digital transmissions have pushed the data encryption to grow quickly to protect the information, against any hacking or digital plagiarisms. Many encryption algorithms are available on the Internet, but it's still illegal to use a number of them. Therefore, the search for new the encryption algorithms is still current. In this work, we will provide a preprocessing of the securisation of the data, which will significantly enhance the crypto-systems. Firstly, we divide the pixel into two blocks of 4 bits, a left block that contains the most significant bit and another a right block which contains the least significant bits and to permute them mutually. Then make another permutation for each of group. This pretreatment is very effective, it is fast and is easy to implement and, only consumes little resource.

Cite

CITATION STYLE

APA

Ali-Pacha, H., Hadj-Said, N., Ali-Pacha, A., Mamat, M., & Mohamed, M. A. (2018). An efficient schema of a special permutation inside of each pixel of an image for its encryption. Indonesian Journal of Electrical Engineering and Computer Science, 11(2), 496–503. https://doi.org/10.11591/ijeecs.v11.i2.pp496-503

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free