A unified approach for defining random discrete fractional transforms

In this paper, we introduce a systematic procedure for defining random discrete fractional transforms of Fourier, Hartley, cosine and sine types. The procedure is based on an extension of the generating matrix method for constructing eigenvectors of such transforms. We give multiorder reality-preserving versions of the referred transforms, characterizing them with respect to the number of free parameters and illustrating their applicability in image encryption.