A New Permutation Method for Sequence of Order 2^8
الباحث الأول:
م. عبدالله عزيز لفته
الباحثين الآخرين:
م.م. صفاء جاسم موسى
المجلة:
Journal of Theoretical and Applied Information Technology (JATIT)
تاريخ النشر:
None
مختصر البحث:
Permutation is reordering for a set of objects with taking into consideration the important of order of their locations. In order to increase security performance, this paper presents a new method of permutation for sequence of order 2^8. In this pr…
Permutation is reordering for a set of objects with taking into consideration the important of order of their locations. In order to increase security performance, this paper presents a new method of permutation for sequence of order 2^8. In this propose method, any information can be converted to the sequence of approximate values between 0 and 255 as a set of blocks. It is needed to build the so called lookup table so that it contains the frequency and positions of the original sequence values. In the experiments, twenty-six image files have been experimented as evidence to the proposed method. In addition, the correlation and entropy measures are computed to test the quality of permutation. All the tests observed that method have significantly effective in reducing the correlation and thereby decreasing the perceptual information of the sequence. Hence, the security is improved.
