Related Experiment Video
Updated: Apr 3, 2026

08:39
Shaping the Amplitude and Phase of Laser Beams by Using a Phase-only Spatial Light Modulator
Published on: January 28, 2019
10.5K
Improved method of attack on an asymmetric cryptosystem based on phase-truncated Fourier transform
Applied Optics
|September 15, 2015
Summary
Researchers developed a new attack on asymmetric cryptosystems using a median-filtering phase-retrieval algorithm. This method efficiently retrieves exact decryption keys and image data, enhancing security and robustness.
Area of Science:
- Cryptography and Information Security
- Image Processing and Computer Vision
Background:
- Asymmetric cryptosystems often rely on Fourier transform properties, which can be vulnerable to phase truncation attacks.
- Existing attacks may suffer from noise, require significant computational resources, or yield imprecise results.
Purpose of the Study:
- To propose an improved attack method for phase-truncated Fourier transform-based asymmetric cryptosystems.
- To develop a novel cryptosystem with enhanced security and efficiency.
Main Methods:
- A novel median-filtering phase-retrieval algorithm is employed for the attack.
- The attack targets the decryption keys and aims to recover original image information.
- A new cryptosystem is designed based on the insights from the improved attack method.
Main Results:
- The proposed attack successfully retrieves exact decryption keys and precise attack results.
- The method achieves exact information recovery in both gray-scale and binary forms.
- Demonstrated advantages include superior computing efficiency and enhanced robustness against noise and occlusions.
Conclusions:
- The novel median-filtering based attack offers significant improvements over existing methods in terms of accuracy, efficiency, and robustness.
- The newly proposed cryptosystem leverages the attack's principles to achieve enhanced security without relying on truncated phases.
Related Concept Videos
Trigonometric Fourier series
1.1K
Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
1.1K
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-time Fourier transform
1.4K
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.4K
Discrete-Time Fourier Series
861
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]...
861
Convergence of Fourier Series
529
The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
529
Properties of Fourier Transform I
813
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
813

