Rounds Of Permutation Research Articles

Chaos based image encryption scheme to secure sensitive multimedia content in cloud storage

Cloud computing offers a variety of on-demand services to users and has gained significant prominence in the contemporary era. The security of information stored in cloud data centers has become a central concern, especially for sensitive data like medical images, videos, and multimedia content that require heightened protection when stored in data centers. Cloud users have a responsibility to ensure the security of their data through strategic measures. Focusing on maintaining the privacy of images stored in the cloud, this research introduces an innovative image encryption technique that is based on a modified Skew Tent chaotic map. The suggested modification to the chaotic map includes combining the Skew Tent map with both the sine trigonometric function and perturbation technology. This results in enhanced randomness, more intricate dynamical behavior, a broader chaotic range, and increased sensitivity to initial values in contrast to alternative chaotic maps. The incorporation of this adapted map into a stepwise procedure, involving two rounds of permutation followed by diffusion, effectively accomplishes image data encryption for cloud storage systems. These consecutive operations collectively enhance the encryption method’s randomness and robustness. Through simulations conducted using Cloudsim, the cipher-image exhibits a uniform distribution and achieves a commendable information entropy score of 7.996749. The encryption algorithm significantly reduces correlation coefficients from 1 in the original image to 0 in the encrypted image, while maintaining NPCR (Number of Pixel Change Rate) and UACI (Unified Average Changing Intensity) values within the critical range. Additionally, both theoretical analysis and practical evaluations confirm the algorithm’s resilience against exhaustive, occlusion, and classical attacks. Moreover, extending this encryption framework to video data, a novel video encryption approach is proposed.

Description, Implementation and Performance/Security Analysis of ASCON128

The aim of the report is to introduce detailed description of the functioning of and to provide an efficient implementation (using bit-sliced implementation of S-Box) in C of encryption, decryption and authentication of the lightweight authenticated encryption algorithm ASCON 128 (sponge based SPN network based on Keccak like operations) as per the v 1.2 submitted to NIST. This is achieved using a sponge construction by setting up initialization state and performing 12 rounds of permutations, XORing consecutively the plaintext blocks (encryption) or ciphertext blocks (decryption) with first 64 bits of the state (after 6 rounds of sponge permutations) and after all consecutive operations on ciphertext/plaintext blocks, XORing the last 128 bits of the resultant state with the secret Key (after 12 rounds of final permutation operations) to produce/re-create the tag. Discussions on Key Features, Performance Analysis (comparison of ASCON 128 v/s AES 128 in GCM mode on our own PC), Performance Comparisons with other NIST lightweight cryptography contest finalists on ARM Cortex M3, and discussions on the Security Analysis (side channel attacks: fault injection and power analysis) of ASCON are included in this report.

Генетическое разнообразие российских и европейских пред-ставителей Dryopteris expansa (C. Presl) Fraser-Jenkins et Jermy (Dryopteridaceae)

The results of molecular genetic analysis (ISSR-PCR) of 112 Dryopteris expansa (C. Presl) Fraser-Jenkins et Jermy specimens collected in Russia and Europe are presented. DNA was extracted using fresh material and material from the herbarium of the South Siberian Botanical Garden (ALTB): the collection of fresh material was carried out during expeditions (40 samples from Perm Krai, Moscow, Smolensk and Tver regions), the selection of material from the herbarium was carried out by removing a part of the dried frond (72 samples from various regions of Russia and Europe). An analysis of DNA polymorphism and the genetic structure of the studied groups with the calculation of the proportion (P95) of polymorphic loci, the absolute (na) number of alleles, the effective (ne) number of alleles, the expected (HE) heterozygosity and the information-entropy measure (I) of Shannon was carried out using the POPGENE 1.31 program. To describe the genetic structure of the studied groups, the following parameters were used: the expected proportion of heterozygous genotypes (HT) in the entire group as a measure of its overall diversity; the expected proportion of heterozygous genotypes in a subgroup (HS) as a measure of its internal diversity; the proportion of intergroup genetic diversity in the total diversity or the subdivision index (GST). In addition to this, the AMOVA package was used with the calculation of the subdivision index of groups using 1000 rounds of permutations. Based on a comparison of the indicators of the Shannon information measure (I), Nei fixation index (FST), as well as intra- and intergroup variability based on the results of the analysis of molecular variants (AMOVA) obtained for D. expansa with similar indicators given for D. fragrans (L.) Schott, a conclusion is made about the inexpediency of dividing D. expansa s.l. into two independent species – D. expansa s. str. and D. assimilis S. Walker. The indicators of all indices and calculated values given in the publication can be used as a basis for comparison in other works devoted to the genetic variability of species of the genus Dryopteris in Russia.

Image Encryption Scheme Based on Multiscale Block Compressed Sensing and Markov Model.

Many image encryption schemes based on compressed sensing have the problem of poor quality of decrypted images. To deal with this problem, this paper develops an image encryption scheme by multiscale block compressed sensing. The image is decomposed by a three-level wavelet transform, and the sampling rates of coefficient matrices at all levels are calculated according to multiscale block compressed sensing theory and the given compression ratio. The first round of permutation is performed on the internal elements of the coefficient matrices at all levels. Then the coefficient matrix is compressed and combined. The second round of permutation is performed on the combined matrix based on the state transition matrix. Independent diffusion and forward-backward diffusion between pixels are used to obtain the final cipher image. Different sampling rates are set by considering the difference of information between an image’s low- and high-frequency parts. Therefore, the reconstruction quality of the decrypted image is better than that of other schemes, which set one sampling rate on an entire image. The proposed scheme takes full advantage of the randomness of the Markov model and shows an excellent encryption effect to resist various attacks.

A Dynamic DNA Color Image Encryption Method Based on SHA-512.

This paper presents a dynamic deoxyribonucleic acid (DNA) image encryption based on Secure Hash Algorithm-512 (SHA-512), having the structure of two rounds of permutation–diffusion, by employing two chaotic systems, dynamic DNA coding, DNA sequencing operations, and conditional shifting. We employed the SHA-512 algorithm to generate a 512-bit hash value and later utilized this value with the natural DNA sequence to calculate the initial values for the chaotic systems and the eight intermittent parameters. We implemented a two-dimensional rectangular transform (2D-RT) on the permutation. We used four-wing chaotic systems and Lorentz systems to generate chaotic sequences and recombined three channel matrices and chaotic matrices with intermittent parameters. We calculated hamming distances of DNA matrices, updated the initial values of two chaotic systems, and generated the corresponding chaotic matrices to complete the diffusion operation. After diffusion, we decoded and decomposed the DNA matrices, and then scrambled and merged these matrices into an encrypted image. According to experiments, the encryption method in this paper not only was able to withstand statistical attacks, plaintext attacks, brute-force attacks, and a host of other attacks, but also could reduce the complexity of the algorithm because it adopted DNA sequencing operations that were different from traditional DNA sequencing operations.

Fuzzy-logic threat classification for multi-level selective encryption over real-time video streams

This paper proposes a Fuzzy-logic Threat Classification (FTC) model as the basis of a method to auto-detect three different confidentiality levels for videos streamed from heterogeneous, mobile devices via web edge servers, possibly part of a Content Distribution Network (CDN). The FTC consists of three parallel Fuzzy Inference Systems (FIS) corresponding to device, network, and type of video application, for the real-time, intelligent selection of an appropriate confidentiality level for a specific end-user. After selection of the level, an encryption module implements the corresponding form of encryption. In tests to demonstrate the concept, there were three increasing confidentiality levels, namely (1) low-level with no encryption, (2) Medium level with an in-house cipher [variant of eXclusive OR (XOR)], named P-XOR (XOR with additional rounds of permutation) applied to Selective Encryption (SE) and (3) high level with the Advanced Encryption Standard again for SE of compressed video syntax components. Results were obtained by considering realistic specifications of multiple digital devices, networks, and differing real-time streaming applications. Visual analysis of encrypted test video clips established that the FTC outputs an appropriate privacy level by reason of the implemented FISs. Absolute encryption times across the privacy levels were distinguished by their real-time response level, which is proportionate to the required degree of confidentiality.

An Efficient Image Encryption Scheme Based on the LSS Chaotic Map and Single S-Box

This paper presents an efficient and secure chaotic S-Box based image encryption algorithm. Firstly, by cryptanalyzing a multiple chaotic S-Boxes based image encryption algorithm, we successfully cracked the cryptosystem by using chosen-plaintext attack (CPA). Secondly, we put forward a new image encryption scheme based on a novel compound chaotic map and single S-Box. In the new scheme, a novel discrete compound chaotic system, Logistic-Sine system (LSS), is proposed, which has wider chaotic range and better chaotic properties. And a new S-Box is constructed by using LSS, which has satisfactory cryptographic performance. Based on the new S-Box and the chaotic key stream, the new image encryption algorithm is designed, which consist of a round of permutation and two rounds of substitution process. The permutation and substitution key sequences are related to the plaintext image content, this strategy enables the cryptosystem to resist CPA. The simulation results and security analysis verified the effectiveness of the proposed image encryption scheme. Especially, the new scheme has obvious efficiency advantages, showing that it has better application potential in real-time image encryption.

2D Logistic-Modulated-Sine-Coupling-Logistic Chaotic Map for Image Encryption

Due to the significant properties of unpredictability, ergodicity, and initial state sensitivity, chaotic system is widely used as a useful tool in image encryption. In this paper, we propose a 2-dimensional logistic-modulated-sine-coupling-logistic chaotic map (LSMCL), where we use the logistic map to modulate Sine map and couple the result of modulation and Sine map together. In terms of chaotic trajectory, Lyapunov exponent, and Kolmogorov entropy, comparing with other existing chaotic maps, we can observe that LSMCL has better chaotic performance. Furthermore, we propose an LSMCL-based image encryption algorithm with two rounds of permutation and diffusion operation. First, we provide a secret key generation procedure to generate the initial values and do permutation operation with the chaotic matrix by LSMCL. Furthermore, in diffusion procedure, we use two different chaotic matrices generated by LSMCL to change the pixel values in row and column. Finally, we provide some theoretical analyses and simulations to confirm the security and the validity of the proposed algorithm.

A light weight secure image encryption scheme based on chaos & DNA computing

This paper proposed a new light weight secure cryptographic scheme for secure image communication. In this scheme the plain image is permuted first using a sequence of pseudo random number (PRN) and encrypted by DeoxyriboNucleic Acid (DNA) computation. Two PRN sequences are generated by a Pseudo Random Number Generator (PRNG) based on cross coupled chaotic logistic map using two sets of keys. The first PRN sequence is used for permuting the plain image whereas the second PRN sequence is used for generating random DNA sequence. The number of rounds of permutation and encryption may be variable to increase security. The scheme is proposed for gray label images but the scheme may be extended for color images and text data. Simulation results exhibit that the proposed scheme can defy any kind of attack.

CRYPTANALYSIS OF A SYMMETRIC COLOR IMAGE ENCRYPTION WITH ONE-ROUND ENCRYPTION

We present the security weakness of encryption algorithm in the form of substitution-permutation network with multiple rounds of permutation and single round of diffusion proposed by W. Zhang et al. The types of chosen-plaintext and chosen-ciphertext attacks are successful against the cryptosystem, and the equivalent versions of keys for encryption and decryption are restored. The security analysis suggests that encryption using substitution-permutation network must be executed more than one encryption round to ensure the security. Our specific examples will demonstrate the cryptanalysis.

An improved image encryption algorithm based on chaotic maps

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.