Related Experiment Video
Updated: Mar 26, 2026

09:43
Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping
Published on: March 20, 2017
10.4K
Optical compression and encryption system combining multiple measurement matrices with fractional Fourier transform.
Applied Optics
|February 3, 2016
Summary
This study introduces a secure optical cryptosystem using multiple measurement matrices for image encryption and compression. This method enhances security against chosen plaintext attacks, improving data protection.
Area of Science:
- Cryptography and Information Security
- Optical Engineering
- Signal Processing
Background:
- Optical cryptosystems combined with compressed sensing offer simultaneous image compression and encryption.
- Existing methods using a single measurement matrix are vulnerable to chosen plaintext attacks.
- The fractional Fourier transform (FrFT) domain is utilized for improved visual effects in decryption.
Purpose of the Study:
- To propose a robust optical cryptosystem resistant to chosen plaintext attacks.
- To enhance the security and effectiveness of combined compression and encryption.
- To improve the visual quality of wrongly decrypted images.
Main Methods:
- Adoption of multiple measurement matrices derived from a basic one via random row exchanging.
- Encoding the measurement matrices into the fractional Fourier transform (FrFT) domain.
- Incorporation of chaos-based pixel scrambling for nonlinearity.
Main Results:
- The proposed scheme effectively overcomes the vulnerability of single measurement matrix methods.
- Enhanced security against chosen plaintext attacks is demonstrated.
- The system shows high effectiveness in simultaneous compression and encryption.
Conclusions:
- The developed optical cryptosystem provides a robust and secure solution for image compression and encryption.
- The use of multiple measurement matrices and chaos-based scrambling significantly improves security.
- The scheme is effective and suitable for practical applications requiring secure image processing.
Related Concept Videos
Fast Fourier Transform
1.2K
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
1.2K
Discrete Fourier Transform
1.1K
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
1.1K
Discrete-time Fourier transform
1.3K
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
1.3K
Computed Tomography
9.5K
Tomography refers to imaging by sections. Computed tomography (CT) is a non-invasive imaging technique that uses computers to analyze several cross-sectional X-rays to reveal minute details about structures in the body.
The technique was invented in the 1970s and is based on the principle that as X-rays pass through the body, they are absorbed or reflected at different levels. In the technique, a patient lies on a motorized platform while a computerized axial tomography (CAT) scanner rotates...
The technique was invented in the 1970s and is based on the principle that as X-rays pass through the body, they are absorbed or reflected at different levels. In the technique, a patient lies on a motorized platform while a computerized axial tomography (CAT) scanner rotates...
9.5K
Linear Approximation in Frequency Domain
424
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
424

