Proposed Encryption Technique Research Articles

Image compression and encryption using chinese remainder theorem

The proposed encryption technique uses Chinese Remainder Theorem (CRT) and hash map to generate and distribute secret co-prime keys to participants. It utilizes the fact that CRT gives a unique solution for the set of congruent equations if and only if the modulus values are relatively co-prime to each other i.e., Greatest Common Divisor (GCD) of moduli is equal to 1. In this paper, we have proposed secret image sharing scheme using CRT and obtained results on grayscale images of different dimensions. The proposed technique not only increases randomness in encrypted image but also compresses the image, resulting in easy storage and fast transmission. As compression ratio is dependent on shared keys, all shared keys are essential for recovering image without any noise, absence of any key gives an image which is deviated from our original image. For r participants, r pixels are encrypted and compressed simultaneously at a time using CRT which gives one encrypted unique value corresponding to those r pixels. As this encrypted value can be greater than 255, hash map is used to store this value. The experimental results show that the encrypted image is compressed, is not disclosing any secret information and recovery of original image is loss-less.

A novel approach to encrypt multiple images using multiple chaotic maps and chaotic discrete fractional random transform

Due to recent advances in network technology, it has become easier to send multiple images together. Hence, image encryption using multiple images is an emerging area of interest amidst researchers. The paper proposes a multiple-image encryption technique based on the chaotic confusion-diffusion strategy and chaotic Discrete Fractional Random Transform (DFRNT). Initially, odd and even bits of three input images (M × N) are separated and a composite image (3M × 2N) is derived by combining the even and odd bits of every image. Secondly, chaotic confusion-diffusion strategy using four chaotic maps Arnold Cat Map (ACM), Logistic-Tent Map (LTM), Logistic-Sine Map (LSM) and Tent-Sine Map (TSM) is applied to scramble and diffuse the pixel values of the composite image. Thereafter, three diffused images are extracted from the diffused composite image. Finally, chaotic DFRNT uses Tent-Sine Map (TSM) to generate the random kernel transform matrix for itself and encrypt the extracted images into a single image. The parameters Histogram, Correlation distribution (CD), Correlation Coefficient (CC), Entropy, Number of Pixel Change Rate (NPCR) and Unified Averaged Changed Intensity (UACI) have been computed to show the potential of the proposed encryption technique.

Security enhancement for OFDM-PON using Brownian motion and chaos in cell.

We propose a novel security enhancement technique for a physical layer secure orthogonal frequency division multiplexed passive optical network (OFDM-PON) based on three-dimensional Brownian motion and chaos in cell (3DBCC). This method confuses an OFDM symbol via transforming it into a 3D symbol matrix and a 3D cell matrix with different size lengths. Different dividing-confusion rules then generate different complementary cumulative distribution functions (CCDFs) of peak-to-average power ratio (PAPR). And we can pre-estimate bit error rate (BER) performance by calculating the CCDF values. We also find that the processing time decreases with the matrix's side length decreasing simultaneously. A new weighted comprehensive value (Qw) is further used to evaluate the overall performance between the processing time and the BER. Finally, an experiment successfully demonstrates a physical layer secure OFDM signal transmission with 22.06-Gb/s data rate over a 25.4-km standard single mode fiber (SSMF). These results indicate that cell (53) has the weighted optimum overall performance, which verifies that the proposed encryption technique is promising for building a physical layer security enhanced OFDM-PON system with a low processing time delay and a good BER for future access network systems.

Secure multi–level permutation operation based multiple colour image encryption

In recent days, there is a high demand of encryption of multiple digital images for secure transmission of multiple images. This paper proposes a multi-level permutation operation based secure multiple colour image encryption technique which is totally different than the currently used multiple image encryption techniques. The proposed encryption technique uses three levels of permutation operation: the first level of permutation operation performs pixel-shuffling operations in R, G, and B components, itself; the second level of permutation operation performs row-shuffling operations in between the pixel-shuffled R, G, and B components; the third level of permutation operation performs column-shuffling operations in between the row-shuffled components. At last, the proposed encryption algorithm performs block-diffusion operations to get the final encrypted images. Multi-level permutation operations and diffusion operation only use PWLCM systems multiple times to make the algorithm more secure and stronger. Multiple PWLCM systems in multi-level permutation operations not only produces larger key space and higher key sensitivity but also generates greater randomness of pixels and weaker correlation of adjacent pixels in images as compared to the currently used multiple image encryption techniques. In addition the secret keys which are used in this proposed algorithm not only depends on the original key values but also depends on the original colour images. This protects the algorithm against known-plaintext attack and chosen-plaintext attack. The simulation results and the security analysis indicate that the proposed algorithm has good encryption results, large secret-key space, higher sensitivity towards secret keys and the plaintext, weaker correlation of adjacent pixels, greater randomness of pixels, and enough resistance against various common attacks.

Secure chaotic dual encryption scheme for H.264/AVC video conferencing protection

This study presents a chaos-based crypto-compression scheme to protect the H.264 advanced video coding (AVC) used for the applications of video conference. To this end, a selective encryption approach was adopted. The authors proposed to encrypt the inter-prediction, the intra-prediction and the context adaptive variable length coding. The format compliance and compression ratio are conserved. Their encryption method is based on two piecewise linear chaotic maps for pseudo-random bit generators. The first is considered as a decision module to choose either to encrypt or not, whereas the second is used for the encryption. The proposed encryption techniques were developed and discussed, and their experimental results indicate that the scheme is secure and very efficient according to the computing times. Moreover, it is suitable for real-time application and convenient for all the H.264/AVC profiles or even with other video compression standards.

Quantum-assisted CR directed encrypted biomedical signal transmission using knight's tour

Exchange of biomedical data through the internet has achieved tremendous success in the recent past, with the necessity of security in every transmission. It has become indispensable to replenish secrecy in biomedical data by avoiding the access of illegitimate users. To evade such disclosure of medical data, a proposal of encryption system along with Cognitive Radio (CR) has been employed. In this paper, CR has been programmed to choose the non-availability of the primary user and by automatically detecting the presence of available spectrum in the channel using Universal Software Radio Peripheral (USRP). Then using the identified free spectrum, encrypted medical data has been transmitted and exchanged between the authenticated users in rural healthcare units. The proposed encryption technique initiates Latin Square Image Cipher (LSIC) which offers double encryption by making use of two different random keys. Then the output has been subjected to a quantum computation encryption method in which Quantum Walks (QW) serves as a key generator which is meant for its natural nonlinear chaotic behaviour. QW is followed up by the disintegration of Knight’s tour permutation process which helps in tamper proofing and authentication. Finally, shear based affine transform has been employed to avoid imperfections in the medical data. The proposed scheme curtails the insecure medical image communication in biomedical research by creating an authenticated communication link among peers. Metrics such as Number of Pixel Changing Rate (NPCR), Unified Average Changing Intensity (UACI), correlation coefficients, chi-square tests, global and local entropies were estimated and compared with the available literature results.

An Innovative Application of Virus Taxonomy and Nomenclatures in the Information Technology

Network Security has always been under constant threat of numerous types of attack. The research idea presented here is to use invisibility of virus as a data carrier and data itself. The basic objective is to propose the design to develop a Virus- the organism based communication system for intelligence information transfer; A secure data communication through V-technology. The taxonomy tree and the anatomical structure of virus is used as an encrypted data packet. The basic simulations are performed on Proteus platform. The most suitable of all is to use virus taxonomy as an encryption tool that is using the existing communication system with the proposed encryption technique. This idea shall extend the application of bio technology and biomedical engineering in communication systems.

A Secure Cloud Storage using ECC-Based Homomorphic Encryption

This paper presents a new homomorphic public-key encryption scheme based on the elliptic curve cryptography (HPKE-ECC). This HPKE-ECC scheme allows public computation on encrypted data stored on a cloud in such a manner that the output of this computation gives a valid encryption of some operations (addition/multiplication) on original data. The cloud system (server) has only access to the encrypted files of an authenticated end-user stored in it and can only do computation on these stored files according to the request of an end-user (client). The implementation of proposed HPKE-ECC protocol uses the properties of elliptic curve operations as well as bilinear pairing property on groups and the implementation is done by Weil and Tate pairing. The security of proposed encryption technique depends on the hardness of ECDLP and BDHP.

A new image encryption technique combining Elliptic Curve Cryptosystem with Hill Cipher

Image encryption is rapidly increased recently by the increasing use of the internet and communication media. Sharing important images over unsecured channels is liable for attacking and stealing. Encryption techniques are the suitable methods to protect images from attacks. Hill cipher algorithm is one of the symmetric techniques, it has a simple structure and fast computations, but weak security because sender and receiver need to use and share the same private key within a non-secure channels. A new image encryption technique that combines Elliptic Curve Cryptosystem with Hill Cipher (ECCHC) has been proposed in this paper to convert Hill cipher from symmetric technique to asymmetric one and increase its security and efficiency and resist the hackers. Self-invertible key matrix is used to generate encryption and decryption secret key. So, no need to find the inverse key matrix in the decryption process. A secret key matrix with dimensions 4×4 will be used as an example in this study. Entropy, Peak Signal to Noise Ratio (PSNR), and Unified Average Changing Intensity (UACI) will be used to assess the grayscale image encryption efficiency and compare the encrypted image with the original image to evaluate the performance of the proposed encryption technique.

NEURAL NETWORK-BASED DOUBLE ENCRYPTION FOR JPEG2000 IMAGES

The JPEG2000 is the more efficient next generation coding standard than the current JPEG standard. It can code files witless visual loss, and the file format is less likely to be affected by system file or bit errors. On the encryption side, the current 128-bit image encryption schemes are reported to be vulnerable to brute force. So there is a need for stronger schemes that not only utilize the efficient coding structure of the JPEG2000, but also apply stronger encryption with better key management. This research investigated a two-layer 256-bit encryption technique proposed for the JPEG2000 compatible images. In the first step, the technique used a multilayer neural network with a 128-bit key to generate single layer encrypted sequences. The second step used a cellular neural network with a different 128-bit key to finally generate a two-layer encrypted image. The projected advantages were compatible with the JPEG2000, 256-bit long key, managing each 128-bit key at separate physical locations, and flexible to opt for a single or a two-layer encryption. In order to test the proposed encryption technique for robustness, randomness tests on random sequences, correlation and histogram tests on encrypted images were conducted. The results show that random sequences pass the NIST statistical tests and the 0/1 balancedness test; the bit sequences are decorrelated, and the histogram of the resulting encrypted images is fairly uniform with the statistical properties of those of the white noise.

Optical encryption with protection against Dirac delta and plain signal attacks.

This Letter proposes an optical encryption technique that disguises the information with modular arithmetic concepts and time-varying noise components that are unknown to the receiver. Optical encryption systems that use these techniques produce a nondeterministic system response, as well as noise like image data that can easily be generated with ordinary spatial light modulators. The principle of this technique is demonstrated for the double random phase encoding (DRPE) method. The conventional DRPE method has major vulnerabilities for Dirac signal and plain signal attacks, making them impractical for secure encryption. It is shown that the proposed encryption technique provides a robustness against these types of attacks, allowing optical DRPE to be employed in secure encryptions. Moreover, applications of this Letter are not limited to DRPE alone but can also be adopted by other optical encryption techniques such as fractional Fourier transform and Fresnel-transform-based techniques.

An Encryption Technique for Provably Secure Transmission from a High Performance Computing Entity to a Tiny One

An encryption/decryption approach is proposed dedicated to one-way communication between a transmitter which is a computationally powerful party and a receiver with limited computational capabilities. The proposed encryption technique combines traditional stream ciphering and simulation of a binary channel which degrades channel input by inserting random bits. A statistical model of the proposed encryption is analyzed from the information-theoretic point of view. In the addressed model an attacker faces the problem implied by observing the messages through a channel with random bits insertion. The paper points out a number of security related implications of the considered channel. These implications have been addressed by estimation of the mutual information between the channel input and output and estimation of the number of candidate channel inputs for a given channel output. It is shown that deliberate and secret key controlled insertion of random bits into the basic ciphertext provides security enhancement of the resulting encryption scheme.

Secure Computation on Cloud Storage

This paper describes a way by which computation on cloud storage is securely possible. A user stores their secret (encrypted) files on cloud storage and later on, retrieves an addition of their original files, however, the cloud system cannot decrypt the stored encrypted files by own. In this paper, the authors use the homomorphic property to securely compute the addition of the files. The implementation of their proposed protocol is based on the computation on the basic properties of elliptic curves and bilinear mapping. The security of proposed encryption technique depends on the hardness of elliptic curve operations.

Image Encryption and Authentication Scheme using 3D Chaotic Map

Cryptographic techniques are in demand due to vast development in application of information transmission and communication. Image encryption and authentication schemes have been continuously studied to meet the demand of secure image transmission through networks. A number of effective chaos-based image encryption and authentication schemes have been proposed. The intent of this paper is to propose an image encryption and authentication scheme using chaotic map. Arnold cat map is used for diffusion as well as for substitution. This paper applies an alternate structure of the classic block cipher applied with Arnold Cat map is used for encryption and hash function is used for Authentication purpose. The paper that is being followed uses a keyed hash function is introduced to generate hash values from both the plain-image and the secret hash keys[1], which leads to large computational time, whereas our schemes computational time is less as compared to the previous. The experimental results show that the proposed encryption technique is efficient and has high security features.

Enhance Steganography Techniques: A Solution for Image Security

Steganography word is making from two words: one is Steganos that means “covered or secret” and second is the graphic that means “writing”. Similarly Cryptography word is also making from two words: one is Crypto that means “Alter original word Meaning” and second is the graphic that means “writing”. In this work, Enhance Steganography technique with cryptograph technique is proposed, developed and analyzed. The proposed technique encrypts the confidential image by the proposed encryption technique initially and then hides the cipher image by Steganography technique which is using randomization techniques during selection of LSB. The results of the proposed technique are discussed and analyzed based on the peek signal to noise ratio (PSNR) and Correlation. The proposed technique is simple, fast secure and efficient, it strong to attack and better the image quality.

Secure Crypto and ECG Steganography Based Data Communication for Wireless Body Sensor Network

The acquisition, processing and secure transmission of a patient’s physiological and physical parameters to a remote location has been done by Patient Tele monitoring System (PTS). The PTS uses the wireless channel for communication of patient’s data which is not secure as wireless channel is open for information being hacked by unauthorized person easily , where there is no patient’s privacy thereby this project proposes the improvement of protection system for secret data communication through encrypted data concealment in ECG signals. The proposed encryption technique is the chaos cryptography technique which encrypts the confidential data in to unreadable form and it is concealed in to the high frequency coefficient of the Wavelet decomposed ECG signals by the data hider. The reversible data hider technique and LSB replacement algorithm is used for concealing the secret message bits into the high frequency coefficients. In the data extraction module relevant key is used to extract the secret data and decryption keys are used to get back original information .Finally the performance of the proposed technique and existing technique is analyzed based on image, data recovery and time consumption.

Photon counting imaging and polarized light encoding for secure image verification and hologam watermarking

We propose an optical image security scheme based on polarized light encoding and the photon counting technique. An input image is encoded using the concept of polarized light, which is parameterized using Stokes–Mueller formalism. The encoded image is further encrypted by applying the photon counting imaging technique to obtain a photon limited image. For decryption, the photon limited decrypted image is obtained by using a polarized light decoding scheme with the help of appropriate keys. The decrypted image has sparse representation, which contains sufficient information for verification. This photon counted decrypted image can be verified using correlation filters. The proposed encryption technique offers benefits over the double random phase encoding in that it does not require active elements such as a lens and provides flexibility in the design of encryption keys. The proposed encryption scheme has also been used for hologram watermarking. The computer simulation results for secure image verification and the hologram watermarking scheme have been presented.

Biometric Inspired Multimedia Encryption Based on Dual Parameter Fractional Fourier Transform

In this paper, a novel biometric inspired multimedia encryption technique is proposed. For this purpose, a new advent in the definition of fractional Fourier transform, namely, dual parameter fractional Fourier transform (DP-FrFT) is proposed and used in multimedia encryption. The core idea behind the proposed encryption technique is to obtain biometrically encoded bitstream followed by the generation of the keys used in the encryption process. Since the key generation process of encryption technique directly determines the security of the technique. Therefore, this paper proposes an efficient method for generating biometrically encoded bitstream from biometrics and its usage to generate the keys. Then, the encryption of multimedia data is done in the DP-FrFT domain with the help of Hessenberg decomposition and nonlinear chaotic map. Finally, a reliable decryption process is proposed to construct original multimedia data from the encrypted data. Theoretical analyses and computer simulations both confirm high security and efficiency of the proposed encryption technique.

Chaos Based Image Encryption using Expand-Shrink Concept

Image information security plays a vital role in computing and communication technologies. This paper describes a new concept of expand and shrink to enhance the strength of chaos based image encryption technique. This method consists of both permutations as well as substitution process for image scrambling and encryption. In permutation plain image is shuffled using chaos technique. Input image undergo two times chaos permutation in-between expand and shrink process leads to substitution. Permutation decreases the correlation between the pixel and substitution increases the entropy of encrypted image. Proposed encryption technique works for both gray-scale and color image. From the experiment highly scrambled image is obtained at the end of encryption process. Decryption process employs exactly reverse process of encryption which results in the reconstructed images.

A Novel Encryption Scheme based on Piecewise Linear Chaotic Maps for Multimedia Data

recent years, many multimedia and image encryption techniques based on chaotic maps have been proposed. In this paper, we propose a novel multimedia data encryption technique called MDEA (Multimedia Data Encryption Algorithm). Proposed encryption scheme is based on two digital chaotic maps, which in turn are used to generate two different chaotic sequences. Detail description of the proposed encryption technique and performance analysis of MDEA on various parameters of security is given in later sections of this paper.