Related Experiment Video
Updated: May 7, 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
Amplitude-phase retrieval attack free cryptosystem based on direct attack to phase-truncated Fourier-transform-based
Optics Letters
|October 10, 2013
Summary
We developed a novel, attack-free cryptosystem using a random amplitude mask (RAM) for secure Fourier-transform-based encryption. This method enhances security by avoiding iterative calculations and making retrieval attacks unusable.
Area of Science:
- Cryptography
- Optical Information Processing
- Information Security
Background:
- Phase-truncated Fourier-transform-based encryption is vulnerable to specific attacks.
- Iterative amplitude-phase retrieval algorithms pose a security risk.
Purpose of the Study:
- To propose a novel, attack-free cryptosystem.
- To enhance security in Fourier-transform-based encryption.
- To prevent iterative amplitude-phase retrieval attacks.
Main Methods:
- A simple amplitude-phase retrieval attack-free cryptosystem is proposed.
- A random amplitude mask (RAM) is utilized for encryption.
- The RAM is not saved post-encryption, ensuring key security.
Main Results:
- The proposed cryptosystem demonstrates high security.
- The encryption process is nonlinear and avoids iterative calculations.
- Attacks based on iterative amplitude-phase retrieval are rendered unusable.
Conclusions:
- The novel cryptosystem offers a robust solution against known attacks.
- The use of a random amplitude mask significantly enhances encryption security.
- Numerical simulations validate the approach's effectiveness and security.
Related Concept Videos
Discrete Fourier Transform
1.3K
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.3K
Discrete-Time Fourier Series
992
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
For a discrete-time periodic signal x[n]...
992
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
Properties of DTFT I
1.0K
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...
1.0K
Discrete-time Fourier transform
1.5K
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.5K
Exponential Fourier series
1.2K
In audio signal processing, the exponential Fourier series plays a crucial role in sound synthesis, allowing complex sounds to be broken down into simpler sinusoidal components. This decomposition process is fundamental in analyzing and reconstructing musical notes and other audio signals. The exponential Fourier series expresses periodic signals as the sum of complex exponentials at both positive and negative harmonic frequencies, providing a powerful tool for signal analysis.
Euler's identity...
Euler's identity...
1.2K

