Image encryption algorithm based on smallest granularity full scrambling
An encryption algorithm and scrambling technology, applied in image data processing, image data processing, computing and other directions, can solve the problem of insufficient scattered and other problems, and achieve the effect of high scrambling degree, high sensitivity and weak correlation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment 1
[0013] An image encryption algorithm based on minimum granularity full scrambling, through full arrangement of image bits, completes two operations of pixel bit position scrambling and pixel value replacement within the full matrix at the same time, mainly including the following steps: (1) Select a chaotic map ; (2) Chaotic encryption algorithm; (3) Decryption algorithm.
[0014] The image bit permutation is driven by the Lorenz chaotic component x.
[0015] The encryption algorithm adopts the image bit full arrangement algorithm, selects a grayscale image I of any size, and sets its size as M×N, as follows: (1) According to the information entropy of chaos scrambling, select the appropriate chaos dynamics equation , giving the initial value x associated with the key 1 or initial vector V 1 , and let K=1; (2) Apply the selected chaotic equation to iterate m=M×N×8 times to generate a chaotic real-valued sequence {x 1 , x 2 ,...,x m} or vector sequence {V 1 , V 2 , V 3 ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More