Two Fibonacci P-code based image scrambling algorithms

Abstract

Image scrambling is used to make images visually unrecognizable such that unauthorized users have difficulty decoding the scrambled image to access the original image. This article presents two new image scrambling algorithms based on Fibonacci p-code, a parametric sequence. The first algorithm works in spatial domain and the second in frequency domain (including JPEG domain). A parameter, p, is used as a security-key and has many possible choices to guarantee the high security of the scrambled images. The presented algorithms can be implemented for encoding/decoding both in full and partial image scrambling, and can be used in real-time applications, such as image data hiding and encryption. Examples of image scrambling are provided. Computer simulations are shown to demonstrate that the presented methods also have good performance in common image attacks such as cutting (data loss), compression and noise. The new scrambling methods can be implemented on grey level images and 3-color components in color images. A new Lucas p-code is also introduced. The scrambling images based on Fibonacci p-code are also compared to the scrambling results of classic Fibonacci number and Lucas p-code. This will demonstrate that the classical Fibonacci number is a special sequence of Fibonacci p-code and show the different scrambling results of Fibonacci p-code and Lucas p-code.

Hybrid encoding method by assembling the magic-matrix scrambling method and the binary encoding method in image hiding

“…3(b) is decomposed into two 60×60 square images called P1 (by using the 1st to 60th rows) and P2 (by using the 37th to 96th rows) for the Arnold transformation [17]. For the p-Fibonacci transformation [18], the parameter p is set as 2, and the parameters for the column and row transformations are set as 3 and 1, respectively. For t≥3, the δ p values in Fig.…”

“…The Hilbert curve method [1], the Arnold transform method [2], the p-Fibonacci transform method [3], the cellular automata method [4], the chaotic sequence method [5], the magic-square scrambling method [6], and the pixel scrambling method [7] are some examples of the image scrambling technology. Among them, the magic-square scrambling method is one of the methods with both easy-encoding and easy-decoding features.…”

Fibonacci thresholding: signal representation and morphological filters

“…To be convinced of this fact, it is enough to consider the first 32 numbers for this sequence, which are 1, 1, 2, 3, 3,4,5,6,6,7,8,8,9,10,10,11,12,12,13,14,15,15,16,17,17,18,19,19,20,21,22,22, . .…”

Performance Evaluation of Digital Image Encryption Using Discrete Random Distributions and MOD Operator

“…Two new image encryption approaches are proposed in [6], one is based on spatial domain and the other on frequency domain. The proposed approach uses Fibonacci P-code, a parametric sequence.…”