788 research outputs found
Applications of tripled chaotic maps in cryptography
Security of information has become a major issue during the last decades. New
algorithms based on chaotic maps were suggested for protection of different
types of multimedia data, especially digital images and videos in this period.
However, many of them fundamentally were flawed by a lack of robustness and
security. For getting higher security and higher complexity, in the current
paper, we introduce a new kind of symmetric key block cipher algorithm that is
based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two
coupling parameters, as well as the increased complexity of the cryptosystem,
make a contribution to the development of cryptosystem with higher security. In
order to increase the security of the proposed algorithm, the size of key space
and the computational complexity of the coupling parameters should be increased
as well. Both the theoretical and experimental results state that the proposed
algorithm has many capabilities such as acceptable speed and complexity in the
algorithm due to the existence of two coupling parameter and high security.
Note that the ciphertext has a flat distribution and has the same size as the
plaintext. Therefore, it is suitable for practical use in secure
communications.Comment: 21 pages, 10 figure
SRSS: A New Chaos-Based Single-Round Single S-Box Image Encryption Scheme for Highly Auto-Correlated Data
With the advent of digital communication, securing digital images during
transmission and storage has become a critical concern. The traditional s-box
substitution methods often fail to effectively conceal the information within
highly auto-correlated regions of an image. This paper addresses the security
issues presented by three prevalent S-box substitution methods, i.e., single
S-box, multiple S-boxes, and multiple rounds with multiple S-boxes, especially
when handling images with highly auto-correlated pixels. To resolve the
addressed security issues, this paper proposes a new scheme SRSS-the Single
Round Single S-Box encryption scheme. SRSS uses a single S-box for substitution
in just one round to break the pixel correlations and encrypt the plaintext
image effectively. Additionally, this paper introduces a new Chaos-based Random
Operation Selection System-CROSS, which nullifies the requirement for multiple
S-boxes, thus reducing the encryption scheme's complexity. By randomly
selecting the operation to be performed on each pixel, driven by a chaotic
sequence, the proposed scheme effectively scrambles even high auto-correlation
areas. When compared to the substitution methods mentioned above, the proposed
encryption scheme exhibited exceptionally well in just a single round with a
single S-box. The close-to-ideal statistical security analysis results, i.e.,
an entropy of 7.89 and a correlation coefficient of 0.007, validate the
effectiveness of the proposed scheme. This research offers an innovative path
forward for securing images in applications requiring low computational
complexity and fast encryption and decryption speeds.Comment: 6 Page
A DNA Based Colour Image Encryption Scheme Using A Convolutional Autoencoder
With the advancement in technology, digital images can easily be transmitted
and stored over the Internet. Encryption is used to avoid illegal interception
of digital images. Encrypting large-sized colour images in their original
dimension generally results in low encryption/decryption speed along with
exerting a burden on the limited bandwidth of the transmission channel. To
address the aforementioned issues, a new encryption scheme for colour images
employing convolutional autoencoder, DNA and chaos is presented in this paper.
The proposed scheme has two main modules, the dimensionality conversion module
using the proposed convolutional autoencoder, and the encryption/decryption
module using DNA and chaos. The dimension of the input colour image is first
reduced from N M 3 to P Q gray-scale image using the
encoder. Encryption and decryption are then performed in the reduced dimension
space. The decrypted gray-scale image is upsampled to obtain the original
colour image having dimension N M 3. The training and
validation accuracy of the proposed autoencoder is 97% and 95%, respectively.
Once the autoencoder is trained, it can be used to reduce and subsequently
increase the dimension of any arbitrary input colour image. The efficacy of the
designed autoencoder has been demonstrated by the successful reconstruction of
the compressed image into the original colour image with negligible perceptual
distortion. The second major contribution presented in this paper is an image
encryption scheme using DNA along with multiple chaotic sequences and
substitution boxes. The security of the proposed image encryption algorithm has
been gauged using several evaluation parameters, such as histogram of the
cipher image, entropy, NPCR, UACI, key sensitivity, contrast, etc. encryption
Entropy in Image Analysis II
Image analysis is a fundamental task for any application where extracting information from images is required. The analysis requires highly sophisticated numerical and analytical methods, particularly for those applications in medicine, security, and other fields where the results of the processing consist of data of vital importance. This fact is evident from all the articles composing the Special Issue "Entropy in Image Analysis II", in which the authors used widely tested methods to verify their results. In the process of reading the present volume, the reader will appreciate the richness of their methods and applications, in particular for medical imaging and image security, and a remarkable cross-fertilization among the proposed research areas
A new block cipher for image encryption based on multi chaotic systems
In this paper, a new algorithm for image encryption is proposed based on three chaotic systems which are Chen system,logistic map and two-dimensional (2D) Arnold cat map. First, a permutation scheme is applied to the image, and then shuffled image is partitioned into blocks of pixels. For each block, Chen system is employed for confusion and then logistic map is employed for generating subsititution-box (S-box) to substitute image blocks. The S-box is dynamic, where it is shuffled for each image block using permutation operation. Then, 2D Arnold cat map is used for providing diffusion, after that XORing the result using Chen system to obtain the encrypted image.The high security of proposed algorithm is experimented using histograms, unified average changing intensity (UACI), number of pixels change rate (NPCR), entropy, correlation and keyspace analyses.
A Chaos-Based Authenticated Cipher with Associated Data
In recent years, there has been a rising interest in authenticated encryptionwith associated data (AEAD)which combines encryption and authentication into a unified scheme. AEAD schemes provide authentication for a message that is divided into two parts: associated data which is not encrypted and the plaintext which is encrypted. However, there is a lack of chaos-based AEAD schemes in recent literature. This paper introduces a new128-bit chaos-based AEAD scheme based on the single-key Even-Mansour and Type-II generalized Feistel structure. The proposed scheme provides both privacy and authentication in a single-pass using only one 128-bit secret key. The chaotic tent map is used to generate whitening keys for the Even-Mansour construction, round keys, and random s-boxes for the Feistel round function. In addition, the proposed AEAD scheme can be implemented with true randomnumber generators to map a message tomultiple possible ciphertexts in a nondeterministic manner. Security and statistical evaluation indicate that the proposed scheme is highly secure for both the ciphertext and the authentication tag. Furthermore, it has multiple advantages over AES-GCM which is the current standard for authenticated encryption
Extended of TEA: A 256 bits block cipher algorithm for image encryption
This paper introduces an effective image encryption approach that merges a chaotic map and polynomial with a block cipher. According to this scheme, there are three levels of encryption. In the first level, pixel positions of the image are scuffled into blocks randomly based on a chaotic map. In the second level, the polynomials are constructed by taking N unused pixels from the permuted blocks as polynomial coefficients. Finally, the third level a proposed secret-key block cipher called extended of tiny encryption algorithm (ETEA) is used. The proposed ETEA algorithm increased the block size from 64-bit to 256-bit by using F-function in type three Feistel network design. The key schedule generation is very straightforward through admixture the entire major subjects in the identical manner for every round. The proposed ETEA algorithm is word-oriented, where wholly internal operations are executed on words of 32 bits. So, it is possible to efficiently implement the proposed algorithm on smart cards. The results of the experimental demonstration that the proposed encryption algorithm for all methods are efficient and have high security features through statistical analysis using histograms, correlation, entropy, randomness tests, and the avalanche effect
Entropy in Image Analysis II
Image analysis is a fundamental task for any application where extracting information from images is required [...
- …