An Efficient Schema of a Special Permutation Inside of Each Pixel of an Image for its Encryption

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. Therefor...

Full description

Saved in:
Bibliographic Details
Main Authors: Ali-Pacha, Hana (Author), Hadj-Said, Naima (Author), Ali-Pacha, Adda (Author), Mamat, Mustafa (Author), Mohamed, Mohamad Afendee (Author)
Format: EJournal Article
Published: Institute of Advanced Engineering and Science, 2018-08-01.
Subjects:
Online Access:Get fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 02179 am a22003373u 4500
001 ijeecs12885_8818
042 |a dc 
100 1 0 |a Ali-Pacha, Hana  |e author 
100 1 0 |e contributor 
700 1 0 |a Hadj-Said, Naima  |e author 
700 1 0 |a Ali-Pacha, Adda  |e author 
700 1 0 |a Mamat, Mustafa  |e author 
700 1 0 |a Mohamed, Mohamad Afendee  |e author 
245 0 0 |a An Efficient Schema of a Special Permutation Inside of Each Pixel of an Image for its Encryption 
260 |b Institute of Advanced Engineering and Science,   |c 2018-08-01. 
500 |a https://ijeecs.iaescore.com/index.php/IJEECS/article/view/12885 
520 |a 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. 
540 |a Copyright (c) 2018 Institute of Advanced Engineering and Science 
540 |a http://creativecommons.org/licenses/by-nc/4.0 
546 |a eng 
690
690
655 7 |a info:eu-repo/semantics/article  |2 local 
655 7 |a info:eu-repo/semantics/publishedVersion  |2 local 
655 7 |2 local 
786 0 |n Indonesian Journal of Electrical Engineering and Computer Science; Vol 11, No 2: August 2018; 496-503 
786 0 |n 2502-4760 
786 0 |n 2502-4752 
786 0 |n 10.11591/ijeecs.v11.i2 
787 0 |n https://ijeecs.iaescore.com/index.php/IJEECS/article/view/12885/8818 
856 4 1 |u https://ijeecs.iaescore.com/index.php/IJEECS/article/view/12885/8818  |z Get fulltext