Double-image encryption without information disclosure using phase-truncation Fourier transforms and a random

Applied Optics
|October 17, 2014
PubMed
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.

Related Concept Videos

Masking and Demasking Agents01:19

Masking and Demasking Agents

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...
4.0K
Properties of DTFT I01:24

Properties of DTFT I

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...
996
Properties of Fourier Transform II01:24

Properties of Fourier Transform II

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...
994
Interference: Path Lengths01:10

Interference: Path Lengths

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...
2.5K
Upsampling01:22

Upsampling

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 Transform01:10

Fast Fourier Transform

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)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
1.3K