Image encryption a communication perspective
Abd El-Samie, Fathi E; Elashry, Ibrahim F; Shahieen, Mai H; Faragallah, Osama S; El-Rabaie, El-Sayed M; Alshebeili, Saleh A
2013-01-01
Presenting encryption algorithms with diverse characteristics, Image Encryption: A Communication Perspective examines image encryption algorithms for the purpose of secure wireless communication. It considers two directions for image encryption: permutation-based approaches encryption and substitution-based approaches.Covering the spectrum of image encryption principles and techniques, the book compares image encryption with permutation- and diffusion-based approaches. It explores number theory-based encryption algorithms such as the Data Encryption Standard, the Advanced Encryption Standard,
Optical image encryption topology.
Yong-Liang, Xiao; Xin, Zhou; Qiong-Hua, Wang; Sheng, Yuan; Yao-Yao, Chen
2009-10-15
Optical image encryption topology is proposed based on the principle of random-phase encoding. Various encryption topological units, involving peer-to-peer, ring, star, and tree topologies, can be realized by an optical 6f system. These topological units can be interconnected to constitute an optical image encryption network. The encryption and decryption can be performed in both digital and optical methods.
Rakesh, S; Shadakshari, B C; Annappa, B
2012-01-01
With the fast evolution of digital data exchange and increased usage of multi media images, it is essential to protect the confidential image data from unauthorized access. In natural images the values and position of the neighbouring pixels are strongly correlated. The method proposed in this paper, breaks this correlation increasing entropy of the position and entropy of pixel values using block shuffling and encryption by chaotic sequence respectively. The plain-image is initially row wise shuffled and first level of encryption is performed using addition modulo operation. The image is divided into blocks and then block based shuffling is performed using Arnold Cat transformation, further the blocks are uniformly scrambled across the image. Finally the shuffled image undergoes second level of encryption by bitwise XOR operation, and then the image as a whole is shuffled column wise to produce the ciphered image for transmission. The experimental results show that the proposed algorithm can successfully enc...
Degradative encryption: An efficient way to protect SPIHT compressed images
Xiang, Tao; Qu, Jinyu; Yu, Chenyun; Fu, Xinwen
2012-11-01
Degradative encryption, a new selective image encryption paradigm, is proposed to encrypt only a small part of image data to make the detail blurred but keep the skeleton discernible. The efficiency is further optimized by combining compression and encryption. A format-compliant degradative encryption algorithm based on set partitioning in hierarchical trees (SPIHT) is then proposed, and the scheme is designed to work in progressive mode for gaining a tradeoff between efficiency and security. Extensive experiments are conducted to evaluate the strength and efficiency of the scheme, and it is found that less than 10% data need to be encrypted for a secure degradation. In security analysis, the scheme is verified to be immune to cryptographic attacks as well as those adversaries utilizing image processing techniques. The scheme can find its wide applications in online try-and-buy service on mobile devices, searchable multimedia encryption in cloud computing, etc.
Reversible Data Hiding In Encrypted Images Using Improved Encryption Technique
Directory of Open Access Journals (Sweden)
Balika J. Chelliah
2015-11-01
Full Text Available Recently more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content‟s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be some errors on data extraction and/or image restoration. In this paper we propose a different scheme which attains real reversibility by reserving room before encryption with a traditional RDH algorithm, and then encrypting the data and embedding the data in the encrypted image, which is encrypted using a new proposed algorithm. The proposed method can achieve real reversibility that is data extraction and image recoveries are free of any error.
Reversible Data Hiding In Encrypted Images Using Improved Encryption Technique
Directory of Open Access Journals (Sweden)
Mr. Balika J. Chelliah
2014-03-01
Full Text Available Recently more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content‟s confidentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may be some errors on data extraction and/or image restoration. In this paper we propose a different scheme which attains real reversibility by reserving room before encryption with a traditional RDH algorithm, and then encrypting the data and embedding the data in the encrypted image, which is encrypted using a new proposed algorithm. The proposed method can achieve real reversibility that is data extraction and image recoveries are free of any error.
Optical image encryption based on diffractive imaging.
Chen, Wen; Chen, Xudong; Sheppard, Colin J R
2010-11-15
In this Letter, we propose a method for optical image encryption based on diffractive imaging. An optical multiple random phase mask encoding system is applied, and one of the phase-only masks is selected and laterally translated along a preset direction during the encryption process. For image decryption, a phase retrieval algorithm is proposed to extract a high-quality plaintext. The feasibility and effectiveness of the proposed method are demonstrated by numerical results. The proposed method can provide a new strategy instead of conventional interference methods, and it may open up a new research perspective for optical image encryption.
Digital image encryption with chaotic map lattices
Institute of Scientific and Technical Information of China (English)
Sun Fu-Yan; Lü Zong-Wang
2011-01-01
This paper proposes a secure approach for encryption and decryption of digital images with chaotic map lattices.In the proposed encryption process, eight different types of operations are used to encrypt the pixels of an image and one of them will be used for particular pixels decided by the outcome of the chaotic map lattices. To make the cipher more robust against any attacks, the secret key is modified after encrypting each block of sixteen pixels of the image.The experimental results and security analysis show that the proposed image encryption scheme achieves high security and efficiency.
Image Encryption Using a Lightweight Stream Encryption Algorithm
Directory of Open Access Journals (Sweden)
Saeed Bahrami
2012-01-01
Full Text Available Security of the multimedia data including image and video is one of the basic requirements for the telecommunications and computer networks. In this paper, we consider a simple and lightweight stream encryption algorithm for image encryption, and a series of tests are performed to confirm suitability of the described encryption algorithm. These tests include visual test, histogram analysis, information entropy, encryption quality, correlation analysis, differential analysis, and performance analysis. Based on this analysis, it can be concluded that the present algorithm in comparison to A5/1 and W7 stream ciphers has the same security level, is better in terms of the speed of performance, and is used for real-time applications.
Optically-induced-potential-based image encryption.
Chen, Bing-Chu; Wang, He-Zhou
2011-11-07
We present a technique of nonlinear image encryption by use of virtual optics. The image to be encrypted is superposed on a random intensity image. And this superposed image propagates through a nonlinear medium and a 4-f system with single phase key. The image is encrypted to a stationary white noise. The decryption process is sensitive to the parameters of the encryption system and the phase key in 4-f system. This sensitivity makes attackers hard to access the phase key. In nonlinear medium, optically-induced potentials, which depend on intensity of optical wave, make the superposition principle frustrated. This nonlinearity based on optically induced potentials highly improves the secrecy level of image encryption. Resistance against attacks based on the phase retrieval technique proves that it has the high secrecy level. This nonlinear image encryption based on optically induced potentials is proposed and demonstrated for the first time.
Novel image encryption based on quantum walks.
Yang, Yu-Guang; Pan, Qing-Xiang; Sun, Si-Jia; Xu, Peng
2015-01-14
Quantum computation has achieved a tremendous success during the last decades. In this paper, we investigate the potential application of a famous quantum computation model, i.e., quantum walks (QW) in image encryption. It is found that QW can serve as an excellent key generator thanks to its inherent nonlinear chaotic dynamic behavior. Furthermore, we construct a novel QW-based image encryption algorithm. Simulations and performance comparisons show that the proposal is secure enough for image encryption and outperforms prior works. It also opens the door towards introducing quantum computation into image encryption and promotes the convergence between quantum computation and image processing.
Joint image encryption and compression scheme based on IWT and SPIHT
Zhang, Miao; Tong, Xiaojun
2017-03-01
A joint lossless image encryption and compression scheme based on integer wavelet transform (IWT) and set partitioning in hierarchical trees (SPIHT) is proposed to achieve lossless image encryption and compression simultaneously. Making use of the properties of IWT and SPIHT, encryption and compression are combined. Moreover, the proposed secure set partitioning in hierarchical trees (SSPIHT) via the addition of encryption in the SPIHT coding process has no effect on compression performance. A hyper-chaotic system, nonlinear inverse operation, Secure Hash Algorithm-256(SHA-256), and plaintext-based keystream are all used to enhance the security. The test results indicate that the proposed methods have high security and good lossless compression performance.
A fractal-based image encryption system
Abd-El-Hafiz, S. K.
2014-12-01
This study introduces a novel image encryption system based on diffusion and confusion processes in which the image information is hidden inside the complex details of fractal images. A simplified encryption technique is, first, presented using a single-fractal image and statistical analysis is performed. A general encryption system utilising multiple fractal images is, then, introduced to improve the performance and increase the encryption key up to hundreds of bits. This improvement is achieved through several parameters: feedback delay, multiplexing and independent horizontal or vertical shifts. The effect of each parameter is studied separately and, then, they are combined to illustrate their influence on the encryption quality. The encryption quality is evaluated using different analysis techniques such as correlation coefficients, differential attack measures, histogram distributions, key sensitivity analysis and the National Institute of Standards and Technology (NIST) statistical test suite. The obtained results show great potential compared to other techniques.
Optical encryption for large-sized images
Sanpei, Takuho; Shimobaba, Tomoyoshi; Kakue, Takashi; Endo, Yutaka; Hirayama, Ryuji; Hiyama, Daisuke; Hasegawa, Satoki; Nagahama, Yuki; Sano, Marie; Oikawa, Minoru; Sugie, Takashige; Ito, Tomoyoshi
2016-02-01
We propose an optical encryption framework that can encrypt and decrypt large-sized images beyond the size of the encrypted image using our two methods: random phase-free method and scaled diffraction. In order to record the entire image information on the encrypted image, the large-sized images require the random phase to widely diffuse the object light over the encrypted image; however, the random phase gives rise to the speckle noise on the decrypted images, and it may be difficult to recognize the decrypted images. In order to reduce the speckle noise, we apply our random phase-free method to the framework. In addition, we employ scaled diffraction that calculates light propagation between planes with different sizes by changing the sampling rates.
An algorithm for encryption of secret images into meaningful images
Kanso, A.; Ghebleh, M.
2017-03-01
Image encryption algorithms typically transform a plain image into a noise-like cipher image, whose appearance is an indication of encrypted content. Bao and Zhou [Image encryption: Generating visually meaningful encrypted images, Information Sciences 324, 2015] propose encrypting the plain image into a visually meaningful cover image. This improves security by masking existence of encrypted content. Following their approach, we propose a lossless visually meaningful image encryption scheme which improves Bao and Zhou's algorithm by making the encrypted content, i.e. distortions to the cover image, more difficult to detect. Empirical results are presented to show high quality of the resulting images and high security of the proposed algorithm. Competence of the proposed scheme is further demonstrated by means of comparison with Bao and Zhou's scheme.
Proposed Hyperchaotic System for Image Encryption
Directory of Open Access Journals (Sweden)
Asst. Prof. Dr. Alia Karim Abdul Hassan
2016-01-01
Full Text Available This paper presents a new hyper chaos system based on Hénon and Logistic maps which provides characteristics of high capacity, security and efficiency. The Proposed hyper chaos system is employed to generate the key for diffusion in an image encryption algorithm. The simulation experiments to the image encryption algorithm which based on the proposed hyper chaos system show that the algorithm security analysis it has large key space (10 84 that ensures a strong resistance against attack of exhaustion as the key space will be greater, strong sensitivity of encryption key and good statistical characteristics. Encryption and decryption time is suitable for different applications.
IMAGE ENCRYPTION BASED ON SINGULAR VALUE DECOMPOSITION
Directory of Open Access Journals (Sweden)
Nidhal K. El Abbadi
2014-01-01
Full Text Available Image encryption is one of the most methods of information hiding. A novel secure encryption method for image encryption is presented in this study. The proposed algorithm based on using singular value decomposition SVD. In this study we start to scramble the image data according to suggested keys (two sequence scrambling process with two different keys to finally create two different matrices. The diagonal matrix from the SVD will be interchanged with the resulted matrices. Another scrambling and diagonal matrices interchange will apply to increase the complexity. The resulted two matrices combine to one matrix according to predefined procedure. The encrypted image is a meaningfull image. The suggested method tested with many images encryption and gives promised results.
Directory of Open Access Journals (Sweden)
Ari Shawakat Tahir
2015-12-01
Full Text Available The Steganography is an art and science of hiding information by embedding messages within other, seemingly harmless messages and lots of researches are working in it. Proposed system is using AES Algorithm and Lossy technique to overcome the limitation of previous work and increasing the process’s speed. The sender uses AES Algorithm to encrypt message and image, then using LSB technique to hide encrypted data in encrypted message. The receive get the original data using the keys that had been used in encryption process. The proposed system has been implemented in NetBeans 7.3 software uses image and data in different size to find the system’s speed.
Space-based optical image encryption.
Chen, Wen; Chen, Xudong
2010-12-20
In this paper, we propose a new method based on a three-dimensional (3D) space-based strategy for the optical image encryption. The two-dimensional (2D) processing of a plaintext in the conventional optical encryption methods is extended to a 3D space-based processing. Each pixel of the plaintext is considered as one particle in the proposed space-based optical image encryption, and the diffraction of all particles forms an object wave in the phase-shifting digital holography. The effectiveness and advantages of the proposed method are demonstrated by numerical results. The proposed method can provide a new optical encryption strategy instead of the conventional 2D processing, and may open up a new research perspective for the optical image encryption.
Multiple image encryption by phase retrieval
Di, Hong; Kang, Yanmei; Liu, Yueqin; Zhang, Xin
2016-07-01
Multiple image encryption (MIE) was proposed to increase the efficiency of encrypting images by processing several images simultaneously. Because of the advantage of optical technology in processing twodimensional images at high throughput, MIE has been significantly improved by use of methods originating from optics. Phase retrieval was the process of algorithmically finding solutions to the phase loss problem due to light detectors only capturing the intensity. It was to retrieve phase information for the determination of a structure from diffraction data. Error-reduction algorithm is a typical phase retrieval method. Here, we employ it to illustrate that methods in phase retrieval are able to encrypt multiple images and compress them into encrypted data simultaneously. Moreover, the decryption is also designed to handle multiple images at the same time. The whole process including both the encryption and decryption is proposed to improve MIE with respect to the compression and efficiency. The feasibility and encryption of the MIE scheme is demonstrated with encryption experiments under Gaussian white noise and unauthorized access.
Performance study of selective encryption in comparison to full encryption for still visual images
Institute of Scientific and Technical Information of China (English)
Osama A.KHASHAN; Abdullah M.ZIN; Elankovan A.SUNDARARAJAN
2014-01-01
Securing digital images is becoming an important concern in today’s information security due to the extensive use of secure images that are either transmitted over a network or stored on disks. Image encryption is the most effective way to fulfil confidentiality and protect the privacy of images. Nevertheless, owing to the large size and complex structure of digital images, the computational overhead and processing time needed to carry out full image encryption prove to be limiting factors that inhibit it of being used more heavily in real time. To solve this problem, many recent studies use the selective encryption approach to encrypt significant parts of images with a hope to reduce the encryption overhead. However, it is necessary to realistically evaluate its performance compared to full encryption. In this paper, we study the performance and efficiency of image segmentation methods used in the selective encryption approach, such as edges and face detection methods, in determining the most important parts of visual images. Experiments were performed to analyse the computational results obtained by selective image encryption compared to full image encryption using symmetric encryption algorithms. Experiment results have proven that the selective encryption approach based on edge and face detection can significantly reduce the time of encrypting still visual images as compared to full encryption. Thus, this approach can be considered a good alternative in the implementation of real-time applications that require adequate security levels.
Spatial chaos-based image encryption design
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. In this paper, permutation and sub- stitution methods are incorporated to present a stronger image encryption algorithm. Spatial chaotic maps are used to realize the position permutation, and to confuse the relationship between the ci- pher-image and the plain-image. The experimental results demonstrate that the suggested encryption scheme of image has the advantages of large key space and high security; moreover, the distribution of grey values of the encrypted image has a random-like behavior.
Spatial chaos-based image encryption design
Institute of Scientific and Technical Information of China (English)
LIU ShuTang; SUN FuYan
2009-01-01
In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. In this paper, permutation and sub-stitution methods are incorporated to present a stronger image encryption algorithm. Spatial chaotic maps are used to realize the position permutation, and to confuse the relationship between the ci-pher-image and the plain-image. The experimental results demonstrate that the suggested encryption scheme of image has the advantages of large key space and high security; moreover, the distribution of grey values of the encrypted image has a random-like behavior.
EEG based image encryption via quantum walks.
Rawat, N; Shin, Y; Balasingham, I
2016-08-01
An electroencephalogram (EEG) based image encryption combined with Quantum walks (QW) is encoded in Fresnel domain. The computational version of EEG randomizes the original plaintext whereas QW can serve as an excellent key generator due to its inherent nonlinear chaotic dynamic behavior. First, a spatially coherent monochromatic laser beam passes through an SLM, which introduces an arbitrary EEG phase-only mask. The modified beam is collected by a CCD. Further, the intensity is multiply with the QW digitally. EEG shows high sensitivity to system parameters and capable of encrypting and transmitting the data whereas QW has unpredictability, stability and non-periodicity. Only applying the correct keys, the original image can be retrieved successfully. Simulations and comparisons show the proposed method to be secure enough for image encryption and outperforms prior works. The proposed method opens the door towards introducing EEG and quantum computation into image encryption and promotes the convergence between our approach and image processing.
Watermarking patient data in encrypted medical images
Indian Academy of Sciences (India)
A Lavanya; V Natarajan
2012-12-01
In this paper, we propose a method for watermarking medical images for data integrity which consists of image encryption, data embedding and image-recovery phases. Data embedding can be completely recovered from the watermarked image after the watermark has been extracted. In the proposed method, we utilize standard stream cipher for image encryption and selecting non-region of interest tile to embed patient data. We show that the lower bound of the PSNR (peak-signal-to-noise-ratio) values for medical images is about 48 dB. Experimental results demonstrate that the proposed scheme can embed a large amount of data while keeping high visual quality of test images.
Image encryption by redirection and cyclical shift
Grigoryan, Artyom M.; Wiatrek, Bryan A.; Agaian, Sos S.
2015-05-01
In this paper, we present a novel method for encrypting and decrypting large amounts of data such as two-dimensional (2-D) images, both gray-scale and color, without the loss of information, and using private keys of varying lengths. The proposed method is based on the concept of the tensor representation of an image and splitting the 2-D discrete Fourier transform (DFT) by one-dimensional (1-D) DFTs of signals from the tensor representation, or transform. The splitting of the transform is accomplished in a three-dimensional (3-D) space, namely on the 3-D lattice placed on the torus. Each splitting-signal of the image defines the 2-D DFT along the frequency-points located on the spirals on the torus. Spirals have different form and cover the lattice on the torus in a complex form, which makes them very effective when moving data through and between the spirals, and data along the spirals. The encryption consists of several iterative applications of mapping the 3-D torus into several ones of smaller sizes, and rotates then moves the data around the spirals on all tori. The encryption results in the image which is uncorrelated. The decryption algorithm uses the encrypted data, and processes them in inverse order with an identical number of iterations. The proposed method can be extended to encrypt and decrypt documents as well as other types of digital media. Simulation results of the purposed method are presented to show the performance for image encryption.
Binary-tree encryption strategy for optical multiple-image encryption.
Yi, Jiawang; Tan, Guanzheng
2016-07-10
In traditional optical multiple-image encryption schemes, different images typically have almost the same encryption or decryption process. Provided that an attacker manages to correctly decrypt some image, the conventional attacks upon other images are much easier to be made. In this paper, a binary-tree encryption strategy for multiple images is proposed to resist the attacks in this case. The encryption schemes produced by this strategy can not only increase the security of multiple-image encryption, but also realize an authority management with high security among the users sharing a cipher image. For a simulation test, we devise a basic binary-tree encryption scheme, whose encryption nodes are based on an asymmetric double random phase encoding in the gyrator domain. The favorable simulation results about the tested scheme can testify to the feasibility of the strategy.
Double Layer Image Security System using Encryption and Steganography
Directory of Open Access Journals (Sweden)
Samreen Sekhon Brar
2016-03-01
Full Text Available The image security on internet transfers is the concern of the hour as the breaching attacks into the image databases are rising every year. The hackers take advantage of the stolen personal and important images to fulfill their dangerous and unethical intentions. The image data theft can be used to defame a person on the internet by posting the illegal and unacceptable images of that person (internet user. Hence the images transfers have to be secure to ensure the privacy of the user's image data. In this research, a number of image security systems have been studied to evaluate the research gap. Majority of the existing image security systems are not up to date to protect against the latest breaching attacks. So, we have proposed an effective and robust image security framework particularly designed for the images. The proposed has been designed and implemented using MATLAB. In this research, a hybrid image security framework has been proposed to overcome the problem stated earlier, which will be implemented by combining various techniques together to achieve the image security goal. The techniques included in the combination would beimage compression, cryptography andsteganography. DWT compression has been used, because it is a stronger compression algorithm. The steganographed image would be compressed to reduce its size. Blowfish encryption algorithm would be used for the encryption purposes. It offers maximum throughput (faster and also energy efficient. Compressed image would be encrypted to enhance the image security. Real image will be hidden into another image. A cluster based steganographic technique will be used. Real image and face image would be analyzed, and the real image would be embedded in those areas of face image, where color schemes of the real image and face image would be most similar. Kmeans or Hierarchical clustering would be used as a clustering technique. An all new comparative analysis technique would be applied to
Wang, Yong; Markman, Adam; Quan, Chenggen; Javidi, Bahram
2016-11-01
We present a photon-counting double-random-phase encryption technique that only requires the photon-limited amplitude of the encrypted image for decryption. The double-random-phase encryption is used to encrypt an image, generating a complex image. Photon counting is applied to the amplitude of the encrypted image, generating a sparse noise-like image; however, the phase information is not retained. By not using the phase information, the encryption process is simplified, allowing for intensity detection and also less information to be recorded. Using a phase numerically generated from the correct encryption keys together with the photon-limited amplitude of the encrypted image, we are able to decrypt the image. Moreover, nonlinear correlation algorithms can be used to authenticate the decrypted image. Both amplitude-based and full-phase encryption using the proposed method are investigated. Preliminary computational results and performance evaluation are presented.
Chaotic Image Encryption of Regions of Interest
Xiao, Di; Fu, Qingqing; Xiang, Tao; Zhang, Yushu
Since different regions of an image have different importance, therefore only the important information of the image regions, which the users are really interested in, needs to be encrypted and protected emphatically in some special multimedia applications. However, the regions of interest (ROI) are always some irregular parts, such as the face and the eyes. Assuming the bulk data in transmission without being damaged, we propose a chaotic image encryption algorithm for ROI. ROI with irregular shapes are chosen and detected arbitrarily. Then the chaos-based image encryption algorithm with scrambling, S-box and diffusion parts is used to encrypt the ROI. Further, the whole image is compressed with Huffman coding. At last, a message authentication code (MAC) of the compressed image is generated based on chaotic maps. The simulation results show that the encryption algorithm has a good security level and can resist various attacks. Moreover, the compression method improves the storage and transmission efficiency to some extent, and the MAC ensures the integrity of the transmission data.
Optical encryption with selective computational ghost imaging
Zafari, Mohammad; kheradmand, Reza; Ahmadi-Kandjani, Sohrab
2014-10-01
Selective computational ghost imaging (SCGI) is a technique which enables the reconstruction of an N-pixel image from N measurements or less. In this paper we propose an optical encryption method based on SCGI and experimentally demonstrate that this method has much higher security under eavesdropping and unauthorized accesses compared with previous reported methods.
ALGORITHM FOR IMAGE MIXING AND ENCRYPTION
Directory of Open Access Journals (Sweden)
Ayman M. Abdalla
2013-04-01
Full Text Available This new algorithm mixes two or more images of different types and sizes by employing a shuffling procedure combined with S-box substitution to perform lossless image encryption. This combines stream cipher with block cipher, on the byte level, in mixing the images. When this algorithm was implemented, empirical analysis using test images of different types and sizes showed that it is effective and resistant to attacks.
Quantum Image Encryption Algorithm Based on Quantum Image XOR Operations
Gong, Li-Hua; He, Xiang-Tao; Cheng, Shan; Hua, Tian-Xiang; Zhou, Nan-Run
2016-07-01
A novel encryption algorithm for quantum images based on quantum image XOR operations is designed. The quantum image XOR operations are designed by using the hyper-chaotic sequences generated with the Chen's hyper-chaotic system to control the control-NOT operation, which is used to encode gray-level information. The initial conditions of the Chen's hyper-chaotic system are the keys, which guarantee the security of the proposed quantum image encryption algorithm. Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm has larger key space, higher key sensitivity, stronger resistance of statistical analysis and lower computational complexity than its classical counterparts.
Image Encryption using chaos functions and fractal key
Directory of Open Access Journals (Sweden)
Houman Kashanian
2016-09-01
Full Text Available Many image in recent years are transmitted via internet and stored on it. Maintain the confidentiality of these data has become a major issue. So that encryption algorithms permit only authorized users to access data which is a proper solution to this problem.This paper presents a novel scheme for image encryption. At first, a two dimensional logistic mapping is applied to permutation relations between image pixels. We used a fractal image as an encryption key. Given that the chaotic mapping properties such as extreme sensitivity to initial values, random behavior, non-periodic, certainty and so on, we used theses mappings in order to select fractal key for encryption. Experimental results show that proposed algorithm to encrypt image has many features. Due to features such as large space key, low relations between the pixels of encrypted image, high sensitivity to key and high security, it can effectively protect the encrypted image security.
Dual encryption scheme of images using polarized light.
Alfalou, A; Brosseau, C
2010-07-01
We propose and analyze a dual encryption/decryption scheme, motivated by recent interest in polarization encoding. Compared to standard optical encryption methods, which are based on phase and amplitude manipulation, this encryption procedure relying on Mueller-Stokes formalism provides large flexibility in the key encryption design. The effectiveness of our algorithm is discussed, thanks to a numerical simulation of the polarization encryption/decryption procedure of a 256 gray-level image. Of additional special interest is the immunity of this encryption algorithm to brute force attacks.
Optical image encryption using multilevel Arnold transform and noninterferometric imaging
Chen, Wen; Chen, Xudong
2011-11-01
Information security has attracted much current attention due to the rapid development of modern technologies, such as computer and internet. We propose a novel method for optical image encryption using multilevel Arnold transform and rotatable-phase-mask noninterferometric imaging. An optical image encryption scheme is developed in the gyrator transform domain, and one phase-only mask (i.e., phase grating) is rotated and updated during image encryption. For the decryption, an iterative retrieval algorithm is proposed to extract high-quality plaintexts. Conventional encoding methods (such as digital holography) have been proven vulnerably to the attacks, and the proposed optical encoding scheme can effectively eliminate security deficiency and significantly enhance cryptosystem security. The proposed strategy based on the rotatable phase-only mask can provide a new alternative for data/image encryption in the noninterferometric imaging.
Review: Image Encryption Using Chaos Based algorithms
Directory of Open Access Journals (Sweden)
Er. Ankita Gaur
2014-03-01
Full Text Available Due to the development in the field of network technology and multimedia applications, every minute thousands of messages which can be text, images, audios, videos are created and transmitted over wireless network. Improper delivery of the message may leads to the leakage of important information. So encryption is used to provide security. In last few years, variety of image encryption algorithms based on chaotic system has been proposed to protect image from unauthorized access. 1-D chaotic system using logistic maps has weak security, small key space and due to the floating of pixel values, some data lose occurs and proper decryption of image becomes impossible. In this paper different chaotic maps such as Arnold cat map, sine map, logistic map, tent map have been studied.
Novel permutation measures for image encryption algorithms
Abd-El-Hafiz, Salwa K.; AbdElHaleem, Sherif H.; Radwan, Ahmed G.
2016-10-01
This paper proposes two measures for the evaluation of permutation techniques used in image encryption. First, a general mathematical framework for describing the permutation phase used in image encryption is presented. Using this framework, six different permutation techniques, based on chaotic and non-chaotic generators, are described. The two new measures are, then, introduced to evaluate the effectiveness of permutation techniques. These measures are (1) Percentage of Adjacent Pixels Count (PAPC) and (2) Distance Between Adjacent Pixels (DBAP). The proposed measures are used to evaluate and compare the six permutation techniques in different scenarios. The permutation techniques are applied on several standard images and the resulting scrambled images are analyzed. Moreover, the new measures are used to compare the permutation algorithms on different matrix sizes irrespective of the actual parameters used in each algorithm. The analysis results show that the proposed measures are good indicators of the effectiveness of the permutation technique.
Image encryption using high-dimension chaotic system
Institute of Scientific and Technical Information of China (English)
Sun Fu-Yan; Liu Shu-Tang; Lü Zong-Wang
2007-01-01
In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. This paper proposes a new approach for image encryption based on a highdimensional chaotic map. The new scheme employs the Cat map to shuffle the positions, then to confuse the relationship between the cipher-image and the plain-image using the high-dimensional Lorenz chaotic map preprocessed. The results of experimental, statistical analysis and key space analysis show that the proposed image encryption scheme provides an efficient and secure way for real-time image encryption and transmission.
Image encryption using P-Fibonacci transform and decomposition
Zhou, Yicong; Panetta, Karen; Agaian, Sos; Chen, C. L. Philip
2012-03-01
Image encryption is an effective method to protect images or videos by transferring them into unrecognizable formats for different security purposes. To improve the security level of bit-plane decomposition based encryption approaches, this paper introduces a new image encryption algorithm by using a combination of parametric bit-plane decomposition along with bit-plane shuffling and resizing, pixel scrambling and data mapping. The algorithm utilizes the Fibonacci P-code for image bit-plane decomposition and the 2D P-Fibonacci transform for image encryption because they are parameter dependent. Any new or existing method can be used for shuffling the order of the bit-planes. Simulation analysis and comparisons are provided to demonstrate the algorithm's performance for image encryption. Security analysis shows the algorithm's ability against several common attacks. The algorithm can be used to encrypt images, biometrics and videos.
Optical double-image encryption and authentication by sparse representation.
Mohammed, Emad A; Saadon, H L
2016-12-10
An optical double-image encryption and authentication method by sparse representation is proposed. The information from double-image encryption can be integrated into a sparse representation. Unlike the traditional double-image encryption technique, only sparse (partial) data from the encrypted data is adopted for the authentication process. Simulation results demonstrate that the correct authentication results are achieved even with partial information from the encrypted data. The randomly selected sparse encrypted information will be used as an effective key for a security system. Therefore, the proposed method is feasible, effective, and can provide an additional security layer for optical security systems. In addition, the method also achieved the general requirements of storage and transmission due to a high reduction of the encrypted information.
Research on medical image encryption in telemedicine systems.
Dai, Yin; Wang, Huanzhen; Zhou, Zixia; Jin, Ziyi
2016-04-29
Recently, advances in computers and high-speed communication tools have led to enhancements in remote medical consultation research. Laws in some localities require hospitals to encrypt patient information (including images of the patient) before transferring the data over a network. Therefore, developing suitable encryption algorithms is quite important for modern medicine. This paper demonstrates a digital image encryption algorithm based on chaotic mapping, which uses the no-period and no-convergence properties of a chaotic sequence to create image chaos and pixel averaging. Then, the chaotic sequence is used to encrypt the image, thereby improving data security. With this method, the security of data and images can be improved.
Chaotic Image Encryption with Random Shuffling of Data
Aydos, Murat; Uğur, Alper
2014-01-01
Security of valuable multimedia contents such as images in personal photograph albums, electronic publishing, frames of multicast video conference can be achieved by image encryption. Secure transmission of these contents is required to be rapid, efficient and practical. Hence, image encryption process must be chosen not only to satisfy the security goals but also to fulfill these requirements. Due to the inadequacy and inefficiency of conventional text based information encryption methods, r...
Image Encryption Using Differential Evolution Approach in Frequency Domain
Hassan, Maaly Awad S; 10.5121/sipij.2011.2105
2011-01-01
This paper presents a new effective method for image encryption which employs magnitude and phase manipulation using Differential Evolution (DE) approach. The novelty of this work lies in deploying the concept of keyed discrete Fourier transform (DFT) followed by DE operations for encryption purpose. To this end, a secret key is shared between both encryption and decryption sides. Firstly two dimensional (2-D) keyed discrete Fourier transform is carried out on the original image to be encrypted. Secondly crossover is performed between two components of the encrypted image, which are selected based on Linear Feedback Shift Register (LFSR) index generator. Similarly, keyed mutation is performed on the real parts of a certain components selected based on LFSR index generator. The LFSR index generator initializes it seed with the shared secret key to ensure the security of the resulting indices. The process shuffles the positions of image pixels. A new image encryption scheme based on the DE approach is developed...
Bondareva, Alyona P.; Cheremkhin, Pavel A.; Evtikhiev, Nikolay N.; Krasnov, Vitaly V.; Rodin, Vladislav G.; Starikov, Sergey N.
2014-10-01
At present time methods of optical encryption are actively developed. The majority of existing methods of optical encryption use not only light intensity distribution, easily registered with photosensors, but also its phase distribution which require application of complex holographic schemes in conjunction with spatially coherent monochromatic illumination. This leads to complex optical schemes and low decryption quality. To eliminate these disadvantages it is possible to implement optical encryption using spatially incoherent monochromatic illumination which requires registration of light intensity distribution only. Encryption is accomplished by means of optical convolution of image of scene to be encrypted and encryption diffractive optical element (DOE) point spread function (PSF) which serves as encryption key. Encryption process is described as follows. Scene is illuminated with spatially-incoherent monochromatic light. In the absence of encryption DOE lens forms image of scene in photosensor plane. DOE serves as encryption element, its PSF - encryption key. Light passing through DOE forms convolution of object image and DOE PSF. Registered by photosensor convolution is encrypted image. Decryption was conducted numerically on computer by means of inverse filtration with regularization. Kinoforms were used as encryption DOE because they have single diffraction order. Two liquid crystal (LC) spatial light modulators (SLM) were used to implement dynamic digital information input and dynamic encryption key change. As input scene amplitude LC SLM HoloEye LC2002 with 800×600 pixels 32×32 μm2 and 256 gray levels was used. To image synthesized encryption kinoforms phase LC SLM HoloEye PLUTO VIS with 1920×1080 pixels 8×8 μm2 and 256 phase levels was used. Set of test images was successfully optically encrypted and then numerically decrypted. Encrypted images contents are hidden. Decrypted images despite quite high noise levels are positively recognizable
Reversible Data Hiding In Encrypted Images by Reserving Room before Encryption
Directory of Open Access Journals (Sweden)
Harish G, Smitha Shekar B, Prajwal R, Sunil S Shetty
2014-07-01
Full Text Available Recently, more and more attention is paid to reversible data hiding (RDH in encrypted images, since it maintains the excellent property that the original cover can be losslessly recovered after embedded data is extracted while protecting the image content’s conﬁdentiality. All previous methods embed data by reversibly vacating room from the encrypted images, which may subject to some errors on data extraction and/or image restoration. Here, a novel method is proposed so as to reserve room before encryption with a traditional RDH algorithm, and thus it is easy for the data hider to reversibly embed data in the encrypted image. The proposed method can achieve real reversibility, i.e., data extraction and image recovery are free of any error.
Digital Image Encryption Based On Multiple Chaotic Maps
Directory of Open Access Journals (Sweden)
Amir Houshang Arab Avval
2016-01-01
Full Text Available A novel and robust chaos-based digital image encryption is proposed. The present paper presents a cipher block image encryption using multiple chaotic maps to lead increased security. An image block is encrypted by the block-based permutation process and cipher block encryption process. In the proposed scheme, secret key includes nineteen control and initial conditions parameter of the four chaotic maps and the calculated key space is 2883. The effectiveness and security of the proposed encryption scheme has been performed using the histograms, correlation coefficients, information entropy, differential analysis, key space analysis, etc. It can be concluded that the proposed image encryption technique is a suitable choice for practical applications.
Digital Image Encryption Scheme Based on Multiple Chaotic Systems
Abd El-Latif, Ahmed A.; Li, Li; Zhang, Tiejun; Wang, Ning; Song, Xianhua; Niu, Xiamu
2012-06-01
Image encryption is a challenging task due to the significant level of sophistication achieved by forgerers and other cybercriminals. Advanced encryption methods for secure transmission, storage, and retrieval of digital images are increasingly needed for a number of military, medical, homeland security, and other applications. In this paper, we introduce a new digital image encryption algorithm. The new algorithm employs multiple chaotic systems and cryptographic primitive operations within the encryption process, which are efficiently implemented on modern processors, and adopts round keys for encryption using a chaotic map. Experiments conducted show that the proposed algorithm possesses robust security features such as fairly uniform distribution, high sensitivity to both keys and plainimages, almost ideal entropy, and the ability to highly de-correlate adjacent pixels in the cipherimages. Furthermore, it has a large key space, which greatly increases its security for image encryption applications.
Single-random-phase holographic encryption of images
Tsang, P. W. M.
2017-02-01
In this paper, a method is proposed for encrypting an optical image onto a phase-only hologram, utilizing a single random phase mask as the private encryption key. The encryption process can be divided into 3 stages. First the source image to be encrypted is scaled in size, and pasted onto an arbitrary position in a larger global image. The remaining areas of the global image that are not occupied by the source image could be filled with randomly generated contents. As such, the global image as a whole is very different from the source image, but at the same time the visual quality of the source image is preserved. Second, a digital Fresnel hologram is generated from the new image, and converted into a phase-only hologram based on bi-directional error diffusion. In the final stage, a fixed random phase mask is added to the phase-only hologram as the private encryption key. In the decryption process, the global image together with the source image it contained, can be reconstructed from the phase-only hologram if it is overlaid with the correct decryption key. The proposed method is highly resistant to different forms of Plain-Text-Attacks, which are commonly used to deduce the encryption key in existing holographic encryption process. In addition, both the encryption and the decryption processes are simple and easy to implement.
A lossless encryption method for medical images using edge maps.
Zhou, Yicong; Panetta, Karen; Agaian, Sos
2009-01-01
Image encryption is an effective approach for providing security and privacy protection for medical images. This paper introduces a new lossless approach, called EdgeCrypt, to encrypt medical images using the information contained within an edge map. The algorithm can fully protect the selected objects/regions within medical images or the entire medical images. It can also encrypt other types of images such as grayscale images or color images. The algorithm can be used for privacy protection in the real-time medical applications such as wireless medical networking and mobile medical services.
ENCRYPTION TECHNIQUES FOR SECURITY OF IMAGES
Directory of Open Access Journals (Sweden)
DR. DHIRENDRA MISHRA
2014-01-01
Full Text Available With the proliferation in technology and advent of internet the data has been digitized, so more emphasis is required for security while transmission and storage to save from unauthorized users. Protecting data in a safe and secure way which does not hamper the access of an authorized authority is difficult and interesting research problem. Many attempts have been made to solve this problem within the cryptographic community. Visual cryptography provides a very powerful technique by which one secret can be distributed into two or more images known as shares. When the shares on transparencies are superimposed exactly together, original secret can be discovered without computer involvement. Image cryptography disrupts the image so that no useful information is seen. The keys used for disruption is used in reverse manner to decrypt the image. This paper discusses the various encryption techniques for better image security and to protect them from unintentional user.
Meteosat Images Encryption based on AES and RSA Algorithms
Directory of Open Access Journals (Sweden)
Boukhatem Mohammed Belkaid
2015-06-01
Full Text Available Satellite image Security is playing a vital role in the field of communication system and Internet. This work is interested in securing transmission of Meteosat images on the Internet, in public or local networks. To enhance the security of Meteosat transmission in network communication, a hybrid encryption algorithm based on Advanced Encryption Standard (AES and Rivest Shamir Adleman (RSA algorithms is proposed. AES algorithm is used for data transmission because of its higher efficiency in block encryption and RSA algorithm is used for the encryption of the key of the AES because of its management advantages in key cipher. Our encryption system generates a unique password every new session of encryption. Cryptanalysis and various experiments have been carried out and the results were reported in this paper, which demonstrate the feasibility and flexibility of the proposed scheme.
Application of Cosine Zone Plates to Image Encryption
Institute of Scientific and Technical Information of China (English)
GE Fan; CHEN Lin-Fei; ZHAO Dao-Mu
2008-01-01
@@ We analyse the diffraction result of optical field after Cosine zone plate, and theoretically deduce its transform matrix. Under some conditions, its diffraction distribution is a mixture of fractional Fourier spectra. Then we use Cosine zone plate and its diffraction result to image encryption. Possible optical image encryption and decryption implementations are proposed, and some numerical simulation results are also provided.
A one-time pad encryption method combining full-phase image encryption and hiding
Li, Jiaosheng; Xiong, Jiaxiang; Zhang, Qinnan; Zhong, Liyun; Zhou, Yunfei; Li, Jun; Lu, Xiaoxu
2017-08-01
A one-time pad encryption method combining full-phase image encryption and hiding is proposed. Firstly, original images are encoded in the phase and encrypted by phase keys loaded on the phase-only liquid crystal spatial light modulator, where the phase keys can be distributed using a quantum key distribution method. Subsequently, a host image is introduced to produce a reference wave, and overlap with an object wave to form an interferogram. Finally, based on phase-shifting interferometry, we can achieve the above encrypted image hiding. Both the simulation and experiment research demonstrate the feasibility of the proposed method, meanwhile the key and the encrypted image can be changed randomly, so the proposed system reveals the high flexibility, anti-attack ability and can be used to implement the one-time pad to achieve absolute secure transmission with the quantum key distribution method. Moreover, system security will be improved due to the fact that encryption information hidden in the host image can be treated as background noise, which does not attract the attention of the attacker.
Efficient hierarchical identity based encryption scheme in the standard model over lattices
Institute of Scientific and Technical Information of China (English)
Feng-he WANG; Chun-xiao WANG; Zhen-hua LIU
2016-01-01
Using lattice basis delegation in a fi xed dimension, we propose an efficient lattice-based hierarchical identity based encryption (HIBE) scheme in the standard model whose public key size is only (dm2+mn) log q bits and whose message-ciphertext expansion factor is only log q, where d is the maximum hierarchical depth and (n,m,q) are public parameters. In our construction, a novel public key assignment rule is used to averagely assign one random and public matrix to two identity bits, which implies that d random public matrices are enough to build the proposed HIBE scheme in the standard model, compared with the case in which 2d such public matrices are needed in the scheme proposed at Crypto 2010 whose public key size is (2dm2+mn+m) log q. To reduce the message-ciphertext expansion factor of the proposed scheme to log q, the encryption algorithm of this scheme is built based on Gentry’s encryption scheme, by which m2 bits of plaintext are encrypted into m2 log q bits of ciphertext by a one time encryption operation. Hence, the presented scheme has some advantages with respect to not only the public key size but also the message-ciphertext expansion factor. Based on the hardness of the learning with errors problem, we demonstrate that the scheme is secure under selective identity and chosen plaintext attacks.
Shannon Entropy based Randomness Measurement and Test for Image Encryption
Wu, Yue; Agaian, Sos
2011-01-01
The quality of image encryption is commonly measured by the Shannon entropy over the ciphertext image. However, this measurement does not consider to the randomness of local image blocks and is inappropriate for scrambling based image encryption methods. In this paper, a new information entropy-based randomness measurement for image encryption is introduced which, for the first time, answers the question of whether a given ciphertext image is sufficiently random-like. It measures the randomness over the ciphertext in a fairer way by calculating the averaged entropy of a series of small image blocks within the entire test image. In order to fulfill both quantitative and qualitative measurement, the expectation and the variance of this averaged block entropy for a true-random image are strictly derived and corresponding numerical reference tables are also provided. Moreover, a hypothesis test at significance?-level is given to help accept or reject the hypothesis that the test image is ideally encrypted/random-...
Optical double image encryption employing a pseudo image technique in the Fourier domain
Guo, Changliang; Liu, Shi; Sheridan, John T.
2014-06-01
A novel optical encryption method is proposed involving double image encryption in which one image is introduced as the pseudo image while the other is the original object image. The Double Random Phase Encoding technique is used to encrypt both the pseudo and object images into complex images. A unique binary image is then employed to first generate the random phase key for the object image encryption and then to embed the encrypted object image into the encrypted pseudo image, which acts as host image. Both the second random phase mask used for encoding the pseudo image and the binary image act as encryption keys. If an attacker attempts to crack the random phase key and decrypt the original object image, the pseudo image will be obtained instead. Simulation results and robustness tests are performed which demonstrate the feasibility of the algorithm.
Chaos-Based Image Encryption Algorithm Using Decomposition
Directory of Open Access Journals (Sweden)
Xiuli Song
2013-07-01
Full Text Available The proposed chaos-based image encryption algorithm consists of four stages: decomposition, shuffle, diffusion and combination. Decomposition is that an original image is decomposed to components according to some rule. The purpose of the shuffle is to mask original organization of the pixels of the image, and the diffusion is to change their values. Combination is not necessary in the sender. To improve the efficiency, the parallel architecture is taken to process the shuffle and diffusion. To enhance the security of the algorithm, firstly, a permutation of the labels is designed. Secondly, two Logistic maps are used in diffusion stage to encrypt the components. One map encrypts the odd rows of the component and another map encrypts the even rows. Experiment results and security analysis demonstrate that the encryption algorithm not only is robust and flexible, but also can withstand common attacks such as statistical attacks and differential attacks.
Image encryption using eight dimensional chaotic cat map
Ganesan, K.; Murali, K.
2014-06-01
In recent years, a large number of discrete chaotic cryptographic algorithms have been proposed. However, most of them encounter some problems such as lack of robustness and security. In this paper, we introduce a new image encryption algorithm based on eight-dimensional (nonlinear) chaotic cat map. Encryption of image is different from that of texts due to some intrinsic features of image such as bulk data capacity and high redundancy, which are generally difficult to handle by traditional methods. In traditional methods the key space is small and the security is weak. The proposed algorithm tries to address these problems and also tries to enhance the encryption speed. In this paper an eight dimensional chaotic cat map is used to encrypt the intensity values of pixels using lookup table method thereby significantly increasing the speed and security of encryption. The proposed algorithm is found to be resistive against chosen/known-plaintext attacks, statistical and differential attacks.
Chaotic Image Encryption with Random Shuffling of Data
Directory of Open Access Journals (Sweden)
Murat Aydos
2014-02-01
Full Text Available Security of valuable multimedia contents such as images in personal photograph albums, electronic publishing, frames of multicast video conference can be achieved by image encryption. Secure transmission of these contents is required to be rapid, efficient and practical. Hence, image encryption process must be chosen not only to satisfy the security goals but also to fulfill these requirements. Due to the inadequacy and inefficiency of conventional text based information encryption methods, researchers have proposed several encryption schemes. Many of them are based on chaotic algorithms. Recently, the studies are concentrated on some weaknesses of chaotic algorithms and most of the presented solutions came up with complex structured chaotic maps. In this paper, we present a self-diagonal shuffler mechanism embedded to one dimensional chaotic encryption system to overcome its leak points while keeping simplicity and efficiency properties.
Chaotic Image Encryption with Random Shuffling of Data
Directory of Open Access Journals (Sweden)
Murat Aydos
2014-02-01
Full Text Available Security of valuable multimedia contents such as images in personal photograph albums, electronic publishing, frames of multicast video conference can be achieved by image encryption. Secure transmission of these contents is required to be rapid, efficient and practical. Hence, image encryption process must be chosen not only to satisfy the security goals but also to fulfill these requirements. Due to the inadequacy and inefficiency of conventional text based information encryption methods, researchers have proposed several encryption schemes. Many of them are based on chaotic algorithms. Recently, the studies are concentrated on some weaknesses of chaotic algorithms and most of the presented solutions came up with complex structured chaotic maps. In this paper, we present a self-diagonal shuffler mechanism embedded to one dimensional chaotic encryption system to overcome its leak points while keeping simplicity and efficiency properties.
Multiple image encryption and watermarking by random phase matching
He, M. Z.; Cai, L. Z.; Liu, Q.; Wang, X. C.; Meng, X. F.
2005-03-01
Usually a set of transmitted patterns can realize encryption and/or watermarking just for one hidden image. In this paper, we propose a novel method of multiple image encryption and watermarking by random phase matching, which can encrypt and then decrypt more than one image with the same set of transmitted patterns based on the idea of double phase encoding and the wave field superposition. The principle and procedure of this method are explained. A series of computer simulations with phase-shifting interferometry have shown that two or four independent images can be encrypted and decrypted without or with watermarking successfully with one set of composite interferograms. The ability of this method to retrieve hidden image(s) from part of the transmitted patterns has also been verified. This technique can considerably raise the efficiency of data transmission, and it is particularly suitable for the image transmission via Internet.
Fractional Fourier Transform Applied to Digital Images Encryption
Vilardy, Juan M.; Torres, Cesar O.; Mattos, Lorenzo
2008-04-01
In the present paper a digital algorithm was developed to make phase encryption of digital indexed images to color using the fractional Fourier transform (the images in RGB are converted to indexed before to encrypt). The indexed images are represented by a matrix of M×N pixels (where M defines the height and N is the Width of the image) and a color map (it's a matrix of C×3 elements, where C indicates the colors number of the image and the number 3 indicates the three columns associated with the color components: Red, Green and Blue of each pixel of the matrix of M×N) associated to the matrix of pixels to suitably represent the color information of the image. The indexed image (matrix of M×N pixels) to encrypt is placed as the phase of a complex exponential, then is transformed three times and multiplied in intermediate steps by two random phase masks statistically independent thus to obtain the encrypted image, for decrypt the coding image the encryption procedure is applied in the inverse sense to the conjugated complex of the encrypted image, then is taken the negative of the phase of the resulting function of the decryption process and the original image is obtained this way that had been encrypted; For the color map equal procedure is applied in the encryption/decryption process described previously for the matrix of M×N pixels. In the implemented cryptographic algorithm five keys are used, constituted by three fractional orders and two random phase masks, all these keys are necessary for a correct decryption providing a dependability to the transference of images by means of the communications nets.
Cryptanalysis of Chatterjee-Sarkar Hierarchical Identity-Based Encryption Scheme at PKC 06
Park, Jong Hwan; Lee, Dong Hoon
In 2006, Chatterjee and Sarkar proposed a hierarchical identity-based encryption (HIBE) scheme which can support an unbounded number of identity levels. This property is particularly useful in providing forward secrecy by embedding time components within hierarchical identities. In this paper we show that their scheme does not provide the claimed property. Our analysis shows that if the number of identity levels becomes larger than the value of a fixed public parameter, an unintended receiver can reconstruct a new valid ciphertext and decrypt the ciphertext using his or her own private key. The analysis is similarly applied to a multi-receiver identity-based encryption scheme presented as an application of Chatterjee and Sarkar's HIBE scheme.
Image Encryption Algorithm Based on Chaotic Economic Model
Directory of Open Access Journals (Sweden)
S. S. Askar
2015-01-01
Full Text Available In literature, chaotic economic systems have got much attention because of their complex dynamic behaviors such as bifurcation and chaos. Recently, a few researches on the usage of these systems in cryptographic algorithms have been conducted. In this paper, a new image encryption algorithm based on a chaotic economic map is proposed. An implementation of the proposed algorithm on a plain image based on the chaotic map is performed. The obtained results show that the proposed algorithm can successfully encrypt and decrypt the images with the same security keys. The security analysis is encouraging and shows that the encrypted images have good information entropy and very low correlation coefficients and the distribution of the gray values of the encrypted image has random-like behavior.
Directory of Open Access Journals (Sweden)
Priya Jambhulkar
2015-11-01
Full Text Available Digital image and information embedding system have number of important multimedia applications. Recently, attention is paid to reversible data hiding (RDH in encrypted images is more, since it maintains the excellent property that the original cover can be lossless recovered after embedded data is extracted while protecting the image content’s confidentiality. RDH is a technique used to hide data inside image for high security in such a way that original data is not visible. All previous methods embed data by reversibly vacating room from the encrypted images, which may be subject to some errors on data extraction and/or image restoration. In this paper, we propose another method in which we simply encrypt an image without its header by using our own algorithm. And thus it is easy for the data hider to reversibly embed data in the encrypted image. The proposed method can achieve real reversibility, that is, data extraction and image recovery are free of any error.
Image Encryption Based on Diffusion and Multiple Chaotic Maps
Sathishkumar, G A; Sriraam, Dr N; 10.5121/ijnsa.2011.3214
2011-01-01
In the recent world, security is a prime important issue, and encryption is one of the best alternative way to ensure security. More over, there are many image encryption schemes have been proposed, each one of them has its own strength and weakness. This paper presents a new algorithm for the image encryption/decryption scheme. This paper is devoted to provide a secured image encryption technique using multiple chaotic based circular mapping. In this paper, first, a pair of sub keys is given by using chaotic logistic maps. Second, the image is encrypted using logistic map sub key and in its transformation leads to diffusion process. Third, sub keys are generated by four different chaotic maps. Based on the initial conditions, each map may produce various random numbers from various orbits of the maps. Among those random numbers, a particular number and from a particular orbit are selected as a key for the encryption algorithm. Based on the key, a binary sequence is generated to control the encryption algorit...
A novel image encryption algorithm based on DNA subsequence operation.
Zhang, Qiang; Xue, Xianglian; Wei, Xiaopeng
2012-01-01
We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.
A Novel Image Encryption Algorithm Based on DNA Subsequence Operation
Zhang, Qiang; Xue, Xianglian; Wei, Xiaopeng
2012-01-01
We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc.) combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack. PMID:23093912
A Novel Image Encryption Algorithm Based on DNA Subsequence Operation
Directory of Open Access Journals (Sweden)
Qiang Zhang
2012-01-01
Full Text Available We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc. combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.
Color image encryption based on Coupled Nonlinear Chaotic Map
Energy Technology Data Exchange (ETDEWEB)
Mazloom, Sahar [Faculty of Electrical, Computer and IT Engineering, Qazvin Islamic Azad University, Qazvin (Iran, Islamic Republic of)], E-mail: sahar.mazloom@gmail.com; Eftekhari-Moghadam, Amir Masud [Faculty of Electrical, Computer and IT Engineering, Qazvin Islamic Azad University, Qazvin (Iran, Islamic Republic of)], E-mail: eftekhari@qazviniau.ac.ir
2009-11-15
Image encryption is somehow different from text encryption due to some inherent features of image such as bulk data capacity and high correlation among pixels, which are generally difficult to handle by conventional methods. The desirable cryptographic properties of the chaotic maps such as sensitivity to initial conditions and random-like behavior have attracted the attention of cryptographers to develop new encryption algorithms. Therefore, recent researches of image encryption algorithms have been increasingly based on chaotic systems, though the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. This paper proposes a Coupled Nonlinear Chaotic Map, called CNCM, and a novel chaos-based image encryption algorithm to encrypt color images by using CNCM. The chaotic cryptography technique which used in this paper is a symmetric key cryptography with a stream cipher structure. In order to increase the security of the proposed algorithm, 240 bit-long secret key is used to generate the initial conditions and parameters of the chaotic map by making some algebraic transformations to the key. These transformations as well as the nonlinearity and coupling structure of the CNCM have enhanced the cryptosystem security. For getting higher security and higher complexity, the current paper employs the image size and color components to cryptosystem, thereby significantly increasing the resistance to known/chosen-plaintext attacks. The results of several experimental, statistical analysis and key sensitivity tests show that the proposed image encryption scheme provides an efficient and secure way for real-time image encryption and transmission.
Chaotic Image Encryption Design Using Tompkins-Paige Algorithm
Directory of Open Access Journals (Sweden)
Shahram Etemadi Borujeni
2009-01-01
Full Text Available In this paper, we have presented a new permutation-substitution image encryption architecture using chaotic maps and Tompkins-Paige algorithm. The proposed encryption system includes two major parts, chaotic pixels permutation and chaotic pixels substitution. A logistic map is used to generate a bit sequence, which is used to generate pseudorandom numbers in Tompkins-Paige algorithm, in 2D permutation phase. Pixel substitution phase includes two process, the tent pseudorandom image (TPRI generator and modulo addition operation. All parts of the proposed chaotic encryption system are simulated. Uniformity of the histogram of the proposed encrypted image is justified using the chi-square test, which is less than 2(255, 0.05. The vertical, horizontal, and diagonal correlation coefficients, as well as their average and RMS values for the proposed encrypted image are calculated that is about 13% less than previous researches. To quantify the difference between the encrypted image and the corresponding plain-image, three measures are used. These are MAE, NPCR, and UACI, which are improved in our proposed system considerably. NPCR of our proposed system is exactly the ideal value of this criterion. The key space of our proposed method is large enough to protect the system against any Brute-force and statistical attacks.
Hardware Realization of Chaos Based Symmetric Image Encryption
Barakat, Mohamed L.
2012-06-01
This thesis presents a novel work on hardware realization of symmetric image encryption utilizing chaos based continuous systems as pseudo random number generators. Digital implementation of chaotic systems results in serious degradations in the dynamics of the system. Such defects are illuminated through a new technique of generalized post proceeding with very low hardware cost. The thesis further discusses two encryption algorithms designed and implemented as a block cipher and a stream cipher. The security of both systems is thoroughly analyzed and the performance is compared with other reported systems showing a superior results. Both systems are realized on Xilinx Vetrix-4 FPGA with a hardware and throughput performance surpassing known encryption systems.
Design and Implementation of Image Encryption Algorithm Using Chaos
Directory of Open Access Journals (Sweden)
Sandhya Rani M.H.
2014-06-01
Full Text Available Images are widely used in diverse areas such as medical, military, science, engineering, art, advertising, entertainment, education as well as training, increasing the use of digital techniques for transmitting and storing images. So maintaining the confidentiality and integrity of images has become a major concern. This makes encryption necessary. The pixel values of neighbouring pixels in a plain image are strongly correlated. The proposed algorithm breaks this correlation increasing the entropy. Correlation is reduced by changing the pixel position this which is called confusion. Histogram is equalized by changing the pixel value this which is called diffusion. The proposed method of encryption algorithm is based on chaos theory. The plain-image is divided into blocks and then performs three levels of shuffling using different chaotic maps. In the first level the pixels within the block are shuffled. In the second level the blocks are shuffled and in the third level all the pixels in an image are shuffled. Finally the shuffled image is diffused using a chaotic sequence generated using symmetric keys, to produce the ciphered image for transmission. The experimental result demonstrates that the proposed algorithm can be used successfully to encrypt/decrypt the images with the secret keys. The analysis of the algorithm also shows that the algorithm gives larger key space and a high key sensitivity. The encrypted image has good encryption effect, information entropy and low correlation coefficient.
Image Encryption based on the RGB PIXEL Transposition and Shuffling
Directory of Open Access Journals (Sweden)
Quist Aphetsi Kester
2013-06-01
Full Text Available Privacy is one of the key issues information Security addresses. Through encryption one can prevent a third party from understanding raw data during signal transmission. The encryption methods for enhancing the security of digital contents has gained high significance in the current era of breach of security and misuse of the confidential information intercepted and misused by the unauthorized parties. This paper sets out to contribute to the general body of knowledge in the area of cryptography application and by developing a cipher algorithm for image encryption of m*n size by shuffling the RGB pixel values. The algorithm ultimately makes it possible for encryption and decryption of the images based on the RGB pixel. The algorithm was implemented using MATLAB.
Image encryption techniques based on the fractional Fourier transform
Hennelly, B. M.; Sheridan, J. T.
2003-11-01
The fractional Fourier transform, (FRT), is a generalisation of the Fourier transform which allows domains of mixed spatial frequency and spatial information to be examined. A number of method have recently been proposed in the literature for the encryption of two dimensional information using optical systems based on the FRT. Typically, these methods require random phase screen keys to decrypt the data, which must be stored at the receiver and must be carefully aligned with the received encrypted data. We have proposed a new technique based on a random shifting or Jigsaw transformation. This method does not require the use of phase keys. The image is encrypted by juxtaposition of sections of the image in various FRT domains. The new method has been compared numerically with existing methods and shows comparable or superior robustness to blind decryption. An optical implementation is also proposed and the sensitivity of the various encryption keys to blind decryption is quantified. We also present a second image encryption technique, which is based on a recently proposed method of optical phase retrieval using the optical FRT and one of its discrete counterparts. Numerical simulations of the new algorithm indicates that the sensitivity of the keys is much greater than any of the techniques currently available. In fact the sensitivity appears to be so high that optical implementation, based on existing optical signal processing technology, may be impossible. However, the technique has been shown to be a powerful method of 2-D image data encryption.
Asymmetric color image encryption based on singular value decomposition
Yao, Lili; Yuan, Caojin; Qiang, Junjie; Feng, Shaotong; Nie, Shouping
2017-02-01
A novel asymmetric color image encryption approach by using singular value decomposition (SVD) is proposed. The original color image is encrypted into a ciphertext shown as an indexed image by using the proposed method. The red, green and blue components of the color image are subsequently encoded into a complex function which is then separated into U, S and V parts by SVD. The data matrix of the ciphertext is obtained by multiplying orthogonal matrices U and V while implementing phase-truncation. Diagonal entries of the three diagonal matrices of the SVD results are abstracted and scrambling combined to construct the colormap of the ciphertext. Thus, the encrypted indexed image covers less space than the original image. For decryption, the original color image cannot be recovered without private keys which are obtained from phase-truncation and the orthogonality of V. Computer simulations are presented to evaluate the performance of the proposed algorithm. We also analyze the security of the proposed system.
Enforcing Access Control in Virtual Organizations Using Hierarchical Attribute-Based Encryption
Asim, Muhammad; Petkovic, Milan; Trivellato, Daniel; Zannone, Nicola
2012-01-01
Virtual organizations are dynamic, inter-organizational collaborations that involve systems and services belonging to different security domains. Several solutions have been proposed to guarantee the enforcement of the access control policies protecting the information exchanged in a distributed system, but none of them addresses the dynamicity characterizing virtual organizations. In this paper we propose a dynamic hierarchical attribute-based encryption (D-HABE) scheme that allows the institutions in a virtual organization to encrypt information according to an attribute-based policy in such a way that only users with the appropriate attributes can decrypt it. In addition, we introduce a key management scheme that determines which user is entitled to receive which attribute key from which domain authority.
Optical encryption using photon-counting polarimetric imaging.
Maluenda, David; Carnicer, Artur; Martínez-Herrero, Rosario; Juvells, Ignasi; Javidi, Bahram
2015-01-26
We present a polarimetric-based optical encoder for image encryption and verification. A system for generating random polarized vector keys based on a Mach-Zehnder configuration combined with translucent liquid crystal displays in each path of the interferometer is developed. Polarization information of the encrypted signal is retrieved by taking advantage of the information provided by the Stokes parameters. Moreover, photon-counting model is used in the encryption process which provides data sparseness and nonlinear transformation to enhance security. An authorized user with access to the polarization keys and the optical design variables can retrieve and validate the photon-counting plain-text. Optical experimental results demonstrate the feasibility of the encryption method.
An Asymmetric Image Encryption Based on Phase Truncated Hybrid Transform
Khurana, Mehak; Singh, Hukum
2017-09-01
To enhance the security of the system and to protect it from the attacker, this paper proposes a new asymmetric cryptosystem based on hybrid approach of Phase Truncated Fourier and Discrete Cosine Transform (PTFDCT) which adds non linearity by including cube and cube root operation in the encryption and decryption path respectively. In this cryptosystem random phase masks are used as encryption keys and phase masks generated after the cube operation in encryption process are reserved as decryption keys and cube root operation is required to decrypt image in decryption process. The cube and cube root operation introduced in the encryption and decryption path makes system resistant against standard attacks. The robustness of the proposed cryptosystem has been analysed and verified on the basis of various parameters by simulating on MATLAB 7.9.0 (R2008a). The experimental results are provided to highlight the effectiveness and suitability of the proposed cryptosystem and prove the system is secure.
Cryptanalysis of an image encryption algorithm based on DNA encoding
Akhavan, A.; Samsudin, A.; Akhshani, A.
2017-10-01
Recently an image encryption algorithm based on DNA encoding and the Elliptic Curve Cryptography (ECC) is proposed. This paper aims to investigate the security the DNA-based image encryption algorithm and its resistance against chosen plaintext attack. The results of the analysis demonstrate that security of the algorithm mainly relies on one static shuffling step, with a simple confusion operation. In this study, a practical plain image recovery method is proposed, and it is shown that the images encrypted with the same key could easily be recovered using the suggested cryptanalysis method with as low as two chosen plain images. Also, a strategy to improve the security of the algorithm is presented in this paper.
Optical image encryption using Kronecker product and hybrid phase masks
Kumar, Ravi; Bhaduri, Basanta
2017-10-01
In this paper, we propose a new technique for security enhancement in optical image encryption system. In this technique we have used the Kronecker product of two random matrices along with the double random phase encoding (DRPE) scheme in the Fresnel domain for optical image encryption. The phase masks used here are different than the random masks used in conventional DRPE scheme. These hybrid phase masks are generated by using the combination of random phase masks and a secondary image. For encryption, the input image is first randomized and then the DRPE in the Fresnel domain is performed using the hybrid phase masks. Secondly, the Kronecker product of two random matrices is multiplied with the DRPE output to get the final encoded image for transmission. The proposed technique consists of more unknown keys for enhanced security and robust against various attacks. The simulation results along with effects under various attacks are presented in support of the proposed technique.
Digital Image Encryption Algorithm Design Based on Genetic Hyperchaos
Directory of Open Access Journals (Sweden)
Jian Wang
2016-01-01
Full Text Available In view of the present chaotic image encryption algorithm based on scrambling (diffusion is vulnerable to choosing plaintext (ciphertext attack in the process of pixel position scrambling, we put forward a image encryption algorithm based on genetic super chaotic system. The algorithm, by introducing clear feedback to the process of scrambling, makes the scrambling effect related to the initial chaos sequence and the clear text itself; it has realized the image features and the organic fusion of encryption algorithm. By introduction in the process of diffusion to encrypt plaintext feedback mechanism, it improves sensitivity of plaintext, algorithm selection plaintext, and ciphertext attack resistance. At the same time, it also makes full use of the characteristics of image information. Finally, experimental simulation and theoretical analysis show that our proposed algorithm can not only effectively resist plaintext (ciphertext attack, statistical attack, and information entropy attack but also effectively improve the efficiency of image encryption, which is a relatively secure and effective way of image communication.
An Image Encryption Algorithm Based on Balanced Pixel and Chaotic Map
Directory of Open Access Journals (Sweden)
Jian Zhang
2014-01-01
Full Text Available Image encryption technology has been applied in many fields and is becoming the main way of protecting the image information security. There are also many ways of image encryption. However, the existing encryption algorithms, in order to obtain a better effect of encryption, always need encrypting several times. There is not an effective method to decide the number of encryption times, generally determined by the human eyes. The paper proposes an image encryption algorithm based on chaos and simultaneously proposes a balanced pixel algorithm to determine the times of image encryption. Many simulation experiments have been done including encryption effect and security analysis. Experimental results show that the proposed method is feasible and effective.
An image encryption algorithm utilizing julia sets and hilbert curves.
Sun, Yuanyuan; Chen, Lina; Xu, Rudan; Kong, Ruiqing
2014-01-01
Image encryption is an important and effective technique to protect image security. In this paper, a novel image encryption algorithm combining Julia sets and Hilbert curves is proposed. The algorithm utilizes Julia sets' parameters to generate a random sequence as the initial keys and gets the final encryption keys by scrambling the initial keys through the Hilbert curve. The final cipher image is obtained by modulo arithmetic and diffuse operation. In this method, it needs only a few parameters for the key generation, which greatly reduces the storage space. Moreover, because of the Julia sets' properties, such as infiniteness and chaotic characteristics, the keys have high sensitivity even to a tiny perturbation. The experimental results indicate that the algorithm has large key space, good statistical property, high sensitivity for the keys, and effective resistance to the chosen-plaintext attack.
A Simple Encryption Algorithm for Quantum Color Image
Li, Panchi; Zhao, Ya
2017-06-01
In this paper, a simple encryption scheme for quantum color image is proposed. Firstly, a color image is transformed into a quantum superposition state by employing NEQR (novel enhanced quantum representation), where the R,G,B values of every pixel in a 24-bit RGB true color image are represented by 24 single-qubit basic states, and each value has 8 qubits. Then, these 24 qubits are respectively transformed from a basic state into a balanced superposition state by employed the controlled rotation gates. At this time, the gray-scale values of R, G, B of every pixel are in a balanced superposition of 224 multi-qubits basic states. After measuring, the whole image is an uniform white noise, which does not provide any information. Decryption is the reverse process of encryption. The experimental results on the classical computer show that the proposed encryption scheme has better security.
Medical Image Encryption: An Application for Improved Padding Based GGH Encryption Algorithm.
Sokouti, Massoud; Zakerolhosseini, Ali; Sokouti, Babak
2016-01-01
Medical images are regarded as important and sensitive data in the medical informatics systems. For transferring medical images over an insecure network, developing a secure encryption algorithm is necessary. Among the three main properties of security services ( i.e. , confidentiality, integrity, and availability), the confidentiality is the most essential feature for exchanging medical images among physicians. The Goldreich Goldwasser Halevi (GGH) algorithm can be a good choice for encrypting medical images as both the algorithm and sensitive data are represented by numeric matrices. Additionally, the GGH algorithm does not increase the size of the image and hence, its complexity will remain as simple as O(n(2) ). However, one of the disadvantages of using the GGH algorithm is the Chosen Cipher Text attack. In our strategy, this shortcoming of GGH algorithm has been taken in to consideration and has been improved by applying the padding (i.e., snail tour XORing), before the GGH encryption process. For evaluating their performances, three measurement criteria are considered including (i) Number of Pixels Change Rate (NPCR), (ii) Unified Average Changing Intensity (UACI), and (iii) Avalanche effect. The results on three different sizes of images showed that padding GGH approach has improved UACI, NPCR, and Avalanche by almost 100%, 35%, and 45%, respectively, in comparison to the standard GGH algorithm. Also, the outcomes will make the padding GGH resist against the cipher text, the chosen cipher text, and the statistical attacks. Furthermore, increasing the avalanche effect of more than 50% is a promising achievement in comparison to the increased complexities of the proposed method in terms of encryption and decryption processes.
A bit-level image encryption algorithm based on spatiotemporal chaotic system and self-adaptive
Teng, Lin; Wang, Xingyuan
2012-09-01
This paper proposes a bit-level image encryption algorithm based on spatiotemporal chaotic system which is self-adaptive. We use a bit-level encryption scheme to reduce the volume of data during encryption and decryption in order to reduce the execution time. We also use the adaptive encryption scheme to make the ciphered image dependent on the plain image to improve performance. Simulation results show that the performance and security of the proposed encryption algorithm can encrypt plaintext effectively and resist various typical attacks.
Double-image encryption based on joint transform correlation and phase-shifting interferometry
Institute of Scientific and Technical Information of China (English)
Lina Shen; Jun Li; Hongsen Chang
2007-01-01
An image encryption method combining the joint transform correlator (JTC) architecture with phaseshifting interferometry to realize double random-phase encoding is proposed. The encrypted field and the decrypting key are registered as holograms by phase-shifting interferometry. This method can encrypt two images simultaneously to improve the encryption efficiency of the methods based on JTC architecture, and eliminate the system alignment constraint of the methods based on Mach-Zehnder interferometer (MZI)architecture. Its feasibility and validity are verified by computer simulations. Moreover, image encryption and decryption can be achieved at high speed optically or digitally. The encrypted data are suitable for Internet transmission.
Optical Image Encryption with Simplified Fractional Hartley Transform
Institute of Scientific and Technical Information of China (English)
LI Xin-Xin; ZHAO Dao-Mu
2008-01-01
We present a new method for image encryption on the basis of simplified fractional Hartley transform (SFRHT). SFRHT is a real transform as Hartley transform (HT) and furthermore, superior to HT in virtue of the advantage that it can also append fractional orders as additional keys for the purpose of improving the system security to some extent. With this method, one can encrypt an image with an intensity-only medium such as a photographic film or a CCD camera by spatially incoherent or coherent illumination. The optical realization is then proposed and computer simulations are also performed to verify the feasibility of this method.
Image encryption based on new Beta chaotic maps
Zahmoul, Rim; Ejbali, Ridha; Zaied, Mourad
2017-09-01
In this paper, we created new chaotic maps based on Beta function. The use of these maps is to generate chaotic sequences. Those sequences were used in the encryption scheme. The proposed process is divided into three stages: Permutation, Diffusion and Substitution. The generation of different pseudo random sequences was carried out to shuffle the position of the image pixels and to confuse the relationship between the encrypted the original image, so that significantly increasing the resistance to attacks. The acquired results of the different types of analysis indicate that the proposed method has high sensitivity and security compared to previous schemes.
Image encryption using random sequence generated from generalized information domain
Xia-Yan, Zhang; Guo-Ji, Zhang; Xuan, Li; Ya-Zhou, Ren; Jie-Hua, Wu
2016-05-01
A novel image encryption method based on the random sequence generated from the generalized information domain and permutation-diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security.
Color image encryption based on gyrator transform and Arnold transform
Sui, Liansheng; Gao, Bo
2013-06-01
A color image encryption scheme using gyrator transform and Arnold transform is proposed, which has two security levels. In the first level, the color image is separated into three components: red, green and blue, which are normalized and scrambled using the Arnold transform. The green component is combined with the first random phase mask and transformed to an interim using the gyrator transform. The first random phase mask is generated with the sum of the blue component and a logistic map. Similarly, the red component is combined with the second random phase mask and transformed to three-channel-related data. The second random phase mask is generated with the sum of the phase of the interim and an asymmetrical tent map. In the second level, the three-channel-related data are scrambled again and combined with the third random phase mask generated with the sum of the previous chaotic maps, and then encrypted into a gray scale ciphertext. The encryption result has stationary white noise distribution and camouflage property to some extent. In the process of encryption and decryption, the rotation angle of gyrator transform, the iterative numbers of Arnold transform, the parameters of the chaotic map and generated accompanied phase function serve as encryption keys, and hence enhance the security of the system. Simulation results and security analysis are presented to confirm the security, validity and feasibility of the proposed scheme.
Multiple-image encryption algorithm based on mixed image element and permutation
Zhang, Xiaoqiang; Wang, Xuesong
2017-05-01
To improve encryption efficiency and facilitate the secure transmission of multiple digital images, by defining the pure image element and mixed image element, this paper presents a new multiple-image encryption (MIE) algorithm based on the mixed image element and permutation, which can simultaneously encrypt any number of images. Firstly, segment the original images into pure image elements; secondly, scramble all the pure image elements with the permutation generated by the piecewise linear chaotic map (PWLCM) system; thirdly, combine mixed image elements into scrambled images; finally, diffuse the content of mixed image elements by performing the exclusive OR (XOR) operation among scrambled images and the chaotic image generated by another PWLCM system. The comparison with two similar algorithms is made. Experimental results and algorithm analyses show that the proposed MIE algorithm is very simple and efficient, which is suitable for practical image encryption.
Optical asymmetric image encryption using gyrator wavelet transform
Mehra, Isha; Nishchal, Naveen K.
2015-11-01
In this paper, we propose a new optical information processing tool termed as gyrator wavelet transform to secure a fully phase image, based on amplitude- and phase-truncation approach. The gyrator wavelet transform constitutes four basic parameters; gyrator transform order, type and level of mother wavelet, and position of different frequency bands. These parameters are used as encryption keys in addition to the random phase codes to the optical cryptosystem. This tool has also been applied for simultaneous compression and encryption of an image. The system's performance and its sensitivity to the encryption parameters, such as, gyrator transform order, and robustness has also been analyzed. It is expected that this tool will not only update current optical security systems, but may also shed some light on future developments. The computer simulation results demonstrate the abilities of the gyrator wavelet transform as an effective tool, which can be used in various optical information processing applications, including image encryption, and image compression. Also this tool can be applied for securing the color image, multispectral, and three-dimensional images.
Color image single-channel encryption based on tricolor grating theory
Institute of Scientific and Technical Information of China (English)
YUAN Qi-ping; YANG Xiao-ping; GAO Li-juan; ZHAI Hong-chen
2009-01-01
A method of color image single-channel encryption is proposed. The proposed method uses tricolor grating to encode a color image into a gray level image, then the gray level image is encrypted by double random phase encryption, so a color image is encrypted in a single-channel and its security is ensured. Computer simulations and the chromatic aberration analysis are given to prove the possibility of the proposed idea.The optical system is simpler and is easy to be applied into practice. The simulation results show that this method is efficiency to encrypt a color image, and it is robust.
Hybrid approach for Image Encryption Using SCAN Patterns and Carrier Images
T, Panduranga H
2010-01-01
We propose a hybrid technique for image encryption which employs the concept of carrier image and SCAN patterns generated by SCAN methodology. Although it involves existing method like SCAN methodology, the novelty of the work lies in hybridizing and carrier image creation for encryption. Here the carrier image is created with the help of alphanumeric keyword. Each alphanumeric key will be having a unique 8bit value generated by 4 out of 8-code. This newly generated carrier image is added with original image to obtain encrypted image. The scan methodology is applied to either original image or carrier image, after the addition of original image and carrier image to obtain highly distorted encrypted image. The resulting image is found to be more distorted in hybrid technique. By applying the reverse process we get the decrypted image.
A symmetrical image encryption scheme in wavelet and time domain
Luo, Yuling; Du, Minghui; Liu, Junxiu
2015-02-01
There has been an increasing concern for effective storages and secure transactions of multimedia information over the Internet. Then a great variety of encryption schemes have been proposed to ensure the information security while transmitting, but most of current approaches are designed to diffuse the data only in spatial domain which result in reducing storage efficiency. A lightweight image encryption strategy based on chaos is proposed in this paper. The encryption process is designed in transform domain. The original image is decomposed into approximation and detail components using integer wavelet transform (IWT); then as the more important component of the image, the approximation coefficients are diffused by secret keys generated from a spatiotemporal chaotic system followed by inverse IWT to construct the diffused image; finally a plain permutation is performed for diffusion image by the Logistic mapping in order to reduce the correlation between adjacent pixels further. Experimental results and performance analysis demonstrate the proposed scheme is an efficient, secure and robust encryption mechanism and it realizes effective coding compression to satisfy desirable storage.
IMAGE ENCRYPTION TECHNIQUES USING CHAOTIC SCHEMES: A REVIEW
Directory of Open Access Journals (Sweden)
Monisha Sharma
2010-06-01
Full Text Available Cryptography is about communication in the presence of an adversary. It encompasses many problems like encryption, authentication, and key distribution to name a few. The field of modern cryptography providesa theoretical foundation based on which one can understand what exactly these problems are, how to evaluate protocols that purport to solve them and how to build protocols in whose security one can haveconfidence. Advanced digital technologies have made multimedia data widely available. Recently, multimedia applications become common in practice and thus security of multimedia data has become main concern.The basic issues pertaining to the problem of encryption has been discussed and also a survey on image encryption techniques based on chaotic schemes has been dealt in the present communication.The chaotic image encryption can be developed by using properties of chaos including deterministic dynamics, unpredictable behavior and non-linear transform. This concept leads to techniques that can simultaneously provide security functions and an overall visualcheck, which might be suitable in some applications. Digital images are widely used in various applications, that include military, legal and medical systems and these applications need to control access toimages and provide the means to verify integrity of images.
Image encryption using the two-dimensional logistic chaotic map
Wu, Yue; Yang, Gelan; Jin, Huixia; Noonan, Joseph P.
2012-01-01
Chaos maps and chaotic systems have been proved to be useful and effective for cryptography. In our study, the two-dimensional logistic map with complicated basin structures and attractors are first used for image encryption. The proposed method adopts the classic framework of the permutation-substitution network in cryptography and thus ensures both confusion and diffusion properties for a secure cipher. The proposed method is able to encrypt an intelligible image into a random-like one from the statistical point of view and the human visual system point of view. Extensive simulation results using test images from the USC-SIPI image database demonstrate the effectiveness and robustness of the proposed method. Security analysis results of using both the conventional and the most recent tests show that the encryption quality of the proposed method reaches or excels the current state-of-the-art methods. Similar encryption ideas can be applied to digital data in other formats (e.g., digital audio and video). We also publish the cipher MATLAB open-source-code under the web page https://sites.google.com/site/tuftsyuewu/source-code.
Bouslimi, D; Coatrieux, G; Roux, Ch
2011-01-01
In this paper, we propose a new joint watermarking/encryption algorithm for the purpose of verifying the reliability of medical images in both encrypted and spatial domains. It combines a substitutive watermarking algorithm, the quantization index modulation (QIM), with a block cipher algorithm, the Advanced Encryption Standard (AES), in CBC mode of operation. The proposed solution gives access to the outcomes of the image integrity and of its origins even though the image is stored encrypted. Experimental results achieved on 8 bits encoded Ultrasound images illustrate the overall performances of the proposed scheme. By making use of the AES block cipher in CBC mode, the proposed solution is compliant with or transparent to the DICOM standard.
Automatic Hierarchical Color Image Classification
Directory of Open Access Journals (Sweden)
Jing Huang
2003-02-01
Full Text Available Organizing images into semantic categories can be extremely useful for content-based image retrieval and image annotation. Grouping images into semantic classes is a difficult problem, however. Image classification attempts to solve this hard problem by using low-level image features. In this paper, we propose a method for hierarchical classification of images via supervised learning. This scheme relies on using a good low-level feature and subsequently performing feature-space reconfiguration using singular value decomposition to reduce noise and dimensionality. We use the training data to obtain a hierarchical classification tree that can be used to categorize new images. Our experimental results suggest that this scheme not only performs better than standard nearest-neighbor techniques, but also has both storage and computational advantages.
Color image encryption scheme using CML and DNA sequence operations.
Wang, Xing-Yuan; Zhang, Hui-Li; Bao, Xue-Mei
2016-06-01
In this paper, an encryption algorithm for color images using chaotic system and DNA (Deoxyribonucleic acid) sequence operations is proposed. Three components for the color plain image is employed to construct a matrix, then perform confusion operation on the pixels matrix generated by the spatiotemporal chaos system, i.e., CML (coupled map lattice). DNA encoding rules, and decoding rules are introduced in the permutation phase. The extended Hamming distance is proposed to generate new initial values for CML iteration combining color plain image. Permute the rows and columns of the DNA matrix and then get the color cipher image from this matrix. Theoretical analysis and experimental results prove the cryptosystem secure and practical, and it is suitable for encrypting color images of any size. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
Shao, Zhuhong; Shu, Huazhong; Wu, Jiasong; Dong, Zhifang; Coatrieux, Gouenou; Coatrieux, Jean Louis
2014-03-10
This paper describes a novel algorithm to encrypt double color images into a single undistinguishable image in quaternion gyrator domain. By using an iterative phase retrieval algorithm, the phase masks used for encryption are obtained. Subsequently, the encrypted image is generated via cascaded quaternion gyrator transforms with different rotation angles. The parameters in quaternion gyrator transforms and phases serve as encryption keys. By knowing these keys, the original color images can be fully restituted. Numerical simulations have demonstrated the validity of the proposed encryption system as well as its robustness against loss of data and additive Gaussian noise.
Hu, Yiqun; Xie, Xinwen; Liu, Xingbin; Zhou, Nanrun
2017-07-01
A novel quantum multi-image encryption algorithm based on iteration Arnold transform with parameters and image correlation decomposition is proposed, and a quantum realization of the iteration Arnold transform with parameters is designed. The corresponding low frequency images are obtained by performing 2-D discrete wavelet transform on each image respectively, and then the corresponding low frequency images are spliced randomly to one image. The new image is scrambled by the iteration Arnold transform with parameters, and the gray-level information of the scrambled image is encoded by quantum image correlation decomposition. For the encryption algorithm, the keys are iterative times, added parameters, classical binary and orthonormal basis states. The key space, the security and the computational complexity are analyzed, and all of the analyses show that the proposed encryption algorithm could encrypt multiple images simultaneously with lower computational complexity compared with its classical counterparts.
Images Encryption Method using Steganographic LSB Method, AES and RSA algorithm
Moumen, Abdelkader; Sissaoui, Hocine
2017-03-01
Vulnerability of communication of digital images is an extremely important issue nowadays, particularly when the images are communicated through insecure channels. To improve communication security, many cryptosystems have been presented in the image encryption literature. This paper proposes a novel image encryption technique based on an algorithm that is faster than current methods. The proposed algorithm eliminates the step in which the secrete key is shared during the encryption process. It is formulated based on the symmetric encryption, asymmetric encryption and steganography theories. The image is encrypted using a symmetric algorithm, then, the secret key is encrypted by means of an asymmetrical algorithm and it is hidden in the ciphered image using a least significant bits steganographic scheme. The analysis results show that while enjoying the faster computation, our method performs close to optimal in terms of accuracy.
Image encryption using a synchronous permutation-diffusion technique
Enayatifar, Rasul; Abdullah, Abdul Hanan; Isnin, Ismail Fauzi; Altameem, Ayman; Lee, Malrey
2017-03-01
In the past decade, the interest on digital images security has been increased among scientists. A synchronous permutation and diffusion technique is designed in order to protect gray-level image content while sending it through internet. To implement the proposed method, two-dimensional plain-image is converted to one dimension. Afterward, in order to reduce the sending process time, permutation and diffusion steps for any pixel are performed in the same time. The permutation step uses chaotic map and deoxyribonucleic acid (DNA) to permute a pixel, while diffusion employs DNA sequence and DNA operator to encrypt the pixel. Experimental results and extensive security analyses have been conducted to demonstrate the feasibility and validity of this proposed image encryption method.
Chen, Wen; Chen, Xudong; Sheppard, Colin J R
2012-02-13
We propose a new method using coherent diffractive imaging for optical color-image encryption and synthesis in the Fresnel domain. An optical multiple-random-phase-mask encryption system is applied, and a strategy based on lateral translations of a phase-only mask is employed during image encryption. For the decryption, an iterative phase retrieval algorithm is applied to extract high-quality decrypted color images from diffraction intensity maps (i.e., ciphertexts). In addition, optical color-image synthesis is also investigated based on coherent diffractive imaging. Numerical results are presented to demonstrate feasibility and effectiveness of the proposed method. Compared with conventional interference methods, coherent diffractive imaging approach may open up a new research perspective or can provide an effective alternative for optical color-image encryption and synthesis.
A New Algorithm of Encryption and Decryption of Images Using Chaotic Mapping
Directory of Open Access Journals (Sweden)
Musheer Ahmad
2010-01-01
Full Text Available The combination of chaotic theory and cryptography forms an important field of information security. In the past decade, chaos based image encryption is given much attention in the research of information security and a lot of image encryption algorithms based on chaotic maps have been proposed. Due to some inherent features of images like bulk data capacity and high data redundancy, the encryption of images is different from that of texts; therefore it is difficult to handle them by traditional encryption methods. In this communication, a new image encryption algorithm based on three different chaotic maps is proposed. In the proposed algorithm, the plain-image is first decomposed into 8x8 size blocks and then the block based shuffling of image is carried out using 2D Cat map. Further, the control parameters of shuffling are randomly generated by employing 2D coupled Logistic map. After that the shuffled image is encrypted using chaotic sequence generated by one-dimensional Logistic map. The experimental results show that the proposed algorithm can successfully encrypt/decrypt the images with same secret keys, and the algorithm has good encryption effect, large key space and high sensitivity to a small change in secret keys. Moreover, the simulation analysis also demonstrates that the encrypted images have good information entropy, very low correlation coefficients and the distribution of gray values of an encrypted image has random-like behavior.
DWT versus WP Based Optical Color Image Encryption Robust to Composite Attacks
Mohamed, M.A.; Ahmed Shaaban Samrah; Mohamed Ismail Fath Allah
2017-01-01
Intensive studies have been done to get robust encryption algorithms. Due to the importance of image information, optical encryption has played a vital role in information security. Many optical encryption schemes have been proposed but most of them suffer from poor robustness. In this paper six proposed algorithms will be presented for optical encryption to be robust to severe attacks: composite attack. Three of these approaches are based on one level Discrete Wavelet Transform (DWT) and the...
Encryption of color images using MSVD in DCST domain
Kumar, Manoj; Vaish, Ankita
2017-01-01
In this paper, a new image encryption and decryption algorithm based on Multiresolution Singular Value Decomposition (MSVD) and Discrete Cosine Stockwell Transform (DCST) is proposed. An original image is first transformed in DCST domain and then decomposed into four subbands using MSVD, all the four subbands are further decomposed into four subimages according to their indexing and masked by the parameters generated by MSVD. We have used number of bands of DCST, arrangement of MSVD subbands, arrangement of various subimages obtained from MSVD subbands, values and arrangement of a 4×4 matrix generated by MSVD and the arrangement of masked subimages as encryption and decryption keys. To ensure the correct decryption of encrypted image, it is indeed necessary to have correct knowledge of all keys in correct order along with their exact values. If all the keys are correct but a single key is wrong even though it would be almost impossible to guess the original image. The efficiency of proposed algorithm is evaluated by comparing it with some recent published works and it is evident from the experimental results and analysis that the proposed algorithm can transmit the images more securely and efficiently over the network.
Vector Quantization Techniques For Partial Encryption of Wavelet-based Compressed Digital Images
Directory of Open Access Journals (Sweden)
H. A. Younis
2009-01-01
Full Text Available The use of image communication has increased in recent years. In this paper, newpartial encryption schemes are used to encrypt only part of the compressed data. Only6.25-25% of the original data is encrypted for four different images, resulting in asignificant reduction in encryption and decryption time. In the compression step, anadvanced clustering analysis technique (Fuzzy C-means (FCM is used. In the encryptionstep, the permutation cipher is used. The effect of number of different clusters is studied.The proposed partial encryption schemes are fast and secure, and do not reduce thecompression performance of the underlying selected compression methods as shown inexperimental results and conclusion.
An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm
Directory of Open Access Journals (Sweden)
Yuping Hu
2014-01-01
Full Text Available An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack.
An image encryption scheme based on quantum logistic map
Akhshani, A.; Akhavan, A.; Lim, S.-C.; Hassan, Z.
2012-12-01
The topic of quantum chaos has begun to draw increasing attention in recent years. While a satisfactory definition for it is not settled yet in order to differentiate between its classical counterparts. Dissipative quantum maps can be characterized by sensitive dependence on initial conditions, like classical maps. Considering this property, an implementation of image encryption scheme based on the quantum logistic map is proposed. The security and performance analysis of the proposed image encryption is performed using well-known methods. The results of the reliability analysis are encouraging and it can be concluded that, the proposed scheme is efficient and secure. The results of this study also suggest application of other quantum maps such as quantum standard map and quantum baker map in cryptography and other aspects of security and privacy.
An Improved Piecewise Linear Chaotic Map Based Image Encryption Algorithm
Hu, Yuping; Wang, Zhijian
2014-01-01
An image encryption algorithm based on improved piecewise linear chaotic map (MPWLCM) model was proposed. The algorithm uses the MPWLCM to permute and diffuse plain image simultaneously. Due to the sensitivity to initial key values, system parameters, and ergodicity in chaotic system, two pseudorandom sequences are designed and used in the processes of permutation and diffusion. The order of processing pixels is not in accordance with the index of pixels, but it is from beginning or end alternately. The cipher feedback was introduced in diffusion process. Test results and security analysis show that not only the scheme can achieve good encryption results but also its key space is large enough to resist against brute attack. PMID:24592159
A new color image encryption scheme using CML and a fractional-order chaotic system.
Directory of Open Access Journals (Sweden)
Xiangjun Wu
Full Text Available The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks.
A new color image encryption scheme using CML and a fractional-order chaotic system.
Wu, Xiangjun; Li, Yang; Kurths, Jürgen
2015-01-01
The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks.
Reversible Integer Wavelet Transform for the Joint of Image Encryption and Watermarking
Directory of Open Access Journals (Sweden)
Bin Wang
2015-01-01
Full Text Available In recent years, signal processing in the encrypted domain has attracted considerable research interest, especially embedding watermarking in encrypted image. In this work, a novel joint of image encryption and watermarking based on reversible integer wavelet transform is proposed. Firstly, the plain-image is encrypted by chaotic maps and reversible integer wavelet transform. Then the lossless watermarking is embedded in the encrypted image by reversible integer wavelet transform and histogram modification. Finally an encrypted image containing watermarking is obtained by the inverse integer wavelet transform. What is more, the original image and watermarking can be completely recovered by inverse process. Numerical experimental results and comparing with previous works show that the proposed scheme possesses higher security and embedding capacity than previous works. It is suitable for protecting the image information.
Analyzing the Efficiency of Text-to-Image Encryption Algorithm
Directory of Open Access Journals (Sweden)
Ahmad Abusukhon
2012-12-01
Full Text Available Today many of the activities are performed online through the Internet. One of the methods used to protect the data while sending it through the Internet is cryptography. In a previous work we proposed the Text-to-Image Encryption algorithm (TTIE as a novel algorithm for network security. In this paper we investigate the efficiency of (TTIE for large scale collection.
Hardware realization of chaos based block cipher for image encryption
Barakat, Mohamed L.
2011-12-01
Unlike stream ciphers, block ciphers are very essential for parallel processing applications. In this paper, the first hardware realization of chaotic-based block cipher is proposed for image encryption applications. The proposed system is tested for known cryptanalysis attacks and for different block sizes. When implemented on Virtex-IV, system performance showed high throughput and utilized small area. Passing successfully in all tests, our system proved to be secure with all block sizes. © 2011 IEEE.
Qin, Yi; Wang, Zhipeng; Gong, Qiong
2014-07-01
In this paper, we propose a novel method for image encryption by employing the diffraction imaging technique. This method is in principle suitable for most diffractive-imaging-based optical encryption schemes, and a typical diffractive imaging architecture using three random phase masks in the Fresnel domain is taken for an example to illustrate it. The encryption process is rather simple because only a single diffraction intensity pattern is needed to be recorded, and the decryption procedure is also correspondingly simplified. To achieve this goal, redundant data are digitally appended to the primary image before a standard encrypting procedure. The redundant data serve as a partial input plane support constraint in a phase retrieval algorithm, which is employed for completely retrieving the plaintext. Simulation results are presented to verify the validity of the proposed approach.
Optical image encryption in Fresnel domain using spiral phase transform
Kumar, Ravi; Bhaduri, Basanta
2017-09-01
In this study, we propose a new nonlinear optical image encryption technique using spiral phase transform (SPT). First, the primary image is phase encoded and multiplied with a random amplitude mask (RAM), and using power function, the product is then powered to m. This powered output is Fresnel propagated with distance z 1 and then modulated with a random phase mask (RPM). The modulated image is further Fresnel propagated with distance z 2. Similarly, a security image is also modulated with another RAM and then Fresnel propagated with distance z 3. Next, the two modulated images after Fresnel propagations, are interfered and further Fresnel propagated with distance z 4 to get a complex image. Finally, this complex image is SPT with particular spiral phase function (SPF), to get the final encrypted image for transmission. In the proposed technique, the security keys are Fresnel propagation distances, the security image, RPM, RAMs, power order, m, and order of SPF, q. Numerical simulation results confirm the validity and effectiveness of the proposed technique. The proposed technique is robust against noise and brutal force attacks.
Sharma, K. K.; Jain, Heena
2013-01-01
The security of digital data including images has attracted more attention recently, and many different image encryption methods have been proposed in the literature for this purpose. In this paper, a new image encryption method using wavelet packet decomposition and discrete linear canonical transform is proposed. The use of wavelet packet decomposition and DLCT increases the key size significantly making the encryption more robust. Simulation results of the proposed technique are also presented.
A chaos-based image encryption algorithm using alternate structure
Institute of Scientific and Technical Information of China (English)
ZHANG YiWei; WANG YuMin; SHEN XuBang
2007-01-01
Combined with two chaotic maps, a novel alternate structure is applied to image cryptosystem. In proposed algorithm, a general cat-map is used for permutation and diffusion, as well as the OCML (one-way coupled map lattice), which is applied for substitution. These two methods are operated alternately in every round of encryption process, where two subkeys employed in different chaotic maps are generated through the masterkey spreading. Decryption has the same structure with the encryption algorithm, but the masterkey in each round should be reversely ordered in decryption. The cryptanalysis shows that the proposed algorithm bears good immunities to many forms of attacks. Moreover, the algorithm features high execution speed and compact program, which is suitable for various software and hardware applications.
A novel image compression-encryption hybrid algorithm based on the analysis sparse representation
Zhang, Ye; Xu, Biao; Zhou, Nanrun
2017-06-01
Recent advances on the compressive sensing theory were invoked for image compression-encryption based on the synthesis sparse model. In this paper we concentrate on an alternative sparse representation model, i.e., the analysis sparse model, to propose a novel image compression-encryption hybrid algorithm. The analysis sparse representation of the original image is obtained with an overcomplete fixed dictionary that the order of the dictionary atoms is scrambled, and the sparse representation can be considered as an encrypted version of the image. Moreover, the sparse representation is compressed to reduce its dimension and re-encrypted by the compressive sensing simultaneously. To enhance the security of the algorithm, a pixel-scrambling method is employed to re-encrypt the measurements of the compressive sensing. Various simulation results verify that the proposed image compression-encryption hybrid algorithm could provide a considerable compression performance with a good security.
A novel color image encryption scheme using alternate chaotic mapping structure
Wang, Xingyuan; Zhao, Yuanyuan; Zhang, Huili; Guo, Kang
2016-07-01
This paper proposes an color image encryption algorithm using alternate chaotic mapping structure. Initially, we use the R, G and B components to form a matrix. Then one-dimension logistic and two-dimension logistic mapping is used to generate a chaotic matrix, then iterate two chaotic mappings alternately to permute the matrix. For every iteration, XOR operation is adopted to encrypt plain-image matrix, then make further transformation to diffuse the matrix. At last, the encrypted color image is obtained from the confused matrix. Theoretical analysis and experimental results has proved the cryptosystem is secure and practical, and it is suitable for encrypting color images.
IMAGE ENCRYPTION ALGORITHM USING TWO-DIMENSIONAL CHAOTIC MAPS
Directory of Open Access Journals (Sweden)
A. V. Sidorenko
2016-01-01
Full Text Available A new image encryption algorithm based on dynamic chaos is proposed. The encryption is performed using the modified element permutation procedure. The element value changing procedure is carried with regard to the performed permutation. The modified permutation procedure includes the following steps: (1 permutation table creation; (2 permutation of image blocks, (3 element permutation in the image regions. The procedure «block permutations – permutation in the image regions» is performed q times – for this study q = 3. The second element value changing procedure is realized with the use of the pseudorandom sequence G that is added to the image elements. The following algorithm is proposed for the formation of this pseudorandom sequence: (1 the formation of the sequence G element distribution by brightness; (2 sequence G element initialization; (3 permutation of the sequence G elements. It is shown that, owing to the modified permutation procedure, the amount of calculations for new positions of the elements using chaotic maps is reduced by a factor of a – in this study a is equal to 16 and 64. The implementation of the proposed element value changing procedure necessitates the formation of d pseudorandom values from the interval [0, 1 with a uniform distribution. Actually, for the majority of practical cases d = 256 is applicable. The proposed algorithm has been tested as follows. The correlation coefficients have been computed for the original and encrypted images, and also for the adjacent elements in the vertical, horizontal, diagonal directions. The algorithm key sensitivity has been evaluated. Besides, the values of the unified average change intensity (UACI and the ratios of differing bits to the total number of bits have been determined. As demonstrated by the testing results, the proposed algorithm is highly operable and may be successfully used to solve the tasks of information security.
Image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing
Zhou, Nanrun; Pan, Shumin; Cheng, Shan; Zhou, Zhihong
2016-08-01
Most image encryption algorithms based on low-dimensional chaos systems bear security risks and suffer encryption data expansion when adopting nonlinear transformation directly. To overcome these weaknesses and reduce the possible transmission burden, an efficient image compression-encryption scheme based on hyper-chaotic system and 2D compressive sensing is proposed. The original image is measured by the measurement matrices in two directions to achieve compression and encryption simultaneously, and then the resulting image is re-encrypted by the cycle shift operation controlled by a hyper-chaotic system. Cycle shift operation can change the values of the pixels efficiently. The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys distribution simultaneously as a nonlinear encryption system. Simulation results verify the validity and the reliability of the proposed algorithm with acceptable compression and security performance.
An improved image encryption algorithm based on chaotic maps
Institute of Scientific and Technical Information of China (English)
Xu Shu-Jiang; Wang Ji-Zhi; Yang Su-Xiang
2008-01-01
Recently,two chaotic image encryption schemes have been proposed,in which shuffling the positions and changing the grey values of image pixels are combined.This paper provides the chosen plaintext attack to recover the corresponding plaintext of a given ciphertext.Furthermore,it points out that the two schemes are not sufficiently sensitive to small changes of the plaintext.Based on the given analysis,it proposes an improved algorithm which includes two rounds of substitution and one round of permutation to strengthen the overall performance.
Chaos-based encryption for fractal image coding
Institute of Scientific and Technical Information of China (English)
Yuen Ching-Hung; Wong Kwok-Wo
2012-01-01
A chaos-based cryptosystem for fractal image coding is proposed.The Rényi chaotic map is employed to determine the order of processing the range blocks and to generate the keystream for masking the encoded sequence.Compared with the standard approach of fractal image coding followed by the Advanced Encryption Standard,our scheme offers a higher sensitivity to both plaintext and ciphertext at a comparable operating efficiency.The keystream generated by the Rényi chaotic map passes the randomness tests set by the United States National Institute of Standards and Technology,and so the proposed scheme is sensitive to the key.
Full Restoration of Visual Encrypted Color Images
Persson, Simeon
2011-01-01
While strictly black and white images have been the basis for visual cryptography, there has been a lack of an easily implemented format for colour images. This paper establishes a simple, yet secure way of implementing visual cryptography with colour, assuming a binary data representation.
Gray-scale and color optical encryption based on computational ghost imaging
Tanha, Mehrdad; Kheradmand, Reza; Ahmadi-Kandjani, Sohrab
2012-09-01
We propose two approaches for optical encryption based on computational ghost imaging. These methods have the capability of encoding ghost images reconstructed from gray-scale images and colored objects. We experimentally demonstrate our approaches under eavesdropping in two different setups, thereby proving the robustness and simplicity thereof for encryption compared with previous algorithms.
QR code based noise-free optical encryption and decryption of a gray scale image
Jiao, Shuming; Zou, Wenbin; Li, Xia
2017-03-01
In optical encryption systems, speckle noise is one major challenge in obtaining high quality decrypted images. This problem can be addressed by employing a QR code based noise-free scheme. Previous works have been conducted for optically encrypting a few characters or a short expression employing QR codes. This paper proposes a practical scheme for optically encrypting and decrypting a gray-scale image based on QR codes for the first time. The proposed scheme is compatible with common QR code generators and readers. Numerical simulation results reveal the proposed method can encrypt and decrypt an input image correctly.
Image encryption based on Independent Component Analysis and Arnold’s Cat Map
Directory of Open Access Journals (Sweden)
Nidaa AbdulMohsin Abbas
2016-03-01
Full Text Available Security of the multimedia data including image and video is one of the basic requirements for the telecommunications and computer networks. In this paper, a new efficient image encryption technique is presented. It is based on modifying the mixing matrix in Independent Component Analysis (ICA using the chaotic Arnold’s Cat Map (ACM for encryption. First, the mixing matrix is generated from the ACM by insert square image of any dimension. Second, the mixing process is implemented using the mixing matrix and the image sources the result is the encryption images that depend on the number of sources. Third, images decrypted using ICA algorithms. We use the Joint Approximate Diagonalization of Eigen-matrices (JADE algorithm as a case study. The results of several experiments, PSNR, SDR and SSIM index tests compared with standard mixing matrix showed that the proposed image encryption system provided effective and safe way for image encryption.
Optical encryption for large-sized images using random phase-free method
Shimobaba, Tomoyoshi; Endo, Yutaka; Hirayama, Ryuji; Hiyama, Daisuke; Hasegawa, Satoki; Nagahama, Yuki; Sano, Marie; Sugie, Takashige; Ito, Tomoyoshi
2015-01-01
We propose an optical encryption framework that can encrypt and decrypt large-sized images beyond the size of the encrypted image using our two methods: random phase-free method and scaled diffraction. In order to record the entire image information on the encrypted image, the large-sized images require the random phase to widely diffuse the object light over the encrypted image; however, the random phase gives rise to the speckle noise on the decrypted images, and it may be difficult to recognize the decrypted images. In order to reduce the speckle noise, we apply our random phase-free method to the framework. In addition, we employ scaled diffraction that calculates light propagation between planes with different sizes by changing the sampling rates.
Qin, Yi; Gong, Qiong; Wang, Zhipeng
2014-09-08
In previous diffractive-imaging-based optical encryption schemes, it is impossible to totally retrieve the plaintext from a single diffraction pattern. In this paper, we proposed a new method to achieve this goal. The encryption procedure can be completed by proceeding only one exposure, and the single diffraction pattern is recorded as ciphertext. For recovering the plaintext, a novel median-filtering-based phase retrieval algorithm, including two iterative cycles, has been developed. This proposal not only extremely simplifies the encryption and decryption processes, but also facilitates the storage and transmission of the ciphertext, and its effectiveness and feasibility have been demonstrated by numerical simulations.
Secure Image Steganography Algorithm Based on DCT with OTP Encryption
Directory of Open Access Journals (Sweden)
De Rosal Ignatius Moses Setiadi
2017-04-01
Full Text Available Rapid development of Internet makes transactions message even easier and faster. The main problem in the transactions message is security, especially if the message is private and secret. To secure these messages is usually done with steganography or cryptography. Steganography is a way to hide messages into other digital content such as images, video or audio so it does not seem nondescript from the outside. While cryptography is a technique to encrypt messages so that messages can not be read directly. In this paper have proposed combination of steganography using discrete cosine transform (DCT and cryptography using the one-time pad or vernam cipher implemented on a digital image. The measurement method used to determine the quality of stego image is the peak signal to noise ratio (PSNR and ormalize cross Correlation (NCC to measure the quality of the extraction of the decrypted message. Of steganography and encryption methods proposed obtained satisfactory results with PSNR and NCC high and resistant to JPEG compression and median filter. Keywords—Image Steganography, Discrete Cosine Transform (DCT, One Time Pad, Vernam, Chiper, Image Cryptography
Classification of Novel Selected Region of Interest for Color Image Encryption
Directory of Open Access Journals (Sweden)
Lahieb Mohammed Jawad
2015-04-01
Full Text Available Securing digital image in exchanging huge multimedia data over internet with limited bandwidth is a significant and sensitive issue. Selective image encryption being an effective method for reducing the amount of encrypted data can achieve adequate security enhancement. Determining and selecting the region of interest in digital color images is challenging for selective image encryption due to their complex structure and distinct regions of varying importance. We propose a new feature in acquiring and selecting Region of Interest (ROI for the color images to develop a selective encryption scheme. The hybrid domain is used to encrypt regions based on chaotic map approach which automatically generates secret key. This new attribute is a vitality facet representing the noteworthy part of the color image. The security performance of selective image encryption is found to enhance considerably based on the rates of encrypted area selection. Computation is performed using MATLAB R2008a codes on eight images (Lena, Pepper, Splash, Airplane, House, Tiffany, Baboon and Sailboat each of size 512*512 pixels obtained from standard USC-SIPI Image Database. A block size of 128*128 pixels with threshold levels 0.0017 and 0.48 are employed. Results are analyzed and compared with edge detection method using the same algorithm. Encrypted area, entropy and correlation coefficients performances reveal that the proposed scheme achieves good alternative in the confined region of interest, fulfills the desired confidentiality and protects image privacy.
Tan, Ru-Chao; Lei, Tong; Zhao, Qing-Min; Gong, Li-Hua; Zhou, Zhi-Hong
2016-12-01
To improve the slow processing speed of the classical image encryption algorithms and enhance the security of the private color images, a new quantum color image encryption algorithm based on a hyper-chaotic system is proposed, in which the sequences generated by the Chen's hyper-chaotic system are scrambled and diffused with three components of the original color image. Sequentially, the quantum Fourier transform is exploited to fulfill the encryption. Numerical simulations show that the presented quantum color image encryption algorithm possesses large key space to resist illegal attacks, sensitive dependence on initial keys, uniform distribution of gray values for the encrypted image and weak correlation between two adjacent pixels in the cipher-image.
Multifractional Fourier Transform Method and Its Applications to Image Encryption
Institute of Scientific and Technical Information of China (English)
RANQiwen; WANGQi; MAJing; TANLiying
2003-01-01
The multiplicity of the fractional Fourier transform(FRFT),which is intrinsic in any fractional operator,has been claimed by several authors,but never across-the-board developed.Particularly,the weight-type FRFT(WFRFT) has not been investigated.Starting with defining the multifractional Fourier transform (MFRFT),we gained the generalization permutation matrix group (GPMG)representation and multiplicity of the MFRFT,and the relationships among the MFRFT the standard WFRFT and the standard CFRFT.Finally,as a application,a novel image encryption method hased on the MFRFT is propounded.Similation results show that this method is safe,practicable and impactful.
Interference-based multiple-image encryption with silhouette removal by position multiplexing.
Qin, Yi; Gong, Qiong
2013-06-10
An approach for multiple-image encryption based on interference and position multiplexing is proposed. In the encryption process, multiple images are analytically hidden into three phase-only masks (POMs). The encryption algorithm for this method is quite simple and does not need iterative encoding. For decryption, both the digital method and optical method could be employed. Also, we analyze the multiplexing capacity through the correlation coefficient. In addition, the silhouette problem that exists in previous interference-based encryption methods with two POMs can be eliminated during the generation procedure of POMs based on the interference principle. Simulation results are presented to verify the validity of the proposed approach.
A New Chaos-Based Image-Encryption and Compression Algorithm
Directory of Open Access Journals (Sweden)
Somaya Al-Maadeed
2012-01-01
Full Text Available We propose a new and efficient method to develop secure image-encryption techniques. The new algorithm combines two techniques: encryption and compression. In this technique, a wavelet transform was used to decompose the image and decorrelate its pixels into approximation and detail components. The more important component (the approximation component is encrypted using a chaos-based encryption algorithm. This algorithm produces a cipher of the test image that has good diffusion and confusion properties. The remaining components (the detail components are compressed using a wavelet transform. This proposed algorithm was verified to provide a high security level. A complete specification for the new algorithm is provided. Several test images are used to demonstrate the validity of the proposed algorithm. The results of several experiments show that the proposed algorithm for image cryptosystems provides an efficient and secure approach to real-time image encryption and transmission.
Double-image encryption based on discrete fractional random transform and chaotic maps
Li, Huijuan; Wang, Yurong
2011-07-01
A novel double-image encryption algorithm is proposed, based on discrete fractional random transform and chaotic maps. The random matrices used in the discrete fractional random transform are generated by using a chaotic map. One of the two original images is scrambled by using another chaotic map, and then encoded into the phase of a complex matrix with the other original image as its amplitude. Then this complex matrix is encrypted by the discrete fractional random transform. By applying the correct keys which consist of initial values, control parameters, and truncated positions of the chaotic maps, and fractional orders, the two original images can be recovered without cross-talk. Numerical simulation has been performed to test the validity and the security of the proposed encryption algorithm. Encrypting two images together by this algorithm creates only one encrypted image, whereas other single-image encryption methods create two encrypted images. Furthermore, this algorithm requires neither the use of phase keys nor the use of matrix keys. In this sense, this algorithm can raise the efficiency when encrypting, storing or transmitting.
Aldossari, M; Alfalou, A; Brosseau, C
2014-09-22
This study presents and validates an optimized method of simultaneous compression and encryption designed to process images with close spectra. This approach is well adapted to the compression and encryption of images of a time-varying scene but also to static polarimetric images. We use the recently developed spectral fusion method [Opt. Lett.35, 1914-1916 (2010)] to deal with the close resemblance of the images. The spectral plane (containing the information to send and/or to store) is decomposed in several independent areas which are assigned according a specific way. In addition, each spectrum is shifted in order to minimize their overlap. The dual purpose of these operations is to optimize the spectral plane allowing us to keep the low- and high-frequency information (compression) and to introduce an additional noise for reconstructing the images (encryption). Our results show that not only can the control of the spectral plane enhance the number of spectra to be merged, but also that a compromise between the compression rate and the quality of the reconstructed images can be tuned. We use a root-mean-square (RMS) optimization criterion to treat compression. Image encryption is realized at different security levels. Firstly, we add a specific encryption level which is related to the different areas of the spectral plane, and then, we make use of several random phase keys. An in-depth analysis at the spectral fusion methodology is done in order to find a good trade-off between the compression rate and the quality of the reconstructed images. Our new proposal spectral shift allows us to minimize the image overlap. We further analyze the influence of the spectral shift on the reconstructed image quality and compression rate. The performance of the multiple-image optical compression and encryption method is verified by analyzing several video sequences and polarimetric images.
Lensless multiple-image optical encryption based on improved phase retrieval algorithm.
Huang, Jian-Ji; Hwang, Hone-Ene; Chen, Chun-Yuan; Chen, Ching-Mu
2012-05-01
A novel architecture of the optical multiple-image encryption based on the modified Gerchberg-Saxton algorithm (MGSA) by using cascading phase only functions (POFs) in the Fresnel transform (FrT) domain is presented. This proposed method can greatly increase the capacity of the system by avoiding the crosstalk, completely, between the encrypted target images. Each present stage encrypted target image is encoded as to a complex function by using the MGSA with constraining the encrypted target image of the previous stage. Not only the wavelength and position parameters in the FrT domain can be keys to increase system security, the created POFs are also served mutually as the encryption keys to decrypt target image from present stage into next stage in the cascaded scheme. Compared with a prior method [Appl. Opt.48, 2686-2692 (2009)], the main advantages of this proposed encryption system is that it does not need any transformative lenses and this makes it very efficient and easy to implement optically. Simulation results show that this proposed encryption system can successfully achieve the multiple-image encryption via fewer POFs, which is more advantageous in simpler implementation and efficiency than a prior method where each decryption stage requires two POFs to accomplish this task.
Multiple-image encryption based on phase mask multiplexing in fractional Fourier transform domain.
Liansheng, Sui; Meiting, Xin; Ailing, Tian
2013-06-01
A multiple-image encryption scheme is proposed based on the phase retrieval process and phase mask multiplexing in the fractional Fourier transform domain. First, each original gray-scale image is encoded into a phase only function by using the proposed phase retrieval process. Second, all the obtained phase functions are modulated into an interim, which is encrypted into the final ciphertext by using the fractional Fourier transform. From a plaintext image, a group of phase masks is generated in the encryption process. The corresponding decrypted image can be recovered from the ciphertext only with the correct phase mask group in the decryption process. Simulation results show that the proposed phase retrieval process has high convergence speed, and the encryption algorithm can avoid cross-talk; in addition, its encrypted capacity is considerably enhanced.
Opto-digital image encryption by using Baker mapping and 1-D fractional Fourier transform
Liu, Zhengjun; Li, She; Liu, Wei; Liu, Shutian
2013-03-01
We present an optical encryption method based on the Baker mapping in one-dimensional fractional Fourier transform (1D FrFT) domains. A thin cylinder lens is controlled by computer for implementing 1D FrFT at horizontal direction or vertical direction. The Baker mapping is introduced to scramble the amplitude distribution of complex function. The amplitude and phase of the output of encryption system are regarded as encrypted image and key. Numerical simulation has been performed for testing the validity of this encryption scheme.
Image meshing via hierarchical optimization
Institute of Scientific and Technical Information of China (English)
Hao XIE; Ruo-feng TONG‡
2016-01-01
Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., defi nition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to fi nd a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it diﬃcult to fi nd a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to fi ner ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.
Image meshing via hierarchical optimization＊
Institute of Scientific and Technical Information of China (English)
Hao XIE; Ruo-feng TONGS
2016-01-01
Vector graphic, as a kind of geometric representation of raster images, has many advantages, e.g., definition independence and editing facility. A popular way to convert raster images into vector graphics is image meshing, the aim of which is to find a mesh to represent an image as faithfully as possible. For traditional meshing algorithms, the crux of the problem resides mainly in the high non-linearity and non-smoothness of the objective, which makes it difficult to find a desirable optimal solution. To ameliorate this situation, we present a hierarchical optimization algorithm solving the problem from coarser levels to finer ones, providing initialization for each level with its coarser ascent. To further simplify the problem, the original non-convex problem is converted to a linear least squares one, and thus becomes convex, which makes the problem much easier to solve. A dictionary learning framework is used to combine geometry and topology elegantly. Then an alternating scheme is employed to solve both parts. Experiments show that our algorithm runs fast and achieves better results than existing ones for most images.
Overview on Selective Encryption of Image and Video: Challenges and Perspectives
Directory of Open Access Journals (Sweden)
Massoudi A
2008-01-01
Full Text Available In traditional image and video content protection schemes, called fully layered, the whole content is first compressed. Then, the compressed bitstream is entirely encrypted using a standard cipher (DES, AES, IDEA, etc.. The specific characteristics of this kind of data (high-transmission rate with limited bandwidth make standard encryption algorithms inadequate. Another limitation of fully layered systems consists of altering the whole bitstream syntax which may disable some codec functionalities. Selective encryption is a new trend in image and video content protection. It consists of encrypting only a subset of the data. The aim of selective encryption is to reduce the amount of data to encrypt while preserving a sufficient level of security. This computation saving is very desirable especially in constrained communications (real-time networking, high-definition delivery, and mobile communications with limited computational power devices. In addition, selective encryption allows preserving some codec functionalities such as scalability. This tutorial is intended to give an overview on selective encryption algorithms. The theoretical background of selective encryption, potential applications, challenges, and perspectives is presented.
Directory of Open Access Journals (Sweden)
Ruisong Ye
2014-03-01
Full Text Available A secure image encryption scheme based on 2D skew tent map is proposed for the encryption of color images. The proposed encryption scheme is composed of one permutation process and one substitution process. The 3D color plain-image matrix is converted to 2D image matrix first, then 2D skew tent map is utilized to generate chaotic sequences, which are used for both permutation process and substitution process. The chaotic sequence for permutation process is dependent on plain-image and cipher keys, resulting in good key sensitivity and plaintext sensitivity. The substitution process is first initiated with the initial vectors generated by the cipher keys and 2D skew tent map, then the gray values of row and column pixels of 2D image matrix are mixed with the pseudorandom number sequences via bitxoring operation. Both permutation process and substitution process are executed row-by-row and column-by-column instead of pixel-by-pixel to improve the speed of encryption. The security and performance of the proposed image encryption have been analyzed, including histograms, correlation coefficients, information entropy, key sensitivity analysis, key space analysis, differential analysis, encryption/decryption rate analysis etc. All the experimental results suggest that the proposed image encryption scheme is robust and secure and can be used for secure image and video communication applications.
Chuang, Cheng-Hung; Chen, Yen-Lin
2013-02-01
This study presents a steganographic optical image encryption system based on reversible data hiding and double random phase encoding (DRPE) techniques. Conventional optical image encryption systems can securely transmit valuable images using an encryption method for possible application in optical transmission systems. The steganographic optical image encryption system based on the DRPE technique has been investigated to hide secret data in encrypted images. However, the DRPE techniques vulnerable to attacks and many of the data hiding methods in the DRPE system can distort the decrypted images. The proposed system, based on reversible data hiding, uses a JBIG2 compression scheme to achieve lossless decrypted image quality and perform a prior encryption process. Thus, the DRPE technique enables a more secured optical encryption process. The proposed method extracts and compresses the bit planes of the original image using the lossless JBIG2 technique. The secret data are embedded in the remaining storage space. The RSA algorithm can cipher the compressed binary bits and secret data for advanced security. Experimental results show that the proposed system achieves a high data embedding capacity and lossless reconstruction of the original images.
A fast image encryption algorithm based on chaotic map
Liu, Wenhao; Sun, Kehui; Zhu, Congxu
2016-09-01
Derived from Sine map and iterative chaotic map with infinite collapse (ICMIC), a new two-dimensional Sine ICMIC modulation map (2D-SIMM) is proposed based on a close-loop modulation coupling (CMC) model, and its chaotic performance is analyzed by means of phase diagram, Lyapunov exponent spectrum and complexity. It shows that this map has good ergodicity, hyperchaotic behavior, large maximum Lyapunov exponent and high complexity. Based on this map, a fast image encryption algorithm is proposed. In this algorithm, the confusion and diffusion processes are combined for one stage. Chaotic shift transform (CST) is proposed to efficiently change the image pixel positions, and the row and column substitutions are applied to scramble the pixel values simultaneously. The simulation and analysis results show that this algorithm has high security, low time complexity, and the abilities of resisting statistical analysis, differential, brute-force, known-plaintext and chosen-plaintext attacks.
Cheremkhin, Pavel A.; Evtikhiev, Nikolay N.; Krasnov, Vitaly V.; Rodin, Vladislav G.; Starikov, Sergey N.
2014-05-01
At present time methods of optical encryption are actively developed. The majority of existing methods of optical encryption use not only light intensity distribution, easily registered with photosensors, but also its phase distribution which require application of complex holographic schemes in conjunction with spatially coherent light. This leads to complex optical schemes and low decryption quality. To eliminate these disadvantages it is possible to implement optical encryption using spatially incoherent illumination which requires registration of light intensity distribution only. However this applies new restrictions on encryption keys: Fourier spectrum amplitude distribution of encryption key should overlap Fourier spectrum amplitude distribution of image to be encrypted otherwise loss of information is unavoidable. Therefore it seems that best key should have white spectrum. On the other hand due to fact that only light intensity distribution is registered, spectra of image to be encrypted and encryption key always have peaks at zero frequency and their heights depend on corresponding total energy. Since encrypted image contains noise, ratio of its average spectrum energy to noise average energy determines signal to noise ratio of decrypted image. Therefore ratio of amplitude at zero frequency to average spectrum amplitude (RZA) of encryption key defines decrypted images quality. For generation of encryption keys with low RZA method of direct search with random trajectory (DSRT) was used. To estimate impact of key RZA on decrypted images error numerical experiments were conducted. For experiments keys with different RZA values but with same energy value were generated and used. Numerically simulated optical encryption and decryption of set of test images was conducted. Results of experiment demonstrate that application of keys with low RZA generated by DSRT method leads to up to 20% lower error in comparison to keys generated by means of uniform random
Wang, Xiaogang; Zhao, Daomu
2012-05-21
A double-image encryption technique that based on an asymmetric algorithm is proposed. In this method, the encryption process is different from the decryption and the encrypting keys are also different from the decrypting keys. In the nonlinear encryption process, the images are encoded into an amplitude cyphertext, and two phase-only masks (POMs) generated based on phase truncation are kept as keys for decryption. By using the classical double random phase encoding (DRPE) system, the primary images can be collected by an intensity detector that located at the output plane. Three random POMs that applied in the asymmetric encryption can be safely applied as public keys. Simulation results are presented to demonstrate the validity and security of the proposed protocol.
Image encryption based on the reality-preserving multiple-parameter fractional Fourier transform
Lang, Jun
2012-05-01
In recent years, a number of methods have been proposed in the literature for the encryption of two-dimensional information by using the fractional Fourier transform, but most of their encryptions are complex values and need digital hologram technique to record information, which is inconvenient for digital transmission. In this paper, we propose a new approach for image encryption based on the real-valuedness and decorrelation property of the reality-preserving multiple-parameter fractional Fourier transform in order to meet the requirements of the secure image transmission. In the proposed scheme, the original and encrypted images are respectively in the spatial domain and the reality-preserving multiple-parameter fractional Fourier transformed domain determined by the encryption keys. Numerical simulations are performed to demonstrate that the proposed method is reliable and more robust to blind decryption than several existing methods.
An asymmetric color image encryption method by using deduced gyrator transform
Yao, Lili; Yuan, Caojin; Qiang, Junjie; Feng, Shaotong; Nie, Shouping
2017-02-01
An encryption algorithm is proposed by using the properties of deduced gyrator transform (GT). After being transformed by the GT algorithm and multiplied by a phase distribution p*, the spectrum modulus of the input image is considered to be the encrypted image by further performing Fourier transformation. To resist the attack from iterative phase retrieval, the red, green and blue components of the input image is modulated by a random phase mask and then combined using convolution. The encryption result is real-valued, which is convenient for display, transmission and storage. In the decryption process, the three original color components can be recovered with decryption keys which are different from the encryption keys. An optoelectronic hybrid system for the encryption process is also presented. Computer simulations are presented to demonstrate its performance, and the security of the proposed system is analyzed as well.
Rajput, Sudheesh K; Nishchal, Naveen K
2013-06-20
In this paper, an image encryption scheme based on polarized light encoding and a phase-truncation approach in the Fresnel transform domain is proposed. The phase-truncated data obtained by an asymmetric cryptosystem is encrypted and decrypted by using the concept of the Stokes-Mueller formalism. Image encryption based on polarization of light using Stokes-Mueller formalism has the main advantage over Jones vector formalism that it manipulates only intensity information, which is measurable. Thus any intensity information can be encrypted and decrypted using this scheme. The proposed method offers several advantages: (1) a lens-free setup, (2) flexibility in the encryption key design, (3) use of asymmetric keys, and (4) immunity against special attack. We present numerical simulation results for gray-scale and color images in support of the proposed security scheme. The performance measurement parameters relative error and correlation coefficient have been calculated to check the effectiveness of the scheme.
A Color Image Encryption Algorithm Based on a Fractional-Order Hyperchaotic System
Directory of Open Access Journals (Sweden)
Xia Huang
2014-12-01
Full Text Available In this paper, a new color image encryption algorithm based on a fractional-order hyperchaotic system is proposed. Firstly, four chaotic sequences are generated by a fractional-order hyperchaotic system. The parameters of such a system, together with the initial value, are regarded as the secret keys and the plain image is encrypted by performing the XOR and shufﬂing operations simultaneously. The proposed encryption scheme is described in detail with security analyses, including correlation analysis, histogram analysis, differential attacks, and key sensitivity analysis. Experimental results show that the proposed encryption scheme has big key space, and high sensitivity to keys properties, and resists statistical analysis and differential attacks, so it has high security and is suitable for color image encryption.
Wang, Yong-Ying; Wang, Yu-Rong; Wang, Yong; Li, Hui-Juan; Sun, Wen-Jia
2007-07-01
A new method of optical image encryption with binary Fourier transform computer-generated hologram (CGH) and pixel-scrambling technology is presented. In this method, the orders of the pixel scrambling, as well as the encrypted image, are used as the keys to decrypt the original image. Therefore, higher security is achieved. Furthermore, the encrypted image is binary, so it is easy to be fabricated and robust against noise and distortion. Computer simulation results are given to verify the feasibility of this method and its robustness against occlusion and additional noise.
A new image encryption algorithm based on logistic chaotic map with varying parameter.
Liu, Lingfeng; Miao, Suoxia
2016-01-01
In this paper, we proposed a new image encryption algorithm based on parameter-varied logistic chaotic map and dynamical algorithm. The parameter-varied logistic map can cure the weaknesses of logistic map and resist the phase space reconstruction attack. We use the parameter-varied logistic map to shuffle the plain image, and then use a dynamical algorithm to encrypt the image. We carry out several experiments, including Histogram analysis, information entropy analysis, sensitivity analysis, key space analysis, correlation analysis and computational complexity to evaluate its performances. The experiment results show that this algorithm is with high security and can be competitive for image encryption.
Chang, Hsuan T; Shui, J-W; Lin, K-P
2017-02-01
In this paper, a joint multiple-image encryption and multiplexing system, which utilizes both the nonnegative matrix factorization (NMF) scheme and digital holography, is proposed. A number of images are transformed into noise-like digital holograms, which are then decomposed into a defined number of basis images and a corresponding weighting matrix using the NMF scheme. The determined basis images are similar to the digital holograms and appear as noise-like patterns, which are then stored as encrypted data and serve as the lock in an encryption system. On the other hand, the column vectors in the weighting matrix serve as the keys for the corresponding plain images or the addresses of the multiplexed images. Both the increased uniformity of the column weighting factors and the parameters used in the digital holography enhance the security of the distributed keys. The experimental results show that the proposed method can successfully perform multiple-image encryption with high-level security.
Su, Yonggang; Tang, Chen; Chen, Xia; Li, Biyuan; Xu, Wenjun; Lei, Zhenkun
2017-01-01
We propose an image encryption scheme using chaotic phase masks and cascaded Fresnel transform holography based on a constrained optimization algorithm. In the proposed encryption scheme, the chaotic phase masks are generated by Henon map, and the initial conditions and parameters of Henon map serve as the main secret keys during the encryption and decryption process. With the help of multiple chaotic phase masks, the original image can be encrypted into the form of a hologram. The constrained optimization algorithm makes it possible to retrieve the original image from only single frame hologram. The use of chaotic phase masks makes the key management and transmission become very convenient. In addition, the geometric parameters of optical system serve as the additional keys, which can improve the security level of the proposed scheme. Comprehensive security analysis performed on the proposed encryption scheme demonstrates that the scheme has high resistance against various potential attacks. Moreover, the proposed encryption scheme can be used to encrypt video information. And simulations performed on a video in AVI format have also verified the feasibility of the scheme for video encryption.
Liang, Yaru; Liu, Guoping; Zhou, Nanrun; Wu, Jianhua
2015-02-01
Based on the fractional discrete cosine transform with multiple generating sequences (MGSFrDCT) and the dependent scrambling and diffusion (DSD), an image encryption algorithm is proposed, in which the multiple-generating sequences greatly enlarge the key space of the encryption system. The real-valued output of MGSFrDCT is beneficial to storage, display and transmission of the cipher-text. During the stage of confusion and diffusion, the locations and values of all MGSFrDCT transformed coefficients change due to DSD, and the initial values and fractional orders of encryption system depend not only on the cipher keys but also on the plain-image due to introduction of a disturbance factor, which allows the encryption system to resist the known-plaintext and chosen-plaintext attacks. Experimental results demonstrate that the proposed encryption algorithm is feasible, effective and secure and able to resist common classical attacks.
Optical multiple-image encryption based on phase encoding algorithm in the Fresnel transform domain
Huang, Jian-Ji; Hwang, Hone-Ene; Chen, Chun-Yuan; Chen, Ching-Mu
2012-10-01
A novel method of the optical multiple-image encryption based on the modified Gerchberg-Saxton algorithm (MGSA) is presented. This proposed method with an architecture of two adjacent phase only functions (POFs) in the Fresnel transform (FrT) domain that can extremely increase capacity of system for completely avoiding the crosstalk between the decrypted images. Each encrypted target image is separately encoded into a POF by using the MGSA which is with constraining the encrypted target image. Each created POF is then added to a prescribed fixed POF composed of a proposed MGSA-based phase encoding algorithm. Not only the wavelength and multiple-position parameters in the FrT domain as keys to increase system security, the created POFs are also served mutually as the encryption keys to decrypt target image based on cascading two POFs scheme. Compared with prior methods [23,24], the main advantages of this proposed encryption system is that it does not need any transformative lenses and that makes it very efficient and easy to implement optically. Simulation results show that this proposed encryption system can successfully achieve the multiple-image encryption with multiple-position keys, which is more advantageous in security than previous work [24] for its decryption process with only two POFs keys to accomplish this task.
An Image Encryption Scheme Based on Bit Circular Shift and Bi-directional Diffusion
Directory of Open Access Journals (Sweden)
Ruisong Ye
2013-12-01
Full Text Available A novel image encryption scheme based on chaotic system is proposed. The proposed encryption scheme utilizes one tent map to generate a pseudo-random sequence and then shift the bits of the expanding 0-1 image circularly so as to shuffle the image gray values. To make the encryption scheme resist differential attack efficiently, generalized Arnold maps and Bernoulli shift maps are applied to produce two pseudo-random gray value sequences and then diffuse the gray values bi-directionally. The bit circular shift process and diffusion processes greatly confuse the statistical nature between plain-images and cipher-images. Security analyses including key sensitivity analysis, key space analysis, statistical analysis, differential attack analysis and information entropy analysis are performed. All the experimental results demonstrate that the proposed image encryption scheme possesses large key space to frustrate brute-force attack efficiently and can resist statistical attack, differential attack, etc.
A Novel Encryption Frame for Medical Image with Watermark Based on Hyperchaotic System
Directory of Open Access Journals (Sweden)
Shun Zhang
2014-01-01
Full Text Available An encryption frame of medical image with watermark based on hyperchaotic system is proposed in this paper. Medical information, such as the patients’ private information, data needed for diagnosis, and information for authentication or protection of medical files, is embedded into the regions of interest (ROI in medical images with a high capacity difference-histogram-based reversible data-hiding scheme. After that, the watermarked medical images are encrypted with hyperchaotic systems. In the receiving end, the receiver with encryption key can decrypt the image to get similar images for diagnosis. If the receiver has the key for data hiding at the same time, he/she can extract the embedded private information and reversibly recover the original medical image. Experiments and analyses demonstrate that high embedding capacity and low distortion have been achieved in the process of data hiding, and, at the same time, high security has been acquired in the encryption phase.
Separable and Error-Free Reversible Data Hiding in Encrypted Image with High Payload
Directory of Open Access Journals (Sweden)
Zhaoxia Yin
2014-01-01
Full Text Available This paper proposes a separable reversible data-hiding scheme in encrypted image which offers high payload and error-free data extraction. The cover image is partitioned into nonoverlapping blocks and multigranularity encryption is applied to obtain the encrypted image. The data hider preprocesses the encrypted image and randomly selects two basic pixels in each block to estimate the block smoothness and indicate peak points. Additional data are embedded into blocks in the sorted order of block smoothness by using local histogram shifting under the guidance of the peak points. At the receiver side, image decryption and data extraction are separable and can be free to choose. Compared to previous approaches, the proposed method is simpler in calculation while offering better performance: larger payload, better embedding quality, and error-free data extraction, as well as image recovery.
Optical color-image encryption in the diffractive-imaging scheme
Qin, Yi; Wang, Zhipeng; Pan, Qunna; Gong, Qiong
2016-02-01
By introducing the theta modulation technique into the diffractive-imaging-based optical scheme, we propose a novel approach for color image encryption. For encryption, a color image is divided into three channels, i.e., red, green and blue, and thereafter these components are appended by redundant data before being sent to the encryption scheme. The carefully designed optical setup, which comprises of three 4f optical architectures and a diffractive-imaging-based optical scheme, could encode the three plaintexts into a single noise-like intensity pattern. For the decryption, an iterative phase retrieval algorithm, together with a filter operation, is applied to extract the primary color images from the diffraction intensity map. Compared with previous methods, our proposal has successfully encrypted a color rather than grayscale image into a single intensity pattern, as a result of which the capacity and practicability have been remarkably enhanced. In addition, the performance and the security of it are also investigated. The validity as well as feasibility of the proposed method is supported by numerical simulations.
Synchronized chaotic phase masks for encrypting and decrypting images
Rueda, Edgar; Vera, Carlos A.; Rodríguez, Boris; Torroba, Roberto
2008-12-01
This paper presents an alternative to secure exchange of encrypted information through public open channels. Chaotic encryption introduces a security improvement by an efficient masking of the message with a chaotic signal. Message extraction by an authorized end user is done using a synchronization procedure, thus allowing a continuous change of the encrypting and decrypting keys. And optical implementation with a 4f optical encrypting architecture is suggested. Digital simulations, including the effects of missing data, corrupted data and noise addition are shown. These results proof the consistency of the proposal, and demonstrate a practical way to operate with it.
Optical color image encryption based on an asymmetric cryptosystem in the Fresnel domain
Chen, Wen; Chen, Xudong
2011-08-01
In recent years, optical color image encryption has attracted much attention in the information security field. Some approaches, such as digital holography, have been proposed to encrypt color images, but the previously proposed methods are developed based on optical symmetric cryptographic strategies. In this paper, we apply an optical asymmetric cryptosystem for the color image encryption instead of conventional symmetric cryptosystems. A phase-truncated strategy is applied in the Fresnel domain, and multiple-wavelength and indexed image methods are further employed. The security of optical asymmetric cryptosystem is also analyzed during the decryption. Numerical results are presented to demonstrate the feasibility and effectiveness of the proposed optical asymmetric cryptosystem for color image encryption.
A Novel Image Encryption Algorithm Based on DNA Encoding and Spatiotemporal Chaos
Directory of Open Access Journals (Sweden)
Chunyan Song
2015-10-01
Full Text Available DNA computing based image encryption is a new, promising field. In this paper, we propose a novel image encryption scheme based on DNA encoding and spatiotemporal chaos. In particular, after the plain image is primarily diffused with the bitwise Exclusive-OR operation, the DNA mapping rule is introduced to encode the diffused image. In order to enhance the encryption, the spatiotemporal chaotic system is used to confuse the rows and columns of the DNA encoded image. The experiments demonstrate that the proposed encryption algorithm is of high key sensitivity and large key space, and it can resist brute-force attack, entropy attack, differential attack, chosen-plaintext attack, known-plaintext attack and statistical attack.
Privacy-Aware Image Encryption Based on Logistic Map and Data Hiding
Sun, Jianglin; Liao, Xiaofeng; Chen, Xin; Guo, Shangwei
The increasing need for image communication and storage has created a great necessity for securely transforming and storing images over a network. Whereas traditional image encryption algorithms usually consider the security of the whole plain image, region of interest (ROI) encryption schemes, which are of great importance in practical applications, protect the privacy regions of plain images. Existing ROI encryption schemes usually adopt approximate techniques to detect the privacy region and measure the quality of encrypted images; however, their performance is usually inconsistent with a human visual system (HVS) and is sensitive to statistical attacks. In this paper, we propose a novel privacy-aware ROI image encryption (PRIE) scheme based on logistical mapping and data hiding. The proposed scheme utilizes salient object detection to automatically, adaptively and accurately detect the privacy region of a given plain image. After private pixels have been encrypted using chaotic cryptography, the significant bits are embedded into the nonprivacy region of the plain image using data hiding. Extensive experiments are conducted to illustrate the consistency between our automatic ROI detection and HVS. Our experimental results also demonstrate that the proposed scheme exhibits satisfactory security performance.
Chen, Tinghuan; Zhang, Meng; Wu, Jianhui; Yuen, Chau; Tong, You
2016-10-01
Because of simple encryption and compression procedure in single step, compressed sensing (CS) is utilized to encrypt and compress an image. Difference of sparsity levels among blocks of the sparsely transformed image degrades compression performance. In this paper, motivated by this difference of sparsity levels, we propose an encryption and compression approach combining Kronecker CS (KCS) with elementary cellular automata (ECA). In the first stage of encryption, ECA is adopted to scramble the sparsely transformed image in order to uniformize sparsity levels. A simple approximate evaluation method is introduced to test the sparsity uniformity. Due to low computational complexity and storage, in the second stage of encryption, KCS is adopted to encrypt and compress the scrambled and sparsely transformed image, where the measurement matrix with a small size is constructed from the piece-wise linear chaotic map. Theoretical analysis and experimental results show that our proposed scrambling method based on ECA has great performance in terms of scrambling and uniformity of sparsity levels. And the proposed encryption and compression method can achieve better secrecy, compression performance and flexibility.
Double image encryption by using iterative random binary encoding in gyrator domains.
Liu, Zhengjun; Guo, Qing; Xu, Lie; Ahmad, Muhammad Ashfaq; Liu, Shutian
2010-05-24
We propose a double image encryption by using random binary encoding and gyrator transform. Two secret images are first regarded as the real part and imaginary part of complex function. Chaotic map is used for obtaining random binary matrix. The real part and imaginary part of complex function are exchanged under the control of random binary data. An iterative structure composed of the random binary encoding method is designed and employed for enhancing the security of encryption algorithm. The parameters in chaotic map and gyrator transform serve as the keys of this encryption scheme. Some numerical simulations have been made, to demonstrate the performance this algorithm.
Mathematical description of the two-dimensional Gabor transform. Application to image encryption
Perez, Ronal; Vilardy, Juan M.; Torres, Cesar O.
2017-01-01
Information security with optical processing, such as the double random phase encoding and the Gabor transform (GT) has been investigated by various researchers. We present a two-dimensional (2-D) generalization of the one-dimensional GT. This 2-D GT is applied to encrypt digital images in this paper. The scaling factors of the GT can be used as new keys, providing a new encryption system with a high security characteristics. This method can encrypt and protect the information of the digital images with a high security for information processing systems.
Optical image encryption based on a joint Fresnel transform correlator with double optical wedges.
Shen, Xueju; Dou, Shuaifeng; Lei, Ming; Chen, Yudan
2016-10-20
An optical cryptosystem based on the joint Fresnel transform correlator (JFTC) with double optical wedges is designed. The designed cryptosystem retains the two major advantages of JTC-based optical cryptosystems. First, the encrypted image is real-valued and therefore is easier to record and transmit. Second, the encryption process is simplified, since it doesn't require accurate alignment of optical elements or the generation of the complex conjugate of the key. Also, the designed optical cryptosystem can produce a decrypted image with higher quality than a JTC-based optical cryptosystem, because the original encrypted image is divided by the Fresnel transform power distribution of the key mask to generate the new encrypted image, which significantly reduces the noise during the decryption process. Simulation results showed that the correlation coefficient of the decrypted image and the original image can reach as large as 0.9819 after denoising and adequately selecting half-central interval a and encrypted image width w. Another improvement relative to JTC-based optical cryptosystems is that the attack resistibility gets enhanced due to the nonlinearity of the encryption process as well as the additional key parameter a, which enlarges the key space.
Encrypting three-dimensional information system based on integral imaging and multiple chaotic maps
Xing, Yan; Wang, Qiong-Hua; Xiong, Zhao-Long; Deng, Huan
2016-02-01
An encrypting three-dimensional (3-D) information system based on integral imaging (II) and multiple chaotic maps is proposed. In the encrypting process, the elemental image array (EIA) which represents spatial and angular information of the real 3-D scene is picked up by a microlens array. Subsequently, R, G, and B color components decomposed by the EIA are encrypted using multiple chaotic maps. Finally, these three encrypted components are interwoven to obtain the cipher information. The decryption process implements the reverse operation of the encryption process for retrieving the high-quality 3-D images. Since the encrypted EIA has the data redundancy property due to II, and all parameters of the pickup part are the secret keys of the encrypting system, the system sensitivity on the changes of the plaintext and secret keys can be significantly improved. Moreover, the algorithm based on multiple chaotic maps can effectively enhance the security. A preliminary experiment is carried out, and the experimental results verify the effectiveness, robustness, and security of the proposed system.
Security analysis of image encryption based on two-dimensional chaotic maps and improved algorithm
Institute of Scientific and Technical Information of China (English)
Feng HUANG; Yong FENG
2009-01-01
The article proposes a new algorithm to improve the security of image encryption based on two-dimensional chaotic maps.Chaotic maps are often used in encrypting images.However,the encryption has periodic-ity,no diffusion,and at the same time,the real keys space of encryption are fewer than the theoretical keys space,which consequently results in potential security problems.Thus,this article puts forward several ways to solve the problems including adding diffusion mechanism,changing the design of keys and developing a composite encryption system.It designs an algorithm for the version B of the discretized baker map,which is one of the most prevalent chaotic maps,based on which a new image encryption is proposed to avoid the above problems.The simulation results show that the new encryption algorithm is valid and the result can be applied to other two-dimensional chaotic maps,such as the cat map.
Cryptanalysis of "an improvement over an image encryption method based on total shuffling"
Akhavan, A.; Samsudin, A.; Akhshani, A.
2015-09-01
In the past two decades, several image encryption algorithms based on chaotic systems had been proposed. Many of the proposed algorithms are meant to improve other chaos based and conventional cryptographic algorithms. Whereas, many of the proposed improvement methods suffer from serious security problems. In this paper, the security of the recently proposed improvement method for a chaos-based image encryption algorithm is analyzed. The results indicate the weakness of the analyzed algorithm against chosen plain-text.
Zhou, Nanrun; Hu, Yiqun; Gong, Lihua; Li, Guangyong
2017-06-01
A new quantum image encryption scheme is suggested by using the iterative generalized Arnold transforms and the quantum image cycle shift operations. The times of the quantum image cycle shift operations are controlled by a hyper-chaotic sequence generated by a new 4D hyper-chaotic system. The image pixels are scrambled by the iterative generalized Arnold transform, and the values of the pixels are altered by the quantum image cycle shift operations. The four initial conditions of the new 4D hyper-chaotic system are exploited to control the two parameters, the iterative rounds of the generalized Arnold transform and the times of the quantum image cycle shift operations, respectively. Thus, the main keys of the proposed quantum image encryption scheme are the four initial conditions of the new 4D hyper-chaotic system and the key space is relatively large enough. Simulation results and theoretical analyses demonstrate that the proposed quantum image encryption scheme outperforms its classical counterparts apparently.
Zhang, Miao; Tong, Xiaojun
2017-07-01
This paper proposes a joint image encryption and compression scheme based on a new hyperchaotic system and curvelet transform. A new five-dimensional hyperchaotic system based on the Rabinovich system is presented. By means of the proposed hyperchaotic system, a new pseudorandom key stream generator is constructed. The algorithm adopts diffusion and confusion structure to perform encryption, which is based on the key stream generator and the proposed hyperchaotic system. The key sequence used for image encryption is relation to plain text. By means of the second generation curvelet transform, run-length coding, and Huffman coding, the image data are compressed. The joint operation of compression and encryption in a single process is performed. The security test results indicate the proposed methods have high security and good compression effect.
Xi, Sixing; Wang, Xiaolei; Song, Lipei; Zhu, Zhuqing; Zhu, Bowen; Huang, Shuai; Yu, Nana; Wang, Huaying
2017-04-03
Optical image encryption, especially double-random-phase-based, is of great interest in information security. In this work, we experimentally demonstrate the security and feasibility of optical image encryption with asymmetric double random phase and computer-generated hologram (CGH) by using spatial light modulator. First of all, the encrypted image modulated by asymmetric double random phase is numerically encoded into real-value CGH. Then, the encoded real-value CGH is loaded on the spatial light modulator and optically decrypted in self-designed experimental system. Experimental decryption results are in agreement with numerical calculations under the prober/mistaken phase keys condition. This optical decryption technology opens a window of optical encryption practical application and shows great potential for digital multimedia product copyright protection and holographic false trademark.
A joint asymmetric watermarking and image encryption scheme
Boato, G.; Conotter, V.; De Natale, F. G. B.; Fontanari, C.
2008-02-01
Here we introduce a novel watermarking paradigm designed to be both asymmetric, i.e., involving a private key for embedding and a public key for detection, and commutative with a suitable encryption scheme, allowing both to cipher watermarked data and to mark encrypted data without interphering with the detection process. In order to demonstrate the effectiveness of the above principles, we present an explicit example where the watermarking part, based on elementary linear algebra, and the encryption part, exploiting a secret random permutation, are integrated in a commutative scheme.
Singh, Hukum
2016-12-01
A cryptosystem for securing image encryption is considered by using double random phase encoding in Fresnel wavelet transform (FWT) domain. Random phase masks (RPMs) and structured phase masks (SPMs) based on devil's vortex toroidal lens (DVTL) are used in spatial as well as in Fourier planes. The images to be encrypted are first Fresnel transformed and then single-level discrete wavelet transform (DWT) is apply to decompose LL,HL, LH and HH matrices. The resulting matrices from the DWT are multiplied by additional RPMs and the resultants are subjected to inverse DWT for the encrypted images. The scheme is more secure because of many parameters used in the construction of SPM. The original images are recovered by using the correct parameters of FWT and SPM. Phase mask SPM based on DVTL increases security that enlarges the key space for encryption and decryption. The proposed encryption scheme is a lens-less optical system and its digital implementation has been performed using MATLAB 7.6.0 (R2008a). The computed value of mean-squared-error between the retrieved and the input images shows the efficacy of scheme. The sensitivity to encryption parameters, robustness against occlusion, entropy and multiplicative Gaussian noise attacks have been analysed.
Halving the dimension of a single image to be encrypted optically to avoid data expansion
Yi, Jiawang; Tan, Guanzheng
2016-06-01
When directly applying optical transforms, such as fractional Fourier transform (FrFT), to a single image or real image (input image), the resulting image will become complex-valued, which leads to the doubling of data volume. This data expansion problem can be found in many existing single-image optical encryption schemes. We propose a folding technique to offset the data expansion by constructing a complex input image of half size. And we devise an optical single-image encryption scheme based on double FrFTs, in which this technique together with compressed sensing can bring about the possible maximum compression of encrypted images. Moreover, the chaos-based random circular shift for scrambling is introduced to enhance security. The chaotic random signum matrix is also tried as the measurement matrix, and it displays a good performance. Simulation results demonstrate the validity and security of the proposed scheme.
An RGB Image Encryption Supported by Wavelet-based Lossless Compression
Directory of Open Access Journals (Sweden)
Ch. Samson
2012-09-01
Full Text Available In this paper we have proposed a method for an RGB image encryption supported by lifting scheme based lossless compression. Firstly we have compressed the input color image using a 2-D integer wavelet transform. Then we have applied lossless predictive coding to achieve additional compression. The compressed image is encrypted by using Secure Advanced Hill Cipher (SAHC involving a pair of involutory matrices, a function called Mix( and an operation called XOR. Decryption followed by reconstruction shows that there is no difference between the output image and the input image. The proposed method can be used for efficient and secure transmission of image data.
Multiple information encryption by user-image-based gyrator transform hologram
Abuturab, Muhammad Rafiq
2017-05-01
A novel multiple information encryption by user-image-based gyrator transform hologram is proposed. In encryption process, each channel of the user image is phase encoded, modulated by random phase function and then gyrator transformed to get the gyrator spectrum of user image. Subsequently, each channel of the secret image is normalized, phase encoded, multiplied by modulated user image, and then gyrator transformed to obtain the gyrator spectrum of secret image. The encrypted digital hologram is recorded by the interference between the gyrator spectrum of user image and the spherical wave function. Similarly, the digital hologram for decryption is recorded by the interference between the gyrator spectrum of secret image and the spherical wave function. The multiple encrypted digital holograms are multiplexed into a final encoded hologram and the corresponding digital holograms for decryption are multiplexed into a final hologram for decryption. The wavelength and radius of the spherical wave function, and angle of gyrator transform are all essential keys for decryption. The proposed system has two main features. First, the encrypted hologram has no information about secret image. Second, the hologram for decryption used as identification key. Consequently the two marked security layers of information protection are achieved. The proposal can be realized by optoelectronic system. Numerical simulation results demonstrate the feasibility and security of the proposed technique.
Optical stream-cipher-like system for image encryption based on Michelson interferometer.
Yang, Bing; Liu, Zhengjun; Wang, Bo; Zhang, Yan; Liu, Shutian
2011-01-31
A novel optical image encryption scheme based on interference is proposed. The original image is digitally encoded into one phase-only mask by employing an improved Gerchberg-Saxton phase retrieval algorithm together with another predefined random phase mask which serves as the encryption key. The decryption process can be implemented optically based on Michelson interferometer by using the same key. The scheme can be regarded as a stream-cipher-like encryption system, the encryption and decryption keys are the same, however the operations are different. The position coordinates and light wavelength can also be used as additional keys during the decryption. Numerical simulations have demonstrated the validity and robustness of the proposed method.
A novel chaotic map and an improved chaos-based image encryption scheme.
Zhang, Xianhan; Cao, Yang
2014-01-01
In this paper, we present a novel approach to create the new chaotic map and propose an improved image encryption scheme based on it. Compared with traditional classic one-dimensional chaotic maps like Logistic Map and Tent Map, this newly created chaotic map demonstrates many better chaotic properties for encryption, implied by a much larger maximal Lyapunov exponent. Furthermore, the new chaotic map and Arnold's Cat Map based image encryption method is designed and proved to be of solid robustness. The simulation results and security analysis indicate that such method not only can meet the requirement of imagine encryption, but also can result in a preferable effectiveness and security, which is usable for general applications.
Optical image encryption based on compressive sensing and chaos in the fractional Fourier domain
Liu, Xingbin; Mei, Wenbo; Du, Huiqian
2014-11-01
We propose a novel image encryption algorithm based on compressive sensing (CS) and chaos in the fractional Fourier domain. The original image is dimensionality reduction measured using CS. The measured values are then encrypted using chaotic-based double-random-phase encoding technique in the fractional Fourier transform domain. The measurement matrix and the random-phase masks used in the encryption process are formed from pseudo-random sequences generated by the chaotic map. In this proposed algorithm, the final result is compressed and encrypted. The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys for distribution simultaneously. Numerical experiments verify the validity and security of the proposed algorithm.
A novel chaos-based bit-level permutation scheme for digital image encryption
Fu, Chong; Lin, Bin-bin; Miao, Yu-sheng; Liu, Xiao; Chen, Jun-jie
2011-11-01
Confidentiality is an important issue when digital images are transmitted over public networks, and encryption is the most useful technique employed for this purpose. Image encryption is somehow different from text encryption due to some inherent features of image such as bulk data capacity and high correlation among pixels, which are generally difficult to handle by conventional algorithms. Recently, chaos-based encryption has suggested a new and efficient way to deal with the intractable problems of fast and highly secure image encryption. This paper proposes a novel chaos-based bit-level permutation scheme for secure and efficient image cipher. To overcome the drawbacks of conventional permutation-only type image cipher, the proposed scheme introduced a significant diffusion effect in permutation procedure through a two-stage bit-level shuffling algorithm. The two-stage permutation operations are realized by chaotic sequence sorting algorithm and Arnold Cat map, respectively. Results of various types of analysis are interesting and indicate that the security level of the new scheme is competitive with that of permutation-diffusion type image cipher, while the computational complexity is much lower. Therefore the new scheme is a good candidate for real-time secure image communication applications.
A Novel Bit-level Image Encryption Method Based on Chaotic Map and Dynamic Grouping
Institute of Scientific and Technical Information of China (English)
张国基; 沈彦
2012-01-01
In this paper,a novel bit-level image encryption method based on dynamic grouping is proposed.In the proposed method,the plain-image is divided into several groups randomly,then permutation-diffusion process on bit level is carried out.The keystream generated by logistic map is related to the plain-image,which confuses the relationship between the plain-image and the cipher-image.The computer simulation results of statistical analysis,information entropy analysis and sensitivity analysis show that the proposed encryption method is secure and reliable enough to be used for communication application.
Bouslimi, Dalel; Coatrieux, Gouenou; Roux, Christian
2012-04-01
In this paper we propose a joint encryption/watermarking algorithm for the purpose of protecting medical images. The proposed solution gives access to the outcomes of the image integrity and of its origins as its attachment to one patient even if the image is stored encrypted. In this study, the given solution combines the RC4 stream cipher and two substitutive watermarking modulations: the Least Significant Bit Method and the Quantization Index Modulation. If watermarking and encryption are conducted jointly at the protection stage, watermark extraction and decryption can be applied independently. Experimental results achieved on 8 bits encoded echographic images illustrate the overall performances of the proposed scheme. At least, a capacity rate of 1 and 0.5 bits of message per pixel of image can be embedded in the spatial and the encrypted domains respectively, with a peak signal to noise ratio greater than 49 dB.
A self-adaptive image encryption scheme with half-pixel interchange permutation operation
Ye, Ruisong; Liu, Li; Liao, Minyu; Li, Yafang; Liao, Zikang
2017-01-01
A plain-image dependent image encryption scheme with half-pixel-level swapping permutation strategy is proposed. In the new permutation operation, a pixel-swapping operation between four higher bit-planes and four lower bit-planes is employed to replace the traditional confusion operation, which not only improves the conventional permutation efficiency within the plain-image, but also changes all the pixel gray values. The control parameters of generalized Arnold map applied for the permutation operation are related to the plain-image content and consequently can resist chosen-plaintext and known-plaintext attacks effectively. To enhance the security of the proposed image encryption, one multimodal skew tent map is applied to generate pseudo-random gray value sequence for diffusion operation. Simulations have been carried out thoroughly to demonstrate that the proposed image encryption scheme is highly secure thanks to its large key space and efficient permutation-diffusion operations.
Image encryption using the Gyrator transform and random phase masks generated by using chaos
Vilardy, Juan M.; Jimenez, Carlos J.; Perez, Ronal
2017-06-01
The Gyrator transform (GT), chaotic random phase masks (CRPMs) and a random permutation of the Jigsaw transform (JT) are utilized to design an images encryption-decryption system. The encryption-decryption system is based on the double random phase encoding (DRPE) in the Gyrator domain (GD), this technique uses two random phase masks (RPMs) to encode the image to encrypt (original image) into a random noise. The RPMs are generated by using chaos, these masks are CRPMs. The parameters of the chaotic function have the control of the generation of the CRPMs. We apply a random permutation to the resulting image of the DRPE technique, with the purpose of obtaining an encrypted image with a higher randomness. In order to successfully retrieve the original image (without errors or noise-free) at the output of the decryption system is necessary to have all the proper keys, which are: the rotation angles of the GTs, the parameters of the chaotic function utilized to generate the two CRPMs and the random permutation of the JT. We check and analyze the validity of the image encryption and decryption systems by means of computing simulations.
Transmission Error and Compression Robustness of 2D Chaotic Map Image Encryption Schemes
Directory of Open Access Journals (Sweden)
Michael Gschwandtner
2007-11-01
Full Text Available This paper analyzes the robustness properties of 2D chaotic map image encryption schemes. We investigate the behavior of such block ciphers under different channel error types and find the transmission error robustness to be highly dependent on on the type of error occurring and to be very different as compared to the effects when using traditional block ciphers like AES. Additionally, chaotic-mixing-based encryption schemes are shown to be robust to lossy compression as long as the security requirements are not too high. This property facilitates the application of these ciphers in scenarios where lossy compression is applied to encrypted material, which is impossible in case traditional ciphers should be employed. If high security is required chaotic mixing loses its robustness to transmission errors and compression, still the lower computational demand may be an argument in favor of chaotic mixing as compared to traditional ciphers when visual data is to be encrypted.
Transmission Error and Compression Robustness of 2D Chaotic Map Image Encryption Schemes
Directory of Open Access Journals (Sweden)
Gschwandtner Michael
2007-01-01
Full Text Available This paper analyzes the robustness properties of 2D chaotic map image encryption schemes. We investigate the behavior of such block ciphers under different channel error types and find the transmission error robustness to be highly dependent on on the type of error occurring and to be very different as compared to the effects when using traditional block ciphers like AES. Additionally, chaotic-mixing-based encryption schemes are shown to be robust to lossy compression as long as the security requirements are not too high. This property facilitates the application of these ciphers in scenarios where lossy compression is applied to encrypted material, which is impossible in case traditional ciphers should be employed. If high security is required chaotic mixing loses its robustness to transmission errors and compression, still the lower computational demand may be an argument in favor of chaotic mixing as compared to traditional ciphers when visual data is to be encrypted.
DWT versus WP Based Optical Color Image Encryption Robust to Composite Attacks
Directory of Open Access Journals (Sweden)
M. A. Mohamed
2017-01-01
Full Text Available Intensive studies have been done to get robust encryption algorithms. Due to the importance of image information, optical encryption has played a vital role in information security. Many optical encryption schemes have been proposed but most of them suffer from poor robustness. In this paper six proposed algorithms will be presented for optical encryption to be robust to severe attacks: composite attack. Three of these approaches are based on one level Discrete Wavelet Transform (DWT and the others are based on Wavelet Packet (WP. Not only will new techniques be presented but also a new proposed chaotic map has been developed as random keys for all algorithms. After extensive comparative study with some traditional techniques, it has been found that the novel algorithms have achieved better performance versus conventional ones. Also it has been found that WP based algorithms have achieved better performance than DWT based ones against severe composite attacks.
A New Loss-Tolerant Image Encryption Scheme Based on Secret Sharing and Two Chaotic Systems
Directory of Open Access Journals (Sweden)
Li Li
2012-04-01
Full Text Available In this study, we propose an efficient loss-tolerant image encryption scheme that protects both confidentiality and loss-tolerance simultaneously in shadow images. In this scheme, we generate the key sequence based on two chaotic maps and then encrypt the image during the sharing phase based on Shamir’s method. Experimental results show a better performance of the proposed scheme for different images than other methods from human vision. Security analysis confirms a high probability to resist both brute-force and collusion attacks.
Singh, Phool; Yadav, A. K.; Singh, Kehar
2017-04-01
A novel scheme for image encryption of phase images is proposed, using fractional Hartley transform followed by Arnold transform and singular value decomposition in the frequency domain. Since the plaintext is a phase image, the mask used in the spatial domain is a random amplitude mask. The proposed scheme has been validated for grayscale images and is sensitive to the encryption parameters such as the order of the Arnold transform and the fractional orders of the Hartley transform. We have also evaluated the scheme's resistance to the well-known noise and occlusion attacks.
A Wheel-Switch Selective Image Encryption Scheme Using Spatiotemporal Chaotic System
Wang, Xing-Yuan; Bao, Xue-Mei
2014-02-01
In this paper, we propose a novel selective image encryption scheme using a one-way coupled map lattice (CML) consisting of logistic maps and a selector constructed by two variants of a cyclic shift register (VCSR). The initial conditions and the coupling constant of CML in our scheme are influenced by all the contents of the plain image. Moreover, the selector is closely related to the nonencrypted part of the plain image. In addition, we select only a portion of image data to encrypt via a wheel-switch scheme governed by the selector. Users can select an appropriate proportion to encrypt the plain image for their different demands of security and efficiency. Experimental results and theoretical analysis show that the cryptosystem is effective and can resist various typical attacks.
Texture Analysis of Chaotic Coupled Map Lattices Based Image Encryption Algorithm
Khan, Majid; Shah, Tariq; Batool, Syeda Iram
2014-09-01
As of late, data security is key in different enclosures like web correspondence, media frameworks, therapeutic imaging, telemedicine and military correspondence. In any case, a large portion of them confronted with a few issues, for example, the absence of heartiness and security. In this letter, in the wake of exploring the fundamental purposes of the chaotic trigonometric maps and the coupled map lattices, we have presented the algorithm of chaos-based image encryption based on coupled map lattices. The proposed mechanism diminishes intermittent impact of the ergodic dynamical systems in the chaos-based image encryption. To assess the security of the encoded image of this scheme, the association of two nearby pixels and composition peculiarities were performed. This algorithm tries to minimize the problems arises in image encryption.
A Novel Image Encryption Scheme Based on Multi-orbit Hybrid of Discrete Dynamical System
Directory of Open Access Journals (Sweden)
Ruisong Ye
2014-10-01
Full Text Available A multi-orbit hybrid image encryption scheme based on discrete chaotic dynamical systems is proposed. One generalized Arnold map is adopted to generate three orbits for three initial conditions. Another chaotic dynamical system, tent map, is applied to generate one pseudo-random sequence to determine the hybrid orbit points from which one of the three orbits of generalized Arnold map. The hybrid orbit sequence is then utilized to shuffle the pixels' positions of plain-image so as to get one permuted image. To enhance the encryption security, two rounds of pixel gray values' diffusion is employed as well. The proposed encryption scheme is simple and easy to manipulate. The security and performance of the proposed image encryption have been analyzed, including histograms, correlation coefficients, information entropy, key sensitivity analysis, key space analysis, differential analysis, etc. All the experimental results suggest that the proposed image encryption scheme is robust and secure and can be used for secure image and video communication applications.
Image Encryption Algorithm Based on Hyperchaotic Maps and Nucleotide Sequences Database.
Niu, Ying; Zhang, Xuncai; Han, Feng
2017-01-01
Image encryption technology is one of the main means to ensure the safety of image information. Using the characteristics of chaos, such as randomness, regularity, ergodicity, and initial value sensitiveness, combined with the unique space conformation of DNA molecules and their unique information storage and processing ability, an efficient method for image encryption based on the chaos theory and a DNA sequence database is proposed. In this paper, digital image encryption employs a process of transforming the image pixel gray value by using chaotic sequence scrambling image pixel location and establishing superchaotic mapping, which maps quaternary sequences and DNA sequences, and by combining with the logic of the transformation between DNA sequences. The bases are replaced under the displaced rules by using DNA coding in a certain number of iterations that are based on the enhanced quaternary hyperchaotic sequence; the sequence is generated by Chen chaos. The cipher feedback mode and chaos iteration are employed in the encryption process to enhance the confusion and diffusion properties of the algorithm. Theoretical analysis and experimental results show that the proposed scheme not only demonstrates excellent encryption but also effectively resists chosen-plaintext attack, statistical attack, and differential attack.
Binary image encryption based on interference of two phase-only masks.
Jia, Wei; Wen, Fung Jacky; Chow, Yuk Tak; Zhou, Changhe
2012-07-20
Optical image encryption based on interference has attracted a lot of attention recently. The technique employs two pure phase masks derived from the complex field of the image in the Fresnel diffraction domain. The image decryption procedure can be carried out by inverse Fresnel transformation of the summation of two pure phase masks. However, the silhouette of the original image, which is recovered by either of the two phase-only masks, impedes the application of this technique. In this paper, a very simple method for binary image encryption based on interference of two phase-only masks is proposed without any silhouette problem. The binary image in combination with a random phase mask is separated into two phase-only masks directly, and the decryption by summation of the two masks can be performed digitally or optically. In this paper, the encryption and decryption processes are analyzed, after which both the optical simulation and the experimental results based on single-beam holography are given to demonstrate the feasibility of the encryption method. As information nowadays is mainly digitized into binary codes, the proposed encryption method may find applications in the information processing field.
A joint encryption/watermarking system for verifying the reliability of medical images.
Bouslimi, Dalel; Coatrieux, Gouenou; Cozic, Michel; Roux, Christian
2012-09-01
In this paper, we propose a joint encryption/water-marking system for the purpose of protecting medical images. This system is based on an approach which combines a substitutive watermarking algorithm, the quantization index modulation, with an encryption algorithm: a stream cipher algorithm (e.g., the RC4) or a block cipher algorithm (e.g., the AES in cipher block chaining (CBC) mode of operation). Our objective is to give access to the outcomes of the image integrity and of its origin even though the image is stored encrypted. If watermarking and encryption are conducted jointly at the protection stage, watermark extraction and decryption can be applied independently. The security analysis of our scheme and experimental results achieved on 8-bit depth ultrasound images as well as on 16-bit encoded positron emission tomography images demonstrate the capability of our system to securely make available security attributes in both spatial and encrypted domains while minimizing image distortion. Furthermore, by making use of the AES block cipher in CBC mode, the proposed system is compliant with or transparent to the DICOM standard.
Chatterjee, Monish R.; Almehmadi, Fares S.
2015-01-01
Secure information encryption via acousto-optic (AO) chaos with profiled optical beams indicates substantially better performance in terms of system robustness. This paper examines encryption of static and time-varying (video) images onto AO chaotic carriers using Gaussian-profile beams with diffracted data numerically generated using transfer functions. The use of profiled beams leads to considerable improvement in the encrypted signal. While static image encryption exhibits parameter tolerances within about +/-10% for uniform optical beams, profiled beams reduce the tolerance to less than 1%, thereby vastly improving both the overall security of the transmitted information as well as the quality of the image retrieval.
Image Encryption Algorithm Based on Dynamic DNA Coding and Chen’s Hyperchaotic System
Directory of Open Access Journals (Sweden)
Jian Zhang
2016-01-01
Full Text Available With the development of national information processes, specific image information from secret departments or individuals is often required to be confidentially transmitted. Numerous image encryption methods exist, especially since the initial value sensitivity and other characteristics of chaos theory and chaos theory-based encryption have become increasingly important in recent years. At present, DNA coding constitutes a new research direction of image encryption that uses the four base pairs of DNA code and image pixel values to establish a special correspondence, in order to achieve pixel diffusion. There are eight DNA encoding rules, and current methods of selecting the DNA encoding rules are largely fixed. Thus, the security of encoded data is not high. In this paper, we use the Lorenz chaotic system, Chen’s hyperchaotic system, and the DNA encoding combination and present a new image encryption algorithm that can dynamically select eight types of DNA encoding rules and eight types of DNA addition and subtraction rules, with significant improvements in security. Through simulation experiments and histograms, correlations, and NPCR analyses, we have determined that the algorithm possesses numerous desirable features, including good encryption effects and antishear and antinoise performances.
A Novel Image Encryption Based on Algebraic S-box and Arnold Transform
Farwa, Shabieh; Muhammad, Nazeer; Shah, Tariq; Ahmad, Sohail
2017-09-01
Recent study shows that substitution box (S-box) only cannot be reliably used in image encryption techniques. We, in this paper, propose a novel and secure image encryption scheme that utilizes the combined effect of an algebraic substitution box along with the scrambling effect of the Arnold transform. The underlying algorithm involves the application of S-box, which is the most imperative source to create confusion and diffusion in the data. The speciality of the proposed algorithm lies, firstly, in the high sensitivity of our S-box to the choice of the initial conditions which makes this S-box stronger than the chaos-based S-boxes as it saves computational labour by deploying a comparatively simple and direct approach based on the algebraic structure of the multiplicative cyclic group of the Galois field. Secondly the proposed method becomes more secure by considering a combination of S-box with certain number of iterations of the Arnold transform. The strength of the S-box is examined in terms of various performance indices such as nonlinearity, strict avalanche criterion, bit independence criterion, linear and differential approximation probabilities etc. We prove through the most significant techniques used for the statistical analyses of the encrypted image that our image encryption algorithm satisfies all the necessary criteria to be usefully and reliably implemented in image encryption applications.
Optical image encryption based on multi-beam interference and common vector decomposition
Chen, Linfei; He, Bingyu; Chen, Xudong; Gao, Xiong; Liu, Jingyu
2016-02-01
Based on multi-beam interference and common vector decomposition, we propose a new method for optical image encryption. In encryption process, the information of an original image is encoded into n amplitude masks and n phase masks which are regarded as a ciphertext and many keys. In decryption process, parallel light irradiates the amplitude masks and phase masks, then passes through lens that takes place Fourier transform, and finally we obtain the original image at the output plane after interference. The security of the encryption system is also discussed in the paper, and we find that only when all the keys are correct, can the information of the original image be recovered. Computer simulation results are presented to verify the validity and the security of the proposed method.
Quantum image encryption based on generalized affine transform and logistic map
Liang, Hao-Ran; Tao, Xiang-Yang; Zhou, Nan-Run
2016-07-01
Quantum circuits of the generalized affine transform are devised based on the novel enhanced quantum representation of digital images. A novel quantum image encryption algorithm combining the generalized affine transform with logistic map is suggested. The gray-level information of the quantum image is encrypted by the XOR operation with a key generator controlled by the logistic map, while the position information of the quantum image is encoded by the generalized affine transform. The encryption keys include the independent control parameters used in the generalized affine transform and the logistic map. Thus, the key space is large enough to frustrate the possible brute-force attack. Numerical simulations and analyses indicate that the proposed algorithm is realizable, robust and has a better performance than its classical counterpart in terms of computational complexity.
Belazi, Akram; Abd El-Latif, Ahmed A.; Diaconu, Adrian-Viorel; Rhouma, Rhouma; Belghith, Safya
2017-01-01
In this paper, a new chaos-based partial image encryption scheme based on Substitution-boxes (S-box) constructed by chaotic system and Linear Fractional Transform (LFT) is proposed. It encrypts only the requisite parts of the sensitive information in Lifting-Wavelet Transform (LWT) frequency domain based on hybrid of chaotic maps and a new S-box. In the proposed encryption scheme, the characteristics of confusion and diffusion are accomplished in three phases: block permutation, substitution, and diffusion. Then, we used dynamic keys instead of fixed keys used in other approaches, to control the encryption process and make any attack impossible. The new S-box was constructed by mixing of chaotic map and LFT to insure the high confidentiality in the inner encryption of the proposed approach. In addition, the hybrid compound of S-box and chaotic systems strengthened the whole encryption performance and enlarged the key space required to resist the brute force attacks. Extensive experiments were conducted to evaluate the security and efficiency of the proposed approach. In comparison with previous schemes, the proposed cryptosystem scheme showed high performances and great potential for prominent prevalence in cryptographic applications.
Fully phase image encryption using double random-structured phase masks in gyrator domain.
Singh, Hukum; Yadav, A K; Vashisth, Sunanda; Singh, Kehar
2014-10-01
We propose a method for fully phase image encryption based on double random-structured phase mask encoding in the gyrator transform (GT) domain. The security of the system is strengthened by parameters used in the construction of a structured phase mask (SPM) based on a devil's vortex Fresnel lens (DVFL). The input image is recovered using the correct parameters of the SPMs, transform orders of the GT, and conjugate of the random phase masks. The use of a DVFL-based SPM enhances security by increasing the key space for encryption, and also overcomes the problem of axis alignment associated with an optical setup. The proposed scheme can also be implemented optically. The computed values of mean squared error between the retrieved and the original image show the efficacy of the proposed scheme. We have also investigated the scheme's sensitivity to the encryption parameters, and robustness against occlusion and multiplicative Gaussian noise attacks.
Image encryption with chaotic map and Arnold transform in the gyrator transform domains
Sang, Jun; Luo, Hongling; Zhao, Jun; Alam, Mohammad S.; Cai, Bin
2017-05-01
An image encryption method combing chaotic map and Arnold transform in the gyrator transform domains was proposed. Firstly, the original secret image is XOR-ed with a random binary sequence generated by a logistic map. Then, the gyrator transform is performed. Finally, the amplitude and phase of the gyrator transform are permutated by Arnold transform. The decryption procedure is the inverse operation of encryption. The secret keys used in the proposed method include the control parameter and the initial value of the logistic map, the rotation angle of the gyrator transform, and the transform number of the Arnold transform. Therefore, the key space is large, while the key data volume is small. The numerical simulation was conducted to demonstrate the effectiveness of the proposed method and the security analysis was performed in terms of the histogram of the encrypted image, the sensitiveness to the secret keys, decryption upon ciphertext loss, and resistance to the chosen-plaintext attack.
Wang, Hongjuan; Qin, Yi; Huang, Yiding; Wang, Zhipeng; Zhang, Yingying
2017-10-01
Conventional interference-based encryption (IBE) scheme suffers from the silhouette problem, and its capacity is relatively low. In this paper, we introduce sparse representation and space multiplexing into the IBE scheme and propose a method for multiple-image encryption and authentication. We demonstrate, through space multiplexing, the information of multiple images can be encrypted into two phase only masks. The decrypted images are intended to be authenticated by nonlinear correlation rather than be observed by naked eyes, and because of that, the silhouette problem has been thoroughly suppressed. Moreover, the capacity of the IBE scheme is also extensively enhanced. The feasibility and effectiveness of the proposal have been demonstrated by numerical simulations.
Enayatifar, Rasul; Sadaei, Hossein Javedani; Abdullah, Abdul Hanan; Lee, Malrey; Isnin, Ismail Fauzi
2015-08-01
Currently, there are many studies have conducted on developing security of the digital image in order to protect such data while they are sending on the internet. This work aims to propose a new approach based on a hybrid model of the Tinkerbell chaotic map, deoxyribonucleic acid (DNA) and cellular automata (CA). DNA rules, DNA sequence XOR operator and CA rules are used simultaneously to encrypt the plain-image pixels. To determine rule number in DNA sequence and also CA, a 2-dimension Tinkerbell chaotic map is employed. Experimental results and computer simulations, both confirm that the proposed scheme not only demonstrates outstanding encryption, but also resists various typical attacks.
Cryptanalysis and improvement of a digital image encryption method with chaotic map lattices
Institute of Scientific and Technical Information of China (English)
Wang Xing-Yuan; Liu Lin-Tao
2013-01-01
A digital image encryption scheme using chaotic map lattices has been proposed recently.In this paper,two fatal flaws of the cryptosystem are pointed out.According to these two drawbacks,cryptanalysts could recover the plaintext by applying the chosen plaintext attack.Therefore,the proposed cryptosystem is not secure enough to be used in the image transmission system.Experimental results show the feasibility of the attack.As a result,we make some improvements to the encryption scheme,which can completely resist our chosen plaintext attack.
Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map
2014-01-01
We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of more than 10113 key space and desirable level of security based on the good statistical results and theoretical arguments. PMID:25143970
Yuan, Lin; Ran, Qiwen; Zhao, Tieyu
2017-02-01
In this paper an image authentication scheme is proposed based on double-image encryption and partial phase decryption in nonseparable Fractional Fourier transform domain. Two original images are combined and transformed into the nonseparable fractional Fourier domain. Only part of the phase information of the encrypted result is kept for decryption while the rest part of phase and all the amplitude information are discarded. The two recovered images are hardly recognized by visual inspection but can be authenticated by the nonlinear correlation algorithm. The numerical simulations demonstrate the viability and validity of the proposed image authentication scheme.
Zhao, Shengmei; Wang, Le; Liang, Wenqiang; Cheng, Weiwen; Gong, Longyan
2015-10-01
In this paper, we propose a high performance optical encryption (OE) scheme based on computational ghost imaging (GI) with QR code and compressive sensing (CS) technique, named QR-CGI-OE scheme. N random phase screens, generated by Alice, is a secret key and be shared with its authorized user, Bob. The information is first encoded by Alice with QR code, and the QR-coded image is then encrypted with the aid of computational ghost imaging optical system. Here, measurement results from the GI optical system's bucket detector are the encrypted information and be transmitted to Bob. With the key, Bob decrypts the encrypted information to obtain the QR-coded image with GI and CS techniques, and further recovers the information by QR decoding. The experimental and numerical simulated results show that the authorized users can recover completely the original image, whereas the eavesdroppers can not acquire any information about the image even the eavesdropping ratio (ER) is up to 60% at the given measurement times. For the proposed scheme, the number of bits sent from Alice to Bob are reduced considerably and the robustness is enhanced significantly. Meantime, the measurement times in GI system is reduced and the quality of the reconstructed QR-coded image is improved.
Sui, Liansheng; Duan, Kuaikuai; Liang, Junli; Hei, Xinhong
2014-05-05
A double-image encryption is proposed based on the discrete fractional random transform and logistic maps. First, an enlarged image is composited from two original images and scrambled in the confusion process which consists of a number of rounds. In each round, the pixel positions of the enlarged image are relocated by using cat maps which are generated based on two logistic maps. Then the scrambled enlarged image is decomposed into two components. Second, one of two components is directly separated into two phase masks and the other component is used to derive the ciphertext image with stationary white noise distribution by using the cascaded discrete fractional random transforms generated based on the logistic map. The cryptosystem is asymmetric and has high resistance against to the potential attacks such as chosen plaintext attack, in which the initial values of logistic maps and the fractional orders are considered as the encryption keys while two decryption keys are produced in the encryption process and directly related to the original images. Simulation results and security analysis verify the feasibility and effectiveness of the proposed encryption scheme.
Quantum Image Encryption Based on Iterative Framework of Frequency-Spatial Domain Transforms
Wang, Han; Wang, Jian; Geng, Ya-Cong; Song, Yan; Liu, Ji-Qiang
2017-10-01
A novel quantum image encryption and decryption algorithm based on iteration framework of frequency-spatial domain transforms is proposed. In this paper, the images are represented in the flexible representation for quantum images (FRQI). Previous quantum image encryption algorithms are realized by spatial domain transform to scramble the position information of original images and frequency domain transform to encode the color information of images. But there are some problems such as the periodicity of spatial domain transform, which will make it easy to recover the original images. Hence, we present the iterative framework of frequency-spatial domain transforms. Based on the iterative framework, the novel encryption algorithm uses Fibonacci transform and geometric transform for many times to scramble the position information of the original images and double random-phase encoding to encode the color information of the images. The encryption keys include the iterative time t of the Fibonacci transform, the iterative time l of the geometric transform, the geometric transform matrix G i which is n × n matrix, the classical binary sequences K (k0k1{\\ldots } k_{2^{2n}-1}) and D(d0d1{\\ldots } d_{2^{2n}-1}). Here the key space of Fibonacci transform and geometric transform are both estimated to be 226. The key space of binary sequences is (2 n× n ) × (2 n× n ). Then the key space of the entire algorithm is about 2^{2{n2}+52}. Since all quantum operations are invertible, the quantum image decryption algorithm is the inverse of the encryption algorithm. The results of numerical simulation and analysis indicate that the proposed algorithm has high security and high sensitivity.
Interference-based optical image encryption with silhouette removal by amplitude modulation
Wang, Yong; Quan, Chenggen
2017-10-01
Interference-based optical encryption schemes have an inherent silhouette problem, due to the equipollent nature of the phase-only masks generated from an analytical method. We propose a new interference-based optical image encryption with silhouette removal by amplitude modulation. Different from the previous methods, which require time-consuming iterative computation or post-processing of the phase-only masks for silhouette removal, the proposed method can resolve the problem by adding an amplitude modulating operation on the original image. The introduction of the amplitude modulator can significantly enhance the security of the system, and the silhouette problem inherent in a conventional interference-based encryption method is fully resolved. The design and parameter choice of the amplitude modulator is discussed. Numerical simulations are presented to verify the validity of the proposed method.
Institute of Scientific and Technical Information of China (English)
Ding Lu; Weimin Jin
2011-01-01
A novel fully phase color image encryption/decryption scheme based on joint fractional Fourier transform correlator (JFRTC) and phase retrieval algorithm (PRA) is proposed. The security of the system is enhanced by the fractional order as a new added key. This method takes full advantage of the parallel processing features of the optical system and could optically realize single-channel color image encryption.The system and operation procedures are simplified. The simulation results of a color image indicate that the new method provides efficient solutions with a strong sense of security.%@@ A novel fully phase color image encryption/decryption scheme based on joint fractional Fourier transform correlator (JFRTC) and phase retrieval algorithm (PRA) is proposed. The security of the system is enhanced by the fractional order as a new added key. This method takes full advantage of the parallel processing features of the optical system and could optically realize single-channel color image encryption. The system and operation procedures are simplified. The simulation results of a color image indicate that the new method provides efficient solutions with a strong sense of security.
Qin, Yi; Gong, Qiong; Wang, Zhipeng; Wang, Hongjuan
2016-11-14
We report a new method for multiple-image encryption in diffractive-imaging-based encryption (DIBE) scheme. The discrete cosine transformation (DCT) spectra of the primary images are extracted, compacted and then nonlinear-transformed before being sent to the DIBE, where they are encoded into a single intensity pattern. With the help of a suggested phase retrieval algorithm, the original images can be recovered with high quality. Furthermore, due to the introduction of the nonlinear operation, the proposal is demonstrated to be robust to the currently available cryptographic attacks. The proposal probes a new way for multiple-image encryption in DIBE, and its effectiveness and feasibility have been supported by numerical simulations.
A hierarchical classification scheme of psoriasis images
DEFF Research Database (Denmark)
Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær
2003-01-01
the normal skin in the second stage. These tools are the Expectation-Maximization Algorithm, the quadratic discrimination function and a classification window of optimal size. Extrapolation of classification parameters of a given image to other images of the set is evaluated by means of Cohen's Kappa......A two-stage hierarchical classification scheme of psoriasis lesion images is proposed. These images are basically composed of three classes: normal skin, lesion and background. The scheme combines conventional tools to separate the skin from the background in the first stage, and the lesion from...
Vilardy, Juan M.; Millán, María S.; Pérez-Cabré, Elisabet
2017-02-01
A novel nonlinear image encryption scheme based on a fully phase nonzero-order joint transform correlator architecture (JTC) in the Gyrator domain (GD) is proposed. In this encryption scheme, the two non-overlapping data distributions of the input plane of the JTC are fully encoded in phase and this input plane is transformed using the Gyrator transform (GT); the intensity distribution captured in the GD represents a new definition of the joint Gyrator power distribution (JGPD). The JGPD is modified by two nonlinear operations with the purpose of retrieving the encrypted image, with enhancement of the decrypted signal quality and improvement of the overall security. There are three keys used in the encryption scheme, two random phase masks and the rotation angle of the GT, which are all necessary for a proper decryption. Decryption is highly sensitivity to changes of the rotation angle of the GT as well as to little changes in other parameters or keys. The proposed encryption scheme in the GD still preserves the shift-invariance properties originated in the JTC-based encryption in the Fourier domain. The proposed encryption scheme is more resistant to brute force attacks, chosen-plaintext attacks, known-plaintext attacks, and ciphertext-only attacks, as they have been introduced in the cryptanalysis of the JTC-based encryption system. Numerical results are presented and discussed in order to verify and analyze the feasibility and validity of the novel encryption-decryption scheme.
Synchronization of spatiotemporal semiconductor lasers and its application in color image encryption
Banerjee, S.; Rondoni, L.; Mukhopadhyay, S.; Misra, A. P.
2011-05-01
Optical chaos is a topic of current research characterized by high-dimensional nonlinearity which is attributed to the delay-induced dynamics, high bandwidth and easy modular implementation of optical feedback. In light of these facts, which add enough confusion and diffusion properties for secure communications, we explore the synchronization phenomena in spatiotemporal semiconductor laser systems. The novel system is used in a two-phase colored image encryption process. The high-dimensional chaotic attractor generated by the system produces a completely randomized chaotic time series, which is ideal in the secure encoding of messages. The scheme thus illustrated is a two-phase encryption method, which provides sufficiently high confusion and diffusion properties of chaotic cryptosystem employed with unique data sets of processed chaotic sequences. In this novel method of cryptography, the chaotic phase masks are represented as images using the chaotic sequences as the elements of the image. The scheme drastically permutes the positions of the picture elements. The next additional layer of security further alters the statistical information of the original image to a great extent along the three-color planes. The intermediate results during encryption demonstrate the infeasibility for an unauthorized user to decipher the cipher image. Exhaustive statistical tests conducted validate that the scheme is robust against noise and resistant to common attacks due to the double shield of encryption and the infinite dimensionality of the relevant system of partial differential equations.
Parallel encryption for multi-channel images based on an optical joint transform correlator
Liu, Jie; Bai, Tingzhu; Shen, Xueju; Dou, Shuaifeng; Lin, Chao; Cai, Jianjun
2017-08-01
We propose an optical encryption method allowing the parallel encryption for multi-channel images based on a joint transform correlator (JTC). Distinguished from the conventional multi-image encryption methods, our proposed cryptosystem can encrypt multi-channel images simultaneously into a single ciphertext, which also can be used to recover arbitrary original images with corresponding keys. This method can achieve the compressed storage of ciphertext. In order to avoid the cross talk between multi-channel images, we restrict the respective joint power spectrum (JPS) into a specific area with optimized phase masks and split the multiple JPS by controlling the position of single JPS using the linear phase shifts. All of these operations are realized by optimizing and designing the phase masks which can be flexibly reconfigured on the spatial light modulator (SLM), leading to a feasible optical implementation with no increase of optical hardware and complexity. Computer simulations provide the validation for it. Experimental implementation is performed in a JTC-based cryptosystem to further verify the feasibility of our proposed method.
A NEW TECHNIQUE BASED ON CHAOTIC STEGANOGRAPHY AND ENCRYPTION TEXT IN DCT DOMAIN FOR COLOR IMAGE
Directory of Open Access Journals (Sweden)
MELAD J. SAEED
2013-10-01
Full Text Available Image steganography is the art of hiding information into a cover image. This paper presents a new technique based on chaotic steganography and encryption text in DCT domain for color image, where DCT is used to transform original image (cover image from spatial domain to frequency domain. This technique used chaotic function in two phases; firstly; for encryption secret message, second; for embedding in DCT cover image. With this new technique, good results are obtained through satisfying the important properties of steganography such as: imperceptibility; improved by having mean square error (MSE, peak signal to noise ratio (PSNR and normalized correlation (NC, to phase and capacity; improved by encoding the secret message characters with variable length codes and embedding the secret message in one level of color image only.
Directory of Open Access Journals (Sweden)
Mohamed M. Abd-Eldayem
2013-03-01
Full Text Available Nowadays; modern Hospital Data Management Systems (HDMSs are applied in a computer network; in addition medicinal equipments produce medical images in a digital form. HDMS must store and exchange these images in a secured environment to provide image integrity and patient privacy. The reversible watermarking techniques can be used to provide the integrity and the privacy. In this paper, a security technique based on watermarking and encryption is proposed to be used for Digital Imaging and Communications in Medicine (DICOM. It provides patient authentication, information confidentiality and integrity based on reversible watermark. To achieve integrity service at the sender side; a hash value based on encrypted MD5 is determined from the image. And to satisfy the reversible feature; R–S-Vector is determined from the image and is compressed based on a Huffman compression algorithm. After that to provide confidentiality and authentication services: the compressed R–S-Vector, the hash value and patient ID are concatenated to form a watermark then this watermark is encrypted using AES encryption technique, finally the watermark is embedded inside the medical image. Experimental results prove that the proposed technique can provide patient authentication services, image integrity service and information confidentiality service with excellent efficiency. Concluded results for all tested DICOM medical images and natural images show the following: BER equals 0, both of SNR and PSNR are consistent and have large values, and MSE has low value; the average values of SNR, PSNR and MSE are 52 dB, 57 dB and 0.12 respectively. Therefore, watermarked images have high imperceptibility, invisibility and transparency. In addition, the watermark extracted from the image at the receiver side is identical to the watermark embedded into the image in the sender side; as a result, the proposed technique is totally reversible, and the embedded watermark does not
A Novel Color Image Encryption Algorithm Based on Quantum Chaos Sequence
Liu, Hui; Jin, Cong
2017-03-01
In this paper, a novel algorithm of image encryption based on quantum chaotic is proposed. The keystreams are generated by the two-dimensional logistic map as initial conditions and parameters. And then general Arnold scrambling algorithm with keys is exploited to permute the pixels of color components. In diffusion process, a novel encryption algorithm, folding algorithm, is proposed to modify the value of diffused pixels. In order to get the high randomness and complexity, the two-dimensional logistic map and quantum chaotic map are coupled with nearest-neighboring coupled-map lattices. Theoretical analyses and computer simulations confirm that the proposed algorithm has high level of security.
An Image Encryption Scheme Based on Hyperchaotic Rabinovich and Exponential Chaos Maps
Directory of Open Access Journals (Sweden)
Xiaojun Tong
2015-01-01
Full Text Available This paper proposes a new four-dimensional hyperchaotic map based on the Rabinovich system to realize chaotic encryption in higher dimension and improve the security. The chaotic sequences generated by Runge-Kutta method are combined with the chaotic sequences generated by an exponential chaos map to generate key sequences. The key sequences are used for image encryption. The security test results indicate that the new hyperchaotic system has high security and complexity. The comparison between the new hyperchaotic system and the several low-dimensional chaotic systems shows that the proposed system performs more efficiently.
Cryptanalysis of a novel image encryption scheme based on improved hyperchaotic sequences
Özkaynak, Fatih; Özer, Ahmet Bedri; Yavuz, Sırma
2012-11-01
Chaotic cryptography is a new field that has seen a significant amount of research activity during the last 20 years. Despite the many proposals that use various methods in the design of encryption algorithms, there is a definite need for a mathematically rigorous cryptanalysis of these designs. In this study, we analyze the security weaknesses of the "C. Zhu, A novel image encryption scheme based on improved hyperchaotic sequences, Optics Communications 285 (2012) 29-37". By applying chosen plaintext attacks, we show that all the secret parameters can be revealed.
Rajput, Sudheesh K; Nishchal, Naveen K
2014-01-20
We propose a novel nonlinear image-encryption scheme based on a Gerchberg-Saxton (G-S) phase-retrieval algorithm in the Fresnel transform domain. The decryption process can be performed using conventional double random phase encoding (DRPE) architecture. The encryption is realized by applying G-S phase-retrieval algorithm twice, which generates two asymmetric keys from intermediate phases. The asymmetric keys are generated in such a way that decryption is possible optically with a conventional DRPE method. Due to the asymmetric nature of the keys, the proposed encryption process is nonlinear and offers enhanced security. The cryptanalysis has been carried out, which proves the robustness of proposed scheme against known-plaintext, chosen-plaintext, and special attacks. A simple optical setup for decryption has also been suggested. Results of computer simulation support the idea of the proposed cryptosystem.
Multidimensional Z-Matrix with Control Parameters and Its Applications in Image Encryption
Institute of Scientific and Technical Information of China (English)
ZHAO Liang; LIAO Xiao-Feng; XIANG Tao; XIAO Di
2009-01-01
An n-dimensional Z-matrix with control parameters is presented,and its periodicity and chaos are testified.Experimental results show that the proposed Z-matrix has a long period and changeable periodicity with different dimensions.Some examples of image encryption with a Z-matrix of different dimensions are listed for demonstrating its appfications.
Multi-focus image fusion and robust encryption algorithm based on compressive sensing
Xiao, Di; Wang, Lan; Xiang, Tao; Wang, Yong
2017-06-01
Multi-focus image fusion schemes have been studied in recent years. However, little work has been done in multi-focus image transmission security. This paper proposes a scheme that can reduce data transmission volume and resist various attacks. First, multi-focus image fusion based on wavelet decomposition can generate complete scene images and optimize the perception of the human eye. The fused images are sparsely represented with DCT and sampled with structurally random matrix (SRM), which reduces the data volume and realizes the initial encryption. Then the obtained measurements are further encrypted to resist noise and crop attack through combining permutation and diffusion stages. At the receiver, the cipher images can be jointly decrypted and reconstructed. Simulation results demonstrate the security and robustness of the proposed scheme.
Directory of Open Access Journals (Sweden)
Sunanda Vashisth
2014-01-01
Full Text Available A frequency plane phase mask based on Devil’s vortex structure has been used for image encryption using the fractional Mellin transform. The phase key for decryption is obtained by an iterative phase retrieval algorithm. The proposed scheme has been validated for grayscale secret target images, by numerical simulation. The efficacy of the scheme has been evaluated by computing mean-squared-error between the secret target image and the decrypted image. Sensitivity analysis of the decryption process to variations in various encryption parameters has been carried out. The proposed encryption scheme has been seen to exhibit reasonable robustness against occlusion attack.
Semantic Image Segmentation with Contextual Hierarchical Models.
Seyedhosseini, Mojtaba; Tasdizen, Tolga
2016-05-01
Semantic segmentation is the problem of assigning an object label to each pixel. It unifies the image segmentation and object recognition problems. The importance of using contextual information in semantic segmentation frameworks has been widely realized in the field. We propose a contextual framework, called contextual hierarchical model (CHM), which learns contextual information in a hierarchical framework for semantic segmentation. At each level of the hierarchy, a classifier is trained based on downsampled input images and outputs of previous levels. Our model then incorporates the resulting multi-resolution contextual information into a classifier to segment the input image at original resolution. This training strategy allows for optimization of a joint posterior probability at multiple resolutions through the hierarchy. Contextual hierarchical model is purely based on the input image patches and does not make use of any fragments or shape examples. Hence, it is applicable to a variety of problems such as object segmentation and edge detection. We demonstrate that CHM performs at par with state-of-the-art on Stanford background and Weizmann horse datasets. It also outperforms state-of-the-art edge detection methods on NYU depth dataset and achieves state-of-the-art on Berkeley segmentation dataset (BSDS 500).
Institute of Scientific and Technical Information of China (English)
CHEN Lin-Fei; ZHAO Dao-Mu
2006-01-01
@@ We propose a new method to add different images together by optical implementation that is realized by the multi-exposure based on fractional Fourier transform hologram. Partial image fusion is proposed and realized by this method. Multiple images encryption can also be implemented by the multi-exposure of the hologram based on fractional Fourier transform. Computer simulations prove that this method is valid.
Phase-retrieval algorithms applied in a 4-f system for optical image encryption: a comparison
Situ, Guohai; Zhang, Jingjuan
2005-01-01
Phase retrieval algorithms based on 4-f system for optical image encryption are compared in respect of the image retrieval quality and the convergence. Simulation results show that enlarging the searching space can decrypt the image with extremely high quality, while employing the searching strategy of modifying both the phase-distributions in the input and the frequency planes can result in much faster convergence for the algorithm.
Kasem, Hossam M.; Nasr, Mohamed E.; Sallam, Elsayed A.; Abd El-Samie, F. E.
2011-10-01
Image transmission takes place as an important research branch in multimedia broadcasting communication systems in the last decade. Our paper presents image transmission over a FFT-OFDM (Fast Fourier Transform Orthogonal Frequency Division Multiplexing). The need for encryption techniques increase with the appearance of the expression which said that our world became small village, and the use of image application such as conference and World Wide Web which increase rapidly in recent years. Encryption is an effective method for protecting the transmitted data by converting it into a form being invisible over transmission path and visible in receiver side. This paper presents a new hybrid encryption technique based on combination of Backer maps and logistic map. This proposed technique aims to increase PSNR and reduce the noise in the received image. The encryption is done by shuffling the positions of a pixel image using two dimensional Baker maps then encrypt using XOR operation with logistic map to generate cipher image over orthogonal frequency multiplexing (OFDM). The encryption approach adopted in this paper is based on chaotic Baker maps because the encoding and decoding steps in this approach are simple and fast enough for HDTV applications. The experimental results reveal the superiority of the proposed chaotic based image encryption technique using two logistic maps and two dimensional Backer map over normal Backer map.
Tian, Ye; Lu, Zhimao
2017-08-01
The development of the computer network makes image files transportation via network become more and more convenient. This paper is concerned with the image encryption algorithm design based on the chaotic S-box mechanism. This paper proposes an Image Encryption algorithm involving both chaotic dynamic S-boxes and DNA sequence operation(IESDNA). The contribution of this paper is three folded: Firstly, we design an external 256-bit key to get large key space; secondly, we design a chaotic system to scramble image pixels; thirdly, DNA sequence operations are adopted to diffuse the scrambled image pixels. Experimental results show that our proposed image encryption algorithm can meet multiple cryptographic criteria and obtain good image encryption effect.
Cheremkhin, Pavel A.; Evtikhiev, Nikolay N.; Krasnov, Vitaly V.; Molodtsov, Dmitriy Y.; Rodin, Vladislav G.; Shifrina, Anna V.
2016-04-01
The majority of existing methods of optical encryption use not only light intensity distribution, easily registered with photosensors, but also its phase distribution. This provides best encryption strength for fixed quantities of elements and phase levels in a mask. Downsides are holographic registration scheme used in order to register not only light intensity distribution but also its phase distribution and speckle noise occurring due to coherent illumination. That factors lead to very poor decryption quality when it comes from computer simulations to optical implementations. Method of optical encryption with spatially incoherent illumination does not have drawbacks inherent to coherent systems, however, as only light intensity distribution is considered, mean value of image to be encrypted is always above zero which leads to intensive zero spatial frequency peak in image spectrum. Therefore, in case of spatially incoherent illumination, image spectrum, as well as encryption key spectrum, cannot be white. If encryption is based on convolution operation, no matter coherent light used or not, Fourier spectrum amplitude distribution of encryption key should overlap Fourier spectrum amplitude distribution of image to be encrypted otherwise loss of information is unavoidable. Another factor affecting decrypted image quality is original image spectrum. Usually, most part of image energy is concentrated in area of low frequencies. Consequently, only this area in encrypted image contains information about original image, while other areas contain only noise. We propose to use additional encoding of input scene to increase size of the area containing useful information. This provides increase of signal-to-noise ratio in encrypted image and consequentially increases quality of decrypted images. Results of computer simulations of test images optical encryption with spatially incoherent illumination and additional input amplitude masks are presented.
Chaotic image encryption based on running-key related to plaintext.
Guanghui, Cao; Kai, Hu; Yizhi, Zhang; Jun, Zhou; Xing, Zhang
2014-01-01
In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack.
Design of an image encryption scheme based on a multiple chaotic map
Tong, Xiao-Jun
2013-07-01
In order to solve the problem that chaos is degenerated in limited computer precision and Cat map is the small key space, this paper presents a chaotic map based on topological conjugacy and the chaotic characteristics are proved by Devaney definition. In order to produce a large key space, a Cat map named block Cat map is also designed for permutation process based on multiple-dimensional chaotic maps. The image encryption algorithm is based on permutation-substitution, and each key is controlled by different chaotic maps. The entropy analysis, differential analysis, weak-keys analysis, statistical analysis, cipher random analysis, and cipher sensibility analysis depending on key and plaintext are introduced to test the security of the new image encryption scheme. Through the comparison to the proposed scheme with AES, DES and Logistic encryption methods, we come to the conclusion that the image encryption method solves the problem of low precision of one dimensional chaotic function and has higher speed and higher security.
Chaotic Image Encryption Based on Running-Key Related to Plaintext
Directory of Open Access Journals (Sweden)
Cao Guanghui
2014-01-01
Full Text Available In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack.
An authenticated image encryption scheme based on chaotic maps and memory cellular automata
Bakhshandeh, Atieh; Eslami, Ziba
2013-06-01
This paper introduces a new image encryption scheme based on chaotic maps, cellular automata and permutation-diffusion architecture. In the permutation phase, a piecewise linear chaotic map is utilized to confuse the plain-image and in the diffusion phase, we employ the Logistic map as well as a reversible memory cellular automata to obtain an efficient and secure cryptosystem. The proposed method admits advantages such as highly secure diffusion mechanism, computational efficiency and ease of implementation. A novel property of the proposed scheme is its authentication ability which can detect whether the image is tampered during the transmission or not. This is particularly important in applications where image data or part of it contains highly sensitive information. Results of various analyses manifest high security of this new method and its capability for practical image encryption.
Hierarchical manifold learning for regional image analysis.
Bhatia, Kanwal K; Rao, Anil; Price, Anthony N; Wolz, Robin; Hajnal, Joseph V; Rueckert, Daniel
2014-02-01
We present a novel method of hierarchical manifold learning which aims to automatically discover regional properties of image datasets. While traditional manifold learning methods have become widely used for dimensionality reduction in medical imaging, they suffer from only being able to consider whole images as single data points. We extend conventional techniques by additionally examining local variations, in order to produce spatially-varying manifold embeddings that characterize a given dataset. This involves constructing manifolds in a hierarchy of image patches of increasing granularity, while ensuring consistency between hierarchy levels. We demonstrate the utility of our method in two very different settings: 1) to learn the regional correlations in motion within a sequence of time-resolved MR images of the thoracic cavity; 2) to find discriminative regions of 3-D brain MR images associated with neurodegenerative disease.
Hierarchical image segmentation for learning object priors
Energy Technology Data Exchange (ETDEWEB)
Prasad, Lakshman [Los Alamos National Laboratory; Yang, Xingwei [TEMPLE UNIV.; Latecki, Longin J [TEMPLE UNIV.; Li, Nan [TEMPLE UNIV.
2010-11-10
The proposed segmentation approach naturally combines experience based and image based information. The experience based information is obtained by training a classifier for each object class. For a given test image, the result of each classifier is represented as a probability map. The final segmentation is obtained with a hierarchial image segmentation algorithm that considers both the probability maps and the image features such as color and edge strength. We also utilize image region hierarchy to obtain not only local but also semi-global features as input to the classifiers. Moreover, to get robust probability maps, we take into account the region context information by averaging the probability maps over different levels of the hierarchical segmentation algorithm. The obtained segmentation results are superior to the state-of-the-art supervised image segmentation algorithms.
Directory of Open Access Journals (Sweden)
Mohadeseh Kanafchian
2017-04-01
In this paper, we first give a brief introduction into chaotic image encryption and then we investigate some important properties and behaviour of the logistic map. The logistic map, aperiodic trajectory, or random-like fluctuation, could not be obtained with some choice of initial condition. Therefore, a noisy logistic map with an additive system noise is introduced. The proposed scheme is based on the extended map of the Clifford strange attractor, where each dimension has a specific role in the encryption process. Two dimensions are used for pixel permutation and the third dimension is used for pixel diffusion. In order to optimize the Clifford encryption system we increase the space key by using the noisy logistic map and a novel encryption scheme based on the Clifford attractor and the noisy logistic map for secure transfer images is proposed. This algorithm consists of two parts: the noisy logistic map shuffle of the pixel position and the pixel value. We use times for shuffling the pixel position and value then we generate the new pixel position and value by the Clifford system. To illustrate the efficiency of the proposed scheme, various types of security analysis are tested. It can be concluded that the proposed image encryption system is a suitable choice for practical applications.
Efficient hierarchical ID-based encryption scheme%一个高效的基于身份的分层加密方案
Institute of Scientific and Technical Information of China (English)
张席; 杨玲
2012-01-01
基于Gentry方案,利用双线性配对,提出了一个高效的基于身份的分层加密方案,在随机预言机模型下证明满足IND-ID-CCA2安全,通过分析,该方案较Gentry方案缩短了密文长度,解密仅需要进行一次双线性配对,大大提高了加密和解密的效率.%This paper proposes an efficient hierarchical id-based encryption scheme with bilinear pairing, which is based on Gentry scheme. This scheme meets IND-ID-CCA2 security in the random oracle model. This scheme reduces the ciphertext length, and only computes bilinear pairing once in the decryption, which increases the efficiency of encryption and decryption, compared with Gentry scheme.
A novel chaotic block image encryption algorithm based on dynamic random growth technique
Wang, Xingyuan; Liu, Lintao; Zhang, Yingqian
2015-03-01
This paper proposes a new block image encryption scheme based on hybrid chaotic maps and dynamic random growth technique. Since cat map is periodic and can be easily cracked by chosen plaintext attack, we use cat map in another securer way, which can completely eliminate the cyclical phenomenon and resist chosen plaintext attack. In the diffusion process, an intermediate parameter is calculated according to the image block. The intermediate parameter is used as the initial parameter of chaotic map to generate random data stream. In this way, the generated key streams are dependent on the plaintext image, which can resist the chosen plaintext attack. The experiment results prove that the proposed encryption algorithm is secure enough to be used in image transmission systems.
Enayatifar, Rasul; Abdullah, Abdul Hanan; Lee, Malrey
2013-09-01
In recent years, there has been increasing interest in the security of digital images. This study focuses on binary image encryption using the weighted discrete imperialist competitive algorithm (WDICA). In the proposed method, a chaotic map is first used to create a specified number of cipher images. Then, to improve the results, WDICA is applied to the cipher images. In this study, entropy and correlation coefficient are used as WDICA's fitness functions. The goal is to maximize the entropy and minimize correlation coefficients. The advantage of this method is its ability to optimize the outcome of all iterations using WDICA. Simulation results show that WDICA not only demonstrates excellent encryption but also resists various typical attacks. The obtained correlation coefficient and entropy of the proposed WDICA are approximately 0.004 and 7.9994, respectively.
Triple-image encryption based on phase-truncated Fresnel transform and basic vector operation.
Pan, Xuemei; Meng, Xiangfeng; Yang, Xiulun; Wang, Yurong; Peng, Xiang; He, Wenqi; Dong, Guoyan; Chen, Hongyi
2015-10-01
A triple-image encryption method is proposed that is based on phase-truncated Fresnel transform (PTFT), basic vector composition, and XOR operation. In the encryption process, two random phase masks, with one each placed at the input plane and the transform plane, are generated by basic vector resolution operations over the first and the second plaintext images, and then a ciphered image in the input plane is fabricated by XOR encoding for the third plaintext image. When the cryptosystem is illuminated by an on-axis plane, assisted by PTFT, the ciphered image is finally encrypted into an amplitude-only noise-like image in the output plane. During decryption, possessing the correct private key, decryption keys, and the assistant geometrical parameter keys, and placing them at the corresponding correct positions, the original three plaintext images can be successfully decrypted by inverse PTFT, basic vector composition, and XOR decoding. Theoretical analysis and numerical simulations both verify the feasibility of the proposed method.
Satellite Image Security Improvement by Combining DWT-DCT Watermarking and AES Encryption
Directory of Open Access Journals (Sweden)
Naida.H.Nazmudeen
2014-06-01
Full Text Available With the large-scale research in space sciences and technologies, there is a great demand of satellite image security system for providing secure storage and transmission of satellite images. As the demand to protect the sensitive and valuable data from satellites has increased and hence proposed a new method for satellite image security by combining DWT-DCT watermarking and AES encryption. Watermarking techniques developed for multimedia data cannot be directly applied to the satellite images because here the analytic integrity of the data, rather than perceptual quality, is of primary importance. To improve performance, combine discrete wavelet transform (DWT with another equally powerful transform; the discrete cosine transform (DCT. The combined DWT-DCT watermarking algorithm’s imperceptibility was better than the performance of the DWT approach. Modified decision based unsymmetrical trimmed median filter (MDBUTMF algorithm is proposed for the restoration of satellite images that are highly corrupted by salt and pepper noise. Satellite images desire not only the watermarking for copyright protection but also encryption during storage and transmission for preventing information leakage. Hence this paper investigates the security and performance level of joint DWT-DCT watermarking and Advanced Encryption Standard (AES for satellite imagery. Theoretical analysis can be done by calculating PSNR and MSE. The experimental results demonstrate the efficiency of the proposed scheme, which fulfils the strict requirements concerning alterations of satellite images.
Color image encryption based on hybrid hyper-chaotic system and cellular automata
Yaghouti Niyat, Abolfazl; Moattar, Mohammad Hossein; Niazi Torshiz, Masood
2017-03-01
This paper proposes an image encryption scheme based on Cellular Automata (CA). CA is a self-organizing structure with a set of cells in which each cell is updated by certain rules that are dependent on a limited number of neighboring cells. The major disadvantages of cellular automata in cryptography include limited number of reversal rules and inability to produce long sequences of states by these rules. In this paper, a non-uniform cellular automata framework is proposed to solve this problem. This proposed scheme consists of confusion and diffusion steps. In confusion step, the positions of the original image pixels are replaced by chaos mapping. Key image is created using non-uniform cellular automata and then the hyper-chaotic mapping is used to select random numbers from the image key for encryption. The main contribution of the paper is the application of hyper chaotic functions and non-uniform CA for robust key image generation. Security analysis and experimental results show that the proposed method has a very large key space and is resistive against noise and attacks. The correlation between adjacent pixels in the encrypted image is reduced and the amount of entropy is equal to 7.9991 which is very close to 8 which is ideal.
Multiple-image encryption with spatial information prechoosing and cascaded blocks scrambling
Yang, Yuhua; Wang, Yali; Shi, Yishi; Zhang, Jingjuan; Hao, Wei
2010-11-01
Multiple-image encryption by spatial information prechoosing and cascaded blocks scrambling is proposed. The spatial information of secret multiple-image is pre-chosen in advance to effectively reduce the capacity burden of following encryption system. It is conveniently achieved by selecting or compressing the spatial information of multiple images to meet practical demands. Spatially pre-chosen multiple images are reformed to a new image. Cascaded double random phase encoding system is used to encrypt the new image, and the blocks scrambling is operated at the input of each sub-encoding system. Two main advantages are obtained: 1. Since the spatial information prechoosing enables the whole system to afford much larger information capacity, the effective multiplexing capacity is improved greatly; 2. The combination of blocks scrambling and cascaded random phase encoding not only ensure the much higher system security, but also save the key space and easy the key to save and release compared with the methods by each pixel scrambling. Computer simulations have shown the effectiveness of this method.
Gauss-Markov encryption matrix construct and image encryption application%Gauss-Markov加密矩阵构造及图像加密应用
Institute of Scientific and Technical Information of China (English)
邹阿金; 刘勇华; 罗移祥
2012-01-01
To solve the problem of encryption matrix is difficult to construct, a novel algorithm is proposed to get the encryption matrix. First, a stochastic sequence is generated by Gauss-Markov process. Then, it is converted into a series of low-order integer matrixes and multiple the selected matrices with determinant equal to 1 each other by using tensor production method. Thus, we can construct some high order encryption matrices and use it in digital image encryption. The encryption instance and theoretical analysis show that the proposed algorithm can produce encryption matrices with high security, and have good random characteristics and autocorrelation to meet the requirement of cryptography.%为了解决加密矩阵难以构造的问题,提出一种获得整数矩阵的新算法,利用Gauss-Markov过程生成一个随机序列,将该序列转换为一系列的低阶整数矩阵,从中寻找行列式等于l的整数矩阵,并对这些矩阵进行张量积运算得到高阶加密矩阵,应用于数字图像加密.加密实例和理论分析及对比表明,该算法可自动生成安全性很高的加密矩阵,且加密结果具有良好的随机特性和自相关性,能满足密码学的要求.
Image Segmentation Using Hierarchical Merge Tree
Liu, Ting; Seyedhosseini, Mojtaba; Tasdizen, Tolga
2016-10-01
This paper investigates one of the most fundamental computer vision problems: image segmentation. We propose a supervised hierarchical approach to object-independent image segmentation. Starting with over-segmenting superpixels, we use a tree structure to represent the hierarchy of region merging, by which we reduce the problem of segmenting image regions to finding a set of label assignment to tree nodes. We formulate the tree structure as a constrained conditional model to associate region merging with likelihoods predicted using an ensemble boundary classifier. Final segmentations can then be inferred by finding globally optimal solutions to the model efficiently. We also present an iterative training and testing algorithm that generates various tree structures and combines them to emphasize accurate boundaries by segmentation accumulation. Experiment results and comparisons with other very recent methods on six public data sets demonstrate that our approach achieves the state-of-the-art region accuracy and is very competitive in image segmentation without semantic priors.
Encryption On Grayscale Image For Digital Image Confidentiality Using Shamir Secret Sharing Scheme
Rodiah; Anggraini, Dyah; Fitrianingsih; Kazhimi, Farizan
2016-04-01
The use of high-frequency internet in the process of exchanging information and digital transaction is often accompanied by transmitting digital image in the form of raster images. Secret sharing schemes are multiparty protocols that related to the key establishment which provides protection against any threats of losing cryptography key. The greater the key duplication, the higher the risk of losing the key and vice versa. In this study, Secret Sharing Method was used by employing Shamir Threshold Scheme Algorithm on grayscale digital image with the size of 256×256 pixel obtaining 128×128 pixels of shared image with threshold values (4, 8). The result number of shared images were 8 parts and the recovery process can be carried out by at least using 4 shares of the 8 parts. The result of encryption on grayscale image is capable of producing vague shared image (i.e., no perceptible information), therefore a message in the form of digital image can be kept confidential and secure.
Synchronization of spatiotemporal semiconductor lasers and its application in color image encryption
Banerjee, S; Mukhopadhyay, S; Misra, A P; 10.1016/j.optcom.2010.12.077
2011-01-01
Optical chaos is a topic of current research characterized by high-dimensional nonlinearity which is attributed to the delay-induced dynamics, high bandwidth and easy modular implementation of optical feedback. In light of these facts, which adds enough confusion and diffusion properties for secure communications, we explore the synchronization phenomena in spatiotemporal semiconductor laser systems. The novel system is used in a two-phase colored image encryption process. The high-dimensional chaotic attractor generated by the system produces a completely randomized chaotic time series, which is ideal in the secure encoding of messages. The scheme thus illustrated is a two-phase encryption method, which provides sufficiently high confusion and diffusion properties of chaotic cryptosystem employed with unique data sets of processed chaotic sequences. In this novel method of cryptography, the chaotic phase masks are represented as images using the chaotic sequences as the elements of the image. The scheme dras...
A parallel block-based encryption schema for digital images using reversible cellular automata
Directory of Open Access Journals (Sweden)
Faraoun Kamel Mohamed
2014-06-01
Full Text Available We propose a novel images encryption schema based on reversible one-dimensional cellular automata. Contrasting to the sequential operating mode of several existing approaches, the proposed one is fully parallelizable since the encryption/decryption tasks can be executed using multiple processes running independently for the same single image. The parallelization is made possible by defining a new RCA-based construction of an extended pseudorandom permutation that takes a nonce as a supplementary parameter. The defined PRP exploit the chaotic behavior and the high initial condition's sensitivity of the RCAs to ensure perfect cryptographic security properties. Results of various experiments and analysis show that high security and execution performances can be achieved using the approach, and furthermore, it provides the ability to perform a selective area decryption since any part of the ciphered-image can be deciphered independently from others, which is very useful for real time applications.
Zhong, Zhi; Qin, Haitao; Liu, Lei; Zhang, Yabin; Shan, Mingguang
2017-03-20
A novel approach for silhouette-free image encryption based on interference is proposed using discrete multiple-parameter fractional Fourier transform (DMPFrFT), which generalizes from fractional Fourier transform. An original image is firstly applied by chaotic pixel scrambling (CPS) and then encoded into the real part of a complex signal. Using interference principle, the complex signal generates three phase-only masks in DMPFrFT domain. The silhouette of the original image cannot be extracted using one or two of the three phase-only masks. The parameters of both CPS and DMPFrFT can also serve as encryption keys to extend the key space, which further enhance the level of cryptosystem security. Numerical simulations are demonstrated to show the feasibility and validity of this approach.
A New Image Encryption Scheme Based on Dynamic S-Boxes and Chaotic Maps
Rehman, Atique Ur; Khan, Jan Sher; Ahmad, Jawad; Hwang, Soeng Oun
2016-03-01
Substitution box is a unique and nonlinear core component of block ciphers. A better designing technique of substitution box can boost up the quality of ciphertexts. In this paper, a new encryption method based on dynamic substitution boxes is proposed via using two chaotic maps. To break the correlation in an original image, pixels values of the original plaintext image are permuted row- and column-wise through random sequences. The aforementioned random sequences are generated by 2-D Burgers chaotic map. For the generation of dynamic substitution boxes, Logistic chaotic map is employed. In the process of diffusion, the permuted image is divided into blocks and each block is substituted via different dynamic substitution boxes. In contrast to conventional encryption schemes, the proposed scheme does not undergo the fixed block cipher and hence the security level can be enhanced. Extensive security analysis including histogram test is applied on the proposed image encryption technique. All experimental results reveal that the proposed scheme has a high level of security and robustness for transmission of digital images on insecure communication channels.
Image Encryption Using Stream Cipher Based on Nonlinear Combination Generator with Enhanced Security
Directory of Open Access Journals (Sweden)
Belmeguenaï Aîssa
2013-03-01
Full Text Available The images are very largely used in our daily life; the security of their transfer became necessary. In this work a novel image encryption scheme using stream cipher algorithm based on nonlinear combination generator is developed. The main contribution of this work is to enhance the security of encrypted image. The proposed scheme is based on the use the several linear feedback shifts registers whose feedback polynomials are primitive and of degrees are all pairwise coprimes combined by resilient function whose resiliency order, algebraic degree and nonlinearity attain Siegenthaler’s and Sarkar, al.’s bounds. This proposed scheme is simple and highly efficient. In order to evaluate performance, the proposed algorithm was measured through a series of tests. These tests included visual test and histogram analysis, key space analysis, correlation coefficient analysis, image entropy, key sensitivity analysis, noise analysis, Berlekamp-Massey attack, correlation attack and algebraic attack. Experimental results demonstrate the proposed system is highly key sensitive, highly resistance to the noises and shows a good resistance against brute-force, statistical attacks, Berlekamp-Massey attack, correlation attack, algebraic attack and a robust system which makes it a potential candidate for encryption of image.
Wang, Xiaogang; Zhao, Daomu; Chen, Yixiang
2014-08-10
We present a study about information disclosure in phase-truncation-based cryptosystems. The main information of the original image to be encoded can be obtained by using a decryption key in the worst case. The problem cannot be thoroughly solved by imaginary part truncating, keeping the encryption keys as private keys, or applying different phase keys for different plaintexts during each encryption process as well as the phase modulation in the frequency domain. In order to eliminate the risk of unintended information disclosure, we further propose a nonlinear spatial and spectral encoding technique using a random amplitude mask (RAM). The encryption process involving two security layers can be fully controlled by a RAM. The spatial encoding of the plaintext images and the simultaneous encryption of the plaintext images and the encryption key greatly enhance the security of system, avoiding several attacks that have cracked the phase-truncation-based cryptosystems. Besides, the hybrid encryption system retains the advantage of a trap door one-way function of phase truncation. Numerical results have demonstrated the feasibility and effectiveness of the proposed encryption algorithm.
Multimedia encryption and watermarking encryption and watermarking
Furht, Borko; Socek, Daniel
2006-01-01
""Multimedia Encryption and Watermarking"" presents a comprehensive survey of contemporary multimedia encryption and watermarking techniques, which enable a secure exchange of multimedia intellectual property. Part I, Digital Rights Management (DRM) for Multimedia, introduces DRM concepts and models for multimedia content protection, and presents the key players. Part II, Multimedia Cryptography, provides an overview of modern cryptography, with the focus on modern image, video, speech, and audio encryption techniques. This book also provides an advanced concept of visual and audio sharing tec
A novel image encryption algorithm based on chaos maps with Markov properties
Liu, Quan; Li, Pei-yue; Zhang, Ming-chao; Sui, Yong-xin; Yang, Huai-jiang
2015-02-01
In order to construct high complexity, secure and low cost image encryption algorithm, a class of chaos with Markov properties was researched and such algorithm was also proposed. The kind of chaos has higher complexity than the Logistic map and Tent map, which keeps the uniformity and low autocorrelation. An improved couple map lattice based on the chaos with Markov properties is also employed to cover the phase space of the chaos and enlarge the key space, which has better performance than the original one. A novel image encryption algorithm is constructed on the new couple map lattice, which is used as a key stream generator. A true random number is used to disturb the key which can dynamically change the permutation matrix and the key stream. From the experiments, it is known that the key stream can pass SP800-22 test. The novel image encryption can resist CPA and CCA attack and differential attack. The algorithm is sensitive to the initial key and can change the distribution the pixel values of the image. The correlation of the adjacent pixels can also be eliminated. When compared with the algorithm based on Logistic map, it has higher complexity and better uniformity, which is nearer to the true random number. It is also efficient to realize which showed its value in common use.
Combination of Sharing Matrix and Image Encryption for Lossless $(k,n)$ -Secret Image Sharing.
Bao, Long; Yi, Shuang; Zhou, Yicong
2017-12-01
This paper first introduces a (k,n) -sharing matrix S((k, n)) and its generation algorithm. Mathematical analysis is provided to show its potential for secret image sharing. Combining sharing matrix with image encryption, we further propose a lossless (k,n) -secret image sharing scheme (SMIE-SIS). Only with no less than k shares, all the ciphertext information and security key can be reconstructed, which results in a lossless recovery of original information. This can be proved by the correctness and security analysis. Performance evaluation and security analysis demonstrate that the proposed SMIE-SIS with arbitrary settings of k and n has at least five advantages: 1) it is able to fully recover the original image without any distortion; 2) it has much lower pixel expansion than many existing methods; 3) its computation cost is much lower than the polynomial-based secret image sharing methods; 4) it is able to verify and detect a fake share; and 5) even using the same original image with the same initial settings of parameters, every execution of SMIE-SIS is able to generate completely different secret shares that are unpredictable and non-repetitive. This property offers SMIE-SIS a high level of security to withstand many different attacks.
Optical image encryption with silhouette removal based on interference and phase blend processing
Wang, Qu
2012-10-01
To completely eliminate the silhouette problem that inherently exists in the earlier interference-based encryption scheme with two phase-only masks (POMs), we propose a simple new encryption method based on optical interference of one random POM and two analytically obtained POMs. Different from the previous methods which require time-consuming iterative computation or postprocessing of the POMs for silhouette removal, our method can resolve the problem during the production of the POMs based on interference principle. Information associated with the original image is smoothed away by modulation of the random POM. Illegal deciphers cannot retrieve the primitive image using only one or two of the POMs. Incorporated with the linear phase blend operation, our method can provide higher robustness against brute force attacks. Simulation results are presented to support the validity and feasibility of our method.
Application of coupled map lattice with parameter q in image encryption
Hao, Zhang; Xing-yuan, Wang; Si-wei, Wang; Kang, Guo; Xiao-hui, Lin
2017-01-01
In this paper, a novel coupled map lattice (CML) with parameter q is applied to image encryption to get higher security. The CML with parameter q is provided with Euler method and Adams-Bashforth-Moulton predictor-corrector method. In the new CML, dynamical properties are improved because the coupled strength can decrease the periodic dynamical behaviors which are caused by finite-precision. What's more, the CML changes system parameters from one-dimensional to two-dimensional. Two-dimensional parameters and coupling strengths provide researchers a possibility to improve the performance in image encryption. Finally, from numerical simulation results, it can be found that the CML improves the effectiveness and security.
Zhou, Nanrun; Zhang, Aidi; Zheng, Fen; Gong, Lihua
2014-10-01
The existing ways to encrypt images based on compressive sensing usually treat the whole measurement matrix as the key, which renders the key too large to distribute and memorize or store. To solve this problem, a new image compression-encryption hybrid algorithm is proposed to realize compression and encryption simultaneously, where the key is easily distributed, stored or memorized. The input image is divided into 4 blocks to compress and encrypt, then the pixels of the two adjacent blocks are exchanged randomly by random matrices. The measurement matrices in compressive sensing are constructed by utilizing the circulant matrices and controlling the original row vectors of the circulant matrices with logistic map. And the random matrices used in random pixel exchanging are bound with the measurement matrices. Simulation results verify the effectiveness, security of the proposed algorithm and the acceptable compression performance.
Improving Image Encryption Using 3D Cat Map and Turing Machine
Directory of Open Access Journals (Sweden)
Nehal A. Mohamed
2016-01-01
Full Text Available Security of data is of prime importance. Security is a very complex and vast topic. One of the common ways to protect this digital data from unauthorized eavesdropping is encryption. This paper introduces an improved image encryption technique based on a chaotic 3D cat map and Turing machine in the form of dynamic random growth technique. The algorithm consists of two main sections: The first does a preprocessing operation to shuffle the image using 3D chaotic map in the form of dynamic random growth technique. The second uses Turing machine simultaneous with shuffling pixels’ locations to diffuse pixels’ values using a random key that is generated by chaotic 3D cat map. The hybrid compound of a 3D chaotic system and Turing machine strengthen the encryption performance and enlarge the key space required to resist the brute force attacks. The main advantages of such a secure technique are the simplicity and efficiency. These good cryptographic properties prove that it is secure enough to use in image transmission systems.
Deng, Xiaopeng; Zhao, Daomu
2011-11-01
A single-channel color image encryption is proposed based on the modified Gerchberg-Saxton algorithm (MGSA) and mutual encoding in the Fresnel domain. Similar to the double random phase encoding (DRPE), this encryption scheme also employs a pair of phase-only functions (POFs) as encryption keys. But the two POFs are generated by the use of the MGSA rather than a random function generator. In the encryption process, only one color component is needed to be encrypted when these POFs are mutually served as the second encryption keys. As a result, a more compact and simple color encryption system based on one-time-pad, enabling only one gray cipheretext to be recorded and transmitted when holographic recording is used, is obtained. Moreover, the optical setup is lensless, thus easy to be implemented and the system parameters and wavelength can be served as additional keys to further enhance the security of the system. The feasibility and effectiveness of the proposed method are demonstrated by numerical results. © 2011 Optical Society of America
Jackson, Deborah J. (Inventor)
1998-01-01
An analog optical encryption system based on phase scrambling of two-dimensional optical images and holographic transformation for achieving large encryption keys and high encryption speed. An enciphering interface uses a spatial light modulator for converting a digital data stream into a two dimensional optical image. The optical image is further transformed into a hologram with a random phase distribution. The hologram is converted into digital form for transmission over a shared information channel. A respective deciphering interface at a receiver reverses the encrypting process by using a phase conjugate reconstruction of the phase scrambled hologram.
Security enhancement of a phase-truncation based image encryption algorithm.
Wang, Xiaogang; Zhao, Daomu
2011-12-20
The asymmetric cryptosystem, which is based on phase-truncated Fourier transforms (PTFTs), can break the linearity of conventional systems. However, it has been proven to be vulnerable to a specific attack based on iterative Fourier transforms when the two random phase masks are used as public keys to encrypt different plaintexts. An improvement from the asymmetric cryptosystem may be taken by relocating the amplitude values in the output plane. In this paper, two different methods are adopted to realize the amplitude modulation of the output image. The first one is to extend the PTFT-based asymmetrical cryptosystem into the anamorphic fractional Fourier transform domain directly, and the second is to add an amplitude mask in the Fourier plane of the encryption scheme. Some numerical simulations are presented to prove the good performance of the proposed cryptosystems.
A new hyperchaotic circuit with two memristors and its application in image encryption
Directory of Open Access Journals (Sweden)
Zhulin Wang
2016-09-01
Full Text Available Memristor is a kind of resistance with a memory function and its special properties decide its broad prospect for application. At present, the focus and difficulty of the research in memristor lie in the establishment of new models and related applications. Therefore, in this paper a new continuous and smooth memristor model is put forward first and the correctness of this new model is proved through the study in the phase trajectory relationship between voltage and current. Then based on Chua’s circuit, a new fifth-order hyper-chaotic circuit including two new memristor models is designed and the dimensionless mathematical model is deduced. By the classical nonlinear method of circuit analysis, the dissipation of the new system is put into study in this paper. It is proved through numerical simulation, bifurcation diagram, Lyapunov spectrum that the new system has its unique dynamical behavior. At last, chaotic sequence of the new system is used to encrypt the image and the encrypted histogram, the correlation and anti-attack capability between adjacent pixels and the key sensitivity are emphatically analyzed. It turns out that when applied to image encryption, the newly proposed memristor chaotic system has relatively high safety performance.
A novel chaos-based image encryption algorithm using DNA sequence operations
Chai, Xiuli; Chen, Yiran; Broyde, Lucie
2017-01-01
An image encryption algorithm based on chaotic system and deoxyribonucleic acid (DNA) sequence operations is proposed in this paper. First, the plain image is encoded into a DNA matrix, and then a new wave-based permutation scheme is performed on it. The chaotic sequences produced by 2D Logistic chaotic map are employed for row circular permutation (RCP) and column circular permutation (CCP). Initial values and parameters of the chaotic system are calculated by the SHA 256 hash of the plain image and the given values. Then, a row-by-row image diffusion method at DNA level is applied. A key matrix generated from the chaotic map is used to fuse the confused DNA matrix; also the initial values and system parameters of the chaotic system are renewed by the hamming distance of the plain image. Finally, after decoding the diffused DNA matrix, we obtain the cipher image. The DNA encoding/decoding rules of the plain image and the key matrix are determined by the plain image. Experimental results and security analyses both confirm that the proposed algorithm has not only an excellent encryption result but also resists various typical attacks.
Wang, Qu; Guo, Qing; Lei, Liang; Zhou, Jinyun
2013-10-01
In this article, a multiple-image encryption method based on the optical interference principle and phase-only mask (POM) multiplexing is proposed. During the encryption process, each secret image is encoded into two analytically obtained POMs and one computer-generated random POM, in which no iterative computation is required. The analytically obtained POMs taken from different secret images are then synthesized by POM multiplexing and further encoded into two complex ciphertext images. The silhouette problem that exists in the earlier interference principle-based encryption approaches is totally resolved by the proposal. Both digital and optical means can be used for decryption. The crosstalk effect between the secret images will not appear in the decrypted results by using the proposed system. Numerical simulations have been given to verify the performance and feasibility of the proposal. We also discuss briefly the influence of information compression on the quality of decrypted images.
Wang, Qu; Guo, Qing; Zhou, Jinyun
2013-12-20
We propose a multiple-image encryption scheme, based on polarized light encoding and the interference principle of phase-only masks (POMs), in the Fresnel-transform (FrT) domain. In this scheme, each secret image is converted into an intensity image by polarized light encoding, where a random key image and a pixilated polarizer with random angles are employed as keys. The intensity encrypted images produced by different secret images are convolved together and then inverse Fresnel-transformed. Phase and amplitude truncations are used to generate the asymmetric decryption keys. The phase-truncated inverse FrT spectrum is sent into an interference-based encryption (IBE) system to analytically obtain two POMs. To reduce the transmission and storage load on the keys, the chaotic mapping method is employed to generate random distributions of keys for encryption and decryption. One can recover all secret images successfully only if the corresponding decryption keys, the mechanism of FrTs, and correct chaotic conditions are known. The inherent silhouette problem can be thoroughly resolved by polarized light encoding in this proposal, without using any time-consuming iterative methods. The entire encryption and decryption process can be realized digitally, or in combination with optical means. Numerical simulation results are presented to verify the effectiveness and performance of the proposed scheme.
Hierarchical imaging of the human knee
Schulz, Georg; Götz, Christian; Deyhle, Hans; Müller-Gerbl, Magdalena; Zanette, Irene; Zdora, Marie-Christine; Khimchenko, Anna; Thalmann, Peter; Rack, Alexander; Müller, Bert
2016-10-01
Among the clinically relevant imaging techniques, computed tomography (CT) reaches the best spatial resolution. Sub-millimeter voxel sizes are regularly obtained. For investigations on true micrometer level lab-based μCT has become gold standard. The aim of the present study is the hierarchical investigation of a human knee post mortem using hard X-ray μCT. After the visualization of the entire knee using a clinical CT with a spatial resolution on the sub-millimeter range, a hierarchical imaging study was performed using a laboratory μCT system nanotom m. Due to the size of the whole knee the pixel length could not be reduced below 65 μm. These first two data sets were directly compared after a rigid registration using a cross-correlation algorithm. The μCT data set allowed an investigation of the trabecular structures of the bones. The further reduction of the pixel length down to 25 μm could be achieved by removing the skin and soft tissues and measuring the tibia and the femur separately. True micrometer resolution could be achieved after extracting cylinders of several millimeters diameters from the two bones. The high resolution scans revealed the mineralized cartilage zone including the tide mark line as well as individual calcified chondrocytes. The visualization of soft tissues including cartilage, was arranged by X-ray grating interferometry (XGI) at ESRF and Diamond Light Source. Whereas the high-energy measurements at ESRF allowed the simultaneous visualization of soft and hard tissues, the low-energy results from Diamond Light Source made individual chondrocytes within the cartilage visual.
A Fresnelet-Based Encryption of Medical Images using Arnold Transform
Directory of Open Access Journals (Sweden)
Muhammad Nazeer
2013-04-01
Full Text Available Medical images are commonly stored in digital media and transmitted via Internet for certain uses. If a medical information image alters, this can lead to a wrong diagnosis which may create a serious health problem. Moreover, medical images in digital form can easily be modified by wiping off or adding small pieces of information intentionally for certain illegal purposes. Hence, the reliability of medical images is an important criterion in a hospital information system. In this paper, the Fresnelet transform is employed along with appropriate handling of the Arnold transform and the discrete cosine transform to provide secure distribution of medical images. This method presents a new data hiding system in which steganography and cryptography are used to prevent unauthorized data access. The experimental results exhibit high imperceptibility for embedded images and significant encryption of information images.
Comment: Cryptanalysis of an image encryption scheme based on the Hill cipher
Institute of Scientific and Technical Information of China (English)
Cheng-qing LI; Dan ZHANG; Guan-rong CHEN
2008-01-01
This paper studies the security of an image encryption scheme based on the Hill cipher (Ismail et al.,2006) and reports its following problems:(1) There is a simple necessary and sufficient condition that makes a number of secret keys invalid;(2) It is insensitive to the change of the secret key;(3) It is insensitive to the change of the plain-image;(4) It can be broken with only one known/chosen plaintext;(5) It has some other minor defects.The proposed cryptanalysis discourages any use of the scheme in practice.
Li, Yueping; Wang, Chunhua; Chen, Hua
2017-03-01
Recently, a number of chaos-based image encryption algorithms that use low-dimensional chaotic map and permutation-diffusion architecture have been proposed. However, low-dimensional chaotic map is less safe than high-dimensional chaotic system. And permutation process is independent of plaintext and diffusion process. Therefore, they cannot resist efficiently the chosen-plaintext attack and chosen-ciphertext attack. In this paper, we propose a hyper-chaos-based image encryption algorithm. The algorithm adopts a 5-D multi-wing hyper-chaotic system, and the key stream generated by hyper-chaotic system is related to the original image. Then, pixel-level permutation and bit-level permutation are employed to strengthen security of the cryptosystem. Finally, a diffusion operation is employed to change pixels. Theoretical analysis and numerical simulations demonstrate that the proposed algorithm is secure and reliable for image encryption.
Lang, Jun
2012-07-01
In recent years, a number of methods have been proposed in the literature for the encryption of two-dimensional information by use of the fractional Fourier transform, but most of their encryptions are complex value and need digital hologram technique to record their encrypted information, which is inconvenience for digital transmission. In this paper, we first propose a novel reality-preserving multiple-parameter fractional Fourier transform which share real-valuedness outputs as well as most of the properties required for a fractional transform. Then we propose a new approach for image encryption based on the real-valuedness of the reality-preserving multiple-parameter fractional Fourier transform and the decorrelation property of chaotic maps in order to meet the requirements of the secure image transmission. In the proposed scheme, the image is encrypted by juxtaposition of sections of the image in the reality-preserving multiple-parameter fractional Fourier domains and the alignment of sections is determined by chaotic logistic maps. Numerical simulations are performed to demonstrate that the proposed method is reliable and more robust to blind decryption than several existing methods.
A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure.
Yao, Wang; Wu, Faguo; Zhang, Xiao; Zheng, Zhiming; Wang, Zhao; Wang, Wenhua; Qiu, Wangjie
2016-01-01
Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two methods are used. First, a simple round function based on a piecewise linear function and tent map are used to reduce computational cost during each iteration. Second, the 4-pixel Feistel structure reduces round number by changing twist direction securely to help the algorithm proceed efficiently. While a large number of simulation experiments prove its security performance, additional special analysis and a corresponding speed simulation show that these two methods increase the speed of the proposed algorithm (0.15s for a 256*256 color image) to twice that of an algorithm with a similar structure (0.37s for the same size image). Additionally, the method is also faster than other recently proposed algorithms.
Li, Jinqing; Bai, Fengming; Di, Xiaoqiang
2013-01-01
We propose an image encryption/decryption algorithm based on chaotic control parameter and hyperchaotic system with the composite permutation-diffusion structure. Compound chaos mapping is used to generate control parameters in the permutation stage. The high correlation between pixels is shuffled. In the diffusion stage, compound chaos mapping of different initial condition and control parameter generates the diffusion parameters, which are applied to hyperchaotic cellular neural networks. The diffusion key stream is obtained by this process and implements the pixels' diffusion. Compared with the existing methods, both simulation and statistical analysis of our proposed algorithm show that the algorithm has a good performance against attacks and meets the corresponding security level.
An image encryption scheme based on the MLNCML system using DNA sequences
Zhang, Ying-Qian; Wang, Xing-Yuan; Liu, Jia; Chi, Ze-Lin
2016-07-01
We propose a new image scheme based on the spatiotemporal chaos of the Mixed Linear-Nonlinear Coupled Map Lattices (MLNCML). This spatiotemporal chaotic system has more cryptographic features in dynamics than the system of Coupled Map Lattices (CML). In the proposed scheme, we employ the strategy of DNA computing and one time pad encryption policy, which can enhance the sensitivity to the plaintext and resist differential attack, brute-force attack, statistical attack and plaintext attack. Simulation results and theoretical analysis indicate that the proposed scheme has superior high security.
Directory of Open Access Journals (Sweden)
Tzu-Hsiang Hung
2012-06-01
Full Text Available This study used the complex dynamic characteristics of chaotic systems and Bluetooth to explore the topic of wireless chaotic communication secrecy and develop a communication security system. The PID controller for chaos synchronization control was applied, and the optimum parameters of this PID controller were obtained using a Particle Swarm Optimization (PSO algorithm. Bluetooth was used to realize wireless transmissions, and a chaotic wireless communication security system was developed in the design concept of a chaotic communication security system. The experimental results show that this scheme can be used successfully in image encryption.
Yau, Her-Terng; Hung, Tzu-Hsiang; Hsieh, Chia-Chun
2012-01-01
This study used the complex dynamic characteristics of chaotic systems and Bluetooth to explore the topic of wireless chaotic communication secrecy and develop a communication security system. The PID controller for chaos synchronization control was applied, and the optimum parameters of this PID controller were obtained using a Particle Swarm Optimization (PSO) algorithm. Bluetooth was used to realize wireless transmissions, and a chaotic wireless communication security system was developed in the design concept of a chaotic communication security system. The experimental results show that this scheme can be used successfully in image encryption.
Secure Image Encryption Based On a Chua Chaotic Noise Generator
Directory of Open Access Journals (Sweden)
A. S. Andreatos
2013-10-01
Full Text Available This paper presents a secure image cryptography telecom system based on a Chua's circuit chaotic noise generator. A chaotic system based on synchronised Master–Slave Chua's circuits has been used as a chaotic true random number generator (CTRNG. Chaotic systems present unpredictable and complex behaviour. This characteristic, together with the dependence on the initial conditions as well as the tolerance of the circuit components, make CTRNGs ideal for cryptography. In the proposed system, the transmitter mixes an input image with chaotic noise produced by a CTRNG. Using thresholding techniques, the chaotic signal is converted to a true random bit sequence. The receiver must be able to reproduce exactly the same chaotic noise in order to subtract it from the received signal. This becomes possible with synchronisation between the two Chua's circuits: through the use of specific techniques, the trajectory of the Slave chaotic system can be bound to that of the Master circuit producing (almost identical behaviour. Additional blocks have been used in order to make the system highly parameterisable and robust against common attacks. The whole system is simulated in Matlab. Simulation results demonstrate satisfactory performance, as well as, robustness against cryptanalysis. The system works with both greyscale and colour jpg images.
Fractal image perception provides novel insights into hierarchical cognition.
Martins, M J; Fischmeister, F P; Puig-Waldmüller, E; Oh, J; Geissler, A; Robinson, S; Fitch, W T; Beisteiner, R
2014-08-01
Hierarchical structures play a central role in many aspects of human cognition, prominently including both language and music. In this study we addressed hierarchy in the visual domain, using a novel paradigm based on fractal images. Fractals are self-similar patterns generated by repeating the same simple rule at multiple hierarchical levels. Our hypothesis was that the brain uses different resources for processing hierarchies depending on whether it applies a "fractal" or a "non-fractal" cognitive strategy. We analyzed the neural circuits activated by these complex hierarchical patterns in an event-related fMRI study of 40 healthy subjects. Brain activation was compared across three different tasks: a similarity task, and two hierarchical tasks in which subjects were asked to recognize the repetition of a rule operating transformations either within an existing hierarchical level, or generating new hierarchical levels. Similar hierarchical images were generated by both rules and target images were identical. We found that when processing visual hierarchies, engagement in both hierarchical tasks activated the visual dorsal stream (occipito-parietal cortex, intraparietal sulcus and dorsolateral prefrontal cortex). In addition, the level-generating task specifically activated circuits related to the integration of spatial and categorical information, and with the integration of items in contexts (posterior cingulate cortex, retrosplenial cortex, and medial, ventral and anterior regions of temporal cortex). These findings provide interesting new clues about the cognitive mechanisms involved in the generation of new hierarchical levels as required for fractals.
An Efficient Image Encryption Scheme Based on a Peter De Jong Chaotic Map and a RC4 Stream Cipher
Hanchinamani, Gururaj; Kulkarni, Linganagouda
2015-09-01
Security is a vital issue in communication and storage of the images and encryption is one of the ways to ensure the security. This paper proposes an efficient image encryption scheme based on a Peter De Jong chaotic map and a RC4 stream cipher. A Peter De Jong map is employed to determine the initial keys for the RC4 stream generator and also during permutation stage. The RC4 stream generator is utilized to generate the pseudo random numbers for the pixel value rotation and diffusion operations. Each encryption round is comprised of three stages: permutation, pixel value rotation and diffusion. The permutation is based on scrambling the rows and columns, in addition, circular rotations of the rows and columns in alternate orientations. The second stage circularly rotates each and every pixel value by utilizing M × N pseudo random numbers. The last stage carries out the diffusion twice by scanning the image in two different ways. Each of the two diffusions accomplishes the diffusion in two orientations (forward and backward) with two previously diffused pixels and two pseudo random numbers. The security and performance of the proposed method is assessed thoroughly by using key space, statistical, differential, entropy and performance analysis. Moreover, two rounds of the call to the encrypt function provide the sufficient security. The experimental results show that the proposed encryption scheme is computationally fast with high security.
Liang, Jinyang; Gao, Liang; Hai, Pengfei; Li, Chiye; Wang, Lihong V
2015-10-27
Compressed ultrafast photography (CUP), a computational imaging technique, is synchronized with short-pulsed laser illumination to enable dynamic three-dimensional (3D) imaging. By leveraging the time-of-flight (ToF) information of pulsed light backscattered by the object, ToF-CUP can reconstruct a volumetric image from a single camera snapshot. In addition, the approach unites the encryption of depth data with the compressed acquisition of 3D data in a single snapshot measurement, thereby allowing efficient and secure data storage and transmission. We demonstrated high-speed 3D videography of moving objects at up to 75 volumes per second. The ToF-CUP camera was applied to track the 3D position of a live comet goldfish. We have also imaged a moving object obscured by a scattering medium.
A novel chaotic image encryption algorithm using block scrambling and dynamic index based diffusion
Xu, Lu; Gou, Xu; Li, Zhi; Li, Jian
2017-04-01
In this paper, we propose a novel chaotic image encryption algorithm which involves a block image scrambling scheme and a new dynamic index based diffusion scheme. Firstly, the original image is divided into two equal blocks by vertical or horizontal directions. Then, we use the chaos matrix to construct X coordinate, Y coordinate and swapping control tables. By searching the X coordinate and Y coordinate tables, the swapping position of the processing pixel is located. The swapping control table is used to control the swapping of the pixel in the current block or the other block. Finally, the dynamic index scheme is applied to the diffusing of the scrambled image. The simulation results and performance analysis show that the proposed algorithm has an excellent safety performance with only one round.
Directory of Open Access Journals (Sweden)
Adelaïde Nicole Kengnou Telem
2014-01-01
Full Text Available A robust gray image encryption scheme using chaotic logistic map and artificial neural network (ANN is introduced. In the proposed method, an external secret key is used to derive the initial conditions for the logistic chaotic maps which are employed to generate weights and biases matrices of the multilayer perceptron (MLP. During the learning process with the backpropagation algorithm, ANN determines the weight matrix of the connections. The plain image is divided into four subimages which are used for the first diffusion stage. The subimages obtained previously are divided into the square subimage blocks. In the next stage, different initial conditions are employed to generate a key stream which will be used for permutation and diffusion of the subimage blocks. Some security analyses such as entropy analysis, statistical analysis, and key sensitivity analysis are given to demonstrate the key space of the proposed algorithm which is large enough to make brute force attacks infeasible. Computing validation using experimental data with several gray images has been carried out with detailed numerical analysis, in order to validate the high security of the proposed encryption scheme.
Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding.
Zhang, Xuncai; Han, Feng; Niu, Ying
2017-01-01
With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule's inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.
CRYPTANALYSIS OF AN IMAGE ENCRYPTION SCHEME WITH A PSEUDORANDOM PERMUTATION AND ITS IMPROVED VERSION
Institute of Scientific and Technical Information of China (English)
Wang Jing; Jiang Guoping; Lin Bing
2012-01-01
Under Kerckhoff principle,this paper discusses the security property of an image encryption scheme with a pseudorandom permutation.Some findings on the security problems of the algorithm are reported in the following:(1) If each row or column of the plain-image matrix is the same,the receiver cannot decrypt correctly.(2) Each plain-text word is correlated with single cipher-text word,but independent of other cipher-text word,which cannot meet the principles of algorithm designdiffusion and confusion.(3) If the cycle numbers β are relatively small,statistics attack can be used to reveal some visual information of any other plain-images encrypted with the same secret key.Considering the above problems,we propose an improved algorithm and then analyze its performance.Theoretical analysis and simulation results show that the improved algorithm can obtain better cryptographic properties,such as statistical characteristics,difference characteristics,and so on.
Institute of Scientific and Technical Information of China (English)
张洁; 葛爱军; 马传贵
2015-01-01
Inner product encryption (IPE) is a concrete construction of predicate encryption ,which represents a wide class of predicates that includes an equality test (for identity‐based encryption and hidden vector encryption ) , disjunctions or conjunctions of equality tests ( for attribute‐based encryption) .Hierarchical inner product encryption (HIPE) can provide the capacity of delegate for inner product encryption ,and it can effectively reduce the workload of root node of the system . Aiming at the efficiency that exists in the hierarchical inner product encryption ,we present a short ciphertexts IPE scheme with full security in asymmetric bilinear pairing .By making use of the IPE scheme as building blocks ,we then present a new HIPE scheme with the new technique for dual system encryption .The new realization of dual system encryption does not use tags ,which makes the compression of ciphertexts possible .The proposed HIPE scheme achieves constant‐size ciphertexts and full security in the standard model .Security is proven under three static assumptions w hose size does not depend on the number of queries .Furthermore ,our scheme achieves lower computational cost because decryption only needs seven pairing operations .Compared with other existing schemes , our scheme is more compact to implement and can provide better efficiency in terms of the communication and computation cost .%分层内积加密方案为内积加密体制提供了私钥分发功能，可有效降低系统根节点的任务量。针对现有分层内积加密方案密文长度过长的问题，首先提出一个完全安全且固定密文长度的内积加密方案，并以该方案为基础，构造了一个新的分层内积加密方案，利用对偶系统加密的新技术，在标准模型下证明了该分层内积加密方案是完全安全的。新方案密文长度达到了固定值，并且解密时只需要7个双线性对运算。与现有方案比，新方案计算效率高
A Chaos-based Image Encryption Scheme Using 3D Skew Tent Map and Coupled Map Lattice
Directory of Open Access Journals (Sweden)
Ruisong Ye
2012-02-01
Full Text Available This paper proposes a chaos-based image encryption scheme where one 3D skew tent map with three control parameters is utilized to generate chaotic orbits applied to scramble the pixel positions while one coupled map lattice is employed to yield random gray value sequences to change the gray values so as to enhance the security. Experimental results have been carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack and possesses good statistical properties to frustrate statistical analysis attacks. Experiments are also performed to illustrate the robustness against malicious attacks like cropping, noising, JPEG compression.
Azoug, Seif Eddine; Bouguezel, Saad
2016-01-01
In this paper, a novel opto-digital image encryption technique is proposed by introducing a new non-linear preprocessing and using the multiple-parameter discrete fractional Fourier transform (MPDFrFT). The non-linear preprocessing is performed digitally on the input image in the spatial domain using a piecewise linear chaotic map (PLCM) coupled with the bitwise exclusive OR (XOR). The resulting image is multiplied by a random phase mask before applying the MPDFrFT to whiten the image. Then, a chaotic permutation is performed on the output of the MPDFrFT using another PLCM different from the one used in the spatial domain. Finally, another MPDFrFT is applied to obtain the encrypted image. The parameters of the PLCMs together with the multiple fractional orders of the MPDFrFTs constitute the secret key for the proposed cryptosystem. Computer simulation results and security analysis are presented to show the robustness of the proposed opto-digital image encryption technique and the great importance of the new non-linear preprocessing introduced to enhance the security of the cryptosystem and overcome the problem of linearity encountered in the existing permutation-based opto-digital image encryption schemes.
Deepan, B; Quan, C; Wang, Y; Tay, C J
2014-07-10
In this paper, a new multiple-image encryption and decryption technique that utilizes the compressive sensing (CS) concept along with a double-random phase encryption (DRPE) has been proposed. The space multiplexing method is employed for integrating multiple-image data. The method, which results in a nonlinear encryption system, is able to overcome the vulnerability of classical DRPE. The CS technique and space multiplexing are able to provide additional key space in the proposed method. A numerical experiment of the proposed method is implemented and the results show that the proposed method has good accuracy and is more robust than classical DRPE. The proposed system is also employed against chosen-plaintext attacks and it is found that the inclusion of compressive sensing enhances robustness against the attacks.
Directory of Open Access Journals (Sweden)
Mona F. M. Mursi
2014-11-01
Full Text Available Robust and secure transmission strategy for high quality image through wireless networks is considered a great challenge. However, the majority of encrypted image transmission schemes don't consider well the effect of bit errors occurring during transmission. These errors are due to the factors that affect the information such as noise and multipath propagation. That should be handled by an efficient channel coding scheme. Our proposed scheme is based on combining hybrid chaotic encryption, which is based on two-dimensional chaotic maps which is utilized for data security, with an error correction technique based on the Low Density Parity Check (LDPC code. The LDPC is employed as channel coding for data communication in order to solve the problem of the channel’s limited bandwidth and improve throughput. Simulation results show that the proposed scheme achieves a high degree of robustness against channel impairments and wide varieties of attacks as wells as improved reliability of the wireless channel. In addition, LDPC is utilized for error correction in order to solve the limitations of wireless channels.
Li, Xianye; Meng, Xiangfeng; Wang, Yurong; Yang, Xiulun; Yin, Yongkai; Peng, Xiang; He, Wenqi; Dong, Guoyan; Chen, Hongyi
2017-09-01
A multiple-image encryption method is proposed that is based on row scanning compressive ghost imaging, (t, n) threshold secret sharing, and phase retrieval in the Fresnel domain. In the encryption process, after wavelet transform and Arnold transform of the target image, the ciphertext matrix can be first detected using a bucket detector. Based on a (t, n) threshold secret sharing algorithm, the measurement key used in the row scanning compressive ghost imaging can be decomposed and shared into two pairs of sub-keys, which are then reconstructed using two phase-only mask (POM) keys with fixed pixel values, placed in the input plane and transform plane 2 of the phase retrieval scheme, respectively; and the other POM key in the transform plane 1 can be generated and updated by the iterative encoding of each plaintext image. In each iteration, the target image acts as the input amplitude constraint in the input plane. During decryption, each plaintext image possessing all the correct keys can be successfully decrypted by measurement key regeneration, compression algorithm reconstruction, inverse wavelet transformation, and Fresnel transformation. Theoretical analysis and numerical simulations both verify the feasibility of the proposed method.
A novel image encryption algorithm using chaos and reversible cellular automata
Wang, Xingyuan; Luan, Dapeng
2013-11-01
In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.
Alfalou, A; Brosseau, C; Abdallah, N; Jridi, M
2013-04-01
We introduce a double optimization procedure for spectrally multiplexing multiple images. This technique is adapted from a recently proposed optical setup implementing the discrete cosine transformation (DCT). The new analysis technique is a combination of spectral fusion based on the properties of DCT, specific spectral filtering, and quantization of the remaining encoded frequencies using an optimal number of bits. Spectrally multiplexing multiple images defines a first level of encryption. A second level of encryption based on a real key image is used to reinforce encryption. A set of numerical simulations and a comparison with the well known JPEG (Joint Photographic Experts Group) image compression standard have been carried out to demonstrate the improved performances of this method. The focus here will differ from the method of simultaneous fusion, compression, and encryption of multiple images (SFCE) [Opt. Express 19, 24023 (2011)] in the following ways. Firstly, we shall be concerned with optimizing the compression rate by adapting the size of the spectral block to each target image and decreasing the number of bits required to encode each block. This size adaptation is achieved by means of the root-mean-square (RMS) time-frequency criterion. We found that this size adaptation provides a good tradeoff between bandwidth of spectral plane and number of reconstructed output images. Secondly, the encryption rate is improved by using a real biometric key and randomly changing the rotation angle of each block before spectral fusion. By using a real-valued key image we have been able to increase the compression rate of 50% over the original SFCE method. We provide numerical examples of the effects for size, rotation, and shifting of DCT-blocks which play noteworthy roles in the optimization of the bandwidth of the spectral plane. Inspection of the results for different types of attack demonstrates the robustness of our procedure.
Hardware stream cipher with controllable chaos generator for colour image encryption
Barakat, Mohamed L.
2014-01-01
This study presents hardware realisation of chaos-based stream cipher utilised for image encryption applications. A third-order chaotic system with signum non-linearity is implemented and a new post processing technique is proposed to eliminate the bias from the original chaotic sequence. The proposed stream cipher utilises the processed chaotic output to mask and diffuse input pixels through several stages of XORing and bit permutations. The performance of the cipher is tested with several input images and compared with previously reported systems showing superior security and higher hardware efficiency. The system is experimentally verified on XilinxVirtex 4 field programmable gate array (FPGA) achieving small area utilisation and a throughput of 3.62 Gb/s. © The Institution of Engineering and Technology 2013.
Key rotation multiplexing for multiple-image optical encryption in the Fresnel domain
Yong-Liang, Xiao; Su, Xianyu; Li, Sikun; Liu, Xiaoqing; Zeng, Shuguang
2011-06-01
We introduce a key rotation multiplexing method into the double random phase encoding system for multiple-image optical encryption in the Fresnel domain. Each plaintext is encoded into a stationary-white-noise ciphertext by the same only phase mask located at the input plane, and another only phase mask with a certain rotation angle located at the transform plane. All ciphertexts encoded from different plaintexts are added together to produce a final ciphertext, which serves as a single data source for different plaintexts decryption. Thus, the mask located at transform plane can be utilized to decrypt different plaintexts with a certain rotation angle. Also, we perform computer simulations to investigate how the quantization level of decrypted key and CCD, respectively, affect the decrypted quality and the number of images that can be multiplexed.
Prakash, M; Balasubramaniam, P; Lakshmanan, S
2016-11-01
This study is mainly concerned with the problem on synchronization criteria for Markovian jumping time delayed bidirectional associative memory neural networks and their applications in secure image communications. Based on the variable transformation method, the addressed second order differential equations are transformed into first order differential equations. Then, by constructing a suitable Lyapunov-Krasovskii functional and based on integral inequalities, the criteria which ensure the synchronization between the uncontrolled system and controlled system are established through designed feedback controllers and linear matrix inequalities. Further, the proposed results proved that the error system is globally asymptotically stable in the mean square. Moreover, numerical illustrations are provided to validate the effectiveness of the derived analytical results. Finally, the application of addressed system is explored via image encryption/decryption process. Copyright © 2016 Elsevier Ltd. All rights reserved.
All-optical video-image encryption with enforced security level using independent component analysis
Alfalou, A.; Mansour, A.
2007-10-01
In the last two decades, wireless communications have been introduced in various applications. However, the transmitted data can be, at any moment, intercepted by non-authorized people. That could explain why data encryption and secure transmission have gained enormous popularity. In order to secure data transmission, we should pay attention to two aspects: transmission rate and encryption security level. In this paper, we address these two aspects by proposing a new video-image transmission scheme. This new system consists in using the advantage of optical high transmission rate and some powerful signal processing tools to secure the transmitted data. The main idea of our approach is to secure transmitted information at two levels: at the classical level by using an adaptation of standard optical techniques and at a second level (spatial diversity) by using independent transmitters. In the second level, a hacker would need to intercept not only one channel but all of them in order to retrieve information. At the receiver, we can easily apply ICA algorithms to decrypt the received signals and retrieve information.
Directory of Open Access Journals (Sweden)
Hanzhong Zheng
2014-01-01
Full Text Available A systematic methodology is developed for multi-images encryption and decryption and field programmable gate array (FPGA embedded implementation by using single discrete time chaotic system. To overcome the traditional limitations that a chaotic system can only encrypt or decrypt one image, this paper initiates a new approach to design n-dimensional (n-D discrete time chaotic controlled systems via some variables anticontrol, which can achieve multipath drive-response synchronization. To that end, the designed n-dimensional discrete time chaotic controlled systems are used for multi-images encryption and decryption. A generalized design principle and the corresponding implementation steps are also given. Based on the FPGA embedded hardware system working platform with XUP Virtex-II type, a chaotic secure communication system for three digital color images encryption and decryption by using a 7D discrete time chaotic system is designed, and the related system design and hardware implementation results are demonstrated, with the related mathematical problems analyzed.
Sang, Jun; Zhao, Jun; Xiang, Zhili; Cai, Bin; Xiang, Hong
2015-08-05
Gyrator transform has been widely used for image encryption recently. For gyrator transform-based image encryption, the rotation angle used in the gyrator transform is one of the secret keys. In this paper, by analyzing the properties of the gyrator transform, an improved particle swarm optimization (PSO) algorithm was proposed to search the rotation angle in a single gyrator transform. Since the gyrator transform is continuous, it is time-consuming to exhaustedly search the rotation angle, even considering the data precision in a computer. Therefore, a computational intelligence-based search may be an alternative choice. Considering the properties of severe local convergence and obvious global fluctuations of the gyrator transform, an improved PSO algorithm was proposed to be suitable for such situations. The experimental results demonstrated that the proposed improved PSO algorithm can significantly improve the efficiency of searching the rotation angle in a single gyrator transform. Since gyrator transform is the foundation of image encryption in gyrator transform domains, the research on the method of searching the rotation angle in a single gyrator transform is useful for further study on the security of such image encryption algorithms.
Directory of Open Access Journals (Sweden)
Jun Sang
2015-08-01
Full Text Available Gyrator transform has been widely used for image encryption recently. For gyrator transform-based image encryption, the rotation angle used in the gyrator transform is one of the secret keys. In this paper, by analyzing the properties of the gyrator transform, an improved particle swarm optimization (PSO algorithm was proposed to search the rotation angle in a single gyrator transform. Since the gyrator transform is continuous, it is time-consuming to exhaustedly search the rotation angle, even considering the data precision in a computer. Therefore, a computational intelligence-based search may be an alternative choice. Considering the properties of severe local convergence and obvious global fluctuations of the gyrator transform, an improved PSO algorithm was proposed to be suitable for such situations. The experimental results demonstrated that the proposed improved PSO algorithm can significantly improve the efficiency of searching the rotation angle in a single gyrator transform. Since gyrator transform is the foundation of image encryption in gyrator transform domains, the research on the method of searching the rotation angle in a single gyrator transform is useful for further study on the security of such image encryption algorithms.
Wang, Xiaogang; Zhao, Daomu
2013-09-01
A nonlinear color and grayscale images cryptosystem based on phase-truncated fractional Fourier transform and optical superposition principle is proposed. In order to realize simultaneous encryption of color and grayscale images, each grayscale image is first converted into two phase masks by using an optical coherent superposition, one of which is treated as a part of input information that will be fractional Fourier transformed while the other in the form of a chaotic random phase mask (CRPM) is used as a decryption key. For the purpose of optical performance, all the processes are performed through three channels, i.e., red, green, and blue. Different from most asymmetric encryption methods, the decryption process is designed to be linear for the sake of effective decryption. The encryption level of a double random phase encryption based on phase-truncated Fourier transform is enhanced by extending it into fractional Fourier domain and the load of the keys management and transmission is lightened by using CRPMs. The security of the proposed cryptosystem is discussed and computer simulation results are presented to verify the validity of the proposed method.
Wang, Qu; Guo, Qing; Lei, Liang
2013-06-01
We present a novel method for double image encryption that is based on amplitude-phase mixed encoding and multistage random phase encoding in gyrator transform (GT) domains. In the amplitude-phase mixed encoding operation, a random binary distribution matrix is defined to mixed encode two primitive images to a single complex-valued image, which is then encrypted into a stationary white noise distribution by the multistage phase encoding with GTs. Compared with the earlier methods that uses fully phase encoding, the proposed method reduces the difference between two primitive images in key space and sensitivity to the GT orders. The primitive images can be recovered exactly by applying correct keys with initial conditions of chaotic system, the GT orders and the pixel scrambling operation. Numerical simulations demonstrate that the proposed scheme has considerably high security level and certain robustness against data loss and noise disturbance.
A joint image encryption and watermarking algorithm based on compressive sensing and chaotic map
Xiao, Di; Cai, Hong-Kun; Zheng, Hong-Ying
2015-06-01
In this paper, a compressive sensing (CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firstly. Then the watermark is adhered to the scrambled data. By compressive sensing, a set of watermarked measurements is obtained as the watermarked cipher image. In this algorithm, watermark embedding and data compression can be performed without knowing the original image; similarly, watermark extraction will not interfere with decryption. Due to the characteristics of CS, this algorithm features compressible cipher image size, flexible watermark capacity, and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss. Simulation results and analyses show that the algorithm achieves good performance in the sense of security, watermark capacity, extraction accuracy, reconstruction, robustness, etc. Project supported by the Open Research Fund of Chongqing Key Laboratory of Emergency Communications, China (Grant No. CQKLEC, 20140504), the National Natural Science Foundation of China (Grant Nos. 61173178, 61302161, and 61472464), and the Fundamental Research Funds for the Central Universities, China (Grant Nos. 106112013CDJZR180005 and 106112014CDJZR185501).
A Fingerprint Image Encryption Scheme Based on Hyperchaotic Rössler Map
Directory of Open Access Journals (Sweden)
F. Abundiz-Pérez
2016-01-01
Full Text Available Currently, biometric identifiers have been used to identify or authenticate users in a biometric system to increase the security in access control systems. Nevertheless, there are several attacks on the biometric system to steal and recover the user’s biometric trait. One of the most powerful attacks is extracting the fingerprint pattern when it is transmitted over communication lines between modules. In this paper, we present a novel fingerprint image encryption scheme based on hyperchaotic Rössler map to provide high security and secrecy in user’s biometric trait, avoid identity theft, and increase the robustness of the biometric system. A complete security analysis is presented to justify the secrecy of the biometric trait by using our proposed scheme at statistical level with 100% of NPCR, low correlation, and uniform histograms. Therefore, it can be used in secure biometric access control systems.
Hierarchical Bayesian sparse image reconstruction with application to MRFM
Dobigeon, Nicolas; Tourneret, Jean-Yves
2008-01-01
This paper presents a hierarchical Bayesian model to reconstruct sparse images when the observations are obtained from linear transformations and corrupted by an additive white Gaussian noise. Our hierarchical Bayes model is well suited to such naturally sparse image applications as it seamlessly accounts for properties such as sparsity and positivity of the image via appropriate Bayes priors. We propose a prior that is based on a weighted mixture of a positive exponential distribution and a mass at zero. The prior has hyperparameters that are tuned automatically by marginalization over the hierarchical Bayesian model. To overcome the complexity of the posterior distribution, a Gibbs sampling strategy is proposed. The Gibbs samples can be used to estimate the image to be recovered, e.g. by maximizing the estimated posterior distribution. In our fully Bayesian approach the posteriors of all the parameters are available. Thus our algorithm provides more information than other previously proposed sparse reconstr...
Ensemble Of Blowfish With Chaos Based S Box Design For Text And Image Encryption
Directory of Open Access Journals (Sweden)
Jeyamala Chandrasekaran
2011-08-01
Full Text Available The rapid and extensive usage of Internet in the present decade has put forth information security as an utmost concern. Most of the commercial transactions taking place over the Internet involves a wide variety of data including text, images, audio and video. With the increasing use of digital techniques for transmitting and storing Multimedia data, the fundamental issue of protecting the confidentiality, integrity and authenticity of the information poses a major challenge for security professionals and hassled to the major developments in Cryptography . In cryptography, an S-Box (Substitution-box is a basic componentof symmetric key algorithms, which performs substitution and is typically used to make the relationship between the key and the cipher text non linear and most of the symmetric key algorithms like DES, Blowfish makes use of S boxes. This paper proposes a new method for design of S boxes based on chaos theory. Chaotic equations are popularly known for its randomness, extreme sensitivity to initial conditions and ergodicity. The modified design has been tested with blowfish algorithm which has no effective crypt analysis reported against its design till date because of its salient design features including the key dependant s boxes and complex key generation process. However every new key requires pre-processing equivalent to encrypting about 4 kilobytes of text, which is very slow compared to other block ciphers and it prevents its usage in memory limited applications and embedded systems. The modified design of S boxesmaintains the non linearity [3] [5] and key dependency factors of S boxes with a major reduction in time complexity of generation of S boxes and P arrays. The algorithm has been implemented and the proposed design has been analyzed for size of key space, key sensitivity and Avalanche effect. Experimental results on text and Image Encryption show that the modified design of key generation continues to offer the same
Qin, Yi; Wang, Hongjuan; Wang, Zhipeng; Gong, Qiong; Wang, Danchen
2016-09-01
In optical interference-based encryption (IBE) scheme, the currently available methods have to employ the iterative algorithms in order to encrypt two images and retrieve cross-talk free decrypted images. In this paper, we shall show that this goal can be achieved via an analytical process if one of the two images is QR code. For decryption, the QR code is decrypted in the conventional architecture and the decryption has a noisy appearance. Nevertheless, the robustness of QR code against noise enables the accurate acquisition of its content from the noisy retrieval, as a result of which the primary QR code can be exactly regenerated. Thereafter, a novel optical architecture is proposed to recover the grayscale image by aid of the QR code. In addition, the proposal has totally eliminated the silhouette problem existing in the previous IBE schemes, and its effectiveness and feasibility have been demonstrated by numerical simulations.
Wang, Qingzhu; Chen, Xiaoming; Wei, Mengying; Miao, Zhuang
2016-11-04
The existing techniques for simultaneous encryption and compression of images refer lossy compression. Their reconstruction performances did not meet the accuracy of medical images because most of them have not been applicable to three-dimensional (3D) medical image volumes intrinsically represented by tensors. We propose a tensor-based algorithm using tensor compressive sensing (TCS) to address these issues. Alternating least squares is further used to optimize the TCS with measurement matrices encrypted by discrete 3D Lorenz. The proposed method preserves the intrinsic structure of tensor-based 3D images and achieves a better balance of compression ratio, decryption accuracy, and security. Furthermore, the characteristic of the tensor product can be used as additional keys to make unauthorized decryption harder. Numerical simulation results verify the validity and the reliability of this scheme.
Jeon, Seok Hee; Hwang, Young Gwan; Gil, Sang Keun
2008-07-01
In this paper we propose an encryption/decryption technique of gray-level image information using an on-axis 2-f digital holographic optical encrypting system with two-step phase-shifting method. This technique reduces the number of holograms in phase-shifting digital holography and minimizes the setup of the encryption system more than multistep phase-shifting technique. We are able to get the complete decrypted image by controlling the K-ratio which is defined as the reference beam intensity versus the object beam intensity. We remove the DC-term of the phase-shifting digital hologram to reconstruct and decrypt the original image information. Simulation results show that the proposed method can be used for encryption and decryption of a 256 gray-level image. Also, the result shows some errors of the decrypted image according to K-ratio.
Chai, Xiu-Li; Gan, Zhi-Hua; Lu, Yang; Zhang, Miao-Hui; Chen, Yi-Ran
2016-10-01
Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them. In the paper, a novel color image encryption algorithm is introduced. The 24 bit planes of components R, G, and B of the color plain image are obtained and recombined into 4 compound bit planes, and this can make the three components affect each other. A four-dimensional (4D) memristive hyperchaotic system generates the pseudorandom key streams and its initial values come from the SHA 256 hash value of the color plain image. The compound bit planes and key streams are confused according to the principles of genetic recombination, then confusion and diffusion as a union are applied to the bit planes, and the color cipher image is obtained. Experimental results and security analyses demonstrate that the proposed algorithm is secure and effective so that it may be adopted for secure communication. Project supported by the National Natural Science Foundation of China (Grant Nos. 61203094 and 61305042), the Natural Science Foundation of the United States (Grant Nos. CNS-1253424 and ECCS-1202225), the Science and Technology Foundation of Henan Province, China (Grant No. 152102210048), the Foundation and Frontier Project of Henan Province, China (Grant No. 162300410196), the Natural Science Foundation of Educational Committee of Henan Province, China (Grant No. 14A413015), and the Research Foundation of Henan University, China (Grant No. xxjc20140006).
A chaos-based digital image encryption scheme with an improved diffusion strategy.
Fu, Chong; Chen, Jun-jie; Zou, Hao; Meng, Wei-hong; Zhan, Yong-feng; Yu, Ya-wen
2012-01-30
Chaos-based image cipher has been widely investigated over the last decade or so to meet the increasing demand for real-time secure image transmission over public networks. In this paper, an improved diffusion strategy is proposed to promote the efficiency of the most widely investigated permutation-diffusion type image cipher. By using the novel bidirectional diffusion strategy, the spreading process is significantly accelerated and hence the same level of security can be achieved with fewer overall encryption rounds. Moreover, to further enhance the security of the cryptosystem, a plain-text related chaotic orbit turbulence mechanism is introduced in diffusion procedure by perturbing the control parameter of the employed chaotic system according to the cipher-pixel. Extensive cryptanalysis has been performed on the proposed scheme using differential analysis, key space analysis, various statistical analyses and key sensitivity analysis. Results of our analyses indicate that the new scheme has a satisfactory security level with a low computational complexity, which renders it a good candidate for real-time secure image transmission applications.
Optical image encryption based on real-valued coding and subtracting with the help of QR code
Deng, Xiaopeng
2015-08-01
A novel optical image encryption based on real-valued coding and subtracting is proposed with the help of quick response (QR) code. In the encryption process, the original image to be encoded is firstly transformed into the corresponding QR code, and then the corresponding QR code is encoded into two phase-only masks (POMs) by using basic vector operations. Finally, the absolute values of the real or imaginary parts of the two POMs are chosen as the ciphertexts. In decryption process, the QR code can be approximately restored by recording the intensity of the subtraction between the ciphertexts, and hence the original image can be retrieved without any quality loss by scanning the restored QR code with a smartphone. Simulation results and actual smartphone collected results show that the method is feasible and has strong tolerance to noise, phase difference and ratio between intensities of the two decryption light beams.
Investigating Encrypted Material
McGrath, Niall; Gladyshev, Pavel; Kechadi, Tahar; Carthy, Joe
When encrypted material is discovered during a digital investigation and the investigator cannot decrypt the material then s/he is faced with the problem of how to determine the evidential value of the material. This research is proposing a methodology of extracting probative value from the encrypted file of a hybrid cryptosystem. The methodology also incorporates a technique for locating the original plaintext file. Since child pornography (KP) images and terrorist related information (TI) are transmitted in encrypted format the digital investigator must ask the question Cui Bono? - who benefits or who is the recipient? By doing this the scope of the digital investigation can be extended to reveal the intended recipient.
Hierarchical Non-linear Image Registration Integrating Deformable Segmentation
Institute of Scientific and Technical Information of China (English)
RAN Xin; QI Fei-hu
2005-01-01
A hierarchical non-linear method for image registration was presented, which integrates image segmentation and registration under a variational framework. An improved deformable model is used to simultaneously segment and register feature from multiple images. The objects in the image pair are segmented by evolving a single contour and meanwhile the parameters of affine registration transformation are found out. After that, a contour-constrained elastic registration is applied to register the images correctly. The experimental results indicate that the proposed approach is effective to segment and register medical images.
Singh, Madan; Kumar, Arvind; Singh, Kehar
2008-10-01
In this paper, we have described a simple and secure double random phase encoding and decoding system to encrypt and decrypt a two-dimensional gray scale image. We have used jigsaw transforms of the second random phase mask and the encrypted image. The random phase mask placed in the Fourier plane is broken into independent non-overlapping segments by applying the jigsaw transform. To make the system more secure, a jigsaw transform on the encrypted image is also carried out. The encrypted image is also broken into independent non-overlapping segments. The jigsaw transform indices of random phase code and the encrypted image form the keys for the successful retrieval of the data. Encrypting with this technique makes it almost impossible to retrieve the image without using both the right keys. Results of computer simulation have been presented in support of the proposed idea. Mean square error (MSE) between the decrypted and the original image has also been calculated in support of the technique.
Directory of Open Access Journals (Sweden)
Saddaf Rubab
2015-01-01
Full Text Available Steganography is a means to hide the existence of information exchange. Using this technique the sender embeds the secret information in some other media. This is done by replacing useless data in ordinary computer files with some other secret information. The secret information could be simple text, encoded text or images. The media used as the embedding plane could be an image, audio, video or text files. Using steganography ensures that no one apart from the sender and the receiver knows about the existence of the message. In this paper, a steganography method based on transforms used i.e. Wavelet and Contourlet. Devised algorithm was used against each transform. Blowfish Encryption method is also embedded to double the security impact. The major advantage of applying transforms is that the image quality is not degraded even if the number of embedded characters is increased. The proposed system operates well in most of the test cases. The average payload capacity is also considerably high.
Spread spectrum image data hiding in the encrypted discrete cosine transform coefficients
Zhang, Xiaoqiang; Wang, Z. Jane
2013-10-01
Digital watermarking and data hiding are important tools for digital rights protection of media data. Spread spectrum (SS)-based watermarking and data-hiding approaches are popular due to their outstanding robustness, but their security might not be sufficient. To improve the security of SS, a SS-based image data-hiding approach is proposed by encrypting the discrete cosine transform coefficients of the host image with the piecewise linear chaotic map, before the operation of watermark embedding. To evaluate the performance of the proposed approach, simulations and analyses of its robustness and security are carried out. The average bit-error-rate values on 100 real images from the Berkeley segmentation dataset under the JPEG compression, additive Gaussian noise, salt and pepper noise, and cropping attacks are reported. Experimental results show that the proposed approach can maintain the high robustness of traditional SS schemes and, meanwhile, also improve the security. The proposed approach can extend the key space of traditional SS schemes from 10 to 10 and thus can resist brute-force attack and unauthorized detection watermark attack.
Sui, Liansheng; Duan, Kuaikuai; Liang, Junli
2015-05-01
A new discrete fractional transform defined by the fractional order, periodicity and vector parameters is presented, which is named as the discrete multiple-parameter fractional angular transform. Based on this transform and two-coupled logistic map, a double-image encryption scheme is proposed. First, an enlarged image is obtained by connecting two plaintext images sequentially and scrambled by using a chaotic permutation process, in which the sequences of chaotic pairs generated by using the two-coupled logistic map. Then, the scrambled enlarged image is decomposed into two new components. Second, a chaotic random phase mask is generated based on the logistic map, with which one of two components is converted to the modulation phase mask. Another component is encoded into an interim matrix with the help of the modulation phase mask. Finally, the two-dimensional discrete multiple-parameter fractional angular transform is performed on the interim matrix to obtain the ciphertext with stationary white noise distribution. The proposed encryption scheme has an obvious advantage that no phase keys are used in the encryption and decryption process, which is convenient to key management. Moreover, the security of the cryptosystem can be enhanced by using extra parameters such as initial values of chaos functions, fractional orders and vector parameters of transform. Simulation results and security analysis verify the feasibility and effectiveness of the proposed scheme.
Sui, Liansheng; Xu, Minjie; Tian, Ailing
2017-04-01
A novel optical image encryption scheme is proposed based on quick response code and high dimension chaotic system, where only the intensity distribution of encoded information is recorded as ciphertext. Initially, the quick response code is engendered from the plain image and placed in the input plane of the double random phase encoding architecture. Then, the code is encrypted to the ciphertext with noise-like distribution by using two cascaded gyrator transforms. In the process of encryption, the parameters such as rotation angles and random phase masks are generated as interim variables and functions based on Chen system. A new phase retrieval algorithm is designed to reconstruct the initial quick response code in the process of decryption, in which a priori information such as three position detection patterns is used as the support constraint. The original image can be obtained without any energy loss by scanning the decrypted code with mobile devices. The ciphertext image is the real-valued function which is more convenient for storing and transmitting. Meanwhile, the security of the proposed scheme is enhanced greatly due to high sensitivity of initial values of Chen system. Extensive cryptanalysis and simulation have performed to demonstrate the feasibility and effectiveness of the proposed scheme.
A New One-Dimensional Chaotic Map and Its Use in a Novel Real-Time Image Encryption Scheme
Directory of Open Access Journals (Sweden)
Radu Boriga
2014-01-01
Full Text Available We present a new one-dimensional chaotic map, suitable for real-time image encryption. Its theoretical analysis, performed using some specific tools from the chaos theory, shows that the proposed map has a chaotic regime and proves its ergodicity, for a large space of values of the control parameter. In addition, to argue for the good cryptographic properties of the proposed map, we have tested the randomness of the values generated by its orbit using NIST statistical suite. Moreover, we present a new image encryption scheme with a classic bimodular architecture, in which the confusion and the diffusion are assured by means of two maps of the previously proposed type. The very good cryptographic performances of the proposed scheme are proved by an extensive analysis, which was performed regarding the latest methodology in this field.
Wavelet based hierarchical coding scheme for radar image compression
Sheng, Wen; Jiao, Xiaoli; He, Jifeng
2007-12-01
This paper presents a wavelet based hierarchical coding scheme for radar image compression. Radar signal is firstly quantized to digital signal, and reorganized as raster-scanned image according to radar's repeated period frequency. After reorganization, the reformed image is decomposed to image blocks with different frequency band by 2-D wavelet transformation, each block is quantized and coded by the Huffman coding scheme. A demonstrating system is developed, showing that under the requirement of real time processing, the compression ratio can be very high, while with no significant loss of target signal in restored radar image.
A New One-Dimensional Chaotic Map and Its Use in a Novel Real-Time Image Encryption Scheme
Radu Boriga; Ana Cristina Dăscălescu; Adrian-Viorel Diaconu
2014-01-01
We present a new one-dimensional chaotic map, suitable for real-time image encryption. Its theoretical analysis, performed using some specific tools from the chaos theory, shows that the proposed map has a chaotic regime and proves its ergodicity, for a large space of values of the control parameter. In addition, to argue for the good cryptographic properties of the proposed map, we have tested the randomness of the values generated by its orbit using NIST statistical suite. Moreover, we pres...
A Brief Study of Video Encryption Algorithms
Directory of Open Access Journals (Sweden)
Pranali Pasalkar,
2015-02-01
Full Text Available Video is a set of images .Video encryption is encrypting those set of images .Thus video encryption is simply hiding your video from prying eyes .Video monitoring has always been in concerned .Multimedia security is very important for multimedia commerce on Internet such as video on demand and Real time video multicast. There are various video encryption algorithm. All have some kind of weakness .In this paper classification of various existing algorithm, its advantages and disadvantages is discussed.
Lang, Jun
2015-03-01
In this paper, we propose a novel color image encryption method by using Color Blend (CB) and Chaos Permutation (CP) operations in the reality-preserving multiple-parameter fractional Fourier transform (RPMPFRFT) domain. The original color image is first exchanged and mixed randomly from the standard red-green-blue (RGB) color space to R‧G‧B‧ color space by rotating the color cube with a random angle matrix. Then RPMPFRFT is employed for changing the pixel values of color image, three components of the scrambled RGB color space are converted by RPMPFRFT with three different transform pairs, respectively. Comparing to the complex output transform, the RPMPFRFT transform ensures that the output is real which can save storage space of image and convenient for transmission in practical applications. To further enhance the security of the encryption system, the output of the former steps is scrambled by juxtaposition of sections of the image in the reality-preserving multiple-parameter fractional Fourier domains and the alignment of sections is determined by two coupled chaotic logistic maps. The parameters in the Color Blend, Chaos Permutation and the RPMPFRFT transform are regarded as the key in the encryption algorithm. The proposed color image encryption can also be applied to encrypt three gray images by transforming the gray images into three RGB color components of a specially constructed color image. Numerical simulations are performed to demonstrate that the proposed algorithm is feasible, secure, sensitive to keys and robust to noise attack and data loss.
Su, Yonggang; Tang, Chen; Li, Biyuan; Chen, Xia; Xu, Wenjun; Cai, Yuanxue
2017-01-20
We propose an optical color image encryption system based on the single-lens Fourier transform, the Fresnel transform, and the chaotic random phase masks (CRPMs). The proposed encryption system contains only one optical lens, which makes it more efficient and concise to implement. The introduction of the Fresnel transform makes the first phase mask of the proposed system also act as the main secret key when the input image is a non-negative amplitude-only map. The two CRPMs generated by dual two-dimensional chaotic maps can provide more security to the proposed system. In the proposed system, the key management is more convenient and the transmission volume is reduced greatly. In addition, the secret keys can be updated conveniently in each encryption process to invalidate the chosen plaintext attack and the known plaintext attack. Numerical simulation results have demonstrated the feasibility and security of the proposed encryption system.
Image Segmentation by Hierarchical Spatial and Color Spaces Clustering
Institute of Scientific and Technical Information of China (English)
YU Wei
2005-01-01
Image segmentation, as a basic building block for many high-level image analysis problems, has attracted many research attentions over years. Existing approaches, however, are mainly focusing on the clustering analysis in the single channel information, i.e., either in color or spatial space, which may lead to unsatisfactory segmentation performance. Considering the spatial and color spaces jointly, this paper proposes a new hierarchical image segmentation algorithm, which alternately clusters the image regions in color and spatial spaces in a fine to coarse manner. Without losing the perceptual consistence, the proposed algorithm achieves the segmentation result using only very few number of colors according to user specification.
Di, Xiaoqiang; Li, Jinqing; Qi, Hui; Cong, Ligang; Yang, Huamin
2017-01-01
Both symmetric and asymmetric color image encryption have advantages and disadvantages. In order to combine their advantages and try to overcome their disadvantages, chaos synchronization is used to avoid the key transmission for the proposed semi-symmetric image encryption scheme. Our scheme is a hybrid chaotic encryption algorithm, and it consists of a scrambling stage and a diffusion stage. The control law and the update rule of function projective synchronization between the 3-cell quantum cellular neural networks (QCNN) response system and the 6th-order cellular neural network (CNN) drive system are formulated. Since the function projective synchronization is used to synchronize the response system and drive system, Alice and Bob got the key by two different chaotic systems independently and avoid the key transmission by some extra security links, which prevents security key leakage during the transmission. Both numerical simulations and security analyses such as information entropy analysis, differential attack are conducted to verify the feasibility, security, and efficiency of the proposed scheme.
Ji, Shiyu; Tong, Xiaojun; Zhang, Miao
2013-01-01
We propose several methods to transplant the compound chaotic image encryption scheme with permutation based on three-dimensional (3-D) baker onto image formats such as the joint photographic experts group (JPEG) and graphics interchange format (GIF). The new methods avert the discrete cosine transform and quantization, which result in floating point precision loss, and succeed to encrypt and decrypt JPEG images lossless. The ciphered JPEG images generated by our solution own much better randomness than most other existing schemes. Our proposed method for GIF keeps the property of animation successfully. The security test results indicate the proposed methods have high security, and the speed of our algorithm is faster than classical solutions. Since JPEG and GIF image formats are popular contemporarily, we show that the prospect of chaotic image encryption is promising.
基于RSA的数字图像加密算法%An Encryption Algorithm for Digital Image Based on RSA System
Institute of Scientific and Technical Information of China (English)
杨昔阳; 李志伟
2009-01-01
It proposes a novel encryption method for digital image based on an Arnold scrambling transform, a chaos encryption algorithm and RSA encryption system. The parameters of the Arnold transform and chaos encryption algorithm are encrypted by RSA system and stored in LSB of an image to ensure the security in transmission. The example in this paper shows that the proposed method is an efficient way to encrypt a digital image.%提出一种基于RSA公钥、Arnold置乱变换和混沌加密算法相结合的公开密钥数字图像加密体制,利用客户的公钥对Arnold置乱变换和混沌序列初值进行RSA加密,确保了只有合法用户才能获取置乱参数信息并将图像复原.RSA对参数的加密信息隐藏于图像LSB中,无需另外传递密文,运算简单,具有良好的加密与隐藏效果.
Zhang, Yushu; Xiao, Di; Wen, Wenying; Tian, Yuan
2013-12-01
In some special multimedia applications, only the regions with semantic information should be provided better protection whereas the other smooth regions can be free of encryption. However, most of the existing multimedia security schemes only consider bits and pixels rather than semantic information during their encryption. Motivated by this, we propose an edge-based lightweight image encryption scheme using chaos-based reversible hidden transform and multiple-order discrete fractional cosine transform. An image is first carried out by the edge detection based on advanced CNN structure with adaptive thresholds to assess data significance in the image. The detection output is a binary image, in which a “1” reflects the detected pixel whereas a “0” is opposite. Both the detected image and the original image are divided into non-overlapping pixel blocks in the same way, respectively. Whether each block is encrypted or not depends on the significance judged by the corresponding detected block. The significant block is performed by reversible hidden transform followed by multiple-order discrete fractional cosine transform parameters and orders of these two transforms are determined by a two dimensional cross chaotic map. Experiment results show the significant contour features of an image that have been largely hidden only by encrypting about half pixels in the average sense. The keys are extremely sensitive and the proposed scheme can resist noise attack to some extent.
一种高效的彩色图像加密和解密算法%Efficient Encryption and Decryption Algorithm for Color Image
Institute of Scientific and Technical Information of China (English)
彭静玉
2013-01-01
分析了基于Arnold变换的加密方案在加密效果及加密效率方面的不足。提出了一种新的彩色图像加密及解密算法。加密过程将像素的物理位置置乱并映射到不同的色彩空间；解密过程提出了一种针对彩色图像的逆变换算法，使解密的时间仅依赖加密的密钥而不依赖变换周期。仿真分析比较了该算法在加密效果及加密效率方面的优势。实验数据表明，该加密算法的加密效果理想，且加密效率较高，是一种简单、可行的彩色图像加密方法。%The deficiencies of encryption scheme based on Arnold transformation is analyzed, and a new encryption/decryption algorithm for color image proposed. The physical locations of pixels are scrambled and mapped to different color spaces in the encryption process. An inverse conversion method for color im-age is suggested in decryption process, thus making the decryption time dependent only on the encryption key instead of on the conversion cycle. Simulation and comparison of the advantages of proposed algorithm in encryption effect and encryption efficiency indicates that the proposed algorithm could improve encryp-tion effect while raising the decryption efficiency, and thus a simple and feasible color image encryption method.
Hierarchical clustering techniques for image database organization and summarization
Vellaikal, Asha; Kuo, C.-C. Jay
1998-10-01
This paper investigates clustering techniques as a method of organizing image databases to support popular visual management functions such as searching, browsing and navigation. Different types of hierarchical agglomerative clustering techniques are studied as a method of organizing features space as well as summarizing image groups by the selection of a few appropriate representatives. Retrieval performance using both single and multiple level hierarchies are experimented with and the algorithms show an interesting relationship between the top k correct retrievals and the number of comparisons required. Some arguments are given to support the use of such cluster-based techniques for managing distributed image databases.
Design and Implementation on the Image Encryption of Mobile Communication System%移动通信的图像加密系统设计与实现
Institute of Scientific and Technical Information of China (English)
万玉晴
2015-01-01
针对智能手机图像的加密应用需求与目前台式加密系统不能很好地适用于移动终端平台等问题，本文设计了一套适用于智能手机的图像加密系统，结合基于混沌算法的图像加密技术，提出了适用于移动端应用的低配置、快速实现图像加密的技术方法。实验结果表明，系统采用的并行多线程技术路线，可以提高大像素图像的加解密效率三倍以上，为智能手机的实时图像加密提供了一种可实现解决方案。%This article presents an image encryption system for smart phones that can solve the problems such as the application requirements of image encryption of smart phones and the current desktop encryption systems are not quite suitable for mobile terminal platform. It propose a technical method with low allocation and fast image encryption for mobile application with the use of image encryption technology based on chaos algorithm. The experiment result shows that the parallel multithreading technical strategy adopted by the system can improve over three times encryption and decryption efficiency of large pixel images. So it can provide a realizable solution for the real-time image encryption of smart phones.
Optimal atlas construction through hierarchical image registration
Grevera, George J.; Udupa, Jayaram K.; Odhner, Dewey; Torigian, Drew A.
2016-03-01
Atlases (digital or otherwise) are common in medicine. However, there is no standard framework for creating them from medical images. One traditional approach is to pick a representative subject and then proceed to label structures/regions of interest in this image. Another is to create a "mean" or average subject. Atlases may also contain more than a single representative (e.g., the Visible Human contains both a male and a female data set). Other criteria besides gender may be used as well, and the atlas may contain many examples for a given criterion. In this work, we propose that atlases be created in an optimal manner using a well-established graph theoretic approach using a min spanning tree (or more generally, a collection of them). The resulting atlases may contain many examples for a given criterion. In fact, our framework allows for the addition of new subjects to the atlas to allow it to evolve over time. Furthermore, one can apply segmentation methods to the graph (e.g., graph-cut, fuzzy connectedness, or cluster analysis) which allow it to be separated into "sub-atlases" as it evolves. We demonstrate our method by applying it to 50 3D CT data sets of the chest region, and by comparing it to a number of traditional methods using measures such as Mean Squared Difference, Mattes Mutual Information, and Correlation, and for rigid registration. Our results demonstrate that optimal atlases can be constructed in this manner and outperform other methods of construction using freely available software.
Architecture of the parallel hierarchical network for fast image recognition
Timchenko, Leonid; Wójcik, Waldemar; Kokriatskaia, Natalia; Kutaev, Yuriy; Ivasyuk, Igor; Kotyra, Andrzej; Smailova, Saule
2016-09-01
Multistage integration of visual information in the brain allows humans to respond quickly to most significant stimuli while maintaining their ability to recognize small details in the image. Implementation of this principle in technical systems can lead to more efficient processing procedures. The multistage approach to image processing includes main types of cortical multistage convergence. The input images are mapped into a flexible hierarchy that reflects complexity of image data. Procedures of the temporal image decomposition and hierarchy formation are described in mathematical expressions. The multistage system highlights spatial regularities, which are passed through a number of transformational levels to generate a coded representation of the image that encapsulates a structure on different hierarchical levels in the image. At each processing stage a single output result is computed to allow a quick response of the system. The result is presented as an activity pattern, which can be compared with previously computed patterns on the basis of the closest match. With regard to the forecasting method, its idea lies in the following. In the results synchronization block, network-processed data arrive to the database where a sample of most correlated data is drawn using service parameters of the parallel-hierarchical network.
Low-Level Hierarchical Multiscale Segmentation Statistics of Natural Images.
Akbas, Emre; Ahuja, Narendra
2014-09-01
This paper is aimed at obtaining the statistics as a probabilistic model pertaining to the geometric, topological and photometric structure of natural images. The image structure is represented by its segmentation graph derived from the low-level hierarchical multiscale image segmentation. We first estimate the statistics of a number of segmentation graph properties from a large number of images. Our estimates confirm some findings reported in the past work, as well as provide some new ones. We then obtain a Markov random field based model of the segmentation graph which subsumes the observed statistics. To demonstrate the value of the model and the statistics, we show how its use as a prior impacts three applications: image classification, semantic image segmentation and object detection.
[A medical image semantic modeling based on hierarchical Bayesian networks].
Lin, Chunyi; Ma, Lihong; Yin, Junxun; Chen, Jianyu
2009-04-01
A semantic modeling approach for medical image semantic retrieval based on hierarchical Bayesian networks was proposed, in allusion to characters of medical images. It used GMM (Gaussian mixture models) to map low-level image features into object semantics with probabilities, then it captured high-level semantics through fusing these object semantics using a Bayesian network, so that it built a multi-layer medical image semantic model, aiming to enable automatic image annotation and semantic retrieval by using various keywords at different semantic levels. As for the validity of this method, we have built a multi-level semantic model from a small set of astrocytoma MRI (magnetic resonance imaging) samples, in order to extract semantics of astrocytoma in malignant degree. Experiment results show that this is a superior approach.
RESEARCH ON FAST IMAGE ENCRYPTION METHOD FOR MOBILE TERMINALS%移动终端的图像快速加密方法研究
Institute of Scientific and Technical Information of China (English)
赵戈; 万玉晴
2015-01-01
According to the requirements of intelligent terminals of mobile Internet in image encryption,this article puts forward the four selection principles in regard to encryption approaches for images of mobile terminals based on analysing the traditional methods of image pixel positions scrambling and pixel greyscale value encryption by transformation,and based on these principles we design the encryption algorithm with dual image keys and dual scrambling which combines the Arnold conversion and the chaotic sequence encryption.Meanwhile,in order to improve computing speed of encryption and decryption,and to realise fast image encryption and decryption of mobile terminals,based on periodic verification and theoretical derivation of Arnold conversion,we derive a fast look-up table method for image encryption and decryption matrix of mobile terminals.It is proved by application that the algorithm can satisfy the requirement of transaction processing in image encryption of mobile terminals.%针对移动互联网智能终端的图像加密需求，在对传统的图像像素位置置乱以及像素灰度值变换加密等方法的分析与实验基础上，提出移动终端图像加密方法的四项选择原则，并按此原则设计Arnold变换和混沌序列加密相结合的图像双重密钥双重置乱加密算法。同时，为了提高加解密运算速度，实现移动终端快速图像加解密工作，在基于对Arnold变换的周期性验证和理论推导，得出移动终端的图像加解密矩阵的快速查表法。应用证明，该算法能满足事务处理对移动终端图像加密的需求。
Institute of Scientific and Technical Information of China (English)
沈学举; 刘旭敏; 许芹祖; 林超
2014-01-01
为了减少加密系统所用模板数，简化隐藏图像对解密过程的影响，采用球面波照明研究了基于傅里叶变换全息的多图像加密隐藏方法，并进行了加密、加密图像隐藏和解密的理论分析和数值模拟，加密图像和原始图像间的相关系数趋于0，宿主图像和加密图像的叠加系数ρ＜0．3时，宿主图像和隐藏图像的相关系数趋于1，解密图像和原始图像间的相关系数趋于1。结果表明，该加密隐藏方法的加密、解密和隐藏效果良好。%To reduce the number of binary random phase mask used in an image encryption system and simplify the effect of hidden encryption images on decryption process , an optical multiple-image encryption and hiding scheme was put forward based on Fourier transform holography under spherical wave illumination .Theoretical analysis and numerical simulation of image encryption and hiding encryption image and image decryption were made .The results show that correlation coefficient between encryption image and original image approaches 0, correlation coefficient between host image and hiding encryption image approaches 1 when superposition coefficient ρbetween host image and hiding encryption image is less than 0.3, correlation coefficient between decryption image and original image approaches 1.The encryption method can obtain good encryption effect .
Hierarchical model-based interferometric synthetic aperture radar image registration
Wang, Yang; Huang, Haifeng; Dong, Zhen; Wu, Manqing
2014-01-01
With the rapid development of spaceborne interferometric synthetic aperture radar technology, classical image registration methods are incompetent for high-efficiency and high-accuracy masses of real data processing. Based on this fact, we propose a new method. This method consists of two steps: coarse registration that is realized by cross-correlation algorithm and fine registration that is realized by hierarchical model-based algorithm. Hierarchical model-based algorithm is a high-efficiency optimization algorithm. The key features of this algorithm are a global model that constrains the overall structure of the motion estimated, a local model that is used in the estimation process, and a coarse-to-fine refinement strategy. Experimental results from different kinds of simulated and real data have confirmed that the proposed method is very fast and has high accuracy. Comparing with a conventional cross-correlation method, the proposed method provides markedly improved performance.
Directory of Open Access Journals (Sweden)
Jian-feng Zhao
2017-01-01
Full Text Available This paper presents a three-dimensional autonomous chaotic system with high fraction dimension. It is noted that the nonlinear characteristic of the improper fractional-order chaos is interesting. Based on the continuous chaos and the discrete wavelet function map, an image encryption algorithm is put forward. The key space is formed by the initial state variables, parameters, and orders of the system. Every pixel value is included in secret key, so as to improve antiattack capability of the algorithm. The obtained simulation results and extensive security analyses demonstrate the high level of security of the algorithm and show its robustness against various types of attacks.
Image feature extraction in encrypted domain with privacy-preserving SIFT.
Hsu, Chao-Yung; Lu, Chun-Shien; Pei, Soo-Chang
2012-11-01
Privacy has received considerable attention but is still largely ignored in the multimedia community. Consider a cloud computing scenario where the server is resource-abundant, and is capable of finishing the designated tasks. It is envisioned that secure media applications with privacy preservation will be treated seriously. In view of the fact that scale-invariant feature transform (SIFT) has been widely adopted in various fields, this paper is the first to target the importance of privacy-preserving SIFT (PPSIFT) and to address the problem of secure SIFT feature extraction and representation in the encrypted domain. As all of the operations in SIFT must be moved to the encrypted domain, we propose a privacy-preserving realization of the SIFT method based on homomorphic encryption. We show through the security analysis based on the discrete logarithm problem and RSA that PPSIFT is secure against ciphertext only attack and known plaintext attack. Experimental results obtained from different case studies demonstrate that the proposed homomorphic encryption-based privacy-preserving SIFT performs comparably to the original SIFT and that our method is useful in SIFT-based privacy-preserving applications.
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-29
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-01
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-01
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196
INTER-GROUP IMAGE REGISTRATION BY HIERARCHICAL GRAPH SHRINKAGE.
Ying, Shihui; Wu, Guorong; Liao, Shu; Shen, Dinggang
2013-12-31
In this paper, we propose a novel inter-group image registration method to register different groups of images (e.g., young and elderly brains) simultaneously. Specifically, we use a hierarchical two-level graph to model the distribution of entire images on the manifold, with intra-graph representing the image distribution in each group and the inter-graph describing the relationship between two groups. Then the procedure of inter-group registration is formulated as a dynamic evolution of graph shrinkage. The advantage of our method is that the topology of entire image distribution is explored to guide the image registration. In this way, each image coordinates with its neighboring images on the manifold to deform towards the population center, by following the deformation pathway simultaneously optimized within the graph. Our proposed method has been also compared with other state-of-the-art inter-group registration methods, where our method achieves better registration results in terms of registration accuracy and robustness.
Hierarchical discriminant manifold learning for dimensionality reduction and image classification
Chen, Weihai; Zhao, Changchen; Ding, Kai; Wu, Xingming; Chen, Peter C. Y.
2015-09-01
In the field of image classification, it has been a trend that in order to deliver a reliable classification performance, the feature extraction model becomes increasingly more complicated, leading to a high dimensionality of image representations. This, in turn, demands greater computation resources for image classification. Thus, it is desirable to apply dimensionality reduction (DR) methods for image classification. It is necessary to apply DR methods to relieve the computational burden as well as to improve the classification accuracy. However, traditional DR methods are not compatible with modern feature extraction methods. A framework that combines manifold learning based DR and feature extraction in a deeper way for image classification is proposed. A multiscale cell representation is extracted from the spatial pyramid to satisfy the locality constraints for a manifold learning method. A spectral weighted mean filtering is proposed to eliminate noise in the feature space. A hierarchical discriminant manifold learning is proposed which incorporates both category label and image scale information to guide the DR process. Finally, the image representation is generated by concatenating dimensionality reduced cell representations from the same image. Extensive experiments are conducted to test the proposed algorithm on both scene and object recognition datasets in comparison with several well-established and state-of-the-art methods with respect to classification precision and computational time. The results verify the effectiveness of incorporating manifold learning in the feature extraction procedure and imply that the multiscale cell representations may be distributed on a manifold.
Flexible optical encryption with multiple users and multiple security levels
Nishchal, Naveen K.; Naughton, Thomas J.
2011-02-01
We present a basic optical encryption architecture that admits several cryptography applications based on multiplexing. Users can decrypt different private images from the same encrypted image, a superuser can have a key that decrypts all encrypted images, and multiplexed images can be encrypted with different levels of security. This system is presented in the context of a general framework of optical encryption application development. We illustrate with a real-world three-dimensional scene, captured with digital holography, and encrypted using the fractional Fourier transform, where different users have access to different three-dimensional objects in the scene.
Chatterjee, Monish R.; Mohamed, Ali A.
2017-05-01
In recent research, anisoplanatic electromagnetic (EM) wave propagation along a slanted path in the presence of low atmosphere phase turbulence (modified von Karman spectrum or MVKS) has been investigated assuming a Hufnagel-Valley (HV) type structure parameter. Preliminary results indicate a strong dependence on the slant angle especially for long range transmission and relatively strong turbulence. The investigation was further divided into two regimes, viz. (a) one where the EM source consisted of a plane wave modulated with a digitized image, which is propagated along the turbulent path and recovered via demodulation at the receiver; and (b) transmit the plane wave without modulation along the turbulent path through an image transparency and a thin lens designed to gather the received image in the focal plane. In this paper, we reexamine the same problem (part (a) only) in the presence of a chaotic optical carrier where the chaos is generated in the feedback loop of an acousto-optic Bragg cell. The image information is encrypted within the chaos wave, and subsequently propagated along a similar slant path and identical turbulence conditions. The recovered image extracted via heterodyning from the received chaos is compared quantitatively (through image cross-correlations and mean-squared error measures) for the non-chaotic versus the chaotic approaches. Generally, "packaging" the information in chaos improves performance through turbulent propagation, and results are discussed from this perspective. Concurrently, we will also examine the effect of a non-encrypted plane EM wave propagation through a transparency-lens combination. These results are also presented with appropriate comparisons with the cases involving lensless transmission of imagery through corresponding turbulent and non-turbulent layers.
a New Color Image Encryption Based on High-Dimensional Chaotic Systems
Li, Pi; Wang, Xing-Yuan; Fu, Hong-Jing; Xu, Da-Hai; Wang, Xiu-Kun
2014-12-01
The high-dimensional chaotic systems (HDCS) have a lot of advantages as more multifarious mechanism, greater the key space, more ruleless for the time series of the system variable than with the low-dimensional chaotic systems (LDCS), etc. Thus, a novel encryption scheme using Lorenz system is suggested. Moreover, we use substitution-diffusion architecture to advance the security of the scheme. The theoretical and experimental results show that the suggested cryptosystem has higher security.
Hierarchical stochastic image grammars for classification and segmentation.
Wang, Wiley; Pollak, Ilya; Wong, Tak-Shing; Bouman, Charles A; Harper, Mary P; Siskind, Jeffrey M
2006-10-01
We develop a new class of hierarchical stochastic image models called spatial random trees (SRTs) which admit polynomial-complexity exact inference algorithms. Our framework of multitree dictionaries is the starting point for this construction. SRTs are stochastic hidden tree models whose leaves are associated with image data. The states at the tree nodes are random variables, and, in addition, the structure of the tree is random and is generated by a probabilistic grammar. We describe an efficient recursive algorithm for obtaining the maximum a posteriori estimate of both the tree structure and the tree states given an image. We also develop an efficient procedure for performing one iteration of the expectation-maximization algorithm and use it to estimate the model parameters from a set of training images. We address other inference problems arising in applications such as maximization of posterior marginals and hypothesis testing. Our models and algorithms are illustrated through several image classification and segmentation experiments, ranging from the segmentation of synthetic images to the classification of natural photographs and the segmentation of scanned documents. In each case, we show that our method substantially improves accuracy over a variety of existing methods.
一种多混沌的彩色图像认证加密算法%A Color Image Authentication Encryption Algorithm Based Multi-chaos
Institute of Scientific and Technical Information of China (English)
蒲昌玖
2013-01-01
In order to protect color image effectively,a color image encryption scheme based on multiple chaotic maps and authentication is presented.The algorithm generated 128-bit Hash keys by the mathematical operation in the RGB components of the color image,and the Hash key is used as part of the image encryption keys.Then,pixels shuffling and pixels substitution are simultaneous implemented to encrypt the color image using Logistic chaotic system,unified chaotic system and Hash keys.Finally,theoretical analyses and simulated experiment show that the color image encryption algorithm shows advantages of larger key space,higher security,a random distribution characteristics of the pixel value of the encrypted image and the zero correlation of adjacent pixels.%为了实现对彩色图像的有效保护,提出一种基于多混沌系统和图像认证功能的彩色图像加密算法.该算法通过对彩色图像RGB分量的运算生成128位Hash值,并把该Hash值作为部分图像加密的密钥.然后通过Logistic混沌系统、统一混沌系统和Hash值对彩色图像进行像素置乱和替代操作以实现图像加密.最后,理论分析和仿真实验结果表明,该加密算法具有密钥空间大,保密性好,加密图像像素值具有类随机均匀分布特性和相邻像素值的零相关特性.
基于FTP的图像混沌加密传输技术的实现%Implementation of transmitting chaotic-encrypted image based on FTP
Institute of Scientific and Technical Information of China (English)
刘新杰; 李黎明
2014-01-01
In order to accelerate the rate of chaotic-encrypted image transmission system and extend its field of application , this paper proposes a new method of transmitting chaotic-encrypted image: applying VSFTPD software to Mini 2440 ARM platform to setup a FTP server , and using FTP to convey the encrypted image files . The experiment result shows that this system can trans-fer chaotic-encrypted images rapidly and reliably .%为了提高混沌图像加密传输系统的传输速度并扩大应用范围，提出了一种实现混沌图像加密传输的新方法：利用 VSFTPD 软件在 Mini 2440 ARM 平台上构建 FTP 服务器，通过 FTP 实现混沌加密图像数据的传输。实验结果表明，该系统能够实现混沌加密图像的可靠快速传输。
Multiscale stochastic hierarchical image segmentation by spectral clustering
Institute of Scientific and Technical Information of China (English)
LI XiaoBin; TIAN Zheng
2007-01-01
This paper proposes a sampling based hierarchical approach for solving the computational demands of the spectral clustering methods when applied to the problem of image segmentation. The authors first define the distance between a pixel and a cluster, and then derive a new theorem to estimate the number of samples needed for clustering. Finally, by introducing a scale parameter into the similarity function, a novel spectral clustering based image segmentation method has been developed. An important characteristic of the approach is that in the course of image segmentation one needs not only to tune the scale parameter to merge the small size clusters or split the large size clusters but also take samples from the data set at the different scales. The multiscale and stochastic nature makes it feasible to apply the method to very large grouping problem. In addition, it also makes the segmentation compute in time that is linear in the size of the image. The experimental results on various synthetic and real world images show the effectiveness of the approach.
Two-level hierarchical feature learning for image classification
Institute of Scientific and Technical Information of China (English)
Guang-hui SONG; Xiao-gang JIN; Gen-lang CHEN; Yan NIE
2016-01-01
In some image classifi cation tasks, similarities among different categories are different and the samples are usually misclassifi ed as highly similar categories. To distinguish highly similar categories, more specifi c features are required so that the classifi er can improve the classifi cation performance. In this paper, we propose a novel two-level hierarchical feature learning framework based on the deep convolutional neural network (CNN), which is simple and effective. First, the deep feature extractors of different levels are trained using the transfer learning method that fi ne-tunes the pre-trained deep CNN model toward the new target dataset. Second, the general feature extracted from all the categories and the specifi c feature extracted from highly similar categories are fused into a feature vector. Then the fi nal feature representation is fed into a linear classifi er. Finally, experiments using the Caltech-256, Oxford Flower-102, and Tasmania Coral Point Count (CPC) datasets demonstrate that the expression ability of the deep features resulting from two-level hierarchical feature learning is powerful. Our proposed method effectively increases the classifi cation accuracy in comparison with fl at multiple classifi cation methods.
Content Based Image Retrieval using Hierarchical and K-Means Clustering Techniques
Directory of Open Access Journals (Sweden)
V.S.V.S. Murthy
2010-03-01
Full Text Available In this paper we present an image retrieval system that takes an image as the input query and retrieves images based on image content. Content Based Image Retrieval is an approach for retrieving semantically-relevant images from an image database based on automatically-derived image features. The unique aspect of the system is the utilization of hierarchical and k-means clustering techniques. The proposed procedure consists of two stages. First, here we are going to filter most of the images in the hierarchical clustering and then apply the clustered images to KMeans, so that we can get better favored image results.
Holographic memories with encryption-selectable function
Su, Wei-Chia; Lee, Xuan-Hao
2006-03-01
Volume holographic storage has received increasing attention owing to its potential high storage capacity and access rate. In the meanwhile, encrypted holographic memory using random phase encoding technique is attractive for an optical community due to growing demand for protection of information. In this paper, encryption-selectable holographic storage algorithms in LiNbO 3 using angular multiplexing are proposed and demonstrated. Encryption-selectable holographic memory is an advance concept of security storage for content protection. It offers more flexibility to encrypt the data or not optionally during the recording processes. In our system design, the function of encryption and non-encryption storage is switched by a random phase pattern and a uniform phase pattern. Based on a 90-degree geometry, the input patterns including the encryption and non-encryption storage are stored via angular multiplexing with reference plane waves at different incident angles. Image is encrypted optionally by sliding the ground glass into one of the recording waves or removing it away in each exposure. The ground glass is a key for encryption. Besides, it is also an important key available for authorized user to decrypt the encrypted information.
Security of image encryption scheme based on multi-parameter fractional Fourier transform
Zhao, Tieyu; Ran, Qiwen; Yuan, Lin; Chi, Yingying; Ma, Jing
2016-10-01
Recently, multi-parameter fractional Fourier transform (MPFRFT) has been widely applied in the optics cryptosystem, which has attracted more and more researchers' attention. However, in further study we find a serious security problem on the MPFRFT which is the multi-choice of decryption key corresponding to an encryption key. The existence of multi-decryption-key hinders the application of this algorithm. We present a new generalized fractional Fourier transform, which can overcome the problem and enlarge the key space. The simulation results show that the proposed algorithm has higher security and key sensitivity.
Hwang, Hone-Ene; Chang, Hsuan T; Lie, Wen-Nung
2009-12-15
What we believe to be a new technique, based on a modified Gerchberg-Saxton algorithm (MGSA) and a phase modulation scheme in the Fresnel-transform domain, is proposed to reduce cross talks existing in multiple-image encryption and multiplexing. First, each plain image is encoded and multiplexed into a phase function by using the MGSA and a different wavelength/position parameter. Then all the created phase functions are phase modulated to result in different shift amounts of the reconstruction images before being combined together into a single phase-only function. Simulation results show that the cross talks between multiplexed images have been significantly reduced, compared with prior methods [Opt. Lett.30, 1306 (2005); J. Opt. A8, 391 (2006)], thus presenting high promise in increasing the multiplexing capacity and encrypting grayscale and color images.
线性移位寄存器在图像加密中的应用%The Application in Image Encryption by Line Feedback Shift Register
Institute of Scientific and Technical Information of China (English)
荆锐; 朱平; 杨恒欢; 冯涛
2011-01-01
图像加密技术作为数字信息保护的一种有效手段，随着信息技术的发展，人们对其安全性的要求越来越高。讨论了关于线性移位寄存器（LFSR）在图像加密中的应用。本算法先采用LFSR算法产生伪混沌比特密钥流，将该密钥流作为随机值映射算法和加密算法的初始参数。随机值映射算法取其中较高位的密钥流，生成置乱序列用于图像像素的位置置乱。另一组密钥流作为加密序列可对图像的像素值进行加密。实验结果表明该方法运算速度快，通过随机值映射算法产生的伪随机置乱和加密序列具有很强的可操作性、保密性，而且截取伪混沌比特密钥流的位数也可作为密钥存在。%For digital information protection, image encryption is an effective technology. As the development of information technology, people also need more and more security on image encryption. This thesis discussed the application in image encryption by line feedback shift register. At first the system generated the initial pseudo-chaos bit key stream by LSFR. The key stream becomed the initial parameter of the random value mapped scrambling algorithm and chaos encryption algorithm. Mapping the image with the mapped stream which was generated by the random value mapped scrambling algorithm with the higher digital key stream, then encrypted the image with the encrypted stream which was generated by another key stream. The result shows this system runs lastly. The pseudo-random mapped stream and pseudo-encrypted stream that were generated by the random value scrambling algorithm both had a strong operational, confidentiality. Also the chosen pseudo-chaos bit key stream can become the keywords.
Dual Watermarking Scheme with Encryption
Dhanalakshmi, R
2010-01-01
Digital Watermarking is used for copyright protection and authentication. In the proposed system, a Dual Watermarking Scheme based on DWT SVD with chaos encryption algorithm, will be developed to improve the robustness and protection along with security. DWT and SVD have been used as a mathematical tool to embed watermark in the image. Two watermarks are embedded in the host image. The secondary is embedded into primary watermark and the resultant watermarked image is encrypted using chaos based logistic map. This provides an efficient and secure way for image encryption and transmission. The watermarked image is decrypted and a reliable watermark extraction scheme is developed for the extraction of the primary as well as secondary watermark from the distorted image.
基于五维混沌系统的图像加密研究%Five-dimensional chaotic system based image encryption algorithm
Institute of Scientific and Technical Information of China (English)
高亮; 朱博; 孙鸣; 朱建良
2011-01-01
随着计算机技术、信息技术和通讯技术等高科技技术在近年来的迅猛发展,信息加密越来越受到人们的重视,提出了基于五维混沌系统用来实现图像加密的方法,并利用迭代次数和方式作为密码,实现了图像加密和解密,为信息加密提供了一种新方法.%With computer technology, information technology and communications technology, high technology, rapid development in recent years, more and more people pay close attention to information encryption. This paper, based on five-dimensional chaotic system realizes image encryption method, and means of using the number of iterations as the password, to realize the image encryption and decryption,the information provides a new method of encryption.
DEFF Research Database (Denmark)
2013-01-01
Disclosed is a method of transmitting a data set using encryption, wherein the method comprises the steps of: selecting a first encryption technique, wherein said first encryption technique comprises a first encryption algorithm for encrypting plain data into cipher data, and a first decryption...... algorithm for on provision of a specific key, decrypting cipher data and reproduce plain data; encrypting the first data package comprising plain data, using a first encryption program implementing the first encryption algorithm of said first encryption technique, creating a first encrypted data package...... comprising cipher data; obtaining a first decryption program; and transmitting said first decryption program and said first encrypted data package to a receiver, wherein the first decryption, upon provision of the specific key and the first encrypted data package, will decrypt the cipher data in the first...
Optical encryption with cascaded fractional wavelet transforms
Institute of Scientific and Technical Information of China (English)
BAO Liang-hua; CHEN Lin-fei; ZHAO Dao-mu
2006-01-01
On the basis of fractional wavelet transform, we propose a new method called cascaded fractional wavelet transform to encrypt images. It has the virtues of fractional Fourier transform and wavelet transform. Fractional orders, standard focal lengths and scaling factors are its keys. Multistage fractional Fourier transforms can add the keys easily and strengthen information security. This method can also realize partial encryption just as wavelet transform and fractional wavelet transform. Optical realization of encryption and decryption is proposed. Computer simulations confirmed its possibility.
基于函数展开与超混沌系统的图像加密%Image Encryption Based on Function Expansion and Hyperchaotic System
Institute of Scientific and Technical Information of China (English)
迟春见; 于万波; 魏小鹏
2011-01-01
In order to protect the security of a digital image effectively, this paper proposes an image encryption algorithm based on wavelet expansion function and hyperchaotic system. The pixel locations of the image are scrambled with a wavelet function, and the relationship between the original image and the encrypted image is disrupted with hyper-chaos system. The many parameters are inserted in four-step Runge-Kutta method in which chaos sequence of hyper--chaos system is gotten, to expand the space of parameter. Simulation exporimental result show that the random behavior of gray value distribution of the encrypted image is better and the method can defends attacks.%为有效保护数字图像的安全,提出一种基于小波展开函数与超混沌系统的数字图像加密算法.利用小波展开函数对网像进行置乱,通过超混沌系统扰乱原图像与加密图像之间的关系.在求解超混沌系统混沌序列的四阶Runge-Kutta公式中,插入多个参数以扩大参数空间.模拟实验结果表明,加密后图像灰度值分布伪随机性较好.
Research on the New Development of Image Encryption Algorithms%图像加密算法研究新进展
Institute of Scientific and Technical Information of China (English)
张晓强; 王蒙蒙; 朱贵良
2012-01-01
With the rapid development of information netization, image interaction in the Internet is widely applied in many fields. People pay much attention to the security of image interaction. We illustrate the encryption principles, characteristics and new development of the important image encryption algorithms, such as those based on matrix transformation, chaos, image secret sharing, frequency domains, SCAN languages, and DNA computing. Finally, the development trend of image encryption algorithm is discussed in this paper. This study is significant in algorithm improvement, new algorithm design and algorithm selection in the practice of image encryption.%随着信息网络化飞速发展,图像网络交互在诸多领域得到应用,图像交互的安全问题倍受人们关注.本文讨论了基于现代密码体制的图像加密、基于矩阵变换的图像加密、基于混沌的图像加密、基于秘密分存的图像加密、基于频域的图像加密、基于SCAN语言的图像加密和基于DNA计算的图像加密等主流图像加密算法的加密原理、优缺点和最新进展.最后,展望了图像加密算法的发展趋势.该成果对图像加密算法的改进、新算法的研究以及在实际工程中对算法的选取具有重要意义.
Security Assessment of Two-Wave Encryption
Kitano, Motoki; Okamoto, Atsushi; Sano, Takayuki
2009-03-01
To determine the degree of security in two-wave encryption under practical conditions, we present a novel numerical technique for simulating the recording and readout of two-wave encryption. The calculation results of the retrieval characteristics show that the diffraction efficiency in an incorrect decryption is 10 times as low as that in correct decryption key and that the output data with an incorrect key is a white noise image. We estimate the necessary key correlation to decrypt an encrypted data is 0.2 when the length of an encryption key is 2313. This means that the decoding probability of the encryption key in two-wave encryption is less than 10-6 even if such a short key is used.
基于空域的图像加密算法与性能研究%Algorithm and performance of image encryption based on spatial domain
Institute of Scientific and Technical Information of China (English)
张晨
2015-01-01
In order to solve the problem of infringement of image information such as piracy and theft in information age, a method of image encryption based on spatial domain with excellent performance must be chosen to deal with it. This paper introduces the principle of algorithm of image encryption of Arnold transform scrambling, Logistic chaotic scrambling, Logistic chaotic sequence, Fibonacci sequence, and both Logistic chaotic scrambling and Logistic chaotic sequence and their performance, such as visual security of encrypted image, distortion of decrypted image, key space, key sensitivity, histogram, correlation between neighboring pixels, and entropy. After programming test, the analysis result of the experiments shows that the encryption method of both Logistic chaotic scrambling and Logistic chaotic sequence is the best one in comprehensive performance.%为解决信息时代中，图像信息的盗版、窃密等侵权问题，需要选择一种性能较好的基于空域的图像加密技术。文中介绍了Arnold变换置乱加密、Logistic混沌置乱加密、Logistic混沌序列加密、Fibonacci序列加密、Logistic混沌置乱与Logistic混沌序列混合加密的算法原理，以及如加密图像的视觉保密性、解密图像的失真度、密钥空间、密钥敏感性、直方图、邻域像素相关性、信息熵等性能指标。编程测试实验分析结果表明，Logistic混沌置乱与Logistic混沌序列混合加密是综合性能较为理想的加密方法。
Sui, Liansheng; Liu, Benqing; Wang, Qiang; Li, Ye; Liang, Junli
2015-12-01
A color image encryption scheme is proposed based on Yang-Gu mixture amplitude-phase retrieval algorithm and two-coupled logistic map in gyrator transform domain. First, the color plaintext image is decomposed into red, green and blue components, which are scrambled individually by three random sequences generated by using the two-dimensional Sine logistic modulation map. Second, each scrambled component is encrypted into a real-valued function with stationary white noise distribution in the iterative amplitude-phase retrieval process in the gyrator transform domain, and then three obtained functions are considered as red, green and blue channels to form the color ciphertext image. Obviously, the ciphertext image is real-valued function and more convenient for storing and transmitting. In the encryption and decryption processes, the chaotic random phase mask generated based on logistic map is employed as the phase key, which means that only the initial values are used as private key and the cryptosystem has high convenience on key management. Meanwhile, the security of the cryptosystem is enhanced greatly because of high sensitivity of the private keys. Simulation results are presented to prove the security and robustness of the proposed scheme.
Image Encryption Communication System Based on Logistic Map%基于Logistic混沌映射的图像加密通信系统研究
Institute of Scientific and Technical Information of China (English)
刘昕浩; 郭腾; 谢德辉; 徐婷; 李春来
2015-01-01
基于二维图像离散余弦变换(DCT)和Logistic混沌映射设计一种图像加密通信系统.首先基于DCT将图像变换成频域系数,利用Logistic映射产生的随机序列对变换得到的频域系数进行排序,对改变后的DCT系数分布结构做离散余弦反变换,得到置乱图像;.然后利用Logistic映射结构简单、复杂度高等特性,在像素替换过程中利用辅助密钥修正系统初始值,并按图像像素空间位置奇偶序号依次构造加密密钥,同时将像素点灰度值加密处理,最终实现图像信息的加密通信.%An image encryption communication system based on Discrete Cosine Transform (DCT) and Logistic map is proposed. Firstly, using the DCT and random sequences from Logistic map, a shuffled image is obtained. Then, the security key is constructed by modifying the initial value of Logistic map. Finally, we realized the image encryption communication system by dealing with the gray values of the encrypted image.
Hierarchical segmentation-assisted multimodal registration for MR brain images.
Lu, Huanxiang; Beisteiner, Roland; Nolte, Lutz-Peter; Reyes, Mauricio
2013-04-01
Information theory-based metric such as mutual information (MI) is widely used as similarity measurement for multimodal registration. Nevertheless, this metric may lead to matching ambiguity for non-rigid registration. Moreover, maximization of MI alone does not necessarily produce an optimal solution. In this paper, we propose a segmentation-assisted similarity metric based on point-wise mutual information (PMI). This similarity metric, termed SPMI, enhances the registration accuracy by considering tissue classification probabilities as prior information, which is generated from an expectation maximization (EM) algorithm. Diffeomorphic demons is then adopted as the registration model and is optimized in a hierarchical framework (H-SPMI) based on different levels of anatomical structure as prior knowledge. The proposed method is evaluated using Brainweb synthetic data and clinical fMRI images. Both qualitative and quantitative assessment were performed as well as a sensitivity analysis to the segmentation error. Compared to the pure intensity-based approaches which only maximize mutual information, we show that the proposed algorithm provides significantly better accuracy on both synthetic and clinical data.
Energy Technology Data Exchange (ETDEWEB)
Yang, Xiuping, E-mail: yangxiuping-1990@163.com; Min, Lequan, E-mail: minlequan@sina.com; Wang, Xue, E-mail: wangxue-20130818@163.com [Schools of Mathematics and Physics, University of Science and Technology Beijing, Beijing 100083 (China)
2015-05-15
This paper sets up a chaos criterion theorem on a kind of cubic polynomial discrete maps. Using this theorem, Zhou-Song's chaos criterion theorem on quadratic polynomial discrete maps and generalized synchronization (GS) theorem construct an eight-dimensional chaotic GS system. Numerical simulations have been carried out to verify the effectiveness of theoretical results. The chaotic GS system is used to design a chaos-based pseudorandom number generator (CPRNG). Using FIPS 140-2 test suit/Generalized FIPS 140-2, test suit tests the randomness of two 1000 key streams consisting of 20 000 bits generated by the CPRNG, respectively. The results show that there are 99.9%/98.5% key streams to have passed the FIPS 140-2 test suit/Generalized FIPS 140-2 test. Numerical simulations show that the different keystreams have an average 50.001% same codes. The key space of the CPRNG is larger than 2{sup 1345}. As an application of the CPRNG, this study gives an image encryption example. Experimental results show that the linear coefficients between the plaintext and the ciphertext and the decrypted ciphertexts via the 100 key streams with perturbed keys are less than 0.00428. The result suggests that the decrypted texts via the keystreams generated via perturbed keys of the CPRNG are almost completely independent on the original image text, and brute attacks are needed to break the cryptographic system.
Veugen, P.J.M.
2010-01-01
When processing signals in the encrypted domain, homomorphic encryption can be used to enable linear operations on encrypted data. Integer division of encrypted data however requires an additional protocol with the server and will be relatively expensive. We present new solutions for dividing encryp
Image Encryption Algorithm Based on Chaotic Mappings%基于混沌映射的图像加密算法
Institute of Scientific and Technical Information of China (English)
卢辉斌; 肖霞
2011-01-01
This paper designs a new kind of image encryption algorithm which uses two Logistic systems. The auxiliary key m is obtained by a certain line data of the changed image matrix. The initial values of two Logistic mappings are modified by the key in. The Logistic mappings are used to generate the encryption sequences which are used to encrypt with every pixel of the image. Theoretical analysis and simulation results show the new algorithm not only has better sensitivity and very uniform pixel-value distribution, but also is simple and easy to achieve.%提出一种基于混沌映射的图像加密算法,该算法对图像进行拉伸融合折叠变换,通过映射其矩阵的某行数据,得到修改Logistic 映射初值的关键密钥m,并由2个Logistic混沌映射相结合产生加密序列,将图像与该序列进行相应代数运算,从而获得加密图像.理论分析和实验结果表明,该算法对密钥具有较强的敏感性,且加密图的像素值分布较均匀.
Directory of Open Access Journals (Sweden)
Hongjuan Liu
2014-01-01
Full Text Available A new general and systematic coupling scheme is developed to achieve the modified projective synchronization (MPS of different fractional-order systems under parameter mismatch via the Open-Plus-Closed-Loop (OPCL control. Based on the stability theorem of linear fractional-order systems, some sufficient conditions for MPS are proposed. Two groups of numerical simulations on the incommensurate fraction-order system and commensurate fraction-order system are presented to justify the theoretical analysis. Due to the unpredictability of the scale factors and the use of fractional-order systems, the chaotic data from the MPS is selected to encrypt a plain image to obtain higher security. Simulation results show that our method is efficient with a large key space, high sensitivity to encryption keys, resistance to attack of differential attacks, and statistical analysis.
Optical image encryption based on gyrator transformation and chaotic function%基于回转器变换和混沌的光图像加密
Institute of Scientific and Technical Information of China (English)
孔德彭; 杜学文; 孔德辉
2012-01-01
提出一种基于混沌理论和回转器的光图像加密技术,它由混沌函数产生的随机相位掩膜对光学系统进行加密和解密.利用三种混沌函数对比研究,它们分别是改进的Logistic映射、Hybrid映射和Baker映射,给出了基于混沌理论与光学系统研究思路和方法,通过盲加密、旋转角度的盲解密来证实其鲁棒性与可靠性,借助计算机进行了模拟,证实了光学加密和解密实施可行性,最后给出了均方差的有效性.%The paper proposed a novel method of optical image encryption based on gyrator transformation and chaos theory. The random phase masks generated by chaotic function is used to encrypt and decrypt the optical system. In this method, the three kinds of chaotic functions are compared and studied. They can improve the Logistic mapping, Hybrid mapping and Baker mapping respectively. It gives research idea and method based on chaos theory and optical system. Its robustness and reliability is proved by blind encryption and the blind decryption of the rotation angle. Through the simulation on computer, the feasibility of the optical encryption and decryption is proved and the validity of the mean square error is given finally.
QR code optical encryption using spatially incoherent illumination
Cheremkhin, P. A.; Krasnov, V. V.; Rodin, V. G.; Starikov, R. S.
2017-02-01
Optical encryption is an actively developing field of science. The majority of encryption techniques use coherent illumination and suffer from speckle noise, which severely limits their applicability. The spatially incoherent encryption technique does not have this drawback, but its effectiveness is dependent on the Fourier spectrum properties of the image to be encrypted. The application of a quick response (QR) code in the capacity of a data container solves this problem, and the embedded error correction code also enables errorless decryption. The optical encryption of digital information in the form of QR codes using spatially incoherent illumination was implemented experimentally. The encryption is based on the optical convolution of the image to be encrypted with the kinoform point spread function, which serves as an encryption key. Two liquid crystal spatial light modulators were used in the experimental setup for the QR code and the kinoform imaging, respectively. The quality of the encryption and decryption was analyzed in relation to the QR code size. Decryption was conducted digitally. The successful decryption of encrypted QR codes of up to 129 × 129 pixels was demonstrated. A comparison with the coherent QR code encryption technique showed that the proposed technique has a signal-to-noise ratio that is at least two times higher.
Optical encryption using a joint transform correlator architecture
Nomura, Takanori; Javidi, Bahram
2000-08-01
An optical double random-phase encryption method using a joint transform correlator architecture is proposed. In this method, the joint power spectrum of the image to be encrypted and the key codes is recorded as the encrypted data. Unlike the case with classical double random-phase encryption, the same key code is used to both encrypt and decrypt the data, and the conjugate key is not required. Computer simulations and optical experimental results using a photorefractive-crystal-based processor are presented.
Directory of Open Access Journals (Sweden)
Satadal Saha
2011-07-01
Full Text Available An innovative hierarchical image segmentation scheme is reported in this research communication. Unlike static/ spatially divided sub-images, the current innovation concentrates on object level hierarchy for segmentation of gray scale or color images into constituent component/ sub-parts. As for example, a gray scale document image may be segmented (binarized in case of two-level segmentation into connected foreground components (text/ graphics and background component by hierarchically applying a gray level threshold selection algorithm in the object-space. In any hierarchy, constituent objects are identified as connected foreground pixels, as classified by the gray scale threshold selection algorithm. To preserve the global information, thresholds for each object in any hierarchy are estimated as a weighted aggregate of the current and previous thresholds relevant to the object. The developed technique may be customized as a general purpose hierarchical information clustering algorithm in the domain of pattern analysis, data mining, bioinformatics etc.
Xu, Ming
2017-06-01
Recently, chaotic image cipher using DNA sequence operation has been studied extensively. However, corresponding cryptanalysis is lacking, which impedes its further development. This paper cryptanalyzes a newly proposed chaotic image cipher based on DNA sequence operation. In this paper, we firstly analyze the security defects of the proposal. Then by applying chosen-plaintext attack, we show that all the secret parameters can be revealed. The effectiveness of the proposed chosen-plaintext attack is supported both by rigorous theoretical analysis and experimental results.
Liansheng, Sui; Bei, Zhou; Xiaojuan, Ning; Ailing, Tian
2016-01-11
A novel multiple-image encryption scheme using the nonlinear iterative phase retrieval algorithm in the gyrator transform domain under the illumination of an optical vortex beam is proposed. In order to increase the randomness, the chaotic structured phase mask based on the logistic map, Fresnel zone plate and radial Hilbert mask is proposed. With the help of two chaotic phase masks, each plain image is encoded into two phase-only masks that are considered as the private keys by using the iterative phase retrieval process in the gyrator domain. Then, the second keys of all plain images are modulated into the ciphertext, which has the stationary white noise distribution. Due to the use of the chaotic structured phase masks, the problem of axis alignment in the optical setup can easily be solved. Two private keys are directly relative to the plain images, which makes that the scheme has high resistance against various potential attacks. Moreover, the use of the vortex beam that can integrates more system parameters as the additional keys into one phase mask can improve the security level of the cryptosystem, which makes the key space enlarged widely. Simulation results are given to verify the feasibility and robustness of the proposed encryption scheme.
Repair approach for DMC images based on hierarchical location using edge curve
Institute of Scientific and Technical Information of China (English)
PAN Jun; WANG Mi; LI DeRen; FENG TianTian
2009-01-01
The color composite digital mapping camera (DMC) images are produced by the post-processing software of Z/I imaging. But the failure of radiometric correction in post-processing leads to residual radiometric differences between CCD images, which then affect the quality of the images in further applications. This paper, via analyzing the characters and causes of such a phenomenon, proposes a repair approach based on hierarchical location using edge curve. The approach employs a hierarchical strategy to locate the transition area and seam-line automatically and then repair the image through the global reconstruction between CCD images and the local reconstruction in the transition area. Experiments indicate that the approach proposed by this paper is feasible and can improve the quality of images effectively.
Timchenko, Leonid; Yarovyi, Andrii; Kokriatskaya, Nataliya; Nakonechna, Svitlana; Abramenko, Ludmila; Ławicki, Tomasz; Popiel, Piotr; Yesmakhanova, Laura
2016-09-01
The paper presents a method of parallel-hierarchical transformations for rapid recognition of dynamic images using GPU technology. Direct parallel-hierarchical transformations based on cluster CPU-and GPU-oriented hardware platform. Mathematic models of training of the parallel hierarchical (PH) network for the transformation are developed, as well as a training method of the PH network for recognition of dynamic images. This research is most topical for problems on organizing high-performance computations of super large arrays of information designed to implement multi-stage sensing and processing as well as compaction and recognition of data in the informational structures and computer devices. This method has such advantages as high performance through the use of recent advances in parallelization, possibility to work with images of ultra dimension, ease of scaling in case of changing the number of nodes in the cluster, auto scan of local network to detect compute nodes.
Tsou, Chi-Hsuan; Lor, Kuo-Lung; Chang, Yeun-Chung; Chen, Chung-Ming
2015-05-14
This paper proposes a semantic segmentation algorithm that provides the spatial distribution patterns of pulmonary ground-glass nodules with solid portions in computed tomography (CT) images. The proposed segmentation algorithm, anatomy packing with hierarchical segments (APHS), performs pulmonary nodule segmentation and quantification in CT images. In particular, the APHS algorithm consists of two essential processes: hierarchical segmentation tree construction and anatomy packing. It constructs the hierarchical segmentation tree based on region attributes and local contour cues along the region boundaries. Each node of the tree corresponds to the soft boundary associated with a family of nested segmentations through different scales applied by a hierarchical segmentation operator that is used to decompose the image in a structurally coherent manner. The anatomy packing process detects and localizes individual object instances by optimizing a hierarchical conditional random field model. Ninety-two histopathologically confirmed pulmonary nodules were used to evaluate the performance of the proposed APHS algorithm. Further, a comparative study was conducted with two conventional multi-label image segmentation algorithms based on four assessment metrics: the modified Williams index, percentage statistic, overlapping ratio, and difference ratio. Under the same framework, the proposed APHS algorithm was applied to two clinical applications: multi-label segmentation of nodules with a solid portion and surrounding tissues and pulmonary nodule segmentation. The results obtained indicate that the APHS-generated boundaries are comparable to manual delineations with a modified Williams index of 1.013. Further, the resulting segmentation of the APHS algorithm is also better than that achieved by two conventional multi-label image segmentation algorithms. The proposed two-level hierarchical segmentation algorithm effectively labelled the pulmonary nodule and its surrounding
Signal and reference wave dually encrypted digital holographic system
Institute of Scientific and Technical Information of China (English)
ZHU YiChao; ZHANG JiaSen; GONG QiHuang
2008-01-01
We propose a secure digital holographic system with signal and reference waves dually encrypted. Two random phase masks are used to encrypt the images in the input and the Fourier planes. The reference beam is phase encoded by another random phase mask. The encrypted image and the key are recorded by a CCD camera. The data can be processed or transferred directly by computer. We theoretically and experimentally demonstrate encryption and decryption of multiple images and the results show a high quality and good fault tolerance.
Fully phase encrypted memory using cascaded extended fractional Fourier transform
Nishchal, Naveen K.; Joseph, Joby; Singh, Kehar
2003-11-01
In this paper, we implement a fully phase encrypted memory system using cascaded extended fractional Fourier transform (FRT). We encrypt and decrypt a two-dimensional image obtained from an amplitude image. The fully phase image to be encrypted is fractional Fourier transformed three times and random phase masks are placed in the two intermediate planes. Performing the FRT three times increases the key size, at an added complexity of one more lens. The encrypted image is holographically recorded in a photorefractive crystal and is then decrypted by generating through phase conjugation, conjugate of encrypted image. The decrypted phase image is converted into an amplitude image by using phase contrast technique. A lithium niobate crystal has been used as a phase contrast filter to reconstruct the phase image, alleviating the need of alignment in the Fourier plane, thereby making the system rugged.
Institute of Scientific and Technical Information of China (English)
龙敏; 谭丽
2011-01-01
Using chaos-based weight variation of Huffman tree,an image/video encryption algorithm is proposed in this paper. In the process of the entropy coding,DC coefficients are encrypted by the weight variation of Huffman tree with the double Logistic chaos and AC coefficients are encrypted by the indexes of codeword. The security,complexity and compression ration of the algorithm are analyzed. Simulation results show that this algorithm has no impact on the compression efficiency and has low complexity,high security and good real-time property. Therefore,it is suitable for real-time image on the network.%提出一种采用混沌权值变异的Huff man树的图像加密算法.此算法在熵编码过程中,以基本的Huffman树为标准,利用双耦合混沌序列1对DC系数进行树的结构未变异、路径值变异的加密；再利用双耦合混沌序列2对AC系数进行码字序号的加密.论文对算法进行了仿真,并对安全性、计算复杂度、压缩比性能进行了分析.实验结果表明,该算法基本上不影响压缩效率,且计算复杂度低、安全性高和实时性好,可用于网络上的图像服务.
Sun, Kaioqiong; Udupa, Jayaram K.; Odhner, Dewey; Tong, Yubing; Torigian, Drew A.
2014-03-01
This paper proposes a thoracic anatomy segmentation method based on hierarchical recognition and delineation guided by a built fuzzy model. Labeled binary samples for each organ are registered and aligned into a 3D fuzzy set representing the fuzzy shape model for the organ. The gray intensity distributions of the corresponding regions of the organ in the original image are recorded in the model. The hierarchical relation and mean location relation between different organs are also captured in the model. Following the hierarchical structure and location relation, the fuzzy shape model of different organs is registered to the given target image to achieve object recognition. A fuzzy connected delineation method is then used to obtain the final segmentation result of organs with seed points provided by recognition. The hierarchical structure and location relation integrated in the model provide the initial parameters for registration and make the recognition efficient and robust. The 3D fuzzy model combined with hierarchical affine registration ensures that accurate recognition can be obtained for both non-sparse and sparse organs. The results on real images are presented and shown to be better than a recently reported fuzzy model-based anatomy recognition strategy.
Hierarchical Image Segmentation of Remotely Sensed Data using Massively Parallel GNU-LINUX Software
Tilton, James C.
2003-01-01
A hierarchical set of image segmentations is a set of several image segmentations of the same image at different levels of detail in which the segmentations at coarser levels of detail can be produced from simple merges of regions at finer levels of detail. In [1], Tilton, et a1 describes an approach for producing hierarchical segmentations (called HSEG) and gave a progress report on exploiting these hierarchical segmentations for image information mining. The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HSWO) approach to region growing, which was described as early as 1989 by Beaulieu and Goldberg. The HSWO approach seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing (e.g. Horowitz and T. Pavlidis, [3]). In addition, HSEG optionally interjects between HSWO region growing iterations, merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the utility of the segmentation results, especially for larger images, it also significantly increases HSEG s computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) was devised, which includes special code to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. The recursive nature of RHSEG makes for a straightforward parallel implementation. This paper describes the HSEG algorithm, its recursive formulation (referred to as RHSEG), and the implementation of RHSEG using massively parallel GNU-LINUX software. Results with Landsat TM data are included comparing RHSEG with classic
Joint Hierarchical Category Structure Learning and Large-Scale Image Classification
Qu, Yanyun; Lin, Li; Shen, Fumin; Lu, Chang; Wu, Yang; Xie, Yuan; Tao, Dacheng
2017-09-01
We investigate the scalable image classification problem with a large number of categories. Hierarchical visual data structures are helpful for improving the efficiency and performance of large-scale multi-class classification. We propose a novel image classification method based on learning hierarchical inter-class structures. Specifically, we first design a fast algorithm to compute the similarity metric between categories, based on which a visual tree is constructed by hierarchical spectral clustering. Using the learned visual tree, a test sample label is efficiently predicted by searching for the best path over the entire tree. The proposed method is extensively evaluated on the ILSVRC2010 and Caltech 256 benchmark datasets. Experimental results show that our method obtains significantly better category hierarchies than other state-of-the-art visual tree-based methods and, therefore, much more accurate classification.
Hierarchical prediction and context adaptive coding for lossless color image compression.
Kim, Seyun; Cho, Nam Ik
2014-01-01
This paper presents a new lossless color image compression algorithm, based on the hierarchical prediction and context-adaptive arithmetic coding. For the lossless compression of an RGB image, it is first decorrelated by a reversible color transform and then Y component is encoded by a conventional lossless grayscale image compression method. For encoding the chrominance images, we develop a hierarchical scheme that enables the use of upper, left, and lower pixels for the pixel prediction, whereas the conventional raster scan prediction methods use upper and left pixels. An appropriate context model for the prediction error is also defined and the arithmetic coding is applied to the error signal corresponding to each context. For several sets of images, it is shown that the proposed method further reduces the bit rates compared with JPEG2000 and JPEG-XR.
Multi-scale visual words for hierarchical medical image categorisation
Markonis, Dimitrios; Seco de Herrera, Alba G.; Eggel, Ivan; Müller, Henning
2012-02-01
The biomedical literature published regularly has increased strongly in past years and keeping updated even in narrow domains is difficult. Images represent essential information of their articles and can help to quicker browse through large volumes of articles in connection with keyword search. Content-based image retrieval is helping the retrieval of visual content. To facilitate retrieval of visual information, image categorisation can be an important first step. To represent scientific articles visually, medical images need to be separated from general images such as flowcharts or graphs to facilitate browsing, as graphs contain little information. Medical modality classification is a second step to focus search. The techniques described in this article first classify images into broad categories. In a second step the images are further classified into the exact medical modalities. The system combines the Scale-Invariant Feature Transform (SIFT) and density-based clustering (DENCLUE). Visual words are first created globally to differentiate broad categories and then within each category a new visual vocabulary is created for modality classification. The results show the difficulties to differentiate between some modalities by visual means alone. On the other hand the improvement of the accuracy of the two-step approach shows the usefulness of the method. The system is currently being integrated into the Goldminer image search engine of the ARRS (American Roentgen Ray Society) as a web service, allowing concentrating image search onto clinically relevant images automatically.
An 3-DES Key Encryption Method Generated by Iris Image%由虹膜图像生成3-DES密钥的加密方法
Institute of Scientific and Technical Information of China (English)
曾明权; 卞燕山; 赵刚
2012-01-01
介绍虹膜生物特征生成密钥的过程，在此基础上，采用3-DES算法对机密图像进行加密。图像加密方案中，将生物特征技术引入其中，成功获得了所需要的比特位，通过对128比特位进行处理，得到了3-DES算法所需要的密钥，其试验结果表明加密的结果良好，达到了预期的目的。%The progresses that biological characteristics of iris are untilized to generate key are presented, based on which 3-DES algorithm is employed for confidential image encryption. The biological characteristics are introduced into image encryption methods and the needed bits stream are archived. After disposing those 128 bits stream, we attain the key for 3-DES algorithm. Experiments show that the enctyption result is good and prospective target is realized.
Directory of Open Access Journals (Sweden)
Tongfeng Zhang
2016-01-01
Full Text Available A one-dimensional (1D hybrid chaotic system is constructed by three different 1D chaotic maps in parallel-then-cascade fashion. The proposed chaotic map has larger key space and exhibits better uniform distribution property in some parametric range compared with existing 1D chaotic map. Meanwhile, with the combination of compressive sensing (CS and Fibonacci-Lucas transform (FLT, a novel image compression and encryption scheme is proposed with the advantages of the 1D hybrid chaotic map. The whole encryption procedure includes compression by compressed sensing (CS, scrambling with FLT, and diffusion after linear scaling. Bernoulli measurement matrix in CS is generated by the proposed 1D hybrid chaotic map due to its excellent uniform distribution. To enhance the security and complexity, transform kernel of FLT varies in each permutation round according to the generated chaotic sequences. Further, the key streams used in the diffusion process depend on the chaotic map as well as plain image, which could resist chosen plaintext attack (CPA. Experimental results and security analyses demonstrate the validity of our scheme in terms of high security and robustness against noise attack and cropping attack.
基于手指静脉特征图像的加密研究%Research on Encryption Based on Finger Vein Feature Image
Institute of Scientific and Technical Information of China (English)
陈暄
2016-01-01
Information security in the mobile Internet is currently a hotspot in researches.Starting from encryption of finger vein image, this paper first extracts characteristics of the finger vein image,and gets the size of vein image through establishing image smoother as well as the collected image of vein features through selecting the darkness area and characteristic features.Then,this paper adopts the function based on wavelet,Android mapping,the quadratic Logistic mapping and Baker transform to encrypt the vein image.Conduct experiment to com-pare the correlation analysis and differential attack analysis,and the results show that algorithm in this paper is safe and costs less time,so it is suitable to promote it in the mobile Internet.%移动互联下的信息安全是目前研究的热门，提出从手指静脉图像的加密出发，首先对手指静脉图像的特征进行了提取，通过构建图像平滑器来获得静脉图像的大小，明暗区域的选择和特征图像的加强来获得采集后的静脉特征图像，其次对静脉图像采用基于小波基函数，Arnold映射，二次Logistic 映射和Baker变换的混合加密方式对进行加密；在相关系分析和差分攻击分析等方面实验比较，说明算法具有很好的安全性和低耗时性，能够完全适应在移动互联环境中推广。
Association Algorithm of Encryption and Compression for Color Image%彩色图像加密与压缩关联算法
Institute of Scientific and Technical Information of China (English)
彭静玉; 赵鹤鸣
2014-01-01
针对传统的加密方法在彩色图像压缩方面的不足，提出一种用于保密通信的彩色图像加密与压缩关联算法。设计一个混合混沌系统在空域对秘密图像进行置乱。混沌系统产生针对彩色图像混淆变换的变换矩阵，改变载体图像的像素值。秘密图像每一像素的编码值与载体图像在设定区域中最佳像素点的坐标一一对应。最佳像素点按照最小欧氏距离的原则在载体图像的设定区域内搜索。经过压缩编码后的秘密图像数据不再是传统的像素值，而只是与序号或者下标对应的编码值。当压缩了67%的图像数据时，重构图像和原始图像的相似度仍然超过95%。对密钥空间、密钥的敏感性、加密图像的统计特性等加密效果进行仿真实验，结果表明，该算法安全性高、压缩率大，是一种有效的、易于实现的加密算法。%Aiming at the insufficiency of traditional encryption method in color image compression, a nassociation algorithm of color image encryption and compression is proposed for secure communication. A hybrid chaotic system is designed to scramble the secret image in time domain. Chaos system is also used to generate a transformation matrix for color images to confusion transform, which is used to change the carrier image pixels. Every pixel’s code value of secret image is one-to-one corresponded to the best pixel’s coordinates, which is searched in the carrier image’s setting area according to the principle of minimum Euclidean distance. After compression coding, the secret image data is no longer the traditional pixel value, but a group of code value corresponding the serial number or subscript. When 67 percent of the original image is compressed, the similarity between reconstructed image and original image is still more than 95%. The key space, sensitivity of the key and statistical features of encrypted image are also analyzed by simulation
Identity-based encryption with wildcards in the standard model
Institute of Scientific and Technical Information of China (English)
MING Yang; SHEN Xiao-qin; WANG Yu-min
2009-01-01
In this article, based on Chatterjee-Sarkar' hierarchical identity-based encryption (HIBE), a novel identity-based encryption with wildcards (WIBE) scheme is proposed and is proven secure in the standard model (without random oracle). The proposed scheme is proven to be secure assuming that the decisional Bilinear Diffie-Hellman (DBDH) problem is hard. Compared with the Wa-WIBE scheme that is secure in the standard model, our scheme has shorter common parameters and ciphertext length.
Guo, Yongkang; Huang, Qizhong; Du, Jinglei; Zhang, Yixiao
2001-06-01
An information-encryption method based on computer-generated hologram (CGH) interference is presented. In this method the original information is decomposed into two parts, and then each part is encoded on a separate CGH. When these two encoded CGHs are aligned and illuminated, a combined interference pattern is formed. The original information is obtained from this pattern. It is impossible to decrypt the original information from one CGH alone; two matched CGHs must be put together to make it available.
Triple Encrypted Holographic Storage and Digital Holographic System
Institute of Scientific and Technical Information of China (English)
ZHU Yi-Chao; ZHANG Jia-Sen; GONG Qi-Huang
2008-01-01
We propose a triple encrypted holographic memory containing a digital holographic system. The original image is encrypted using double random phase encryption and stored in a LiNbO3:Fe crystal with shift-multiplexing. Both the reference beams of the memory and the digital holographic system are random phase encoded. We theoretically and experimentally demonstrate the encryption and decryption of multiple images and the results show high quality and good fault tolerance. The total key length of this system is larger than 4.7×1033.
Three-dimensional information encryption and anticounterfeiting using digital holography.
Shiu, Min-Tzung; Chew, Yang-Kun; Chan, Huang-Tian; Wong, Xin-Yu; Chang, Chi-Ching
2015-01-01
In this work, arbitrary micro phase-step digital holography with optical interferometry and digital image processing is utilized to obtain information about an image of a three-dimensional object and encrypting keys. Then, a computer-generated hologram is used for the purpose of holographic encryption. All information about the keys is required to perform the decryption, comprising the amplitude and phase distribution of the encrypting key, the distance of image reconstruction, zero-order term elimination, and twin-image term suppression. In addition to using identifiable information on different image planes and linear superposition processing hidden within the encrypted information, not only can we convey an important message, but we can also achieve anticounterfeiting. This approach retains the strictness of traditional holographic encryption and the convenience of digital holographic processing without image distortion. Therefore, this method provides better solutions to earlier methods for the security of the transmission of holographic information.
Multiple Object Retrieval in Image Databases Using Hierarchical Segmentation Tree
Chen, Wei-Bang
2012-01-01
The purpose of this research is to develop a new visual information analysis, representation, and retrieval framework for automatic discovery of salient objects of user's interest in large-scale image databases. In particular, this dissertation describes a content-based image retrieval framework which supports multiple-object retrieval. The…
Multiple Object Retrieval in Image Databases Using Hierarchical Segmentation Tree
Chen, Wei-Bang
2012-01-01
The purpose of this research is to develop a new visual information analysis, representation, and retrieval framework for automatic discovery of salient objects of user's interest in large-scale image databases. In particular, this dissertation describes a content-based image retrieval framework which supports multiple-object retrieval. The…
A Hierarchical Bayesian M/EEG Imaging Method Correcting for Incomplete Spatio-Temporal Priors
DEFF Research Database (Denmark)
Stahlhut, Carsten; Attias, Hagai T.; Sekihara, Kensuke;
2013-01-01
In this paper we present a hierarchical Bayesian model, to tackle the highly ill-posed problem that follows with MEG and EEG source imaging. Our model promotes spatiotemporal patterns through the use of both spatial and temporal basis functions. While in contrast to most previous spatio-temporal ...
A hybrid scheme for encryption and watermarking
Xu, Xiaowei; Dexter, Scott D.; Eskicioglu, Ahmet M.
2004-06-01
Encryption and watermarking are complementary lines of defense in protecting multimedia content. Recent watermarking techniques have therefore been developed independent from encryption techniques. In this paper, we present a hybrid image protection scheme to establish a relation between the data encryption key and the watermark. Prepositioned secret sharing allows the reconstruction of different encryption keys by communicating different activating shares for the same prepositioned information. Each activating share is used by the receivers to generate a fresh content decryption key. In the proposed scheme, the activating share is used to carry copyright or usage rights data. The bit stream that represents this data is also embedded in the content as a visual watermark. When the encryption key needs to change, the data source generates a new activating share, and embeds the corresponding watermark into the multimedia stream. Before transmission, the composite stream is encrypted with the key constructed from the new activating share. Each receiver can decrypt the stream after reconstructing the same key, and extract the watermark from the image. Our presentation will include the application of the scheme to a test image, and a discussion on the data hiding capacity, watermark transparency, and robustness to common attacks.
Wei, Liyang; Shen, Dinggang; Kumar, Dinesh; Turlapati, Ram; Suri, Jasjit S.
2008-02-01
DSA images suffer from challenges like system X-ray noise and artifacts due to patient movement. In this paper, we present a two-step strategy to improve DSA image quality. First, a hierarchical deformable registration algorithm is used to register the mask frame and the bolus frame before subtraction. Second, the resulted DSA image is further enhanced by background diffusion and nonlinear normalization for better visualization. Two major changes are made in the hierarchical deformable registration algorithm for DSA images: 1) B-Spline is used to represent the deformation field in order to produce the smooth deformation field; 2) two features are defined as the attribute vector for each point in the image, i.e., original image intensity and gradient. Also, for speeding up the 2D image registration, the hierarchical motion compensation algorithm is implemented by a multi-resolution framework. The proposed method has been evaluated on a database of 73 subjects by quantitatively measuring signal-to-noise (SNR) ratio. DSA embedded with proposed strategies demonstrates an improvement of 74.1% over conventional DSA in terms of SNR. Our system runs on Eigen's DSA workstation using C++ in Windows environment.
Stego Optical Encryption Based on Chaotic Baker's Map Transformation
Hussain, Iqtadar; Gondal, Muhammad Asif
2014-06-01
In this article, an optical image encryption algorithm based on chaotic baker's map is presented. The stego-image is encrypted with the help of double random phase encoding algorithm and then produced disorder with the help of chaotic transformation. Security test shows that the reading of proposed algorithm is very close to the optimal values.
OBIA based hierarchical image classification for industrial lake water.
Uca Avci, Z D; Karaman, M; Ozelkan, E; Kumral, M; Budakoglu, M
2014-07-15
Water management is very important in water mining regions for the sustainability of the natural environment and for industrial activities. This study focused on Acigol Lake, which is an important wetland for sodium sulphate (Na2SO4) production, a significant natural protection area and habitat for local bird species and endemic species of this saline environment, and a stopover for migrating flamingos. By a hierarchical classification method, ponds representing the industrial part were classified according to in-situ measured Baumé values, and lake water representing the natural part was classified according to in-situ measurements of water depth. The latter is directly related to the water level, which should not exceed a critical level determined by the regulatory authorities. The resulting data, produced at an accuracy of around 80%, illustrates the status in two main regions for a single date. The output of the analysis may be meaningful for firms and environmental researchers, and authorizations can provide a good perspective for decision making for sustainable resource management in the region which has uncommon and specific ecological characteristics.
Monitoring Post Disturbance Forest Regeneration with Hierarchical Object-Based Image Analysis
Directory of Open Access Journals (Sweden)
L. Monika Moskal
2013-10-01
Full Text Available The main goal of this exploratory project was to quantify seedling density in post fire regeneration sites, with the following objectives: to evaluate the application of second order image texture (SOIT in image segmentation, and to apply the object-based image analysis (OBIA approach to develop a hierarchical classification. With the utilization of image texture we successfully developed a methodology to classify hyperspatial (high-spatial imagery to fine detail level of tree crowns, shadows and understory, while still allowing discrimination between density classes and mature forest versus burn classes. At the most detailed hierarchical Level I classification accuracies reached 78.8%, a Level II stand density classification produced accuracies of 89.1% and the same accuracy was achieved by the coarse general classification at Level III. Our interpretation of these results suggests hyperspatial imagery can be applied to post-fire forest density and regeneration mapping.
Towards Symbolic Encryption Schemes
DEFF Research Database (Denmark)
Ahmed, Naveed; Jensen, Christian D.; Zenner, Erik
2012-01-01
Symbolic encryption, in the style of Dolev-Yao models, is ubiquitous in formal security models. In its common use, encryption on a whole message is specified as a single monolithic block. From a cryptographic perspective, however, this may require a resource-intensive cryptographic algorithm......, namely an authenticated encryption scheme that is secure under chosen ciphertext attack. Therefore, many reasonable encryption schemes, such as AES in the CBC or CFB mode, are not among the implementation options. In this paper, we report new attacks on CBC and CFB based implementations of the well......-known Needham-Schroeder and Denning-Sacco protocols. To avoid such problems, we advocate the use of refined notions of symbolic encryption that have natural correspondence to standard cryptographic encryption schemes....
Institute of Scientific and Technical Information of China (English)
于娜娜
2012-01-01
基于傅里叶计算全息技术,结合菲涅尔双随机相位加密系统,提出了一种数字图像加密方法。该方法以傅里叶计算全息图记录菲涅尔衍射双随机相位加密图像,傅里叶计算全息加密图像隐藏了原图像大小尺度信息,而且再现多个图像,必须针对加密图像共轭方可解密,提高了图像加密的安全性,并且解决了普通方法加密图像难存储的问题,作为原始明文的拥有者,两个随机相位板,应用波长,两次菲涅尔衍射的距离都可作为解密密钥。%A new method of digital image encryption using Fourier CGH,combined the Fresnel dual randomized phase encryption system is proposed.In this method the encryption images of Fresnel diffraction two random phases system is recorded by Fourier CGH,The Fourier CGH is an image without size scale information of the original image and many images representation,but the decryption must according to the conjugate of original encryption,so this method greatly enhances the image encryption security.As the owner of the original image,three phase plate,application wavelength,twice the distance of the Fresnel diffraction can serve as decryption keys.
Naji, A W; Zaidan, B B; Al-Khateeb, Wajdi F; Khalifa, Othman O; Zaidan, A A; Gunawan, Teddy S
2009-01-01
The hurried development of multimedia and internet allows for wide distribution of digital media data. It becomes much easier to edit, modify and duplicate digital information. In additional, digital document is also easy to copy and distribute, therefore it may face many threats. It became necessary to find an appropriate protection due to the significance, accuracy and sensitivity of the information. Furthermore, there is no formal method to be followed to discover a hidden data. In this paper, a new information hiding framework is presented.The proposed framework aim is implementation of framework computation between advance encryption standard (AES) and distortion technique (DT) which embeds information in image page within executable file (EXE file) to find a secure solution to cover file without change the size of cover file. The framework includes two main functions; first is the hiding of the information in the image page of EXE file, through the execution of four process (specify the cover file, spec...
Encryption for digital content
Kiayias, Aggelos
2010-01-01
Encryption for Digital Content is an area in cryptography that is widely used in commercial productions (e.g., Blu-Ray and HD-DVDs). This book provides a comprehensive mathematical treatment of combinatorial encryption techniques used in digital content distribution systems and related attack models. A complete description of broadcast encryption with various revocation and tracing functionalities is included. ""Encryption for Digital Content"" introduces the subset cover framework (currently used in AACS, Blu-Ray and HD-DVDs,) and tracking/revocation mechanisms in various attack models. Pirat
On Fully Homomorphic Encryption
Fauzi, Prastudy
2012-01-01
Fully homomorphic encryption is an encryption scheme where a party can receive encrypted data and perform arbitrary operations on this data efficiently.The data remains encrypted throughout, but the operations can be done regardless, without having to know the decryption key.Such a scheme would be very advantageous, for example in ensuring the privacy of data that is sent to a third-party service.This is in contrast with schemes like Paillier where you can not perform a multiplication of encr...
Unsupervised Classification of SAR Images using Hierarchical Agglomeration and EM
Kayabol, K.; Krylov, V.; Zerubia, J.; Salerno, E.; Cetin, A.E.; Salvetti, O.
2012-01-01
We implement an unsupervised classification algorithm for high resolution Synthetic Aperture Radar (SAR) images. The foundation of algorithm is based on Classification Expectation-Maximization (CEM). To get rid of two drawbacks of EM type algorithms, namely the initialization and the model order sel
Image segmentation by connectivity preserving relinking in hierarchical graph structures
Nacken, P.F.M.
1995-01-01
The method of image segmentation by pyramid relinking is extended to the formalism of hierarchies of region adjacency graphs. This approach has a number of advantages: (1) resulting regions are connected; (2) the method is adaptive, and therefore artifacts caused by a regular grid are avoided; and (
Recursive Hierarchical Image Segmentation by Region Growing and Constrained Spectral Clustering
Tilton, James C.
2002-01-01
This paper describes an algorithm for hierarchical image segmentation (referred to as HSEG) and its recursive formulation (referred to as RHSEG). The HSEG algorithm is a hybrid of region growing and constrained spectral clustering that produces a hierarchical set of image segmentations based on detected convergence points. In the main, HSEG employs the hierarchical stepwise optimization (HS WO) approach to region growing, which seeks to produce segmentations that are more optimized than those produced by more classic approaches to region growing. In addition, HSEG optionally interjects between HSWO region growing iterations merges between spatially non-adjacent regions (i.e., spectrally based merging or clustering) constrained by a threshold derived from the previous HSWO region growing iteration. While the addition of constrained spectral clustering improves the segmentation results, especially for larger images, it also significantly increases HSEG's computational requirements. To counteract this, a computationally efficient recursive, divide-and-conquer, implementation of HSEG (RHSEG) has been devised and is described herein. Included in this description is special code that is required to avoid processing artifacts caused by RHSEG s recursive subdivision of the image data. Implementations for single processor and for multiple processor computer systems are described. Results with Landsat TM data are included comparing HSEG with classic region growing. Finally, an application to image information mining and knowledge discovery is discussed.
Cryptanalyzing a chaotic encryption algorithm for highly autocorrelated data
Li, Ming; Liu, Shangwang; Niu, Liping; Liu, Hong
2016-12-01
Recently, a chaotic encryption algorithm for highly autocorrelated data was proposed. By adding chaotic diffusion to the former work, the information leakage of the encryption results especially for the images with lower gray scales was eliminated, and both higher-level security and fast encryption time were achieved. In this study, we analyze the security weakness of this scheme. By applying the ciphertext-only attack, the encrypted image can be restored into the substituted image except for the first block; and then, by using the chosen-plaintext attack, the S-boxes, the distribution map, and the block of chaotic map values, can all be revealed, and the encrypted image can be completely cracked. The improvement is also proposed. Experimental results verify our assertion.
Nucleus segmentation in histology images with hierarchical multilevel thresholding
Ahmady Phoulady, Hady; Goldgof, Dmitry B.; Hall, Lawrence O.; Mouton, Peter R.
2016-03-01
Automatic segmentation of histological images is an important step for increasing throughput while maintaining high accuracy, avoiding variation from subjective bias, and reducing the costs for diagnosing human illnesses such as cancer and Alzheimer's disease. In this paper, we present a novel method for unsupervised segmentation of cell nuclei in stained histology tissue. Following an initial preprocessing step involving color deconvolution and image reconstruction, the segmentation step consists of multilevel thresholding and a series of morphological operations. The only parameter required for the method is the minimum region size, which is set according to the resolution of the image. Hence, the proposed method requires no training sets or parameter learning. Because the algorithm requires no assumptions or a priori information with regard to cell morphology, the automatic approach is generalizable across a wide range of tissues. Evaluation across a dataset consisting of diverse tissues, including breast, liver, gastric mucosa and bone marrow, shows superior performance over four other recent methods on the same dataset in terms of F-measure with precision and recall of 0.929 and 0.886, respectively.
Automated Hierarchical Time Gain Compensation for In Vivo Ultrasound Imaging
DEFF Research Database (Denmark)
Moshavegh, Ramin; Hemmsen, Martin Christian; Martins, Bo;
2015-01-01
in terms of image quality. Wilcoxon signed-rank test was used to evaluate whether radiologists preferred the processed sequences or the unprocessed data. The results indicate that the average visual analogue scale (VAS) is positive ( p-value: 2.34 × 10−13) and estimated to be 1.01 (95% CI: 0.85; 1...... tissue and the ultrasound signal strength. The proposed algorithm was applied to a set of 44 in vivo abdominal movie sequences each containing 15 frames. Matching pairs of in vivo sequences, unprocessed and processed with the proposed AHTGC were visualized side by side and evaluated by two radiologists...
Automated Hierarchical Time Gain Compensation for In Vivo Ultrasound Imaging
DEFF Research Database (Denmark)
Moshavegh, Ramin; Hemmsen, Martin Christian; Martins, Bo
2015-01-01
Time gain compensation (TGC) is essential to ensure the optimal image quality of the clinical ultrasound scans. When large fluid collections are present within the scan plane, the attenuation distribution is changed drastically and TGC compensation becomes challenging. This paper presents...... tissue and the ultrasound signal strength. The proposed algorithm was applied to a set of 44 in vivo abdominal movie sequences each containing 15 frames. Matching pairs of in vivo sequences, unprocessed and processed with the proposed AHTGC were visualized side by side and evaluated by two radiologists...
Distributed Searchable Symmetric Encryption
Bösch, Christoph; Peter, Andreas; Leenders, Bram; Lim, Hoon Wei; Tang, Qiang; Wang, Huaxiong; Hartel, Pieter; Jonker, Willem
2014-01-01
Searchable Symmetric Encryption (SSE) allows a client to store encrypted data on a storage provider in such a way, that the client is able to search and retrieve the data selectively without the storage provider learning the contents of the data or the words being searched for. Practical SSE schemes
Land cover classification of remotely sensed image with hierarchical iterative method
Institute of Scientific and Technical Information of China (English)
LI Peijun; HUANG Yingduan
2005-01-01
Based on the analysis of the single-stage classification results obtained by the multitemporal SPOT 5 and Landsat 7 ETM + multispectral images separately and the derived variogram texture, the best data combinations for each land cover class are selected, and the hierarchical iterative classification is then applied for land cover mapping. The proposed classification method combines the multitemporal images of different resolutions with the image texture, which can greatly improve the classification accuracy. The method and strategies proposed in the study can be easily transferred to other similar applications.
Hierarchical Multi-modal Image Registration by Learning Common Feature Representations.
Ge, Hongkun; Wu, Guorong; Wang, Li; Gao, Yaozong; Shen, Dinggang
2015-10-05
Mutual information (MI) has been widely used for registering images with different modalities. Since most inter-modality registration methods simply estimate deformations in a local scale, but optimizing MI from the entire image, the estimated deformations for certain structures could be dominated by the surrounding unrelated structures. Also, since there often exist multiple structures in each image, the intensity correlation between two images could be complex and highly nonlinear, which makes global MI unable to precisely guide local image deformation. To solve these issues, we propose a hierarchical inter-modality registration method by robust feature matching. Specifically, we first select a small set of key points at salient image locations to drive the entire image registration. Since the original image features computed from different modalities are often difficult for direct comparison, we propose to learn their common feature representations by projecting them from their native feature spaces to a common space, where the correlations between corresponding features are maximized. Due to the large heterogeneity between two high-dimension feature distributions, we employ Kernel CCA (Canonical Correlation Analysis) to reveal such non-linear feature mappings. Then, our registration method can take advantage of the learned common features to reliably establish correspondences for key points from different modality images by robust feature matching. As more and more key points take part in the registration, our hierarchical feature-based image registration method can efficiently estimate the deformation pathway between two inter-modality images in a global to local manner. We have applied our proposed registration method to prostate CT and MR images, as well as the infant MR brain images in the first year of life. Experimental results show that our method can achieve more accurate registration results, compared to other state-of-the-art image registration
Kumar, Pramod; Joseph, Joby; Singh, Kehar
2011-05-01
Interference-based optical encryption schemes have an inherent silhouette problem due to the equipollent nature of the phase-only masks (POMs) generated using an analytical method. One of the earlier methods suggested that removing the problem by use of exchanging process between two masks increases the computational load. This shortcoming is overcome with a noniterative method using the jigsaw transformation (JT) in a single step, with improved security because the inverse JT of these masks, along with correct permutation keys that are necessary to decrypt the original image. The stringent alignment requirement of the POMs in two different arms during the experiment is removed with an alternative method using a single spatial light modulator. Experimental results are provided to demonstrate the decryption process with the proposed method.
Borisagar, Viral H; Zaveri, Mukesh A
2014-01-01
A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.
Directory of Open Access Journals (Sweden)
Viral H. Borisagar
2014-01-01
Full Text Available A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.
Li, Xianye; Meng, Xiangfeng; Yin, Yongkai; Yang, Xiulun; Wang, Yurong; Peng, Xiang; He, Wenqi; Pan, Xuemei; Dong, Guoyan; Chen, Hongyi
2017-02-01
A hierarchical multilevel authentication system for multiple-image based on phase retrieval and basic vector operations in the Fresnel domain is proposed, by which more certification images are iteratively encoded into multiple cascaded phase masks according to different hierarchical levels. Based on the secret sharing algorithm by basic vector decomposition and composition operations, the iterated phase distributions are split into n pairs of shadow images keys (SIKs), and then distributed to n different participants (the authenticators). During each level in the high authentication process, any 2 or more participants can be gathered to reconstruct the original meaningful certification images. While in the case of each level in the low authentication process, only one authenticator who possesses a correct pair of SIKs, will gain no significant information of certification image; however, it can result in a remarkable peak output in the nonlinear correlation coefficient of the recovered image and the standard certification image, which can successfully provide an additional authentication layer for the high-level authentication. Theoretical analysis and numerical simulations both verify the feasibility of the proposed method.
Phase retrieval for attacking fractional Fourier transform encryption.
Kong, Dezhao; Shen, Xueju; Cao, Liangcai; Jin, Guofan
2017-04-20
An advanced iterative phase retrieval algorithm is applied to perform a ciphertext-only attack on the fractional Fourier transform-based double random phase encryption system. With the given complex amplitude of ciphertext and definite support of the object image, the original object image can be recovered by estimating the energy of support area in the recovered image. The encryption system can be attacked by analyzing the sensibility of fractional Fourier transform order keys and evaluating the energy of the object image support area. The proposed algorithm can obtain encrypted fractional order and retrieve two random phase keys. Numerical results demonstrate the efficacy of the proposed attacking method.
Multidimensional data encryption with digital holography
Yu, Lingfeng; Cai, Lilong
2003-01-01
A new method based on the concept of virtual optics for both encryption and decryption is proposed. It analyzes the potential reasons of the limitations of our earlier work and presents some new approach to improve the original algorithm. Different methods of numerical reconstruction for data encryption are compared, the limitations caused by off-axis setups are discussed, and the resolution of the decrypted image could be flexibly adjusted, which makes it possible to decrypt the image with virtually no loss of data. Numerical experiments are performed to validate the proposed method, and sensitivities of some parameters are quantitatively analyzed and illustrated.
Chatterjee, Sanjit
2011-01-01
Identity Based Encryption (IBE) is a type of public key encryption and has been intensely researched in the past decade. Identity-Based Encryption summarizes the available research for IBE and the main ideas that would enable users to pursue further work in this area. This book will also cover a brief background on Elliptic Curves and Pairings, security against chosen Cipher text Attacks, standards and more. Advanced-level students in computer science and mathematics who specialize in cryptology, and the general community of researchers in the area of cryptology and data security will find Ide
Institute of Scientific and Technical Information of China (English)
孔德照; 林超; 沈学举; 王昕; 周晗
2013-01-01
提出一种基于小波包变换(WPT)的分数阶光学图像加密方法.利用WPT能够对图像多层次分解的特性,结合分数傅里叶变换(FRFT)的灵活性,将双随机相位、小波函数的类型及尺度因子和分数阶次作为密钥,实现了图像的多重密钥加解密.同时,实现了图像小波域上的选择性加密,使加密样式变得更灵活多样,还增强了加密图像的抵抗恶意的攻击能力.数值模拟了加密和解密过程,分析了加密效果和解密图像质量,验证了本文方法的可行性.%A novel method for the optical image encryption is presented, which is based on the wavelet packet transform (WPT) and fractional Fourier transform (FRFT). The idea of combining WPT with FRFT comes from the study of properties of them. Images can be decomposed by wavelet packet transform. With the increase in the order of WPT,the image will be decomposed into more parts,of which each contains the essential information. Based on the good property of WPT and the flexibility of FRFT, the method implicates encryption and decryption of the image and produces many keys, consisting of double random phase masks,the order of WPT and the order of FRFT. Meanwhile,the selected-image-encryption in wavlet domain is realized in this paper,which varies the patterns of encryptioa The method improves the security,and the ability of resisting malicious attacks is also enhanced. The encryption and decryption are implicated by numerical simulation. The result of the simulation provides the requirement for analyzing the properties of encryption and decryptioa The feasibility and simplicity of the method are verified by numerical simulation,and a simple optical implication of the method is also proposed. Based on the numerical simulation and theroy analysis,it can be confluded that the method for the optical image encryption is novel and effective.
Key-space analysis of double random phase encryption technique
Monaghan, David S.; Gopinathan, Unnikrishnan; Naughton, Thomas J.; Sheridan, John T.
2007-09-01
We perform a numerical analysis on the double random phase encryption/decryption technique. The key-space of an encryption technique is the set of possible keys that can be used to encode data using that technique. In the case of a strong encryption scheme, many keys must be tried in any brute-force attack on that technique. Traditionally, designers of optical image encryption systems demonstrate only how a small number of arbitrary keys cannot decrypt a chosen encrypted image in their system. However, this type of demonstration does not discuss the properties of the key-space nor refute the feasibility of an efficient brute-force attack. To clarify these issues we present a key-space analysis of the technique. For a range of problem instances we plot the distribution of decryption errors in the key-space indicating the lack of feasibility of a simple brute-force attack.
Alshehhi, Rasha; Marpu, Prashanth Reddy
2017-04-01
Extraction of road networks in urban areas from remotely sensed imagery plays an important role in many urban applications (e.g. road navigation, geometric correction of urban remote sensing images, updating geographic information systems, etc.). It is normally difficult to accurately differentiate road from its background due to the complex geometry of the buildings and the acquisition geometry of the sensor. In this paper, we present a new method for extracting roads from high-resolution imagery based on hierarchical graph-based image segmentation. The proposed method consists of: 1. Extracting features (e.g., using Gabor and morphological filtering) to enhance the contrast between road and non-road pixels, 2. Graph-based segmentation consisting of (i) Constructing a graph representation of the image based on initial segmentation and (ii) Hierarchical merging and splitting of image segments based on color and shape features, and 3. Post-processing to remove irregularities in the extracted road segments. Experiments are conducted on three challenging datasets of high-resolution images to demonstrate the proposed method and compare with other similar approaches. The results demonstrate the validity and superior performance of the proposed method for road extraction in urban areas.
Hard X-ray spectroscopic nano-imaging of hierarchical functional materials at work.
Andrews, Joy C; Weckhuysen, Bert M
2013-11-11
Heterogeneous catalysts often consist of an active metal (oxide) in close contact with a support material and various promoter elements. Although macroscopic properties, such as activity, selectivity and stability, can be assessed with catalyst performance testing, the development of relevant, preferably quantitative structure-performance relationships require the use of advanced characterisation methods. Spectroscopic imaging in the hard X-ray region with nanometer-scale resolution has very recently emerged as a powerful approach to elucidate the hierarchical structure and related chemistry of catalytic solids in action under realistic reaction conditions. This X-ray-based chemical imaging method benefits from the combination of high resolution (∼30 nm) with large X-ray penetration and depth of focus, and the possibility for probing large areas with mosaic imaging. These capabilities make it possible to obtain spatial and temporal information on chemical changes in catalytic solids as well as a wide variety of other functional materials, such as fuel cells and batteries, in their full complexity and integrity. In this concept article we provide details on the method and setup of full-field hard X-ray spectroscopic imaging, illustrate its potential for spatiotemporal chemical imaging by making use of recent showcases, outline the pros and cons of this experimental approach and discuss some future directions for hierarchical functional materials research.
Optical phase encryption by phase contrast using electrically addressed spatial light modulator
Nishchal, Naveen Kumar; Joseph, Joby; Singh, Kehar
2003-03-01
We report the use of an electrically addressed liquid crystal spatial light modulator (EALCSLM) operating in the phase mode as a phase-contrast filter (PCF). As an application, an optical phase encryption system has been implemented. We encrypt and decrypt a two-dimensional phase image obtained from an amplitude image. Encrypted image is holographically recorded in a Barium titanate crystal and is then decrypted by generating through phase conjugation, a conjugate of the encrypted image. The decrypted phase image is converted into an amplitude image using an EASLM as a PCF. The idea has been supported by the experimental results.
Advanced Steganography Algorithm using Encrypted secret message
Directory of Open Access Journals (Sweden)
Joyshree Nath
2011-03-01
Full Text Available In the present work the authors have introduced a new method for hiding any encrypted secret message inside a cover file. For encrypting secret message the authors have used new algorithm proposed by Nath et al(1. For hiding secret message we have used a method proposed by Nath et al(2. In MSA(1 method we have modified the idea of Play fair method into a new platform where we can encrypt or decrypt any file. We have introduced a new randomization method for generating the randomized key matrix to encrypt plain text file and to decrypt cipher text file. We have also introduced a new algorithm for encrypting the plain text multiple times. Our method is totally dependent on the random text_key which is to be supplied by the user. The maximum length of the text_key can be of 16 characters long and it may contain any character(ASCII code 0 to 255. We have developed an algorithm to calculate the randomization number and the encryption number from the given text_key. The size of the encryption key matrix is 16x16 and the total number of matrices can be formed from 16 x 16 is 256! which is quite large and hence if someone applies the brute force method then he/she has to give trail for 256! times which is quite absurd. Moreover the multiple encryption method makes the system further secured. For hiding secret message in the cover file we have inserted the 8 bits of each character of encrypted message file in 8 consecutive bytes of the cover file. We have introduced password for hiding data in the cover file. We propose that our new method could be most appropriate for hiding any file in any standard cover file such as image, audio, video files. Because the hidden message is encrypted hence it will be almost impossible for the intruder to unhide the actual secret message from the embedded cover file. This method may be the most secured method in digital water marking.
Taquet, Jonathan; Labit, Claude
2012-05-01
We propose a new hierarchical approach to resolution scalable lossless and near-lossless (NLS) compression. It combines the adaptability of DPCM schemes with new hierarchical oriented predictors to provide resolution scalability with better compression performances than the usual hierarchical interpolation predictor or the wavelet transform. Because the proposed hierarchical oriented prediction (HOP) is not really efficient on smooth images, we also introduce new predictors, which are dynamically optimized using a least-square criterion. Lossless compression results, which are obtained on a large-scale medical image database, are more than 4% better on CTs and 9% better on MRIs than resolution scalable JPEG-2000 (J2K) and close to nonscalable CALIC. The HOP algorithm is also well suited for NLS compression, providing an interesting rate-distortion tradeoff compared with JPEG-LS and equivalent or a better PSNR than J2K for a high bit rate on noisy (native) medical images.
Using Hierarchical Adaptive Neuro Fuzzy Systems And Design Two New Edge Detectors In Noisy Images
Directory of Open Access Journals (Sweden)
M. H. Olyaee
2013-10-01
Full Text Available One of the most important topics in image processing is edge detection. Many methods have been proposed for this end but most of them have weak performance in noisy images because noise pixels are determined as edge. In this paper, two new methods are represented based on Hierarchical Adaptive Neuro Fuzzy Systems (HANFIS. Each method consists of desired number of HANFIS operators that receive the value of some neighbouring pixels and decide central pixel is edge or not. Simple train images are used in order to set internal parameters of each HANFIS operator. The presented methods are evaluated by some test images and compared with several popular edge detectors. The experimental results show that these methods are robust against impulse noise and extract edge pixels exactly.
Homomorphic encryption and applications
Yi, Xun; Bertino, Elisa
2014-01-01
This book introduces the fundamental concepts of homomorphic encryption. From these foundations, applications are developed in the fields of private information retrieval, private searching on streaming data, privacy-preserving data mining, electronic voting and cloud computing. The content is presented in an instructional and practical style, with concrete examples to enhance the reader's understanding. This volume achieves a balance between the theoretical and the practical components of modern information security. Readers will learn key principles of homomorphic encryption as well as their
Encrypting Analytical Web Applications
Fuhry, Benny; Tighzert, Walter; Kerschbaum. Florian
2016-01-01
The software-as-a-service (SaaS) market is growing very fast, but still many clients are concerned about the confidentiality of their data in the cloud. Motivated hackers or malicious insiders could try to steal the clients’ data. Encryption is a potential solution, but supporting the necessary functionality also in existing applications is difficult. In this paper, we examine encrypting analytical web applications that perform extensive number processing operations in the database. Existing ...
Encryption Switching Protocols
Couteau, Geoffroy; Peters, Thomas; Pointcheval, David
2016-01-01
International audience; We formally define the primitive of encryption switching protocol (ESP), allowing to switch between two encryption schemes. Intuitively, this two-party protocol converts given ciphertexts from one scheme into ciphertexts of the same messages under the other scheme, for any polynomial number of switches, in any direction. Although ESP is a special kind of two-party computation protocol, it turns out that ESP implies general two-party computation (2-PC) under natural con...
A hierarchical Bayesian-MAP approach to inverse problems in imaging
Raj, Raghu G.
2016-07-01
We present a novel approach to inverse problems in imaging based on a hierarchical Bayesian-MAP (HB-MAP) formulation. In this paper we specifically focus on the difficult and basic inverse problem of multi-sensor (tomographic) imaging wherein the source object of interest is viewed from multiple directions by independent sensors. Given the measurements recorded by these sensors, the problem is to reconstruct the image (of the object) with a high degree of fidelity. We employ a probabilistic graphical modeling extension of the compound Gaussian distribution as a global image prior into a hierarchical Bayesian inference procedure. Since the prior employed by our HB-MAP algorithm is general enough to subsume a wide class of priors including those typically employed in compressive sensing (CS) algorithms, HB-MAP algorithm offers a vehicle to extend the capabilities of current CS algorithms to include truly global priors. After rigorously deriving the regression algorithm for solving our inverse problem from first principles, we demonstrate the performance of the HB-MAP algorithm on Monte Carlo trials and on real empirical data (natural scenes). In all cases we find that our algorithm outperforms previous approaches in the literature including filtered back-projection and a variety of state-of-the-art CS algorithms. We conclude with directions of future research emanating from this work.
Encrypted Data Storage in EGEE
Frohner, Ákos
2006-01-01
The medical community is routinely using clinical images and associated medical data for diagnosis, intervention planning and therapy follow-up. Medical imaging is producing an increasing number of digital images for which computerized archiving, processing and analysis are needed. Grids are promising infrastructures for managing and analyzing the huge medical databases. Given the sensitive nature of medical images, practiotionners are often reluctant to use distributed systems though. Security if often implemented by isolating the imaging network from the outside world inside hospitals. Given the wide scale distribution of grid infrastructures and their multiple administrative entities, the level of security for manipulating medical data should be particularly high. In this presentation we describe the architecture of a solution, the gLite Encrypted Data Storage (EDS), which was developed in the framework of Enabling Grids for E-sciencE (EGEE), a project of the European Commission (contract number INFSO--508...
Directory of Open Access Journals (Sweden)
Boriša Ž. Jovanović
2010-10-01
Full Text Available Digitalni multimedijalni sadržaj postaje zastupljeniji i sve više se razmenjuje putem računarskih mreža i javnih kanala (satelitske komunikacije, bežične mreže, internet, itd. koji predstavljaju nebezbedne medijume za prenos informacija osetljive sadržine. Sve više na značaju dobijaju mehanizmi kriptološke zaštite slika i video sadržaja. Tradicionalni sistemi kriptografske obrade u sistemima za prenos ovih vrsta informacija garantuju visok stepen sigurnosti, ali i imaju svoje nedostatke - visoku cenu implementacije i znatno kašnjenje u prenosu podataka. Pomenuti nedostaci se prevazilaze primenom algoritama selektivnog šifrovanja. / Digital multimedia content is becoming widely used and increasingly exchanged over computer network and public channels (satelite, wireless networks, Internet, etc. which is unsecured transmission media for ex changing that kind of information. Mechanisms made to encrypt image and video data are becoming more and more significant. Traditional cryptographic techniques can guarantee a high level of security but at the cost of expensive implementation and important transmission delays. These shortcomings can be exceeded using selective encryption algorithms. Introduction In traditional image and video content protection schemes, called fully layered, the whole content is first compressed. Then, the compressed bitstream is entirely encrypted using a standard cipher (DES - Data Encryption Algorithm, IDEA - International Data Encryption Algorithm, AES - Advanced Encryption Algorithm etc.. The specific characteristics of this kind of data, high-transmission rate with limited bandwidth, make standard encryption algorithms inadequate. Another limitation of traditional systems consists of altering the whole bitstream syntax which may disable some codec functionalities on the delivery site coder and decoder on the receiving site. Selective encryption is a new trend in image and video content protection. As its
Interactive Hierarchical-Flow Segmentation of Scar Tissue From Late-Enhancement Cardiac MR Images.
Rajchl, Martin; Yuan, Jing; White, James A; Ukwatta, Eranga; Stirrat, John; Nambakhsh, Cyrus M S; Li, Feng P; Peters, Terry M
2014-01-01
We propose a novel multi-region image segmentation approach to extract myocardial scar tissue from 3-D whole-heart cardiac late-enhancement magnetic resonance images in an interactive manner. For this purpose, we developed a graphical user interface to initialize a fast max-flow-based segmentation algorithm and segment scar accurately with progressive interaction. We propose a partially-ordered Potts (POP) model to multi-region segmentation to properly encode the known spatial consistency of cardiac regions. Its generalization introduces a custom label/region order constraint to Potts model to multi-region segmentation. The combinatorial optimization problem associated with the proposed POP model is solved by means of convex relaxation, for which a novel multi-level continuous max-flow formulation, i.e., the hierarchical continuous max-flow (HMF) model, is proposed and studied. We demonstrate that the proposed HMF model is dual or equivalent to the convex relaxed POP model and introduces a new and efficient hierarchical continuous max-flow based algorithm by modern convex optimization theory. In practice, the introduced hierarchical continuous max-flow based algorithm can be implemented on the parallel GPU to achieve significant acceleration in numerics. Experiments are performed in 50 whole heart 3-D LE datasets, 35 with left-ventricular and 15 with right-ventricular scar. The experimental results are compared to full-width-at-half-maximum and Signal-threshold to reference-mean methods using manual expert myocardial segmentations and operator variabilities and the effect of user interaction are assessed. The results indicate a substantial reduction in image processing time with robust accuracy for detection of myocardial scar. This is achieved without the need for additional region constraints and using a single optimization procedure, substantially reducing the potential for error.
System for Information Encryption Implementing Several Chaotic Orbits
Directory of Open Access Journals (Sweden)
Jiménez-Rodríguez Maricela
2015-07-01
Full Text Available This article proposes a symmetric encryption algorithm that takes, as input value, the original information of length L, that when encoded, generates the ciphertext of greater length LM. A chaotic discrete system (logistic map is implemented to generate 3 different orbits: the first is used for applying a diffusion technique in order to mix the original data, the second orbit is combined with the mixed information and increases the length of L to LM, and with the third orbit, the confusion technique is implemented. The encryption algorithm was applied to encode an image which is then totally recovered by the keys used to encrypt and his respective, decrypt algorithm. The algorithm can encode any information, just dividing into 8 bits, it can cover the requirements for high level security, it uses 7 keys to encrypt and provides good encryption speed
An Attack on Wavelet Tree Shuffling Encryption Schemes
Assegie, Samuel; Salama, Paul; King, Brian
With the ubiquity of the internet and advances in technology, especially digital consumer electronics, demand for online multimedia services is ever increasing. While it's possible to achieve a great reduction in bandwidth utilization of multimedia data such as image and video through compression, security still remains a great concern. Traditional cryptographic algorithms/systems for data security are often not fast enough to process the vast amounts of data generated by the multimedia applications to meet the realtime constraints. Selective encryption is a new scheme for multimedia content protection. It involves encrypting only a portion of the data to reduce computational complexity(the amount of data to encrypt)while preserving a sufficient level of security. To achieve this, many selective encryption schemes are presented in different literatures. One of them is Wavelet Tree Shuffling. In this paper we assess the security of a wavelet tree shuffling encryption scheme.
Institute of Scientific and Technical Information of China (English)
赵丽; 齐兴斌; 李雪梅; 田涛
2014-01-01
For the security issue of two-dimensional image encryption, an optical image fusion fractional Fouri-er transform and image replacement techniques of encryption scheme is proposed. Firstly, jigsaw transform algo-rithm is used to decompose the original image into several sub graphs, shifting subgraph randomly. Then, Arnold transform (ART) is used to scramble pixel of image. Finally, scrambling image by using fractional Fourier transform, and repeat the process of iteration. The jigsaw array index, Arnold frequency and fractional Fourier order parameters constitute a key space. Through the simulation in the optical implementation evaluation of the performance of algo-rithm, experimental results show that proposed scheme has better flexibility and robustness.%针对二维图像加密系统的安全性问题，本文提出一种融合分数傅里叶变换和图像置换技术的光学图像加密方案。首先，使用jigsaw变换算法将原始图像分解成若干子图，并随机平移子图；然后，利用Arnold变换对图像像素进行置乱；最后，采用分数傅里叶变换加密置乱图像，并迭代重复这些过程。将jigsaw排列指标、Arnold频率和分数傅里叶阶等参数组成一个密钥空间，通过仿真实验在光学实现方面评估算法性能。实验结果表明，本文提出的方案具有很好的灵活性和鲁棒性。
An optical encryption scheme that uses polarization of coherent light
Gopinathan, Unnikrishnan; David S. Monaghan; Naughton, Thomas J.; Sheridan, John T.
2005-01-01
We demonstrate an optical system that encodes two dimensional data as different polarization states. The encrypted image is recorded using a digital holographic setup and the decryption is done numerically.
Provably Secure Role-Based Encryption with Revocation Mechanism
Institute of Scientific and Technical Information of China (English)
Yan Zhu; Hong-Xin Hu; Gail-Joon Ahn; Huai-Xi Wang; Shan-Biao Wang
2011-01-01
Role-Based Encryption (RBE) realizes access control mechanisms over encrypted data according to the widely adopted hierarchical RBAC model.In this paper,we present a practical RBE scheme with revocation mechanism based on partial-order key hierarchy with respect to the public key infrastructure,in which each user is assigned with a unique private-key to support user identification,and each role corresponds to a public group-key that is used to encrypt data.Based on this key hierarchy structure,our RBE scheme allows a sender to directly specify a role for encrypting data,which can be decrypted by all senior roles,as well as to revoke any subgroup of users and roles.We give a full proof of security of our scheme against hierarchical collusion attacks.In contrast to the existing solutions for encrypted file systems,our scheme not only supports dynamic joining and revoking users,but also has shorter ciphertexts and constant-size decryption keys.
A novel cellular automata based technique for visual multimedia content encryption
Chatzichristofis, Savvas A.; Mitzias, Dimitris A.; Sirakoulis, Georgios Ch.; Boutalis, Yiannis S.
2010-11-01
This paper proposes a new method for visual multimedia content encryption using Cellular Automata (CA). The encryption scheme is based on the application of an attribute of the CLF XOR filter, according to which the original content of a cellular neighborhood can be reconstructed following a predetermined number of repeated applications of the filter. The encryption is achieved using a key image of the same dimensions as the image being encrypted. This technique is accompanied by the one-time pad (OTP) encryption method, rendering the proposed method reasonably powerful, given the very large number of resultant potential security keys. The method presented here makes encryption possible in cases where there is more than one image with the use of just one key image. A further significant characteristic of the proposed method is that it demonstrates how techniques from the field of image retrieval can be used in the field of image encryption. The proposed method is further strengthened by the fact that the resulting encrypted image for a given key image is different each time. The encryption result depends on the structure of an artificial image produced by the superposition of four 1-D CA time-space diagrams as well as from a CA random number generator. A semi-blind source separation algorithm is used to decrypt the encrypted image. The result of the decryption is a lossless representation of the encrypted image. Simulation results demonstrate the effectiveness of the proposed encryption method. The proposed method is implemented in C# and is available online through the img(Rummager) application.
Badshah, Amir; Choudhry, Aadil Jaleel; Ullah, Shan
2017-03-01
Industries are moving towards automation in order to increase productivity and ensure quality. Variety of electronic and electromagnetic systems are being employed to assist human operator in fast and accurate quality inspection of products. Majority of these systems are equipped with cameras and rely on diverse image processing algorithms. Information is lost in 2D image, therefore acquiring accurate 3D data from 2D images is an open issue. FAST, SURF and SIFT are well-known spatial domain techniques for features extraction and henceforth image registration to find correspondence between images. The efficiency of these methods is measured in terms of the number of perfect matches found. A novel fast and robust technique for stereo-image processing is proposed. It is based on non-rigid registration using modified normalized phase correlation. The proposed method registers two images in hierarchical fashion using quad-tree structure. The registration process works through global to local level resulting in robust matches even in presence of blur and noise. The computed matches can further be utilized to determine disparity and depth for industrial product inspection. The same can be used in driver assistance systems. The preliminary tests on Middlebury dataset produced satisfactory results. The execution time for a 413 x 370 stereo-pair is 500ms approximately on a low cost DSP.
Polarisation Encryption/Decryption Module
DEFF Research Database (Denmark)
2002-01-01
A polarisation encryption/decryption module comprising at least two array based modulating devices, preferably spatial light modulators (SLMs), at least one array based intensity detector, and at least one source of electromagnetic radiation. A local region of information displayed on a first of ...... rapidly. May be used for real time encryption/decryption of motion pictures. Further, a method of polarisation encrypting and decrypting information. The encryption/decryption is performed optically while the communication is performed electronically....
Optical encryption of personal identification information using orthogonal code
Islam, Mohammed N.; Alam, Mohammad S.
2006-05-01
Optical information processing techniques have been developed for information security and fraud deterrent applications. Several encryption methods have been proposed in the literature, which includes optical double random-phase encryption, polarization encoding, encryption and verification using a multiplexed minimum average correlation energy phase-encrypted filter. All these reports employed a pseudo-random number for the code. But as such numbers are not uncorrelated, the security is not guaranteed because a wrong code may also extract some of the features of the coded information. The objective of the paper is to develop an optical security system employing orthogonal code for protection of personal identification information. As the orthogonal codes have zero or minimum cross-correlation depending on the offset between the codes, a wrong code can not decrypt any information. Here a simple encryption technique is proposed in spatial domain, where the input images are first spread in one dimension using an optical lens and then multiplied by the respective code. Finally, the individual encrypted images are superimposed on a common spatial domain. The individual images can then be decrypted by correlating the received signal with the respective address code. Computer simulation results show that any information containing binary characters can be encrypted and then decrypted successfully. The encrypted images are found to be secure, because no unwanted reproduction is possible without having the appropriate code. The technique also offers an efficient use of the storage or transmission capacity. Therefore, the proposed optical encryption technique can be applied to securing personal identification or similar information.
Kurtz, Camille; Beaulieu, Christopher F; Napel, Sandy; Rubin, Daniel L
2014-06-01
Computer-assisted image retrieval applications could assist radiologist interpretations by identifying similar images in large archives as a means to providing decision support. However, the semantic gap between low-level image features and their high level semantics may impair the system performances. Indeed, it can be challenging to comprehensively characterize the images using low-level imaging features to fully capture the visual appearance of diseases on images, and recently the use of semantic terms has been advocated to provide semantic descriptions of the visual contents of images. However, most of the existing image retrieval strategies do not consider the intrinsic properties of these terms during the comparison of the images beyond treating them as simple binary (presence/absence) features. We propose a new framework that includes semantic features in images and that enables retrieval of similar images in large databases based on their semantic relations. It is based on two main steps: (1) annotation of the images with semantic terms extracted from an ontology, and (2) evaluation of the similarity of image pairs by computing the similarity between the terms using the Hierarchical Semantic-Based Distance (HSBD) coupled to an ontological measure. The combination of these two steps provides a means of capturing the semantic correlations among the terms used to characterize the images that can be considered as a potential solution to deal with the semantic gap problem. We validate this approach in the context of the retrieval and the classification of 2D regions of interest (ROIs) extracted from computed tomographic (CT) images of the liver. Under this framework, retrieval accuracy of more than 0.96 was obtained on a 30-images dataset using the Normalized Discounted Cumulative Gain (NDCG) index that is a standard technique used to measure the effectiveness of information retrieval algorithms when a separate reference standard is available. Classification
Computationally Efficient Searchable Symmetric Encryption
Liesdonk, van Peter; Sedghi, Saeed; Doumen, Jeroen; Hartel, Pieter; Jonker, Willem; Jonker, Willem; Petkovic, Milan
2010-01-01
Searchable encryption is a technique that allows a client to store documents on a server in encrypted form. Stored documents can be retrieved selectively while revealing as little information as possible to the server. In the symmetric searchable encryption domain, the storage and the retrieval are
Energy Technology Data Exchange (ETDEWEB)
Grazzini, Jacopo [Los Alamos National Laboratory; Prasad, Lakshman [Los Alamos National Laboratory; Dillard, Scott [PNNL
2010-10-21
The automatic detection, recognition , and segmentation of object classes in remote sensed images is of crucial importance for scene interpretation and understanding. However, it is a difficult task because of the high variability of satellite data. Indeed, the observed scenes usually exhibit a high degree of complexity, where complexity refers to the large variety of pictorial representations of objects with the same semantic meaning and also to the extensive amount of available det.ails. Therefore, there is still a strong demand for robust techniques for automatic information extraction and interpretation of satellite images. In parallel, there is a growing interest in techniques that can extract vector features directly from such imagery. In this paper, we investigate the problem of automatic hierarchical segmentation and vectorization of multispectral satellite images. We propose a new algorithm composed of the following steps: (i) a non-uniform sampling scheme extracting most salient pixels in the image, (ii) an anisotropic triangulation constrained by the sampled pixels taking into account both strength and directionality of local structures present in the image, (iii) a polygonal grouping scheme merging, through techniques based on perceptual information , the obtained segments to a smaller quantity of superior vectorial objects. Besides its computational efficiency, this approach provides a meaningful polygonal representation for subsequent image analysis and/or interpretation.
Hierarchical model of natural images and the origin of scale invariance.
Saremi, Saeed; Sejnowski, Terrence J
2013-02-19
The study of natural images and how our brain processes them has been an area of intense research in neuroscience, psychology, and computer science. We introduced a unique approach to studying natural images by decomposing images into a hierarchy of layers at different logarithmic intensity scales and mapping them to a quasi-2D magnet. The layers were in different phases: "cold" and ordered at large-intensity scales, "hot" and disordered at small-intensity scales, and going through a second-order phase transition at intermediate scales. There was a single "critical" layer in the hierarchy that exhibited long-range correlation similar to that found in the 2D Ising model of ferromagnetism at the critical temperature. We also determined the interactions between layers mapped from natural images and found mutual inhibition that generated locally "frustrated" antiferromagnetic states. Almost all information in natural images was concentrated in a few layers near the phase transition, which has biological implications and also points to the hierarchical origin of scale invariance in natural images.
New image encryption algorithm of extended logistic equation%一种改进logistic方程的图像加密新算法
Institute of Scientific and Technical Information of China (English)
蒋梦轩; 射可夫
2012-01-01
提出了改进的logistic混沌方程和新的图像加密算法.改进的混沌方程对比logistic混沌方程具有更大的密钥空间,而且所生成的混沌序列的互相关性、敏感性等密码特性更好.新的图像加密算法是运用密码学原理设计的随机加密算法,理论上安全空间非常大.理论分析和计算机仿真实验表明该方程和该算法结合的加密机制具有更好的加密效果和安全性,能有效抵抗暴力攻击、已知明文攻击和统计分析.%An extended logistic equation and new image encryption algorithm is proposed. Compared with the logistic equation, the improved chaotic equation has larger key space, and the generated chaotic sequences has excellent performance such as cross correlation and sensitivity. The algorithm is designed based on cryptography theory and safety space is huge. Theoretical analyses and computer simulation show that the equation and the algorithm has more efficiency and security, it can resist violence attack, known-plaintext attack and statistical analysis effectively.
Homomorphic encryption from codes
Bogdanov, Andrej
2011-01-01
We propose a new homomorphic encryption scheme based on the hardness of decoding under independent random noise from certain affine families of codes. Unlike in previous lattice-based homomorphic encryption schemes, where the message is hidden in the noisy part of the ciphertext, our scheme carries the message in the affine part of the transformation and applies noise only to achieve security. Our scheme can tolerate noise of arbitrary magnitude, as long as the noise vector has sufficiently small hamming weight (and its entries are independent). Our design achieves "proto-homomorphic" properties in an elementary manner: message addition and multiplication are emulated by pointwise addition and multiplication of the ciphertext vectors. Moreover, the extremely simple nature of our decryption makes the scheme easily amenable to bootstrapping. However, some complications are caused by the inherent presence of noticeable encryption error. Our main technical contribution is the development of two new techniques for...
Automatic and hierarchical segmentation of the human skeleton in CT images
Fu, Yabo; Liu, Shi; Li, H. Harold; Yang, Deshan
2017-04-01
Accurate segmentation of each bone of the human skeleton is useful in many medical disciplines. The results of bone segmentation could facilitate bone disease diagnosis and post-treatment assessment, and support planning and image guidance for many treatment modalities including surgery and radiation therapy. As a medium level medical image processing task, accurate bone segmentation can facilitate automatic internal organ segmentation by providing stable structural reference for inter- or intra-patient registration and internal organ localization. Even though bones in CT images can be visually observed with minimal difficulty due to the high image contrast between the bony structures and surrounding soft tissues, automatic and precise segmentation of individual bones is still challenging due to the many limitations of the CT images. The common limitations include low signal-to-noise ratio, insufficient spatial resolution, and indistinguishable image intensity between spongy bones and soft tissues. In this study, a novel and automatic method is proposed to segment all the major individual bones of the human skeleton above the upper legs in CT images based on an articulated skeleton atlas. The reported method is capable of automatically segmenting 62 major bones, including 24 vertebrae and 24 ribs, by traversing a hierarchical anatomical tree and by using both rigid and deformable image registration. The degrees of freedom of femora and humeri are modeled to support patients in different body and limb postures. The segmentation results are evaluated using the Dice coefficient and point-to-surface error (PSE) against manual segmentation results as the ground-truth. The results suggest that the reported method can automatically segment and label the human skeleton into detailed individual bones with high accuracy. The overall average Dice coefficient is 0.90. The average PSEs are 0.41 mm for the mandible, 0.62 mm for cervical vertebrae, 0.92 mm for thoracic
Automatic and hierarchical segmentation of the human skeleton in CT images.
Fu, Yabo; Liu, Shi; Li, Hui Harold; Yang, Deshan
2017-02-14
Accurate segmentation of each bone in human skeleton is useful in many medical disciplines. Results of bone segmentation could facilitate bone disease diagnosis and post-treatment assessment, and support planning and image guidance for many treatment modalities including surgery and radiation therapy. As a medium level medical image processing task, accurate bone segmentation can facilitate automatic internal organ segmentation by providing stable structural reference for inter- or intra-patient registration and internal organ localization. Even though bones in CT images can be visually observed with minimal difficulties due to high image contrast between bony structures and surrounding soft tissues, automatic and precise segmentation of individual bones is still challenging due to many limitations in the CT images. The common limitations include low signal-to-noise ratio, insufficient spatial resolution, and indistinguishable image intensity between spongy bones and soft tissues. In this study, a novel and automatic method is proposed to segment all major individual bones of human skeleton above the upper legs in the CT images based on an articulated skeleton atlas. The reported method is capable of automatically segmenting 62 major bones, including 24 vertebrae and 24 ribs, by traversing a hierarchical anatomical tree and by using both rigid and deformable image registration. Degrees of freedom of femora and humeri are modeled to support patients in different body and limb postures. Segmentation results are evaluated using Dice coefficient and point-to-surface error (PSE) against manual segmentation results as ground truth. The results suggest that the reported method can automatically segment and label human skeleton into detailed individual bones with high accuracy. The overall average Dice coefficient is 0.90. The average PSEs are 0.41 mm for mandible, 0.62 mm for cervical vertebrae, 0.92 mm for thoracic vertebrae, and 1.45 mm for pelvis bones.
Cheremkhin, Pavel A.; Krasnov, Vitaly V.; Rodin, Vladislav G.; Starikov, Rostislav S.
2016-11-01
Applications of optical methods for encryption purposes have been attracting interest of researchers for decades. The most popular are coherent techniques such as double random phase encoding. Its main advantage is high security due to transformation of spectrum of image to be encrypted into white spectrum via use of first phase random mask which allows for encrypted images with white spectra. Downsides are necessity of using holographic registration scheme and speckle noise occurring due to coherent illumination. Elimination of these disadvantages is possible via usage of incoherent illumination. In this case, phase registration no longer matters, which means that there is no need for holographic setup, and speckle noise is gone. Recently, encryption of digital information in form of binary images has become quite popular. Advantages of using quick response (QR) code in capacity of data container for optical encryption include: 1) any data represented as QR code will have close to white (excluding zero spatial frequency) Fourier spectrum which have good overlapping with encryption key spectrum; 2) built-in algorithm for image scale and orientation correction which simplifies decoding of decrypted QR codes; 3) embedded error correction code allows for successful decryption of information even in case of partial corruption of decrypted image. Optical encryption of digital data in form QR codes using spatially incoherent illumination was experimentally implemented. Two liquid crystal spatial light modulators were used in experimental setup for QR code and encrypting kinoform imaging respectively. Decryption was conducted digitally. Successful decryption of encrypted QR codes is demonstrated.
Chaos based encryption system for encrypting electroencephalogram signals.
Lin, Chin-Feng; Shih, Shun-Han; Zhu, Jin-De
2014-05-01
In the paper, we use the Microsoft Visual Studio Development Kit and C# programming language to implement a chaos-based electroencephalogram (EEG) encryption system involving three encryption levels. A chaos logic map, initial value, and bifurcation parameter for the map were used to generate Level I chaos-based EEG encryption bit streams. Two encryption-level parameters were added to these elements to generate Level II chaos-based EEG encryption bit streams. An additional chaotic map and chaotic address index assignment process was used to implement the Level III chaos-based EEG encryption system. Eight 16-channel EEG Vue signals were tested using the encryption system. The encryption was the most rapid and robust in the Level III system. The test yielded superior encryption results, and when the correct deciphering parameter was applied, the EEG signals were completely recovered. However, an input parameter error (e.g., a 0.00001 % initial point error) causes chaotic encryption bit streams, preventing the recovery of 16-channel EEG Vue signals.
基于量子Logistic映射的小波域图像加密算法%Image Encryption Algorithm Based on Quantum Logistic Map in Wavelet Domain
Institute of Scientific and Technical Information of China (English)
罗玉玲; 杜明辉
2013-01-01
为增强图像加密算法的安全性和高效性,基于量子Logistic混沌映射和二维离散小波变换,提出了一种结合置乱与扩散的自适应图像加密算法.首先,对图像进行离散小波分解,利用量子Logistic映射产生的随机序列对分解得到的低频子带系数进行排序,对改变后的小波系数分布结构做小波反变换,得到置乱图像；然后,提取新的混沌序列,逐一替换置乱图像的像素,与此同时扰动量子混沌系统完成像素的自适应替换,从而达到更好的扩散效果.实验结果与性能分析表明,该图像加密算法具有密钥空间大、安全性高和运算速度快等特点,并且加密图像灰度值的分布具有类随机的行为.%In order to improve the safety and efficiency of image encryption algorithms,a new adaptive algorithm based on quantum Logistic map and 2D discrete wavelet transform (DWT),which combines confusion and diffusion,is proposed.In this algorithm,first,the original image is decomposed into low-pass subband and high-pass subband coefficients via the DWT,and the low-pass ones are sorted out by using the quantum Logistic map with random sequences,followed by an inverse DWT to obtain a shuffled image.Then,each pixel of the shuffled image is mixed with the chaotic sequence generated by the quantum Logistic system,and the quantum Logistic system is perturbed to substitute for pixel values adaptively.Thus,better diffusion effect is achieved.Experimental results and performance analysis demonstrate that the proposed algorithm is of large key space,high security and high operation speed,etc.,and that it helps to obtain cipher images with random gray distribution.
Fernique, P; Boch, T; Oberto, A; Pineau, F-X; Durand, D; Bot, C; Cambresy, L; Derriere, S; Genova, F; Bonnarel, F
2015-01-01
Scientific exploitation of the ever increasing volumes of astronomical data requires efficient and practical methods for data access, visualisation, and analysis. Hierarchical sky tessellation techniques enable a multi-resolution approach to organising data on angular scales from the full sky down to the individual image pixels. Aims. We aim to show that the Hierarchical progressive survey (HiPS) scheme for describing astronomical images, source catalogues, and three-dimensional data cubes is a practical solution to managing large volumes of heterogeneous data and that it enables a new level of scientific interoperability across large collections of data of these different data types. Methods. HiPS uses the HEALPix tessellation of the sphere to define a hierarchical tile and pixel structure to describe and organise astronomical data. HiPS is designed to conserve the scientific properties of the data alongside both visualisation considerations and emphasis on the ease of implementation. We describe the develop...
Engel, Dave W.; Reichardt, Thomas A.; Kulp, Thomas J.; Graff, David L.; Thompson, Sandra E.
2016-05-01
Validating predictive models and quantifying uncertainties inherent in the modeling process is a critical component of the HARD Solids Venture program [1]. Our current research focuses on validating physics-based models predicting the optical properties of solid materials for arbitrary surface morphologies and characterizing the uncertainties in these models. We employ a systematic and hierarchical approach by designing physical experiments and comparing the experimental results with the outputs of computational predictive models. We illustrate this approach through an example comparing a micro-scale forward model to an idealized solid-material system and then propagating the results through a system model to the sensor level. Our efforts should enhance detection reliability of the hyper-spectral imaging technique and the confidence in model utilization and model outputs by users and stakeholders.
Energy Technology Data Exchange (ETDEWEB)
Engel, David W.; Reichardt, Thomas A.; Kulp, Thomas J.; Graff, David; Thompson, Sandra E.
2016-09-17
Validating predictive models and quantifying uncertainties inherent in the modeling process is a critical component of the HARD Solids Venture program [1]. Our current research focuses on validating physics-based models predicting the optical properties of solid materials for arbitrary surface morphologies and characterizing the uncertainties in these models. We employ a systematic and hierarchical approach by designing physical experiments and comparing the experimental results with the outputs of computational predictive models. We illustrate this approach through an example comparing a micro-scale forward model to an idealized solid-material system and then propagating the results through a system model to the sensor level. Our efforts should enhance detection reliability of the hyper-spectral imaging technique and the confidence in model utilization and model outputs by users and stakeholders.
Automatic Contrast Enhancement of Brain MR Images Using Hierarchical Correlation Histogram Analysis.
Chen, Chiao-Min; Chen, Chih-Cheng; Wu, Ming-Chi; Horng, Gwoboa; Wu, Hsien-Chu; Hsueh, Shih-Hua; Ho, His-Yun
Parkinson's disease is a progressive neurodegenerative disorder that has a higher probability of occurrence in middle-aged and older adults than in the young. With the use of a computer-aided diagnosis (CAD) system, abnormal cell regions can be identified, and this identification can help medical personnel to evaluate the chance of disease. This study proposes a hierarchical correlation histogram analysis based on the grayscale distribution degree of pixel intensity by constructing a correlation histogram, that can improves the adaptive contrast enhancement for specific objects. The proposed method produces significant results during contrast enhancement preprocessing and facilitates subsequent CAD processes, thereby reducing recognition time and improving accuracy. The experimental results show that the proposed method is superior to existing methods by using two estimation image quantitative methods of PSNR and average gradient values. Furthermore, the edge information pertaining to specific cells can effectively increase the accuracy of the results.
Hu, Jinyan; Li, Li; Yang, Yunfeng
2017-06-01
The hierarchical and successive approximate registration method of non-rigid medical image based on the thin-plate splines is proposed in the paper. There are two major novelties in the proposed method. First, the hierarchical registration based on Wavelet transform is used. The approximate image of Wavelet transform is selected as the registered object. Second, the successive approximation registration method is used to accomplish the non-rigid medical images registration, i.e. the local regions of the couple images are registered roughly based on the thin-plate splines, then, the current rough registration result is selected as the object to be registered in the following registration procedure. Experiments show that the proposed method is effective in the registration process of the non-rigid medical images.
Capell, Joyce; Deeth, David
1996-01-01
This paper describes why encryption was selected by Lockheed Martin Missiles & Space as the means for securing ATM networks. The ATM encryption testing program is part of an ATM network trial provided by Pacific Bell under the California Research Education Network (CalREN). The problem being addressed is the threat to data security which results when changing from a packet switched network infrastructure to a circuit switched ATM network backbone. As organizations move to high speed cell-based networks, there is a break down in the traditional security model which is designed to protect packet switched data networks from external attacks. This is due to the fact that most data security firewalls filter IP packets, restricting inbound and outbound protocols, e.g. ftp. ATM networks, based on cell-switching over virtual circuits, does not support this method for restricting access since the protocol information is not carried by each cell. ATM switches set up multiple virtual connections, thus there is no longer a single point of entry into the internal network. The problem is further complicated by the fact that ATM networks support high speed multi-media applications, including real time video and video teleconferencing which are incompatible with packet switched networks. The ability to restrict access to Lockheed Martin networks in support of both unclassified and classified communications is required before ATM network technology can be fully deployed. The Lockheed Martin CalREN ATM testbed provides the opportunity to test ATM encryption prototypes with actual applications to assess the viability of ATM encryption methodologies prior to installing large scale ATM networks. Two prototype ATM encryptors are being tested: (1) `MILKBUSH' a prototype encryptor developed by NSA for transmission of government classified data over ATM networks, and (2) a prototype ATM encryptor developed by Sandia National Labs in New Mexico, for the encryption of proprietary data.
Fully phase-encrypted memory using cascaded extended fractional Fourier transform
Nishchal, Naveen Kumar; Joseph, Joby; Singh, Kehar
2004-08-01
In this paper, we implement a fully phase-encrypted memory system using cascaded extended fractional Fourier transform (FRT). We encrypt and decrypt a two-dimensional image obtained from an amplitude image. The full phase image to be encrypted is fractional Fourier transformed three times and random phase masks are placed in the two intermediate planes. Performing the FRT three times increases the key size, at an added complexity of one more lens. The encrypted image is holographically recorded in a photorefractive crystal and is then decrypted by generating through phase conjugation, the conjugate of the encrypted image. A lithium niobate crystal has been used as a phase contrast filter to reconstruct the decrypted phase image, alleviating the need of alignment in the Fourier plane making the system rugged.
Analysis of double random phase encryption from a key-space perspective
Monaghan, David S.; Situ, Guohai; Ryle, James; Gopinathan, Unnikrishnan; Naughton, Thomas J.; Sheridan, John T.
2007-09-01
The main advantage of the double random phase encryption technique is its physical implementation however to allow us to analyse its behaviour we perform the encryption/decryption numerically. A typically strong encryption scheme will have an extremely large key-space, which will make the probable success of any brute force attack on that algorithm miniscule. Traditionally, designers of optical image encryption systems only demonstrate how a small number of arbitrary keys cannot decrypt a chosen encrypted image in their system. We analyse this algorithm from a key-space perspective. The key-space of an encryption algorithm can be defined as the set of possible keys that can be used to encode data using that algorithm. For a range of problem instances we plot the distribution of decryption errors in the key-space indicating the lack of feasibility of a simple brute force attack.
Institute of Scientific and Technical Information of China (English)
戴晓明; 张薇; 郑志恒; 李镇林
2016-01-01
针对传统的基于身份的加密(IBE)方案不能够对密文直接进行计算这一功能上的缺陷,提出了一个新的IBE方案.该方案利用Gentry等提出的同态转化机制,结合Agrawal等构造的层次型IBE方案,构造了一个具有全同态性质的层次型IBE方案.与Gentry等提出的全同态加密(GSW)方案(GENTRY C,SAHAI A,WATERS B.Homomorphic encryption from learning with errors:conceptually-simpler,asymptotically-faster,attribute-based.CRYPTO 2013:Proceedings of the 33rd Annual Cryptology Conference on Advances in Cryptology.Berlin:Springer,2013:75-92)和Clear等提出的全同态IBE(CM)方案(CLEAR M,MCGOLDRICK C.Bootstrappable identity-based fully homomorphic encryption.CANS 2014:Proceedings of 13th International Conference on Cryptology and Network Security.Berlin:Springer,2014:1-19)相比,该方案构造方法更加自然,空间复杂度由立方级降低到平方级,效率更高.在当前云计算背景下,有助于基于容错学习(LWE)的全同态加密方案从理论向实践转化.通过性能分析并在随机预言机模型下验证了所提方案具有完全安全下的选择明文攻击(IND-ID-CPA)安全性.
加密医学图像中的视觉无损信息隐藏算法%A Visual Lossless Data Hiding Method in Encrypted Medical Images
Institute of Scientific and Technical Information of China (English)
郑洪英; 彭钟贤; 肖迪
2014-01-01
提出了一种医学图像加密域的视觉无损信息隐藏算法，其结合了密码与信息隐藏技术，保护了图像的机密性，可验证图像的真实性。算法首先利用边缘检测技术获得医学图像主要信息作为无损区域，再对图像加密，并将设计的头部嵌入加密医学图像中。水印嵌入者获得加密图像后，提取头部，再在非主要区域嵌入水印。接收方可以根据密钥类型进行相应的操作。实验结果表明，该算法具有较高的嵌入容量和峰值信噪比值。%A visual lossless data hiding method in encrypted medical images is proposed in this paper , which effectively combines the encryption and the data hiding methods to achieve confidence and integrity of the medical images .First ,the main information of a medical image is detected by an edge detection tech‐nique and taken as a lossless and important region .Then ,the medical image is encrypted ,and the head composed of the edge information is embedded into it .When the data‐hider gets the encrypted medical im‐age ,the head is first extracted ,then the binary embedding information is embedded into the unimportant region ,and the main information of the medical image is unchanged to complete diagnosis .For the receiv‐er ,there are four operations according to the keys which he owns .An experiment shows that the informa‐tion capacity and PSNR values are improved .
Directory of Open Access Journals (Sweden)
Hossein Pourghassem
2010-10-01
Full Text Available The conversion of document image to its electronic version is a very important problem in the saving, searching and retrieval application in the official automation system. For this purpose, analysis of the document image is necessary. In this paper, a hierarchical classification structure based on a two-stage segmentation algorithm is proposed. In this structure, image is segmented using the proposed two-stage segmentation algorithm. Then, the type of the image regions such as document and non-document image is determined using multiple classifiers in the hierarchical classification structure. The proposed segmentation algorithm uses two algorithms based on wavelet transform and thresholding. Texture features such as correlation, homogeneity and entropy that extracted from co-occurrenc matrix and also two new features based on wavelet transform are used to classifiy and lable the regions of the image. The hierarchical classifier is consisted of two Multilayer Perceptron (MLP classifiers and a Support Vector Machine (SVM classifier. The proposed algorithm is evaluated on a database consisting of document and non-document images that provides from Internet. The experimental results show the efficiency of the proposed approach in the region segmentation and classification. The proposed algorithm provides accuracy rate of 97.5% on classification of the regions.
Hierarchical image feature extraction by an irregular pyramid of polygonal partitions
Energy Technology Data Exchange (ETDEWEB)
Skurikhin, Alexei N [Los Alamos National Laboratory
2008-01-01
We present an algorithmic framework for hierarchical image segmentation and feature extraction. We build a successive fine-to-coarse hierarchy of irregular polygonal partitions of the original image. This multiscale hierarchy forms the basis for object-oriented image analysis. The framework incorporates the Gestalt principles of visual perception, such as proximity and closure, and exploits spectral and textural similarities of polygonal partitions, while iteratively grouping them until dissimilarity criteria are exceeded. Seed polygons are built upon a triangular mesh composed of irregular sized triangles, whose spatial arrangement is adapted to the image content. This is achieved by building the triangular mesh on the top of detected spectral discontinuities (such as edges), which form a network of constraints for the Delaunay triangulation. The image is then represented as a spatial network in the form of a graph with vertices corresponding to the polygonal partitions and edges reflecting their relations. The iterative agglomeration of partitions into object-oriented segments is formulated as Minimum Spanning Tree (MST) construction. An important characteristic of the approach is that the agglomeration of polygonal partitions is constrained by the detected edges; thus the shapes of agglomerated partitions are more likely to correspond to the outlines of real-world objects. The constructed partitions and their spatial relations are characterized using spectral, textural and structural features based on proximity graphs. The framework allows searching for object-oriented features of interest across multiple levels of details of the built hierarchy and can be generalized to the multi-criteria MST to account for multiple criteria important for an application.
Hierarchical design of a polymeric nanovehicle for efficient tumor regression and imaging
An, Jinxia; Guo, Qianqian; Zhang, Peng; Sinclair, Andrew; Zhao, Yu; Zhang, Xinge; Wu, Kan; Sun, Fang; Hung, Hsiang-Chieh; Li, Chaoxing; Jiang, Shaoyi
2016-04-01
Effective delivery of therapeutics to disease sites significantly contributes to drug efficacy, toxicity and clearance. Here we designed a hierarchical polymeric nanoparticle structure for anti-cancer chemotherapy delivery by utilizing state-of-the-art polymer chemistry and co-assembly techniques. This novel structural design combines the most desired merits for drug delivery in a single particle, including a long in vivo circulation time, inhibited non-specific cell uptake, enhanced tumor cell internalization, pH-controlled drug release and simultaneous imaging. This co-assembled nanoparticle showed exceptional stability in complex biological media. Benefiting from the synergistic effects of zwitterionic and multivalent galactose polymers, drug-loaded nanoparticles were selectively internalized by cancer cells rather than normal tissue cells. In addition, the pH-responsive core retained their cargo within their polymeric coating through hydrophobic interaction and released it under slightly acidic conditions. In vivo pharmacokinetic studies in mice showed minimal uptake of nanoparticles by the mononuclear phagocyte system and excellent blood circulation half-lives of 14.4 h. As a result, tumor growth was completely inhibited and no damage was observed for normal organ tissues. This newly developed drug nanovehicle has great potential in cancer therapy, and the hierarchical design principle should provide valuable information for the development of the next generation of drug delivery systems.Effective delivery of therapeutics to disease sites significantly contributes to drug efficacy, toxicity and clearance. Here we designed a hierarchical polymeric nanoparticle structure for anti-cancer chemotherapy delivery by utilizing state-of-the-art polymer chemistry and co-assembly techniques. This novel structural design combines the most desired merits for drug delivery in a single particle, including a long in vivo circulation time, inhibited non-specific cell uptake
A New Measurement Method of Iimage Encryption
Energy Technology Data Exchange (ETDEWEB)
Yu, X Y [College of Measurement-Control Tech and Communications Engineering, Harbin University of Science and Technology, Harbin, 150080 (China); Zhang, J [College of Measurement-Control Tech and Communications Engineering, Harbin University of Science and Technology, Harbin, 150080 (China); Ren, H E [Information and Computer Engineering College, Northeast Forestry University, Harbin, 150000 (China); Li, S [College of Measurement-Control Tech and Communications Engineering, Harbin University of Science and Technology, Harbin, 150080 (China); Zhang, X D [College of Measurement-Control Tech and Communications Engineering, Harbin University of Science and Technology, Harbin, 150080 (China)
2006-10-15
Image scrambling transformation is applied widely in the digital watermarking and image encryption. Although more and more scrambling algorithms appear, they lack a method to evaluate the image scrambling degree. According to the relative differences of a point and adjacent point in scrambling front and back, a new method which judges the scrambling degree is proposed. Not only it can evaluate the change of each pixel's position, but also evaluate the change of adjacent pixel's value. Apply Matlab to the simulation experiment, the result indicated that this method can evaluate image scrambling degree well, and it accorded with people's vision too.
Institute of Scientific and Technical Information of China (English)
底晓强; 母一宁; 李锦青; 杨华民
2014-01-01
Since chaos is sensitive for initial values, it is very suitable for data encryption. An image encryption algorithm based on hyper- chaotic control parameters and mixed scrambling diffusion structure of higher- order chaotic system was presented. The encryption algorithm included scrambling step and diffusion step. In the scrambling step, the composite chaotic map was used to generate the alignment phase control parameters and scramble for the high- level image cross- correlation between the adjacent pixels. In the diffusion step, the composite chaotic map with the different initial states and parameters was used to generate the initial conditions for hyper- chaotic cellular neural networks in order to generate the key stream. This method was evaluated by known plaintext attack and chosen plaintext attack, key space, image histogram, and simulations show good results. Compared with several other related algorithms, it has better anti- aggressive and key sensitivity is high. It can be applied to the image encryption.%混沌对初值敏感的特性使得它适合于数据加密。以4阶CNN模型为基础，提出了一种新的超混沌细胞神经网络图像加密算法。算法分为置乱和扩散二个阶段，复合混沌映射用于生成置乱阶段控制参数，用以置乱图像行列之间的高度互相关像素。在扩散阶段，使用不同初始状态和参数的复合混沌映射生成高阶混沌细胞神经网络的初始条件，以生成扩散阶段的密钥流。算法的已知明文和选择明文攻击、密钥空间和直方图的仿真实验均取得了良好的结果。与其他相关算法相比，该算法具有密钥敏感性和抗攻击性强的优点，适用于图像加密。
Computer Security Team
2013-01-01
Sigh! Pandora’s box has been opened (once again). Recent documents leaked by whistle-blower Edward Snowden have revealed that the NSA project “Bullrun” is intruding deeply into the confidentiality of our documents and the privacy of our lives. In their continuous effort to kill privacy on the Internet, the US National Security Agency (NSA) and the British Government Communications Headquarters (GCHQ) have made significant progress in breaking almost every basic encryption protocol or have developed the means to bypass them. “US and British intelligence agencies have successfully cracked much of the online encryption relied upon by hundreds of millions of people to protect the privacy of their personal data, online transactions and e-mails.” - The Guardian So what’s left? With “Prism” and “Tempora”, our public communication on the Internet was already filtered and analysed (see our Bulletin ar...
IT Department
2011-01-01
This week FTP (the file transfer protocol) celebrated its 40th birthday - and will hopefully retire soon! While a nice and simple means of transferring files, it is totally insecure: both the transferred contents and the authentication password are transfered unencrypted. FTP is not the only protocol that transfers data unencrypted: standard web traffic (“HTTP”) and e-mail (“SMTP”) are not encrypted either. Not an issue? Think again! Nowadays, we all use wireless Ethernet from our laptops and mobile phones. This means that your traffic can be intercepted by anyone*… What if I could your web browsing history, read your last e-mail to your boyfriend/girlfriend, or see which commands you’ve just executed? I could easily intercept your Facebook session… If this worries you, check for secrecy and encryption. Usually this is shown by an “S” in your communication protocol: · “HTTPS&...
Primal implication as encryption
Krupski, Vladimir
2013-01-01
We propose a "cryptographic" interpretation for the propositional connectives of primal infon logic introduced by Y. Gurevich and I. Neeman and prove the corresponding soundness and completeness results. Primal implication $\\imp{\\varphi}{\\psi}$ corresponds to the encryption of $\\psi$ with a secret key $\\varphi$, primal disjunction $\\vp{\\varphi}{\\psi}$ is a group key and $\\bot$ reflects some backdoor constructions such as full superuser permissions or a universal decryption key. For the logic ...
Automated hierarchical time gain compensation for in-vivo ultrasound imaging
Moshavegh, Ramin; Hemmsen, Martin C.; Martins, Bo; Brandt, Andreas H.; Hansen, Kristoffer L.; Nielsen, Michael B.; Jensen, Jørgen A.
2015-03-01
Time gain compensation (TGC) is essential to ensure the optimal image quality of the clinical ultrasound scans. When large fluid collections are present within the scan plane, the attenuation distribution is changed drastically and TGC compensation becomes challenging. This paper presents an automated hierarchical TGC (AHTGC) algorithm that accurately adapts to the large attenuation variation between different types of tissues and structures. The algorithm relies on estimates of tissue attenuation, scattering strength, and noise level to gain a more quantitative understanding of the underlying tissue and the ultrasound signal strength. The proposed algorithm was applied to a set of 44 in vivo abdominal movie sequences each containing 15 frames. Matching pairs of in vivo sequences, unprocessed and processed with the proposed AHTGC were visualized side by side and evaluated by two radiologists in terms of image quality. Wilcoxon signed-rank test was used to evaluate whether radiologists preferred the processed sequences or the unprocessed data. The results indicate that the average visual analogue scale (VAS) is positive ( p-value: 2.34 × 10-13) and estimated to be 1.01 (95% CI: 0.85; 1.16) favoring the processed data with the proposed AHTGC algorithm.
A novel chaotic encryption scheme based on pseudorandom bit padding
Sadra, Yaser; Fard, Zahra Arasteh
2012-01-01
Cryptography is always very important in data origin authentications, entity authentication, data integrity and confidentiality. In recent years, a variety of chaotic cryptographic schemes have been proposed. These schemes has typical structure which performed the permutation and the diffusion stages, alternatively. The random number generators are intransitive in cryptographic schemes and be used in the diffusion functions of the image encryption for diffused pixels of plain image. In this paper, we propose a chaotic encryption scheme based on pseudorandom bit padding that the bits be generated by a novel logistic pseudorandom image algorithm. To evaluate the security of the cipher image of this scheme, the key space analysis, the correlation of two adjacent pixels and differential attack were performed. This scheme tries to improve the problem of failure of encryption such as small key space and level of security.