Finite Precision Logistic Map between Computational Efficiency and Accuracy with Encryption Applications

Published on Feb 1, 2017in Complexity2.833
路 DOI :10.1155/2017/8692046
Wafaa S. Sayed9
Estimated H-index: 9
(Cairo University),
Ahmed G. Radwan49
Estimated H-index: 49
(Cairo University)
+ 1 AuthorsHossam A. H. Fahmy14
Estimated H-index: 14
(Cairo University)
Sources
Abstract
Chaotic systems appear in many applications such as pseudo-random number generation, text encryption, and secure image transfer. Numerical solutions of these systems using digital software or hardware inevitably deviate from the expected analytical solutions. Chaotic orbits produced using finite precision systems do not exhibit the infinite period expected under the assumptions of infinite simulation time and precision. In this paper, digital implementation of the generalized logistic map with signed parameter is considered. We present a fixed-point hardware realization of a Pseudo-Random Number Generator using the logistic map that experiences a trade-off between computational efficiency and accuracy. Several introduced factors such as the used precision, the order of execution of the operations, parameter, and initial point values affect the properties of the finite precision map. For positive and negative parameter cases, the studied properties include bifurcation points, output range, maximum Lyapunov exponent, and period length. The performance of the finite precision logistic map is compared in the two cases. A basic stream cipher system is realized to evaluate the system performance for encryption applications for different bus sizes regarding the encryption key size, hardware requirements, maximum clock frequency, NIST and correlation, histogram, entropy, and Mean Absolute Error analyses of encrypted images.
馃摉 Papers frequently viewed together
References30
Newest
#1Lingfeng Liu (NCU: Nanchang University)H-Index: 4
#2Suoxia Miao (Nanchang Institute of Technology)H-Index: 4
The information sources using logistic maps have been studied in this article. We use a particular symmetric binary function to generate the binary sequences due to the generating partition of the logistic maps, which can reflect the dynamics of chaotic real-valued sequences. Using this binary function, we will establish a binary description of the logistic maps, and prove that this description is equivalent with the logistic maps. The probability of all the possible binary sequences generated b...
Source
#1Ranjit Kumar Upadhyay (IIT: Indian Institute of Technology Dhanbad)H-Index: 27
#2Parimita Roy (IIT: Indian Institute of Technology Dhanbad)H-Index: 10
In this paper, an eco-epidemiological model in which both species diffuse along a spatial gradient has been shown to exhibit temporal chaos at a fixed point in space. The proposed model is a modification of the model recently presented by Upadhyay and Roy [2014]. The spatial interactions among the species have been represented in the form of reaction鈥揹iffusion equations. The model incorporates the intrinsic growth rate of fish population which varies linearly with the depth of water. Numerical r...
Source
#1Yuansheng Liu (XTU: Xiangtan University)H-Index: 16
#2Hua FanH-Index: 2
Last. Chengqing Li (XTU: Xiangtan University)H-Index: 32
view all 5 authors...
Since John von Neumann suggested utilizing Logistic map as a random number generator in 1947, a great number of encryption schemes based on Logistic map and/or its variants have been proposed. This paper re-evaluates the security of an image cipher based on transformed logistic maps and proves that the image cipher can be deciphered efficiently under two different conditions: (1) two pairs of known plain-images and the corresponding cipher-images with computational complexity of O(218 + L); (2) ...
Source
The discrete logistic map is one of the most famous discrete chaotic maps which has widely spread applications. This paper investigates a set of four generalized logistic maps where the conventional map is a special case. The proposed maps have extra degrees of freedom which provide different chaotic characteristics and increase the design flexibility required for many applications such as quantitative financial modeling. Based on the maximum chaotic range of the output, the proposed maps can be...
Source
#1陌smail 脰zt眉rk (Erciyes University)H-Index: 7
#2Recai Kili莽 (Erciyes University)H-Index: 12
This paper investigates cycle and transient lengths of spatially discretized chaotic maps with respect to different initial condition values. By investigating cycle lengths and their correlation properties using fixed point arithmetic, it is observed that for different initial condition values only a limited number of cycles occur for each resolution and rounding type. Additionally, it is seen that cycles with the same length are actually identical due to intersections between pseudo trajectorie...
Source
#1Hong-jun Wang (Heilongjiang University)H-Index: 1
#2Bingbing Song (Heilongjiang University)H-Index: 1
Last. Qun Ding (Heilongjiang University)H-Index: 6
view all 5 authors...
FPGA technology, applied to the case of electronic system, needs to make full use of hardware resources, to achieve great efficiency and yield the largest returns. To apply digital chaotic sequence which consume least resource in encryption system, this paper seeks a tradeoff between logistic and skew tent discrete map aiming at hardware utilization through the method of testing critical precision. Critical precision (or delay) is firstly proposed to weigh the effect of different precision (or d...
Source
#1Yuansheng Liu (XTU: Xiangtan University)H-Index: 16
#2Hua FanH-Index: 2
Last. Chengqing Li (XTU: Xiangtan University)H-Index: 32
view all 5 authors...
Since John von Neumann suggested utilizing Logistic map as a random number generator in 1947, a great number of encryption schemes based on Logistic map and/or its variants have been proposed. This paper re-evaluates the security of an image cipher based on transformed logistic maps and proves that the image cipher can be deciphered efficiently under two different conditions: (1) two pairs of known plain-images and the corresponding cipher-images with computational complexity of O(218 + L); (2) ...
Source
#1Abhinav S. Mansingka (KAUST: King Abdullah University of Science and Technology)H-Index: 6
#2M. Affan Zidan (KAUST: King Abdullah University of Science and Technology)H-Index: 10
Last. Khaled N. Salama (KAUST: King Abdullah University of Science and Technology)H-Index: 52
view all 5 authors...
This paper introduces fully digital implementations of four different systems in the 3rd order jerk-equation based chaotic family using the Euler approximation. The digitization approach enables controllable chaotic systems that reliably provide sinusoidal or chaotic output based on a selection input. New systems are introduced, derived using logical and arithmetic operations between two system implementations of different bus widths, with up to 100i? higher maximum Lyapunov exponent than the or...
Source
#1M. Affan Zidan (KAUST: King Abdullah University of Science and Technology)H-Index: 10
#2Ahmed G. Radwan (KAUST: King Abdullah University of Science and Technology)H-Index: 49
Last. Khaled N. Salama (KAUST: King Abdullah University of Science and Technology)H-Index: 52
view all 3 authors...
In this paper, a new controllable V-shape multiscroll attractor is presented, where a variety of symmetrical and unsymmetrical attractors with a variable number of scrolls can be controlled using new staircase nonlinear function and the parameters of the system. This attractor can be used to generate random signals with a variety of symbol distribution. Digital implementation of the proposed generator is also presented using a Xilinx Virtex庐 4 Field Programmable Gate Array and experimental resul...
Source
#1Kyle Persohn (Marquette University)H-Index: 3
#2Richard J. Povinelli (Marquette University)H-Index: 28
Abstract Because of the mixing and aperiodic properties of chaotic maps, such maps have been used as the basis for pseudorandom number generators (PRNGs). However, when implemented on a finite precision computer, chaotic maps have finite and periodic orbits. This manuscript explores the consequences finite precision has on the periodicity of a PRNG based on the logistic map. A comparison is made with conventional methods of generating pseudorandom numbers. The approach used to determine the numb...
Source
Cited By17
Newest
Source
#1Chunyuan Liu (Heilongjiang University)H-Index: 1
#2Qun Ding (Heilongjiang University)H-Index: 4
Low-dimensional chaotic mappings are simple functions that have low computation cost and are easy to realize, but applying them in a cryptographic algorithm will lead to security vulnerabilities. To overcome this shortcoming, this paper proposes the coupled chaotic system, which coupled the piecewise and Henon mapping. Simulation results indicate that the novel mapping has better complexity and initial sensitivity and larger key space compared with the original mapping. Then, a new color image e...
Source
#1Wafaa S. Sayed (Cairo University)H-Index: 9
#2Merna Roshdy (Nile University)H-Index: 2
Last. Ahmed G. Radwan (Cairo University)H-Index: 49
view all 4 authors...
This article proposes a numerical solution approach and Field Programmable Gate Array implementation of a delayed fractional-order system. The proposed method is amenable to a sufficiently efficient hardware realization. The system鈥檚 numerical solution and hardware realization have two requirements. First, the delay terms are implemented by employing LookUp Tables to keep the already required delayed samples in the dynamical equations. Second, the fractional derivative is numerically approximate...
Source
#1Zongchao Qiao (脡cole centrale de Nantes)H-Index: 1
#2Ina Taralova (脡cole centrale de Nantes)H-Index: 6
Last. Safwan El Assad (CNRS: Centre national de la recherche scientifique)H-Index: 11
view all 3 authors...
Pseudo-chaotic number generators (PCNGs), designed based on multiple chaotic maps, have a significant influence on the security of chaos-based cryptosystems. Since the majority of the chaotic maps are based on real numbers, most of the proposed PCNGs use floating-point notations. However, this data type, especially the double precision notation, has disadvantages of high computation cost and inefficient resource utilization. Also, due to the high sensitivity of the chaotic systems and the finite...
Source
This paper discusses the implementation sensitivity of chaotic systems added to their widely discussed sensitivities to initial conditions and parameter variation. This sensitivity can cause mismatches in some applications, which require an exact duplication of the system, e.g., chaos-based cryptography, synchronization and communication. Specifically, different implementation cases of three discretized jerk-based chaotic systems and a discrete-time logistic map are presented corresponding to di...
Source
#1Rania A. Elmanfaloty (KAU: King Abdulaziz University)H-Index: 1
#2Ehab Abou-BakrH-Index: 1
Because of their complex behaviour, simple mathematical and digital hardware representation, one-dimensional (1D) chaotic functions were the earliest choices of cryptologists for applying chaos theory to cryptography. It was discovered later that most of these functions suffer from orbits collapsing into a specific period, especially under finite precision realization and weakness because of their limited number of control parameter(s). This in turn exposed many security issues and was proven to...
Source
Last. Denis N. ButusovH-Index: 11
view all 4 authors...
An evergreen scientific feature is the ability for scientific works to be reproduced. Since chaotic systems are so hard to understand analytically, numerical simulations assume a key role in their investigation. Such simulations have been considered as reproducible in many works. However, few studies have focused on the effects of the finite precision of computers on the simulation reproducibility of chaotic systems; moreover, code sharing and details on how to reproduce simulation results are n...
Source
#1Fei Yu (CSUST: Changsha University of Science and Technology)H-Index: 7
#2Li Liu (CSUST: Changsha University of Science and Technology)H-Index: 10
Last. Qiuzhen Wan (Hunan Normal University)H-Index: 5
view all 10 authors...
Novel memristive hyperchaotic system designs and their engineering applications have received considerable critical attention. In this paper, a novel multistable 5D memristive hyperchaotic system and its application are introduced. The interesting aspect of this chaotic system is that it has different types of coexisting attractors, chaos, hyperchaos, periods, and limit cycles. First, a novel 5D memristive hyperchaotic system is proposed by introducing a flux-controlled memristor with quadratic ...
Source
#1Chunguang Huang (Heilongjiang University)H-Index: 1
#2Qun Ding (Heilongjiang University)H-Index: 4
The scintillating technological improvements have changed the process of communication in all parts of the world. Shopping, banking, instant communication, and so on can be operated online and do not care about the linkage of those Internet communications. Because of simple chaotic structure, discrete nature, less arithmetic computation, and high complexity, low-dimensional chaotic systems such as a logistic map and tent map are more attractive than a high-dimensional chaotic system. To overcome...
Source
Abstract Chaotic systems are broadly adopted to generate pseudo-random numbers used in encryption schemes. However, when implemented on a finite precision computer, chaotic systems end up in dynamical degradation of chaotic properties. Many works have been proposed to address this issue. Nevertheless, little attention has been paid to exploit the finite precision as a source of randomness rather a feature that should be mitigated. This paper proposes a novel plain-image encryption using finite-p...
Source
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.