A data encryption model based on intertwining logistic map

2020 ◽  
Vol 55 ◽  
pp. 102622
Author(s):  
Kamlesh Kumar Raghuvanshi ◽  
Subodh Kumar ◽  
Sunil Kumar
2011 ◽  
Vol 121-126 ◽  
pp. 867-871 ◽  
Author(s):  
Jie Li ◽  
Wei Wei Shan ◽  
Chao Xuan Tian

In order to evaluate the security of Application Specific Integrated Circuit (ASIC) implemented cryptographic algorithms at an early design stage, a Hamming distance model based power analysis is proposed. The Data Encryption Standard (DES) algorithm is taken as an example to illustrate the threats of differential power analysis (DPA) attack against the security of ASIC chip. A DPA attack against the ASIC implementation of a DES algorithm is realized based on hamming distance power model (HD model), and it realized the attack by successfully guessing the right 48-bit subkey. This result indicates that the power analysis attack based on the HD model is simple, rapid and effective for the design and evaluation of security chips.


2019 ◽  
Vol 11 (9) ◽  
pp. 3771-3786 ◽  
Author(s):  
Mohit Dua ◽  
Aishwarya Wesanekar ◽  
Vishwas Gupta ◽  
Mayank Bhola ◽  
Shelza Dua

2018 ◽  
Vol 32 (09) ◽  
pp. 1850115 ◽  
Author(s):  
Manjit Kaur ◽  
Vijay Kumar

In this paper, a robust image encryption technique that utilizes Fourier–Mellin moments and intertwining logistic map is proposed. Fourier–Mellin moment-based intertwining logistic map has been designed to overcome the issue of low sensitivity of an input image. Multi-objective Non-Dominated Sorting Genetic Algorithm (NSGA-II) based on Reinforcement Learning (MNSGA-RL) has been used to optimize the required parameters of intertwining logistic map. Fourier–Mellin moments are used to make the secret keys more secure. Thereafter, permutation and diffusion operations are carried out on input image using secret keys. The performance of proposed image encryption technique has been evaluated on five well-known benchmark images and also compared with seven well-known existing encryption techniques. The experimental results reveal that the proposed technique outperforms others in terms of entropy, correlation analysis, a unified average changing intensity and the number of changing pixel rate. The simulation results reveal that the proposed technique provides high level of security and robustness against various types of attacks.


2014 ◽  
Vol 651-653 ◽  
pp. 1864-1867
Author(s):  
Er Song Yang ◽  
Lin You ◽  
Zhen Dong Wu ◽  
Wang Ke Yu

In order to ensure the security of massive data and user’s privacy in cloud computing, encrypting is a preferred method to protect their security. Due to some characteristics of massive data,such as large scale and structural complexity, it makes that the traditional encryption algorithms cannot be directly used to protect the security of massive data in cloud computing. Considering the real-time and reliability of encryption algorithms, we propose a hybrid algorithm, which combines DES algorithm and one-dimensional logistic map by using the parallel computing architecture of the MapReduce. Our experimental results and analysis show that our algorithm could effectively implement massive data encryption with high security.


2017 ◽  
Vol 32 ◽  
pp. 47-58 ◽  
Author(s):  
Manish Kumar ◽  
Sunil Kumar ◽  
Rajat Budhiraja ◽  
M.K. Das ◽  
Sanjeev Singh
Keyword(s):  

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Ye Tian ◽  
Zhimao Lu

As the unique nonlinear component of block ciphers, Substitution box (S-box) directly affects the safety of a cryptographic system. It is important and difficult to design strong S-box that simultaneously meets multiple cryptographic criteria such as bijection, nonlinearity, strict avalanche criterion (SAC), bit independence criterion (BIC), differential probability (DP), and linear probability (LP). Though many chaotic S-boxes have been proposed, the cryptographic performance of most of them needs to be further improved. A new chaotic S-box based on the intertwining logistic map and bacterial foraging optimization is designed in this paper. It firstly iterates the intertwining logistic map to construct many S-boxes and then applies a bacterial foraging optimization algorithm to find the optimal S-box. Moreover, bacterial foraging optimization algorithm considers the nonlinearity and differential uniformity as the fitness functions in the optimization process. We experiment that the proposed S-box can effectively resist multiple types of cryptanalysis attacks.


Sign in / Sign up

Export Citation Format

Share Document