2D Image Encryption via FFT Bit Reversal Permutation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encryption methods for 2D images using fast Fourier transform require an encryption key for each pixel, making them inefficient in terms of data processing speed and security.
Innovation Solution
The method involves bit reversal permutation of pixel data, applying it to a butterfly algorithm of fast Fourier transform, determining data paths, and performing multiple encryption steps using a weighted data path and twiddle factor to encrypt the image efficiently with a simpler key.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If encryption keys of the same number as pixels for the 2D image are applied, then encryption security is improved, but data processing speed deteriorates
Solution Approach 1:
The patent segments the 2D image into multiple 1D images (rows and columns), then applies bit-reversal permutation to organize pixel data into groups. This segmentation allows the encryption process to work with smaller data units rather than treating the entire image as one large block, improving processing speed while maintaining security through the structured organization of pixel groups.
Solution Approach 2:
The patent changes the encryption approach by using bit-reversal permutation to reorganize pixel data indices, transforming the data structure before encryption. This parameter change in data organization allows for more efficient processing paths to be determined, reducing the computational burden while maintaining encryption strength through the transformed data arrangement.
2Productivity
If bit reversal permutation and data path determination are applied, then data processing speed is improved, but device complexity increases
Solution Approach 1:
The patent performs bit-reversal permutation as a preliminary action before the main encryption process. By pre-organizing the pixel data into groups based on bit-reversed indices, the system prepares the data structure in advance to enable faster processing during the actual encryption phase, reducing the computational complexity of the main encryption routine.
Solution Approach 2:
The patent transitions from treating the image as a 2D array to organizing data along 1D paths (rows and columns) after bit-reversal permutation. This dimensional transformation allows for simpler data path determination and more efficient processing, as linear paths are easier to traverse and encrypt than two-dimensional structures.
3Reliability
If multiple encryption steps are performed, then encryption security is improved, but loss of time increases
Solution Approach 1:
The patent implements continuous encryption operations across multiple data paths without interrupting the processing flow. By determining multiple data paths based on the permuted pixel data and processing them sequentially in a streamlined manner, the system maintains continuous useful action throughout the encryption process, reducing idle time and overhead between encryption steps.
Data Source
AI summary
An encryption method, includes performing, by an encryption system, bit reversal permutation of pixel data of a 2D image, arranging the pixel data as first-pixel data, and applying the 2D image to a butterfly algorithm of fast Fourier transform; determining, by the encryption system, a plurality of data paths based on the first-pixel data; and performing, by the encryption system, a first encryption of the first-pixel data into second-pixel data on a specific data path based on a number of the specific data path among the plurality of data paths.