Signal Encryption Strategy based on Domain change of the Fractional Fourier Transform
We provide a double encryption algorithm that uses the lack of invertibility of the fractional Fourier transform (FRFT) on L^1. One encryption key is a function, which maps a "good" L^2(ℝ) signal to a "bad" L^1(ℝ) signal. The FRFT parameter which describes the rotation associated with this operator on the time-frequency plane provides the other encryption key. With the help of approximate identities, such as of the Abel and Gauss means of the FRFT established in <cit.>, we recover the encrypted signal on the FRFT domain. This design of an encryption algorithm seems new even when using the classical Fourier transform.
READ FULL TEXT