Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this paper, an asymmetric cryptosystem based on random decomposition is proposed. The suggested scheme used three different decryption keys to get decrypted image, two of which are generated using phase truncation and one through random decomposition. The combination of these keys and fractional Fourier transform parameter increase the security of cryptosystem against various attacks. MATLAB simulations are used to validate the scheme’s conclusions. The effectiveness of a scheme is validated by the key sensitivity performance of the cryptosystem. This research also includes a 3D plot for both grayscale and binary images. Correlation coefficient (CC) values between the original and recovered images is also calculated to validate the cryptosystem.
EN
To escalate the image encryption a new method has been devised which includes double random phase encoding (DRPE) using rear phase masking and random decomposition (RD) technique stranded on fractional Fourier transform. Here, asymmetric cryptographic system is developed in fractional Fourier transform (FrFT) mode using two random phase masks (RPM) and a rear mounted phase mask. In the projected scheme a colored image is decomposed into R, G and B channels. The amplitude of each channel is normalized, phase encoded and modulated using RPM. The modulated R, G and B channels of the colored image are individually transformed using FrFT to produce corresponding encrypted image. The proposed scheme is authorized on grayscale image also. The norm behind the development of the suggested scheme has been elaborated by carrying out cryptanalysis on system based on the RD. The method helps in escalations of the protection of double random phase encoding by cumulating the key length and the parameter amount, so that it vigorously can be used against various attacks. The forte of the suggested cryptographic system was verified using simulations with MATLAB 7.9.0 (R2008a). The efficiency of the suggested scheme includes the analysis using singular value decomposition (SVD), histogram and correlation coefficient.
EN
In this paper, an asymmetric audio and image encryption mechanism using QR decomposition and random modulus decomposition (RD) in the Fresnel domain is proposed. The audio file is recorded as a vector and converted to a two-dimensional array to act as an image or a sound map. This sound map is encrypted using the image encryption algorithm proposed in this paper. The proposed cryptosystem is validated for both audios and grayscale images. Fresnel parameters and the two private keys obtained from QR decomposition and random modulus decomposition (RD) form the key space. Computer-based reproductions have been carried out to prove the validity and authenticity of the scheme. Simulation results authenticate that the scheme is robust and efficient against various attacks and is sensitive to input parameters.
EN
A novel asymmetric scheme for double image encryption, compression and watermarking based on QR decomposition in the Fresnel domain has been presented. The QR decomposition provides a permutation matrix as a ciphertext, and the product of orthogonal and triangular matrix as a key. The ciphertext obtained through this process is a sparse matrix that is compressed by the CSR method to give compressed encrypted data, which when combined with a host image, gives a watermarked image. Thus, a cryptosystem that involves compression and watermarking is proposed. The proposed scheme is validated for grayscale images. To check the efficacy of the proposed scheme, histograms, statistical parameters, and key sensitivity are analyzed. The scheme is also tested against various attacks. Numerical simulations are performed to validate the security of the scheme.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.