Earticle

초록

영어

This paper presents a new image permutation algorithm to improve permutation efficiency. Based on uniform trend theorem and ideal bias theorem, we propose two classes of extractors, which solve the critical problem of any chaotic sequence uniformity. Then, the uniform chaotic sequence is transformed into integer space and the random integers are used to perform one-dimensional data permutation algorithm, which is based on data position interchange. Based on the data vector permutation, a secure and efficient image permutation is presented. Comparing with previous approaches, the proposed scheme is secure and its efficiency is enhanced.

목차

Abstract
 1. Introduction
 2. Efficient Image Scrambling
  2.1. Construction of Chaotic Uniform Sequence
  2.2. Image Permutation base on Chaotic Uniform Sequence
 3. Experiment Results
 4. Comparison with Chaos Sorting Permutation
  4.1. Key Uniformity
  4.2. Key Space
  4.3. Correlation of Adjacent Pixels
  4.4. Running Time Analysis
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Cao Guanghui [ School of Computer Science and Technology, Beihang University, Electronic & Information Engineering College, Liaoning University of Technology, Jinzhou 121001, China ]
• Hu Kai [ School of Computer Science and Technology, Beihang University, Beijing, 100191, China ]
• Zhou Jun [ Electronic & Information Engineering College, Liaoning University of Technology, Jinzhou 121001, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605