Fractional Bio-Image Encryption using Karhunen-Loeve Transform (original) (raw)
Related papers
Multiple Image Encryption using Fractional Multiresolution Transforms S.Arivazhagan ECE department
2015
Secured communication has been a common practice in the social life. The main idea of encryption is to transform the message in which its original information can only be reconstructed by a desired recipient. As data significance can easily be determined in transformation domain, it is a preferable domain for encryption of digital images. In this work, secured multiple image transmission is chosen as the primary application and hence a method is proposed for securing multiple images during communication and transmission over insecure channel. The multiple images are encrypted using Arnold cat Map and then using various Fractional Multiresolutional transforms followed by sharing. Recent years have also witnessed Fractional Fourier transform (FrFT) domain as a potential transformation domain for encryption. Fractional combined Multiresolution domain inherits the virtues of Multiresolution transform and Fractional domain providing improved security. This offers the Fractional order as ...
Image encryption and decryption using fractional Fourier transform and radial Hilbert transform
Optics and Lasers in Engineering, 2008
A technique for image encryption using fractional Fourier transform (FRT) and radial Hilbert transform (RHT) is proposed. The spatial frequency spectrum of the image to be encrypted is first segregated into two parts/channels using RHT, and image subtraction technique. Each of these channels is encrypted independently using double random phase encoding in the FRT domain. The different fractional orders and random phase masks used during the process of encryption and decryption are the keys to enhance the security of the proposed system. The algorithms to implement the proposed encryption and decryption scheme are discussed, and results of digital simulation are presented.
A Novel Framework for Image Encryption using Karhunen-Loeve Transform
International Journal of Computer Applications
The Karhunen-Loeve (KL) transform is widely used technique for image compression or clustering analysis. Since KL transform is a reversible linear transform, a novel cryptosystem is developed to provide confidentiality service for images. The original image (x), in the form of square matrix, is given as input to the KL transform which in turn produces the encrypted image (y) and the decryption key (k). Since the key matrix (k) plays a major role for decryption, it is encrypted by the receiver's public key by using RSA algorithm. The encrypted image (y) and key matrix (k) are transmitted over the public network. On receiving the encrypted image (y) and key matrix (k), the receiver takes the transpose of the decrypted key matrix (k) and multiplies the result with the encrypted image (y) to get the original image (x). The time complexity of the proposed scheme is calculated separately for both encryption, O(n 2), and decryption, O(n 3). The histograms of the encrypted images are almost uniform and different from that of the original images. This method of image cryptosystem is more suitable for small images.
Image Encryption Based on Multi-Order Fractional Fourier Transform
Al-Azhar Engineering Journal, 2014
Encryption technology has been developed quickly and many image encryption methods have been used to protect confidential image data from unauthorized access. In this paper, we introduce general quick brief introduction about cryptography, and then propose a technique for image encryption/decryption by using the nature of FrFT in signals analysis, without use of special methods of encryption algorithms, based on multi-order Fractional Fourier Transform. Taking into account the security of the method used in the encryption work. In this research was to identify indicators to measure the security of the encryption Techniques: (i) sensitivity proposed Techniques for the encryption key can not get the original data only in the presence of this key, (ii) The complexity of the processes that are form internal proposed methods for encryption and decryption processes, and (iii) statistical analysis has been performed by calculating the histograms analysis, comparing with traditional Fourier transform the security system based on the fractional Fourier transform is protected by order of FrFT, it is can provides additional keys for encryption to make it more difficult to break. The keg is formed by combination of order of Fractional Fourier Transform and the matrix. Then, the encrypted image is obtained by the summation of different orders. Numerical simulation results are given to demonstrate this proposed method.
Multiple Image Encryption using Fractional Multiresolution Transforms
International Journal of Applied Information Systems, 2015
Secured communication has been a common practice in the social life. The main idea of encryption is to transform the message in which its original information can only be reconstructed by a desired recipient. As data significance can easily be determined in transformation domain, it is a preferable domain for encryption of digital images. In this work, secured multiple image transmission is chosen as the primary application and hence a method is proposed for securing multiple images during communication and transmission over insecure channel. The multiple images are encrypted using Arnold cat Map and then using various Fractional Multiresolutional transforms followed by sharing. Recent years have also witnessed Fractional Fourier transform (FrFT) domain as a potential transformation domain for encryption. Fractional combined Multiresolution domain inherits the virtues of Multiresolution transform and Fractional domain providing improved security. This offers the Fractional order as an extra key, in addition to the keys offered by any Multiresolution based encryption technique. In the proposed work, Fractional Undecimated Dual Tree Complex Wavelet Transform (FrUDT-CWT) is introduced by coalescing Fractional Fourier Transform (FrFT) and Undecimated Dual Tree Complex Wavelet Transform (UDT-CWT) inheriting the properties of both FrFT and UDT-CWT. Multiple image encryption is done using FrUDT-CWT and the results are compared with FrDT-CWT and FrWT.
A novel image encryption method based on fractional Fourier transform and odd-even quantification
Eighth International Conference on Digital Image Processing (ICDIP 2016), 2016
In order to improve the performance of the Meixner moments, we suggest in this article a new set of Fractional Discrete Meixner Polynomials (FrDMPs), a sort of a generalization of the traditional whole order. Firstly, we introduce the necessary algebraic derivatives of FrDMPs using the spectral decomposition of Discrete Meixner Polynomials (DMPs) for any order without numerical fluctuation and always preserving the property of orthogonality thanks to the algorithm of the Gram-Schmidt process. Then, we determine the eigenvalues and the corresponding multiplicity of the Meixner transform matrix. An image encryption and decryption method was proposed based on jigsaw transform and generation of Fractional Discrete Meixner Moments (FrDMMs), in which the image is broken up into bit planes. Each bit plane undergoes a jigsaw transform is divided into blocks and encrypted. The transformed bit planes are combined together and then encrypted using random phase masks and fractional discrete Meixner moments. In addition, we introduce a new encryption and decryption scheme based on the proposed FrDMMs. This scheme has a good encryption effect because the fractional parameters used as key to the encrypted data. Experimental results show that the encryption scheme is sensitive to keys, it is resist a variety of attacks, and decrypted images are almost non-distored, which indicate excellent encryption effect, sufficient security and robustness of the method.
IEEE Access
A new algorithm for biometric templates using a 6D-chaotic system, and 2D fractional discrete cosine transform (FrDCT) is proposed in this paper. In this technique, the k biometric templates are represented into three groups. After representation, these three groups are converted into row vectors and scrambled by using keys generated by the 6D-chaotic system and after that, these row vectors are combined into three matrices. The three matrices are then mixed horizontally and divided into two halves, with the left half serving as the real part and the right half serving as the imaginary part of a complex-valued matrix (CVM). This CVM is further subjected to 2D FrDCT. The output of 2D FrDCT is separated into three parts. The robustness of the technique is further enhanced by substitution operation using keys generated by the 6D-chaotic system. Thus, the final encrypted template is obtained. The analysis like security, statistical, and attacks are given to authenticate the reliability of the proposed technique. The experimental values also show that the proposed technique is resistant to brute force attacks. INDEX TERMS Biometric template encryption, decryption, 2D fractional discrete cosine transform, 6D-chaotic system.
In modern this world, transmission of information through internet has been increased to very large extent. The environment offered for communication is unprotected, in order to keep confidentiality of information; data is required to be protected. Several techniques are available for the protection of information from the intruders, but better techniques are always welcomed to provide better security to the transmitted information. In this paper security of video information has taken into account. Most of the algorithms that are available for encryption used mathematical keys for the security purposes, but better alternative is to involve biometrics for the protection of multimedia information. In order to keep this need of the world in mind, the biometric based technique has been proposed in this paper. In this algorithm, asymmetric biometric keys as well as dual parameter based fractional wavelet transform in combination with scrambling are used for the encryption of videos. In order to enhance the performance of algorithm, ROI (region of interest) based partial encryption is proposed. Then several parameters like PSNR (peak signal to noise ratio), MSE (mean square error), SSIM (structural similarity index measure) etc. are calculated to prove the superiority of proposed technique.
Numerous methods have been recently proposed in the literature for the encryption of 2-D information using optical systems based on the Fractional Fourier Transform. Encryption is one of the well known techniques to provide security in transmission of multimedia contents over the internet and wireless networks. There is a vast use of image in all areas so its security is of great concern nowadays. Discrete Fractional Fourier Transform (DFRFT) generalization of the Discrete Fourier transform (DFT) with an additional parameter is incorporated in image encryption to achieve a more robust encryption system. To focus on security aspect, in this paper a novel method of image encryption has been proposed based on discrete Fractional Fourier Transform (DFRFT), using exponential random phase mask. Encryption with this technique makes it almost impossible to retrieve an image without using both the correct keys. The technique has been implemented experimentally and parameters like security, sensitivity and mean square error (MSE) are discussed. Keywords Fourier Transform (FT); Discrete Fourier Transform (DFT); Fractionl Fourier Transform (FRFT); Discrete Fractional Fourier Transform (DFRFT).