AbstractMost of existing image encryption schemes are proposed in the spatial domain which easily destroys the correlation between pixels. This paper proposes an image encryption scheme by employing discrete cosine transform (DCT), quantum logistic map and substitution-permutation network (SPN). The DCT is used to transform the images in the frequency domain. Meanwhile, the SPN is used to provide the security properties of confusion and diffusion. The SPN provides fast encryption as compared to the asymmetric based image encryption since operations with low computational complexity are used (e.g., exclusive-or and permutation). Different statistical experiments and security analysis are performed against six grayscale and color images to justify the effectiveness and security of the proposed image encryption scheme.

The issue of protecting the information from penetration has become an important issue. The system that depends on the encryption ensures the confidentiality of the information non-disclosure of sensitive information but does not ensure the integrity of data from destruction and change. In this paper, a proposed system is designed to protect the confidentiality and integrity of data from penetration, disclosure, and destruction. The proposed system based on the polynomial numbers of GF (𝟐𝟖) is achieved by improving the encryption approach using the idea of the magic square and the linear equation system also uses improving the digital signature method for ensuring that data is not changed or modified. The system has higher encryption and decryption throughput (548.924Kb /sec), (548.924 Kb /sec) and acceptable value 0.759294 of the randomness data according to the NIST randomness tests as well as a high confusion and diffusion in cipher text based on the ratio of Avalanche effect test.

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

Today, the majority of industries used Hadoop for processing their data. Hadoop is an open-source and programming based framework that has many components. One of them is HDFS (Hadoop Distributed Files System) that is used to stored data. Hadoop by default does not have any security mechanism. According to the previous study authentication, authorization, and Data encryption are the principal techniques to enhance the security in HDFS. As huge volume of data is stored in HDFS, encryption of massive data will consume more time and need more resources for operations. In this paper we have developed one DNA based that used confusion and Diffusion for securing data in HDFS. This proposed algorithm is efficient as compared to other encryption algorithm.

 Data is a file that can be confidential so it requires a data security process to maintain confidentiality.  Kripotgrrafi is a data security process that can be used based on the use of algorithms, one of which is AES.  AES is a modern algorithm that can be modified to improve confusion and diffusion in cryptography.  AES combination can be done using Polybius which has cryptographic diffusion properties.  This study modified the AES using 6x6 and 10x10 polybius matrices that were performed on plaintext and plaintext and keys.  Analysis was carried out based on the highest bit change rate found in modification II in the plaintext and 6x6 matrix keys, which amounted to 51.8% using the avalanche effect test.  The results of the AE compared to the expected results using chi square with the modified AES results can increase the AE by 5% with the real level is 0,05 and the degree of freedom is 4 . Execution time was tested in this study with the results of the AES modification time longer than the standard AES because the complexity of the algorithm affects both encryption and decryption time.Abstract Data is a file that can be confidential so it requires a data security process to maintain confidentiality.  Kripotgrrafi is a data security process that can be used based on the use of algorithms, one of which is AES.  AES is a modern algorithm that can be modified to improve confusion and diffusion in cryptography.  AES combination can be done using Polybius which has cryptographic diffusion properties.  This study modified the AES using 6x6 and 10x10 polybius matrices that were performed on plaintext and plaintext and keys.  Analysis was carried out based on the highest bit change rate found in modification II in the plaintext and 6x6 matrix keys, which amounted to 51.8% using the avalanche effect test.  The results of the AE compared to the expected results using chi square with the modified AES results can increase the AE by 5% with the real level is 0,05 and the degree of freedom is 4 . Execution time was tested in this study with the results of the AES modification time longer than the standard AES because the complexity of the algorithm affects both encryption and decryption time.

A substitution box is a core component of the popular symmetric-key algorithms. However, the major problem of the conventional substitution boxes is the statistic behavior, which is employed as a fixed-size lookup table. To solve the fixed-size lookup table problem, various substitution box construction methods were proposed with key control, but it is hard to enhance all cryptographic properties, for example, linear and differential probabilities. Thus, chaos is applied for key control in designing robust substitution boxes due to unpredictable and random-like behavior. Moreover, the confusion and diffusion properties of cryptography can be achieved by chaos. This article introduces an efficient construction of a key-dependent substitution box based on the mixing property of the chaotic sine map. The substitution box so constructed has very low differential and linear approximation probabilities. The experimental results confirmed that the proposed method to construct substitution box has acceptable cryptographic properties to resist against various cryptanalysis.

Confusion and diffusion are the frequently used embryonics in multimedia (image) encryption systems. Multimedia data protection against cryptanalysis can be effectually fortified by these techniques. Due to inherent properties of images such as high inter-pixel redundancy and bulk data capacity, encryption is performed in two stages: Confusion and Diffusion. In this article, a combined Pseudo Hadamard transformation in the confusion stage and Gingerbreadman chaotic substitution in the diffusion stage are used in the encryption phase of the algorithm. The strong correlation between contiguous elements in the host image is effectually reduced using Pseudo Hadamard transformation and entropy in the cipher image is enhanced using Gingerbreadman chaotic substitution. Secrete key length used in the algorithm is 128 bits, these are the initial conditions for Gingerbreadman chaotic generator. The elements of S-box in the substitution stage are considered from this random sequence generator. Experimental exploration including information entropy, correlation analysis, sensitivity analysis, key space analysis and computational complexity have been performed on set of standard images. Results obtained are better compared to many existing systems.

The integrity violation of remote data draws more significance after the advent of cloud solutions. The conventional digest functions like MD4, MD5, SHA-160, SHA-2 family, and SHA-3 family provide a more elegant solution for the aforesaid problem. But the breaking of MD4, MD5, and SHA-160 algorithms and the partisal breaking of the families of SHA-2 and SHA-3 raises concerns about their use on cryptographic applications. In addition, they do not provide the facility to decide the hash output length dynamically at runtime. This work attempts to address the aforesaid problems through polynomial products. The proposed design uses a higher-order two-variables polynomial function to establish the hash output. The application of polynomial function at the block-level helps the proposed design to produce variable length hash output. The experimental analysis of avalanche response, the effect of an avalanche on the hash output nibbles, and the analysis of confusion and diffusion prove the proposed design performs exceedingly well than the conventional algorithms. Therefore, the proposed design could be considered as a more suitable alternative for the conventional keyless digest function in the perspective of security.