Bitwise level image permutation using a sinusoidal signal

This paper presents a permutation technique based on a sinusoid whose complexity is O(N) but providing a very acceptable security. It considers an image as a set of vertical and horizontal bits that shift under the effect of a sinusoidal wave. This results in the permutation of the image content at...

Full description

Saved in:
Bibliographic Details
Published in:2016 5th International Conference on Multimedia Computing and Systems (ICMCS) pp. 108 - 112
Main Authors: Nini, Brahim, Ounzar, Asma
Format: Conference Proceeding
Language:English
Published: IEEE 01-09-2016
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a permutation technique based on a sinusoid whose complexity is O(N) but providing a very acceptable security. It considers an image as a set of vertical and horizontal bits that shift under the effect of a sinusoidal wave. This results in the permutation of the image content at the level of bits. As a result, for only one round of the algorithm, the correlation between pixel values may reach 0.03. Moreover, the proposed method offers the opportunity to permute a selective free form. The algorithm is able to consider any concave or convex curve in the selected part. The significance of these two criterion is in the possibility to mix the technique together with an object detection application in order to encrypt the object of interest in a live broadcast.
ISSN:2472-7652
DOI:10.1109/ICMCS.2016.7905583