Related Experiment Video
Updated: Apr 22, 2026

08:39
Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator
Published on: January 28, 2019
9.4K
Double-image encryption without information disclosure using phase-truncation Fourier transforms and a random
Applied Optics
|October 17, 2014
Summary
This study addresses information disclosure in phase-truncation cryptosystems. A novel nonlinear spatial and spectral encoding technique using a random amplitude mask (RAM) enhances security and prevents attacks.
Area of Science:
- Cryptography
- Image Processing
- Information Security
Background:
- Phase-truncation-based cryptosystems face risks of unintended information disclosure.
- Existing methods like imaginary part truncating or varying phase keys are insufficient to prevent data leakage.
Purpose of the Study:
- To propose a secure encryption technique that eliminates the risk of information disclosure in phase-truncation cryptosystems.
- To enhance the security of image encryption against sophisticated attacks.
Main Methods:
- A nonlinear spatial and spectral encoding technique utilizing a random amplitude mask (RAM) was developed.
- The proposed method involves a two-layer security process controlled by the RAM.
- Spatial encoding of plaintext images and simultaneous encryption of images and keys were implemented.
Main Results:
- The proposed random amplitude mask (RAM) based encryption effectively prevents information disclosure.
- The hybrid encryption system maintains the trapdoor one-way function property of phase truncation.
- Numerical results confirm the feasibility and high effectiveness of the proposed algorithm.
Conclusions:
- The novel nonlinear spatial and spectral encoding technique significantly improves the security of phase-truncation cryptosystems.
- This method offers a robust solution against attacks that have previously compromised similar systems.
- The encryption algorithm provides enhanced security and data protection for digital images.
Related Concept Videos
Masking and Demasking Agents
4.0K
EDTA titrations may necessitate masking and demasking agents to temporarily protect a particular metal ion in a mixture from the EDTA reaction. These agents facilitate the sequential analysis of the metal ions by forming stable complexes with some—but not all—metal ions during certain steps.
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on...
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on...
4.0K
Properties of DTFT I
996
In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
996
Properties of Fourier Transform II
994
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
994
Interference: Path Lengths
2.5K
Consider two sources of sound, that may or may not be in phase, emitting waves at a single frequency, and consider the frequencies to be the same.
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...
Two special sources may be considered when they are in phase. This can be easily achieved by feeding the two sources from the same source. An example would be synchronizing the two speakers by feeding them with the same source, such as the sound waves produced by a tuning fork. This setup ensures that the two sources have the same frequency and are...
2.5K
Upsampling
740
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
740
Fast Fourier Transform
1.3K
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.3K

