From Golden to Unimodular Cryptography

We introduce a natural generalization of the golden cryptography, which uses general unimodular matrices in place of the traditional Q-matrices, and prove that it preserves the original error correction properties of the encryption. Moreover, the additional parameters involved in generating the coding matrices make this unimodular cryptography resilient to the chosen plaintext attacks that worked against the golden cryptography. Finally, we show that even the golden cryptography is generally unable to correct double errors in the same row of the ciphertext matrix, and offer an additional check number which, if transmitted, allows for the correction.Comment: 20 pages, no figure

Joint watermarking and encryption of color images in the Fibonacci-Haar domain

A novel method for watermarking and ciphering color images, based on the joint use of a key-dependent wavelet transform with a secure cryptographic scheme, is presented. The system allows to watermark encrypted data without requiring the knowledge of the original data and also to cipher watermarked data without damaging the embedded signal. Since different areas of the proposed transform domain are used for encryption and watermarking, the extraction of the hidden information can be performed without deciphering the cover data and it is also possible to decipher watermarked data without removing the watermark. Experimental results show the effectiveness of the proposed scheme

Cloud security: literature survey

Today, the growth of digitalization has made the ease for livelihood for all the organizations. Cloud computing the storage provider for all the computer resources has made it easy for accessing the data from anywhere anytime. But at the same time the security for cloud data storage is the major drawback which is provided by various cryptographic algorithms. These algorithms convert the data into unreadable format, known as cipher text, Rivest, Shamir and Adleman (RSA) one of the most popularly used asymmetric algorithm. This paper gives detailed review about such different cryptographic algorithms used for the cloud data security. The comparison study is also made for the size of data and to analyze the encryption time and decryption time, which concludes that to enhance the cloud data security some addon techniques are to be used along with these cryptographic algorithms. To increase the security level and to increase the transmission speed of plaintext, integrated method will be proposed by encoding the plaintext to intermediate plaintext and then intermediate plaintext will be compressed using any one of the compression techniques to increase the compression ratio, lastly the compressed file is encrypted to further enhance the security level

The Determinants, Inverses, Norm, and Spread of Skew Circulant Type Matrices Involving Any Continuous Lucas Numbers

We consider the skew circulant and skew left circulant matrices with any continuous Lucas numbers. Firstly, we discuss the invertibility of the skew circulant matrices and present the determinant and the inverse matrices by constructing the transformation matrices. Furthermore, the invertibility of the skew left circulant matrices is also discussed. We obtain the determinants and the inverse matrices of the skew left circulant matrices by utilizing the relationship between skew left circulant matrices and skew circulant matrix, respectively. Finally, the four kinds of norms and bounds for the spread of these matrices are given, respectively

Performance analysis of gray code number system in image security

The encryption of digital images has become essential since it is vulnerable to interception while being transmitted or stored. A new image encryption algorithm to address the security challenges of traditional image encryption algorithms is presented in this research. The proposed scheme transforms the pixel information of an original image by taking into consideration the pixel location such that two neighboring pixels are processed via two separate algorithms. The proposed scheme utilized the Gray code number system. The experimental results and comparison shows the encrypted images were different from the original images. Also, pixel histogram revealed that the distribution of the plain images and their decrypted images have the same pixel histogram distributions, which means that there is a high correlation between the original images and decrypted images. The scheme also offers strong resistance to statistical attacks