Audio encryption scheme by confusion and diffusion based on multi-scroll chaotic system and one-time keys

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.

Download Full-text

A NEW CHAOTIC CRYPTOGRAPHY BASED ON ERGODICITY

International Journal of Modern Physics B ◽

10.1142/s0217979208038983 ◽

2008 ◽

Vol 22 (07) ◽

pp. 901-908 ◽

Cited By ~ 10

Author(s):

XINGYUAN WANG ◽

CHAOFENG DUAN ◽

NINI GU

Keyword(s):

Chaotic System ◽

Control Parameter ◽

Chaotic Map ◽

Logistic Map ◽

Initial Condition ◽

Secret Key ◽

Chaotic Cryptography ◽

And Diffusion ◽

Confusion And Diffusion ◽

Number Of Iterations

This paper analyzes the encryption and weaknesses of E. Álvarez cryptography. On the basis of this, a new chaotic cryptography based on ergodicity is presented. The control parameter and the initial condition of the chaotic system are chosen as a secret key. A bit chain is generated by iterating the chaotic map, and the location where a plaintext grouping appears in the chain is found. We then write down the number of iterations of the chaotic map as the ciphertext grouping. Several weaknesses of the E. Álvarez cryptography are avoided in the new scheme, and the security of the new scheme is improved. In the end, the new cryptography is studied experimentally using the Logistic map, where the new cryptography's confusion and diffusion is validated, and its effectiveness is also illuminated.

Download Full-text

An image encryption scheme based on public key cryptosystem and quantum logistic map

Scientific Reports ◽

10.1038/s41598-020-78127-2 ◽

2020 ◽

Vol 10 (1) ◽

Author(s):

Guodong Ye ◽

Kaixin Jiao ◽

Xiaoling Huang ◽

Bok-Min Goi ◽

Wun-She Yap

Keyword(s):

Image Encryption ◽

Logistic Map ◽

Security Analysis ◽

Encryption Scheme ◽

Statistical Experiments ◽

Encryption Schemes ◽

Security Properties ◽

Exclusive Or ◽

And Diffusion ◽

Confusion And Diffusion

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.

Download Full-text

A New Image Encryption Scheme Using Dual Chaotic Map Synchronization

The International Arab Journal of Information Technology ◽

10.34028/iajit/18/1/11 ◽

2020 ◽

Vol 18 (1) ◽

Keyword(s):

Image Encryption ◽

Chaotic Systems ◽

Initial Conditions ◽

Chaotic Map ◽

Security Applications ◽

The Common ◽

And Diffusion ◽

Confusion And Diffusion ◽

Sensitivity To Initial Conditions ◽

Diffusion Properties

Chaotic systems behavior attracts many researchers in the field of image encryption. The major advantage of using chaos as the basis for developing a crypto-system is due to its sensitivity to initial conditions and parameter tunning as well as the random-like behavior which resembles the main ingredients of a good cipher namely the confusion and diffusion properties. In this article, we present a new scheme based on the synchronization of dual chaotic systems namely Lorenz and Chen chaotic systems and prove that those chaotic maps can be completely synchronized with other under suitable conditions and specific parameters that make a new addition to the chaotic based encryption systems. This addition provides a master-slave configuration that is utilized to construct the proposed dual synchronized chaos-based cipher scheme. The common security analyses are performed to validate the effectiveness of the proposed scheme. Based on all experiments and analyses, we can conclude that this scheme is secure, efficient, robust, reliable, and can be directly applied successfully for many practical security applications in insecure network channels such as the Internet

Download Full-text

Image cipher using image filtering with 3D DNA-based confusion and diffusion strategy

Neural Computing and Applications ◽

10.1007/s00521-021-06225-x ◽

2021 ◽

Author(s):

Zhihua Gan ◽

Xiuli Chai ◽

Xiangcheng Zhi ◽

Wenke Ding ◽

Yang Lu ◽

...

Keyword(s):

Image Filtering ◽

Image Cipher ◽

And Diffusion ◽

Confusion And Diffusion

Download Full-text

Hyperchaotic Image Encryption Based on Multiple Bit Permutation and Diffusion

Entropy ◽

10.3390/e23050510 ◽

2021 ◽

Vol 23 (5) ◽

pp. 510

Author(s):

Taiyong Li ◽

Duzhong Zhang

Keyword(s):

Big Data ◽

Lyapunov Exponents ◽

Image Encryption ◽

Hyperchaotic System ◽

Encryption Scheme ◽

Image Content ◽

Image Security ◽

Level Data ◽

Different Types ◽

And Diffusion

Image security is a hot topic in the era of Internet and big data. Hyperchaotic image encryption, which can effectively prevent unauthorized users from accessing image content, has become more and more popular in the community of image security. In general, such approaches conduct encryption on pixel-level, bit-level, DNA-level data or their combinations, lacking diversity of processed data levels and limiting security. This paper proposes a novel hyperchaotic image encryption scheme via multiple bit permutation and diffusion, namely MBPD, to cope with this issue. Specifically, a four-dimensional hyperchaotic system with three positive Lyapunov exponents is firstly proposed. Second, a hyperchaotic sequence is generated from the proposed hyperchaotic system for consequent encryption operations. Third, multiple bit permutation and diffusion (permutation and/or diffusion can be conducted with 1–8 or more bits) determined by the hyperchaotic sequence is designed. Finally, the proposed MBPD is applied to image encryption. We conduct extensive experiments on a couple of public test images to validate the proposed MBPD. The results verify that the MBPD can effectively resist different types of attacks and has better performance than the compared popular encryption methods.

Download Full-text

A new image encryption algorithm based on the OF-LSTMS and chaotic sequences

Scientific Reports ◽

10.1038/s41598-021-85377-1 ◽

2021 ◽

Vol 11 (1) ◽

Author(s):

Yi He ◽

Ying-Qian Zhang ◽

Xin He ◽

Xing-Yuan Wang

Keyword(s):

Image Encryption ◽

Fractional Order ◽

Chaotic System ◽

Short Term Memory ◽

Encryption Algorithm ◽

Chaotic Sequences ◽

Long Short Term Memory ◽

Input Gate ◽

And Diffusion ◽

Image Encryption Algorithm

AbstractIn this paper, a novel image encryption algorithm based on the Once Forward Long Short Term Memory Structure (OF-LSTMS) and the Two-Dimensional Coupled Map Lattice (2DCML) fractional-order chaotic system is proposed. The original image is divided into several image blocks, each of which is input into the OF-LSTMS as a pixel sub-sequence. According to the chaotic sequences generated by the 2DCML fractional-order chaotic system, the parameters of the input gate, output gate and memory unit of the OF-LSTMS are initialized, and the pixel positions are changed at the same time of changing the pixel values, achieving the synchronization of permutation and diffusion operations, which greatly improves the efficiency of image encryption and reduces the time consumption. In addition the 2DCML fractional-order chaotic system has better chaotic ergodicity and the values of chaotic sequences are larger than the traditional chaotic system. Therefore, it is very suitable to image encryption. Many simulation results show that the proposed scheme has higher security and efficiency comparing with previous schemes.

Download Full-text

A secure image encryption scheme based on genetic mutation and MLNCML chaotic system

Multimedia Tools and Applications ◽

10.1007/s11042-021-10724-3 ◽

2021 ◽

Author(s):

Ying-Qian Zhang ◽

Hui-Fang Huang ◽

Xing-Yuan Wang ◽

Xin-Hao Huang

Keyword(s):

Image Encryption ◽

Chaotic System ◽

Genetic Mutation ◽

Encryption Scheme

Download Full-text

Analysis of Neural Network Based Ciphers

10.32920/ryerson.14654583 ◽

2021 ◽

Author(s):

Maryam Arvandi

Keyword(s):

Neural Networks ◽

Block Cipher ◽

Statistical Tests ◽

Back Propagation ◽

Variable Step Size ◽

Step Size ◽

Variable Step ◽

And Diffusion ◽

Confusion And Diffusion ◽

Diffusion Properties

Cryptography can be considered one of the most important aspects of communication security with existence of many threats and attacks to the systems. Unbreakableness is the main feature of a cryptographic cipher. In this thesis, feasibility of using neural networks, due to their computational capabilities is investigated for designing new cryptography methods. A newly proposed block cipher based on recurrent neural networks has also been analysed It is shown that: the new scheme is not a block cipher, and it should be referred to as a symmetric cipher; the simple architecture of the network is compatible with the requirement for confusion, and diffusion properties of a cryptosystem; the back propagation with variable step size without momentum, has the best result among other back propagation algorithms; the output of the network, the ciphertext, is not random, proved by using three statistical tests; the cipher is resistant to some fundamental cryptanalysis attacks, and finally a possible chosen-plaintext attack is presented.

Download Full-text