Massive Data Hybrid Encryption Algorithm Based on Cloud Computing

2014 ◽  
Vol 651-653 ◽  
pp. 1864-1867
Author(s):  
Er Song Yang ◽  
Lin You ◽  
Zhen Dong Wu ◽  
Wang Ke Yu
Keyword(s):  
Cloud Computing ◽  
Hybrid Algorithm ◽  
Large Scale ◽  
Logistic Map ◽  
Structural Complexity ◽  
Data Encryption ◽  
Massive Data ◽  
One Dimensional ◽  
Hybrid Encryption ◽  
Encryption Algorithms

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.

A WEIGHTED CHAOTIC BLOCK ENCRYPTION ALGORITHM USING MULTIPLE ONE-DIMENSIONAL CHAOTIC MAPS

2011 ◽  
Vol 25 (29) ◽  
pp. 3987-3996
Author(s):  
XING-YUAN WANG ◽  
XIAO-JUAN WANG
Keyword(s):  
Chaotic Maps ◽  
Encryption Algorithm ◽  
One Dimensional ◽  
Chaotic Iterations ◽  
Block Encryption

This paper proposes a new block encryption algorithm. The chaotic trajectories are computed by weighting. Then the result is used to mask the plaintext. Multiple blocks of plaintext are encrypted at the same time and this decreases the chaotic iterations. So the encryption speed is improved to some extent. The proposed algorithm is flexible. When the number of weights is increased, the number of the encrypted plaintext block at the same time is increased and the encryption speed is improved. The simulation result shows that the proposed algorithm has fast encryption speed and fine security.

scholarly journals Analysis of Cryptography Algorithms Implemented in Android Mobile Application

2021 ◽  
Vol 50 (4) ◽  
pp. 786-807
Author(s):  
Alen Salkanovic ◽  
Sandi Ljubic ◽  
Ljubisa Stankovic ◽  
Jonatan Lerga
Keyword(s):  
Operating System ◽  
Mobile Application ◽  
Data Encryption ◽  
Performance Outcomes ◽  
Primary Objective ◽  
Symmetric Encryption ◽  
Variable Size ◽  
Encryption Algorithms ◽  
Android Operating System ◽  
Time Required

This paper evaluates the performances of numerous encryption algorithms on mobile devices running the Android operating system. The primary objective of our research was to measure and compare the relative performances of tested algorithm implementations (Data Encryption Standard (DES), 3DES, Advanced Encryption Standard (AES), ChaCha20, Blowfish, and Rivest Cipher 4 (RC4)) on the Android platform. The algorithms were compared in terms of CPU utilization by measuring the time required to encrypt and decrypt variable size text files. Besides evaluating the six common symmetric encryption ciphers, a comparison has been conducted for several Password-Based Encryption (PBE) algorithms. Diverse cipher transformations were evaluated for each algorithm by utilizing various feedback modes and padding schemes. Two smartphone devices were used for testing, with different versions of the Android operating system and hardware specifications. The summarized performance outcomes for various cipher transformations are presented to demonstrate the effectiveness of each algorithm.

scholarly journals Research on Pseudorandom Number Generator Based on Several New Types of Piecewise Chaotic Maps

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Hongyan Zang ◽  
Yue Yuan ◽  
Xinyuan Wei
Keyword(s):  
Theoretical Basis ◽  
Chaotic Maps ◽  
Dynamic Properties ◽  
Chaotic Map ◽  
Pseudorandom Number ◽  
Pseudorandom Number Generator ◽  
Number Generator ◽  
High Quality ◽  
One Dimensional ◽  
Construction Methods

This paper proposes three types of one-dimensional piecewise chaotic maps and two types of symmetrical piecewise chaotic maps and presents five theorems. Furthermore, some examples that satisfy the theorems are constructed, and an analysis and model of the dynamic properties are discussed. The construction methods proposed in this paper have a certain generality and provide a theoretical basis for constructing a new discrete chaotic system. In addition, this paper designs a pseudorandom number generator based on piecewise chaotic map and studies its application in cryptography. Performance evaluation shows that the generator can generate high quality random sequences efficiently.

STABILIZATION OF CHAOTIC DYNAMICS OF ONE-DIMENSIONAL MAPS BY A CYCLIC PARAMETRIC TRANSFORMATION

1996 ◽  
Vol 06 (04) ◽  
pp. 725-735 ◽  
Author(s):  
ALEXANDER Yu. LOSKUTOV ◽  
VALERY M. TERESHKO ◽  
KONSTANTIN A. VASILIEV
Keyword(s):  
Periodic Orbits ◽  
Chaotic Dynamics ◽  
Chaotic Maps ◽  
Logistic Map ◽  
Exponential Map ◽  
One Dimensional ◽  
Stable Periodic ◽  
One Dimensional Maps ◽  
Parameter Values ◽  
Parametric Transformation

We consider one-dimensional maps, the logistic map and an exponential map, in those sets of parameter values which correspond to their chaotic dynamics. It is proven that such dynamics may be stabilized by a certain cyclic parametric transformation operating strictly within the chaotic set. The stabilization is a result of the creation of stable periodic orbits in the initially chaotic maps. The period of these stable orbits is a multiple of the period of the cyclic transformation. It is shown that stabilized behavior cannot be destroyed by a weak noise smearing of the required parameter values. The regions where the behavior stabilization takes place are numerically estimated. Periods of the created stabile periodic orbits are calculated.

A Chaotification model based on sine and cosecant functions for enhancing chaos

2021 ◽  
Author(s):  
Yuqing Li ◽  
Xing He ◽  
Dawen Xia
Keyword(s):  
Fixed Point ◽  
Lyapunov Exponent ◽  
Chaotic Maps ◽  
Dynamic Properties ◽  
Chaotic Map ◽  
Sample Entropy ◽  
One Dimensional ◽  
Model Based ◽  
Chaotic Region ◽  
Definition Of

Chaotic maps with higher chaotic complexity are urgently needed in many application scenarios. This paper proposes a chaotification model based on sine and cosecant functions (CMSC) to improve the dynamic properties of existing chaotic maps. CMSC can generate a new map with higher chaotic complexity by using the existing one-dimensional (1D) chaotic map as a seed map. To discuss the performance of CMSC, the chaos properties of CMSC are analyzed based on the mathematical definition of the Lyapunov exponent (LE). Then, three new maps are generated by applying three classical 1D chaotic maps to CMSC respectively, and the dynamic behaviors of the new maps are analyzed in terms of fixed point, bifurcation diagram, sample entropy (SE), etc. The results of the analysis demonstrate that the new maps have a larger chaotic region and excellent chaotic characteristics.

Sign in / Sign up

Export Citation Format

Share Document