Open AccessAn Efficient Schema of a Special Permutation Inside of Each Pixel of an Image for its Encryption
Author(s) -
Hana Ali-Pacha,
Naïma Hadj-Said,
Adda Ali-Pacha,
Mustafa Mamat,
Mohamad Afendee Mohamed
Publication year - 2018
Publication title -
indonesian journal of electrical engineering and computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.241
H-Index - 17
eISSN - 2502-4760
pISSN - 2502-4752
DOI - 10.11591/ijeecs.v11.i2.pp496-503
Subject(s) - encryption , computer science , permutation (music) , cryptography , block (permutation group theory) , hacker , pixel , theoretical computer science , computer network , computer security , algorithm , mathematics , computer vision , physics , acoustics , geometry
The developments 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.