A new chaotic algorithm for image encryption
International Nuclear Information System (INIS)
Gao Haojiang; Zhang Yisheng; Liang Shuyun; Li Dequn
2006-01-01
Recent researches of image encryption algorithms have been increasingly based on chaotic systems, but the drawbacks of small key space and weak security in one-dimensional chaotic cryptosystems are obvious. This paper presents a new nonlinear chaotic algorithm (NCA) which uses power function and tangent function instead of linear function. Its structural parameters are obtained by experimental analysis. And an image encryption algorithm in a one-time-one-password system is designed. The experimental results demonstrate that the image encryption algorithm based on NCA shows advantages of large key space and high-level security, while maintaining acceptable efficiency. Compared with some general encryption algorithms such as DES, the encryption algorithm is more secure
Image Encryption Using the Chaotic Josephus Matrix
Directory of Open Access Journals (Sweden)
Gelan Yang
2014-01-01
Full Text Available This paper presents a new image encryption solution using the chaotic Josephus matrix. It extends the conventional Josephus traversing to a matrix form and proposes a treatment to improve the randomness of this matrix by mixing chaotic maps. It also derives the corresponding encryption primitives controlled by the chaotic Josephus matrix. In this way, it builds up an image encryption system with very high sensitivities in both encryption key and input image. Our simulation results demonstrate that an encrypted image of using this method is very random-like, that is, a uniform-like pixel histogram and very low correlations in adjacent pixels. The design idea of this method is also applicable to data encryption of other types, like audio and video.
Image Encryption and Chaotic Cellular Neural Network
Peng, Jun; Zhang, Du
Machine learning has been playing an increasingly important role in information security and assurance. One of the areas of new applications is to design cryptographic systems by using chaotic neural network due to the fact that chaotic systems have several appealing features for information security applications. In this chapter, we describe a novel image encryption algorithm that is based on a chaotic cellular neural network. We start by giving an introduction to the concept of image encryption and its main technologies, and an overview of the chaotic cellular neural network. We then discuss the proposed image encryption algorithm in details, which is followed by a number of security analyses (key space analysis, sensitivity analysis, information entropy analysis and statistical analysis). The comparison with the most recently reported chaos-based image encryption algorithms indicates that the algorithm proposed in this chapter has a better security performance. Finally, we conclude the chapter with possible future work and application prospects of the chaotic cellular neural network in other information assurance and security areas.
Encryption in Chaotic Systems with Sinusoidal Excitations
Directory of Open Access Journals (Sweden)
G. Obregón-Pulido
2014-01-01
Full Text Available In this contribution an encryption method using a chaotic oscillator, excited by “n” sinusoidal signals, is presented. The chaotic oscillator is excited by a sum of “n” sinusoidal signals and a message. The objective is to encrypt such a message using the chaotic behavior and transmit it, and, as the chaotic system is perturbed by the sinusoidal signal, the transmission security could be increased due to the effect of such a perturbation. The procedure is based on the regulation theory and consider that the receiver knows the frequencies of the perturbing signal, with this considerations the algorithm estimates the excitation in such a way that the receiver can cancel out the perturbation and all the undesirable dynamics in order to produce only the message. In this way we consider that the security level is increased.
Symmetric encryption algorithms using chaotic and non-chaotic generators: A review.
Radwan, Ahmed G; AbdElHaleem, Sherif H; Abd-El-Hafiz, Salwa K
2016-03-01
This paper summarizes the symmetric image encryption results of 27 different algorithms, which include substitution-only, permutation-only or both phases. The cores of these algorithms are based on several discrete chaotic maps (Arnold's cat map and a combination of three generalized maps), one continuous chaotic system (Lorenz) and two non-chaotic generators (fractals and chess-based algorithms). Each algorithm has been analyzed by the correlation coefficients between pixels (horizontal, vertical and diagonal), differential attack measures, Mean Square Error (MSE), entropy, sensitivity analyses and the 15 standard tests of the National Institute of Standards and Technology (NIST) SP-800-22 statistical suite. The analyzed algorithms include a set of new image encryption algorithms based on non-chaotic generators, either using substitution only (using fractals) and permutation only (chess-based) or both. Moreover, two different permutation scenarios are presented where the permutation-phase has or does not have a relationship with the input image through an ON/OFF switch. Different encryption-key lengths and complexities are provided from short to long key to persist brute-force attacks. In addition, sensitivities of those different techniques to a one bit change in the input parameters of the substitution key as well as the permutation key are assessed. Finally, a comparative discussion of this work versus many recent research with respect to the used generators, type of encryption, and analyses is presented to highlight the strengths and added contribution of this paper.
A novel chaotic encryption scheme based on arithmetic coding
International Nuclear Information System (INIS)
Mi Bo; Liao Xiaofeng; Chen Yong
2008-01-01
In this paper, under the combination of arithmetic coding and logistic map, a novel chaotic encryption scheme is presented. The plaintexts are encrypted and compressed by using an arithmetic coder whose mapping intervals are changed irregularly according to a keystream derived from chaotic map and plaintext. Performance and security of the scheme are also studied experimentally and theoretically in detail
Performance Analysis of Chaotic Encryption Using a Shared Image ...
African Journals Online (AJOL)
Most of the secret key encryption algorithms in use today are designed based on either the feistel structure or the substitution-permutation structure. This paper focuses on data encryption technique using multi-scroll chaotic natures and a publicly shared image as a key. A key is generated from the shared image using a full ...
Chaotic Dynamical State Variables Selection Procedure Based Image Encryption Scheme
Directory of Open Access Journals (Sweden)
Zia Bashir
2017-12-01
Full Text Available Nowadays, in the modern digital era, the use of computer technologies such as smartphones, tablets and the Internet, as well as the enormous quantity of confidential information being converted into digital form have resulted in raised security issues. This, in turn, has led to rapid developments in cryptography, due to the imminent need for system security. Low-dimensional chaotic systems have low complexity and key space, yet they achieve high encryption speed. An image encryption scheme is proposed that, without compromising the security, uses reasonable resources. We introduced a chaotic dynamic state variables selection procedure (CDSVSP to use all state variables of a hyper-chaotic four-dimensional dynamical system. As a result, less iterations of the dynamical system are required, and resources are saved, thus making the algorithm fast and suitable for practical use. The simulation results of security and other miscellaneous tests demonstrate that the suggested algorithm excels at robustness, security and high speed encryption.
Chaotic Image Encryption Algorithm Based on Circulant Operation
Directory of Open Access Journals (Sweden)
Xiaoling Huang
2013-01-01
Full Text Available A novel chaotic image encryption scheme based on the time-delay Lorenz system is presented in this paper with the description of Circulant matrix. Making use of the chaotic sequence generated by the time-delay Lorenz system, the pixel permutation is carried out in diagonal and antidiagonal directions according to the first and second components. Then, a pseudorandom chaotic sequence is generated again from time-delay Lorenz system using all components. Modular operation is further employed for diffusion by blocks, in which the control parameter is generated depending on the plain-image. Numerical experiments show that the proposed scheme possesses the properties of a large key space to resist brute-force attack, sensitive dependence on secret keys, uniform distribution of gray values in the cipher-image, and zero correlation between two adjacent cipher-image pixels. Therefore, it can be adopted as an effective and fast image encryption algorithm.
A symmetric image encryption scheme based on 3D chaotic cat maps
International Nuclear Information System (INIS)
Chen Guanrong; Mao Yaobin; Chui, Charles K.
2004-01-01
Encryption of images is different from that of texts due to some intrinsic features of images such as bulk data capacity and high redundancy, which are generally difficult to handle by traditional methods. Due to the exceptionally desirable properties of mixing and sensitivity to initial conditions and parameters of chaotic maps, chaos-based encryption has suggested a new and efficient way to deal with the intractable problem of fast and highly secure image encryption. In this paper, the two-dimensional chaotic cat map is generalized to 3D for designing a real-time secure symmetric encryption scheme. This new scheme employs the 3D cat map to shuffle the positions (and, if desired, grey values as well) of image pixels and uses another chaotic map to confuse the relationship between the cipher-image and the plain-image, thereby significantly increasing the resistance to statistical and differential attacks. Thorough experimental tests are carried out with detailed analysis, demonstrating the high security and fast encryption speed of the new scheme
Joint compression and encryption using chaotically mutated Huffman trees
Hermassi, Houcemeddine; Rhouma, Rhouma; Belghith, Safya
2010-10-01
This paper introduces a new scheme for joint compression and encryption using the Huffman codec. A basic tree is first generated for a given message and then based on a keystream generated from a chaotic map and depending from the input message, the basic tree is mutated without changing the statistical model. Hence a symbol can be coded by more than one codeword having the same length. The security of the scheme is tested against the known plaintext attack and the brute force attack. Performance analysis including encryption/decryption speed, additional computational complexity and compression ratio are given.
Fast encryption of image data using chaotic Kolmogorov flows
Scharinger, Josef
1998-04-01
To guarantee security and privacy in image and video archival applications, efficient bulk encryption techniques are necessary which are easily implementable in soft- and hardware and are able to cope with the vast amounts of data involved. Experience has shown that block-oriented symmetric product ciphers constitute an adequate design paradigm for resolving this task, since they can offer a very high level of security as well as very high encryption rates. In this contribution we introduce a new product cipher which encrypts large blocks of plain text by repeated intertwined application of substitution and permutation operations. While almost all of the current product ciphers use fixed permutation operations on small data blocks, our approach involves parametrizable permutations on large data blocks induced by specific chaotic systems. By combining these highly unstable dynamics with an adaption of a very fast shift register based pseudo-random number generator, we obtain a new class of computationally secure product ciphers which offer many features that make them superior to contemporary bulk encryption systems when aiming at efficient image and video data encryption.
A fast image encryption algorithm based on chaotic map
Liu, Wenhao; Sun, Kehui; Zhu, Congxu
2016-09-01
Derived from Sine map and iterative chaotic map with infinite collapse (ICMIC), a new two-dimensional Sine ICMIC modulation map (2D-SIMM) is proposed based on a close-loop modulation coupling (CMC) model, and its chaotic performance is analyzed by means of phase diagram, Lyapunov exponent spectrum and complexity. It shows that this map has good ergodicity, hyperchaotic behavior, large maximum Lyapunov exponent and high complexity. Based on this map, a fast image encryption algorithm is proposed. In this algorithm, the confusion and diffusion processes are combined for one stage. Chaotic shift transform (CST) is proposed to efficiently change the image pixel positions, and the row and column substitutions are applied to scramble the pixel values simultaneously. The simulation and analysis results show that this algorithm has high security, low time complexity, and the abilities of resisting statistical analysis, differential, brute-force, known-plaintext and chosen-plaintext attacks.
Image encryption using the two-dimensional logistic chaotic map
Wu, Yue; Yang, Gelan; Jin, Huixia; Noonan, Joseph P.
2012-01-01
Chaos maps and chaotic systems have been proved to be useful and effective for cryptography. In our study, the two-dimensional logistic map with complicated basin structures and attractors are first used for image encryption. The proposed method adopts the classic framework of the permutation-substitution network in cryptography and thus ensures both confusion and diffusion properties for a secure cipher. The proposed method is able to encrypt an intelligible image into a random-like one from the statistical point of view and the human visual system point of view. Extensive simulation results using test images from the USC-SIPI image database demonstrate the effectiveness and robustness of the proposed method. Security analysis results of using both the conventional and the most recent tests show that the encryption quality of the proposed method reaches or excels the current state-of-the-art methods. Similar encryption ideas can be applied to digital data in other formats (e.g., digital audio and video). We also publish the cipher MATLAB open-source-code under the web page https://sites.google.com/site/tuftsyuewu/source-code.
An Anti-Cheating Visual Cryptography Scheme Based on Chaotic Encryption System
Han, Yanyan; Xu, Zhuolin; Ge, Xiaonan; He, Wencai
By chaotic encryption system and introducing the trusted third party (TTP), in this paper, an anti-cheating visual cryptography scheme (VCS) is proposed. The scheme solved the problem of dishonest participants and improved the security of chaotic encryption system. Simulation results and analysis show that the recovery image is acceptable, the system can detect the cheating in participants effectively and with high security.
Synchronization properties of chaotic semiconductor lasers and applications to encryption
Mirasso, Claudio R.; Vicente, Raúl; Colet, Pere; Mulet, Josep; Pérez, Toni
2004-08-01
We review the main properties of two unidirectionally coupled single-mode semiconductor lasers ( master-slave configuration). Our analysis is based on numerical simulations of a rate equations model. The emitter, or master laser, is assumed to be an external-cavity single-mode semiconductor laser subject to optical feedback that operates in a chaotic regime. The receiver, or slave laser, is similar to the emitter but can either operate in a chaotic regime, as the emitter (closed loop configuration), or without optical feedback and consequently under CW when it is uncoupled (open loop configuration). This configuration is one of the most simple and useful configuration for chaos based communication systems and data encryption. To cite this article: C.R. Mirasso et al., C. R. Physique 5 (2004).
A novel image encryption algorithm based on a 3D chaotic map
Kanso, A.; Ghebleh, M.
2012-07-01
Recently [Solak E, Çokal C, Yildiz OT Biyikoǧlu T. Cryptanalysis of Fridrich's chaotic image encryption. Int J Bifur Chaos 2010;20:1405-1413] cryptanalyzed the chaotic image encryption algorithm of [Fridrich J. Symmetric ciphers based on two-dimensional chaotic maps. Int J Bifur Chaos 1998;8(6):1259-1284], which was considered a benchmark for measuring security of many image encryption algorithms. This attack can also be applied to other encryption algorithms that have a structure similar to Fridrich's algorithm, such as that of [Chen G, Mao Y, Chui, C. A symmetric image encryption scheme based on 3D chaotic cat maps. Chaos Soliton Fract 2004;21:749-761]. In this paper, we suggest a novel image encryption algorithm based on a three dimensional (3D) chaotic map that can defeat the aforementioned attack among other existing attacks. The design of the proposed algorithm is simple and efficient, and based on three phases which provide the necessary properties for a secure image encryption algorithm including the confusion and diffusion properties. In phase I, the image pixels are shuffled according to a search rule based on the 3D chaotic map. In phases II and III, 3D chaotic maps are used to scramble shuffled pixels through mixing and masking rules, respectively. Simulation results show that the suggested algorithm satisfies the required performance tests such as high level security, large key space and acceptable encryption speed. These characteristics make it a suitable candidate for use in cryptographic applications.
Data transmission system with encryption by chaotic sequences
Directory of Open Access Journals (Sweden)
Politans’kyy R. L.
2014-06-01
Full Text Available Protection of transferable information in the telecommunication systems is possible by its imposition of coding sequence on a plaintext. Encryption of pseudorandom sequences can be performed by using generation algorithms which are implemented on the basis of the phenomenon of dynamical chaos, which is sensitive to changes in the initial conditions. One of the major problems encountered in the construction of secure communication systems is to provide synchronization between the receiving and transmitting parties of communication systems. Improvement of methods of hidden data transfer based on the systems with chaotic synchronization is the important task of research in the field of information and telecommunication systems based on chaos. This article shows an implementation of a data transmission system, encrypted by sequences, generated on the basis of one-dimensional discrete chaotic maps with ensuring synchronization of the transmitting and receiving sides of the system. In this system realization of synchronization is offered by a transmission through certain time domains of current value of xn generated by a logistic reflection. Xn transmission period depends on computer speed and distance between subscribers of the system. Its value is determined by transmitting a test message before the session. Infallible reception of test message indicates the optimal choice of a transmission period of the current value of xn. Selection period is done at the program level. For the construction of communication network modern software was used, in particular programming language Delphi 7.0. The work of the system is shown on the example of information transmission between the users of the system. The system operates in real time full duplex mode at any hardware implementation of Internet access. It is enough for the users of the system to specify IP address only.
A novel hybrid color image encryption algorithm using two complex chaotic systems
Wang, Leyuan; Song, Hongjun; Liu, Ping
2016-02-01
Based on complex Chen and complex Lorenz systems, a novel color image encryption algorithm is proposed. The larger chaotic ranges and more complex behaviors of complex chaotic systems, which compared with real chaotic systems could additionally enhance the security and enlarge key space of color image encryption. The encryption algorithm is comprised of three step processes. In the permutation process, the pixels of plain image are scrambled via two-dimensional and one-dimensional permutation processes among RGB channels individually. In the diffusion process, the exclusive-or (XOR for short) operation is employed to conceal pixels information. Finally, the mixing RGB channels are used to achieve a multilevel encryption. The security analysis and experimental simulations demonstrate that the proposed algorithm is large enough to resist the brute-force attack and has excellent encryption performance.
Multi-image encryption based on synchronization of chaotic lasers and iris authentication
Banerjee, Santo; Mukhopadhyay, Sumona; Rondoni, Lamberto
2012-07-01
A new technique of transmitting encrypted combinations of gray scaled and chromatic images using chaotic lasers derived from Maxwell-Bloch's equations has been proposed. This novel scheme utilizes the general method of solution of a set of linear equations to transmit similar sized heterogeneous images which are a combination of monochrome and chromatic images. The chaos encrypted gray scaled images are concatenated along the three color planes resulting in color images. These are then transmitted over a secure channel along with a cover image which is an iris scan. The entire cryptology is augmented with an iris-based authentication scheme. The secret messages are retrieved once the authentication is successful. The objective of our work is briefly outlined as (a) the biometric information is the iris which is encrypted before transmission, (b) the iris is used for personal identification and verifying for message integrity, (c) the information is transmitted securely which are colored images resulting from a combination of gray images, (d) each of the images transmitted are encrypted through chaos based cryptography, (e) these encrypted multiple images are then coupled with the iris through linear combination of images before being communicated over the network. The several layers of encryption together with the ergodicity and randomness of chaos render enough confusion and diffusion properties which guarantee a fool-proof approach in achieving secure communication as demonstrated by exhaustive statistical methods. The result is vital from the perspective of opening a fundamental new dimension in multiplexing and simultaneous transmission of several monochromatic and chromatic images along with biometry based authentication and cryptography.
A new color image encryption scheme using CML and a fractional-order chaotic system.
Directory of Open Access Journals (Sweden)
Xiangjun Wu
Full Text Available The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks.
Parallel image encryption algorithm based on discretized chaotic map
International Nuclear Information System (INIS)
Zhou Qing; Wong Kwokwo; Liao Xiaofeng; Xiang Tao; Hu Yue
2008-01-01
Recently, a variety of chaos-based algorithms were proposed for image encryption. Nevertheless, none of them works efficiently in parallel computing environment. In this paper, we propose a framework for parallel image encryption. Based on this framework, a new algorithm is designed using the discretized Kolmogorov flow map. It fulfills all the requirements for a parallel image encryption algorithm. Moreover, it is secure and fast. These properties make it a good choice for image encryption on parallel computing platforms
An image encryption scheme based on three-dimensional Brownian motion and chaotic system
International Nuclear Information System (INIS)
Chai Xiu-Li; Yuan Ke; Gan Zhi-Hua; Lu Yang; Chen Yi-Ran
2017-01-01
At present, many chaos-based image encryption algorithms have proved to be unsafe, few encryption schemes permute the plain images as three-dimensional (3D) bit matrices, and thus bits cannot move to any position, the movement range of bits are limited, and based on them, in this paper we present a novel image encryption algorithm based on 3D Brownian motion and chaotic systems. The architecture of confusion and diffusion is adopted. Firstly, the plain image is converted into a 3D bit matrix and split into sub blocks. Secondly, block confusion based on 3D Brownian motion (BCB3DBM) is proposed to permute the position of the bits within the sub blocks, and the direction of particle movement is generated by logistic-tent system (LTS). Furthermore, block confusion based on position sequence group (BCBPSG) is introduced, a four-order memristive chaotic system is utilized to give random chaotic sequences, and the chaotic sequences are sorted and a position sequence group is chosen based on the plain image, then the sub blocks are confused. The proposed confusion strategy can change the positions of the bits and modify their weights, and effectively improve the statistical performance of the algorithm. Finally, a pixel level confusion is employed to enhance the encryption effect. The initial values and parameters of chaotic systems are produced by the SHA 256 hash function of the plain image. Simulation results and security analyses illustrate that our algorithm has excellent encryption performance in terms of security and speed. (paper)
Audio signal encryption using chaotic Hénon map and lifting wavelet transforms
Roy, Animesh; Misra, A. P.
2017-12-01
We propose an audio signal encryption scheme based on the chaotic Hénon map. The scheme mainly comprises two phases: one is the preprocessing stage where the audio signal is transformed into data by the lifting wavelet scheme and the other in which the transformed data is encrypted by chaotic data set and hyperbolic functions. Furthermore, we use dynamic keys and consider the key space size to be large enough to resist any kind of cryptographic attacks. A statistical investigation is also made to test the security and the efficiency of the proposed scheme.
Color image encryption using random transforms, phase retrieval, chaotic maps, and diffusion
Annaby, M. H.; Rushdi, M. A.; Nehary, E. A.
2018-04-01
The recent tremendous proliferation of color imaging applications has been accompanied by growing research in data encryption to secure color images against adversary attacks. While recent color image encryption techniques perform reasonably well, they still exhibit vulnerabilities and deficiencies in terms of statistical security measures due to image data redundancy and inherent weaknesses. This paper proposes two encryption algorithms that largely treat these deficiencies and boost the security strength through novel integration of the random fractional Fourier transforms, phase retrieval algorithms, as well as chaotic scrambling and diffusion. We show through detailed experiments and statistical analysis that the proposed enhancements significantly improve security measures and immunity to attacks.
International Nuclear Information System (INIS)
Alvarez, G.; Montoya, F.; Romera, M.; Pastor, G.
2005-01-01
This paper describes the security weakness of a recently proposed improved chaotic encryption method based on the modulation of a signal generated by a chaotic system with an appropriately chosen scalar signal. The aim of the improvement is to avoid the breaking of chaotic encryption schemes by means of the return map attack introduced by Perez and Cerdeira. A method of attack based on taking the absolute value of the ciphertext is presented, that allows for the cancellation of the modulation scalar signal and the determination of some system parameters that play the role of system key. The proposed improved method is shown to be compromised without any knowledge of the chaotic system parameter values and even without knowing the transmitter structure
Chaotic image encryption based on running-key related to plaintext.
Guanghui, Cao; Kai, Hu; Yizhi, Zhang; Jun, Zhou; Xing, Zhang
2014-01-01
In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack.
Chaotic Image Encryption Based on Running-Key Related to Plaintext
Directory of Open Access Journals (Sweden)
Cao Guanghui
2014-01-01
Full Text Available In the field of chaotic image encryption, the algorithm based on correlating key with plaintext has become a new developing direction. However, for this kind of algorithm, some shortcomings in resistance to reconstruction attack, efficient utilization of chaotic resource, and reducing dynamical degradation of digital chaos are found. In order to solve these problems and further enhance the security of encryption algorithm, based on disturbance and feedback mechanism, we present a new image encryption scheme. In the running-key generation stage, by successively disturbing chaotic stream with cipher-text, the relation of running-key to plaintext is established, reconstruction attack is avoided, effective use of chaotic resource is guaranteed, and dynamical degradation of digital chaos is minimized. In the image encryption stage, by introducing random-feedback mechanism, the difficulty of breaking this scheme is increased. Comparing with the-state-of-the-art algorithms, our scheme exhibits good properties such as large key space, long key period, and extreme sensitivity to the initial key and plaintext. Therefore, it can resist brute-force, reconstruction attack, and differential attack.
Tong, Xiaojun; Cui, Minggen; Wang, Zhu
2009-07-01
The design of the new compound two-dimensional chaotic function is presented by exploiting two one-dimensional chaotic functions which switch randomly, and the design is used as a chaotic sequence generator which is proved by Devaney's definition proof of chaos. The properties of compound chaotic functions are also proved rigorously. In order to improve the robustness against difference cryptanalysis and produce avalanche effect, a new feedback image encryption scheme is proposed using the new compound chaos by selecting one of the two one-dimensional chaotic functions randomly and a new image pixels method of permutation and substitution is designed in detail by array row and column random controlling based on the compound chaos. The results from entropy analysis, difference analysis, statistical analysis, sequence randomness analysis, cipher sensitivity analysis depending on key and plaintext have proven that the compound chaotic sequence cipher can resist cryptanalytic, statistical and brute-force attacks, and especially it accelerates encryption speed, and achieves higher level of security. By the dynamical compound chaos and perturbation technology, the paper solves the problem of computer low precision of one-dimensional chaotic function.
Secure Image Encryption Based On a Chua Chaotic Noise Generator
Directory of Open Access Journals (Sweden)
A. S. Andreatos
2013-10-01
Full Text Available This paper presents a secure image cryptography telecom system based on a Chua's circuit chaotic noise generator. A chaotic system based on synchronised Master–Slave Chua's circuits has been used as a chaotic true random number generator (CTRNG. Chaotic systems present unpredictable and complex behaviour. This characteristic, together with the dependence on the initial conditions as well as the tolerance of the circuit components, make CTRNGs ideal for cryptography. In the proposed system, the transmitter mixes an input image with chaotic noise produced by a CTRNG. Using thresholding techniques, the chaotic signal is converted to a true random bit sequence. The receiver must be able to reproduce exactly the same chaotic noise in order to subtract it from the received signal. This becomes possible with synchronisation between the two Chua's circuits: through the use of specific techniques, the trajectory of the Slave chaotic system can be bound to that of the Master circuit producing (almost identical behaviour. Additional blocks have been used in order to make the system highly parameterisable and robust against common attacks. The whole system is simulated in Matlab. Simulation results demonstrate satisfactory performance, as well as, robustness against cryptanalysis. The system works with both greyscale and colour jpg images.
Ensemble of Chaotic and Naive Approaches for Performance Enhancement in Video Encryption
Directory of Open Access Journals (Sweden)
Jeyamala Chandrasekaran
2015-01-01
Full Text Available Owing to the growth of high performance network technologies, multimedia applications over the Internet are increasing exponentially. Applications like video conferencing, video-on-demand, and pay-per-view depend upon encryption algorithms for providing confidentiality. Video communication is characterized by distinct features such as large volume, high redundancy between adjacent frames, video codec compliance, syntax compliance, and application specific requirements. Naive approaches for video encryption encrypt the entire video stream with conventional text based cryptographic algorithms. Although naive approaches are the most secure for video encryption, the computational cost associated with them is very high. This research work aims at enhancing the speed of naive approaches through chaos based S-box design. Chaotic equations are popularly known for randomness, extreme sensitivity to initial conditions, and ergodicity. The proposed methodology employs two-dimensional discrete Henon map for (i generation of dynamic and key-dependent S-box that could be integrated with symmetric algorithms like Blowfish and Data Encryption Standard (DES and (ii generation of one-time keys for simple substitution ciphers. The proposed design is tested for randomness, nonlinearity, avalanche effect, bit independence criterion, and key sensitivity. Experimental results confirm that chaos based S-box design and key generation significantly reduce the computational cost of video encryption with no compromise in security.
Directory of Open Access Journals (Sweden)
Guangya Peng
2018-01-01
Full Text Available The four-wing memristive chaotic system used in synchronization is applied to secure communication which can increase the difficulty of deciphering effectively and enhance the security of information. In this paper, a novel four-wing memristive chaotic system with an active cubic flux-controlled memristor is proposed based on a Lorenz-like circuit. Dynamical behaviors of the memristive system are illustrated in terms of Lyapunov exponents, bifurcation diagrams, coexistence Poincaré maps, coexistence phase diagrams, and attraction basins. Besides, the modular equivalent circuit of four-wing memristive system is designed and the corresponding results are observed to verify its accuracy and rationality. A nonlinear synchronization controller with exponential function is devised to realize synchronization of the coexistence of multiple attractors, and the synchronization control scheme is applied to image encryption to improve secret key space. More interestingly, considering different influence of multistability on encryption, the appropriate key is achieved to enhance the antideciphering ability.
A fast image encryption system based on chaotic maps with finite precision representation
International Nuclear Information System (INIS)
Kwok, H.S.; Tang, Wallace K.S.
2007-01-01
In this paper, a fast chaos-based image encryption system with stream cipher structure is proposed. In order to achieve a fast throughput and facilitate hardware realization, 32-bit precision representation with fixed point arithmetic is assumed. The major core of the encryption system is a pseudo-random keystream generator based on a cascade of chaotic maps, serving the purpose of sequence generation and random mixing. Unlike the other existing chaos-based pseudo-random number generators, the proposed keystream generator not only achieves a very fast throughput, but also passes the statistical tests of up-to-date test suite even under quantization. The overall design of the image encryption system is to be explained while detail cryptanalysis is given and compared with some existing schemes
Chaotic reconfigurable ZCMT precoder for OFDM data encryption and PAPR reduction
Chen, Han; Yang, Xuelin; Hu, Weisheng
2017-12-01
A secure orthogonal frequency division multiplexing (OFDM) transmission scheme precoded by chaotic Zadoff-Chu matrix transform (ZCMT) is proposed and demonstrated. It is proved that the reconfigurable ZCMT matrices after row/column permutations can be applied as an alternative precoder for peak-to-average power ratio (PAPR) reduction. The permutations and the reconfigurable parameters in ZCMT matrix are generated by a hyper digital chaos, in which a huge key space of ∼ 10800 is created for physical-layer OFDM data encryption. An encrypted data transmission of 8.9 Gb/s optical OFDM signals is successfully demonstrated over 20 km standard single-mode fiber (SSMF) for 16-QAM. The BER performance of the encrypted signals is improved by ∼ 2 dB (BER@ 10-3), which is mainly attributed to the effective reduction of PAPR via chaotic ZCMT precoding. Moreover, the chaotic ZCMT precoding scheme requires no sideband information, thus the spectrum efficiency is enhanced during transmission.
A New Image Encryption Scheme Based on Dynamic S-Boxes and Chaotic Maps
Rehman, Atique Ur; Khan, Jan Sher; Ahmad, Jawad; Hwang, Soeng Oun
2016-03-01
Substitution box is a unique and nonlinear core component of block ciphers. A better designing technique of substitution box can boost up the quality of ciphertexts. In this paper, a new encryption method based on dynamic substitution boxes is proposed via using two chaotic maps. To break the correlation in an original image, pixels values of the original plaintext image are permuted row- and column-wise through random sequences. The aforementioned random sequences are generated by 2-D Burgers chaotic map. For the generation of dynamic substitution boxes, Logistic chaotic map is employed. In the process of diffusion, the permuted image is divided into blocks and each block is substituted via different dynamic substitution boxes. In contrast to conventional encryption schemes, the proposed scheme does not undergo the fixed block cipher and hence the security level can be enhanced. Extensive security analysis including histogram test is applied on the proposed image encryption technique. All experimental results reveal that the proposed scheme has a high level of security and robustness for transmission of digital images on insecure communication channels.
Chatterjee, Monish R.; Almehmadi, Fares S.
2015-01-01
Secure information encryption via acousto-optic (AO) chaos with profiled optical beams indicates substantially better performance in terms of system robustness. This paper examines encryption of static and time-varying (video) images onto AO chaotic carriers using Gaussian-profile beams with diffracted data numerically generated using transfer functions. The use of profiled beams leads to considerable improvement in the encrypted signal. While static image encryption exhibits parameter tolerances within about +/-10% for uniform optical beams, profiled beams reduce the tolerance to less than 1%, thereby vastly improving both the overall security of the transmitted information as well as the quality of the image retrieval.
Image encryption based on permutation-substitution using chaotic map and Latin Square Image Cipher
Panduranga, H. T.; Naveen Kumar, S. K.; Kiran, HASH(0x22c8da0)
2014-06-01
In this paper we presented a image encryption based on permutation-substitution using chaotic map and Latin square image cipher. The proposed method consists of permutation and substitution process. In permutation process, plain image is permuted according to chaotic sequence generated using chaotic map. In substitution process, based on secrete key of 256 bit generate a Latin Square Image Cipher (LSIC) and this LSIC is used as key image and perform XOR operation between permuted image and key image. The proposed method can applied to any plain image with unequal width and height as well and also resist statistical attack, differential attack. Experiments carried out for different images of different sizes. The proposed method possesses large key space to resist brute force attack.
Qiu, Junchao; Zhang, Lin; Li, Diyang; Liu, Xingcheng
2016-06-01
Chaotic sequences can be applied to realize multiple user access and improve the system security for a visible light communication (VLC) system. However, since the map patterns of chaotic sequences are usually well known, eavesdroppers can possibly derive the key parameters of chaotic sequences and subsequently retrieve the information. We design an advanced encryption standard (AES) interleaving aided multiple user access scheme to enhance the security of a chaotic code division multiple access-based visible light communication (C-CDMA-VLC) system. We propose to spread the information with chaotic sequences, and then the spread information is interleaved by an AES algorithm and transmitted over VLC channels. Since the computation complexity of performing inverse operations to deinterleave the information is high, the eavesdroppers in a high speed VLC system cannot retrieve the information in real time; thus, the system security will be enhanced. Moreover, we build a mathematical model for the AES-aided VLC system and derive the theoretical information leakage to analyze the system security. The simulations are performed over VLC channels, and the results demonstrate the effectiveness and high security of our presented AES interleaving aided chaotic CDMA-VLC system.
A Novel Image Encryption Scheme Based on Intertwining Chaotic Maps and RC4 Stream Cipher
Kumari, Manju; Gupta, Shailender
2018-03-01
As the systems are enabling us to transmit large chunks of data, both in the form of texts and images, there is a need to explore algorithms which can provide a higher security without increasing the time complexity significantly. This paper proposes an image encryption scheme which uses intertwining chaotic maps and RC4 stream cipher to encrypt/decrypt the images. The scheme employs chaotic map for the confusion stage and for generation of key for the RC4 cipher. The RC4 cipher uses this key to generate random sequences which are used to implement an efficient diffusion process. The algorithm is implemented in MATLAB-2016b and various performance metrics are used to evaluate its efficacy. The proposed scheme provides highly scrambled encrypted images and can resist statistical, differential and brute-force search attacks. The peak signal-to-noise ratio values are quite similar to other schemes, the entropy values are close to ideal. In addition, the scheme is very much practical since having lowest time complexity then its counterparts.
Image encryption with chaotic random codes by grey relational grade and Taguchi method
Huang, Chuan-Kuei; Nien, Hsiau-Hsian; Changchien, Shih-Kuen; Shieh, Hong-Wei
2007-12-01
This paper presents a novel scheme for implementation of quasi-optimal chaotic random codes (CRC). Usually, the localization grey relational grade (LGRG) approaches 1 by using less random codes to encrypt digital color images. On the contrary, randomized codes cause highly independent images. In this paper, the LGRG between original and encoded image is used as the quality characteristic, and the chaotic system's initial values x0, y0 and z0 which influence the quality characteristic are chosen as control factors and the levels are also decided. According to the control factors and levels, this paper applied a Taguchi orthogonal array for the experiments, and generated a factor response graph, to figure out a set of chaotic initial values. Finally, the quasi-optimal CRC are decided by these initial values. Eventually, the most effective encryption of digital color images can be obtained by applying the quasi-optimal CRC. The experimental results have demonstrated that the proposed scheme is feasible and efficient.
Directory of Open Access Journals (Sweden)
MADANI Mohammed
2017-10-01
Full Text Available In this paper, a new satellite image encryption algorithm based on the combination of multiple chaotic systems and a random cyclic rotation technique is proposed. Our contribution consists in implementing three different chaotic maps (logistic, sine, and standard combined to improve the security of satellite images. Besides enhancing the encryption, the proposed algorithm also focuses on advanced efficiency of the ciphered images. Compared with classical encryption schemes based on multiple chaotic maps and the Rubik's cube rotation, our approach has not only the same merits of chaos systems like high sensitivity to initial values, unpredictability, and pseudo-randomness, but also other advantages like a higher number of permutations, better performances in Peak Signal to Noise Ratio (PSNR and a Maximum Deviation (MD.
Security of public key encryption technique based on multiple chaotic systems
International Nuclear Information System (INIS)
Wang Kai; Pei Wenjiang; Zou Liuhua; Cheung Yiuming; He Zhenya
2006-01-01
Recently, a new public key encryption technique based on multiple chaotic systems has been proposed [B. Ranjan, Phys. Rev. Lett. 95 (2005) 098702]. This scheme employs m-chaotic systems and a set of linear functions for key exchange over an insecure channel. Security of the proposed algorithm grows as (NP) m , where N, P are the size of the key and the computational complexity of the linear functions respectively. In this Letter, the fundamental weakness of the cryptosystem is pointed out and a successful attack is described. Given the public keys and the initial vector, one can calculate the secret key based on Parseval's theorem. Both theoretical and experimental results show that the attacker can access to the secret key without difficulty. The lack of security discourages the use of such algorithm for practical applications
Directory of Open Access Journals (Sweden)
Adelaïde Nicole Kengnou Telem
2014-01-01
Full Text Available A robust gray image encryption scheme using chaotic logistic map and artificial neural network (ANN is introduced. In the proposed method, an external secret key is used to derive the initial conditions for the logistic chaotic maps which are employed to generate weights and biases matrices of the multilayer perceptron (MLP. During the learning process with the backpropagation algorithm, ANN determines the weight matrix of the connections. The plain image is divided into four subimages which are used for the first diffusion stage. The subimages obtained previously are divided into the square subimage blocks. In the next stage, different initial conditions are employed to generate a key stream which will be used for permutation and diffusion of the subimage blocks. Some security analyses such as entropy analysis, statistical analysis, and key sensitivity analysis are given to demonstrate the key space of the proposed algorithm which is large enough to make brute force attacks infeasible. Computing validation using experimental data with several gray images has been carried out with detailed numerical analysis, in order to validate the high security of the proposed encryption scheme.
Chaotic Image Encryption Algorithm Based on Bit Permutation and Dynamic DNA Encoding
Directory of Open Access Journals (Sweden)
Xuncai Zhang
2017-01-01
Full Text Available With the help of the fact that chaos is sensitive to initial conditions and pseudorandomness, combined with the spatial configurations in the DNA molecule’s inherent and unique information processing ability, a novel image encryption algorithm based on bit permutation and dynamic DNA encoding is proposed here. The algorithm first uses Keccak to calculate the hash value for a given DNA sequence as the initial value of a chaotic map; second, it uses a chaotic sequence to scramble the image pixel locations, and the butterfly network is used to implement the bit permutation. Then, the image is coded into a DNA matrix dynamic, and an algebraic operation is performed with the DNA sequence to realize the substitution of the pixels, which further improves the security of the encryption. Finally, the confusion and diffusion properties of the algorithm are further enhanced by the operation of the DNA sequence and the ciphertext feedback. The results of the experiment and security analysis show that the algorithm not only has a large key space and strong sensitivity to the key but can also effectively resist attack operations such as statistical analysis and exhaustive analysis.
A joint image encryption and watermarking algorithm based on compressive sensing and chaotic map
International Nuclear Information System (INIS)
Xiao Di; Cai Hong-Kun; Zheng Hong-Ying
2015-01-01
In this paper, a compressive sensing (CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firstly. Then the watermark is adhered to the scrambled data. By compressive sensing, a set of watermarked measurements is obtained as the watermarked cipher image. In this algorithm, watermark embedding and data compression can be performed without knowing the original image; similarly, watermark extraction will not interfere with decryption. Due to the characteristics of CS, this algorithm features compressible cipher image size, flexible watermark capacity, and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss. Simulation results and analyses show that the algorithm achieves good performance in the sense of security, watermark capacity, extraction accuracy, reconstruction, robustness, etc. (paper)
Text Encryption Scheme Realized with a Chaotic Pseudo-Random Bit Generator
Directory of Open Access Journals (Sweden)
Ch. K. Volos
2013-09-01
Full Text Available In this work a new encryption scheme, which is realized with a Chaotic Pseudo-Random Bit Generator (CPRBG based on a Logistic map, is presented. The proposed system is used for encrypting text files for the purpose of creating secure data bases. The Logistic map is the most studied discrete nonlinear map because it has been used in many scientific fields. Also, the fact, that this discrete map has a known algebraic distribution, made the Logistic map a good candidate for use in the design of random bit generators. The proposed CPRBG, which is very easily implemented, uses the X-OR function, in the bit sequences, that are produced by two Logistic maps with different initial conditions and system’s parameters, to achieve better results concerning the “randomness” of the produced bits sequence. The detailed results of the statistical testing on generated bit sequences, done by the most well known tests of randomness: the FIPS-140-2 suite tests, confirmed the specific characteristics expected of random bit sequences.
An enhanced chaotic key-based RC5 block cipher adapted to image encryption
Faragallah, Osama S.
2012-07-01
RC5 is a block cipher that has several salient features such as adaptability to process different word lengths with a variable block size, a variable number of rounds and a variable-length secret key. However, RC5 can be broken with various attacks such as correlation attack, timing attack, known plaintext correlation attack and differential attacks, revealing weak security. We aimed to enhance the RC5 block cipher to be more secure and efficient for real-time applications while preserving its advantages. For this purpose, this article introduces a new approach based on strengthening both the confusion and diffusion operations by combining chaos and cryptographic primitive operations to produce round keys with better pseudo-random sequences. Comparative security analysis and performance evaluation of the enhanced RC5 block cipher (ERC5) with RC5, RC6 and chaotic block cipher algorithm (CBCA) are addressed. Several test images are used for inspecting the validity of the encryption and decryption algorithms. The experimental results show the superiority of the suggested enhanced RC5 (ERC5) block cipher to image encryption algorithms such as RC5, RC6 and CBCA from the security analysis and performance evaluation points of view.
A Self-adaptive Bit-level Color Image Encryption Algorithm Based on Generalized Arnold Map
Directory of Open Access Journals (Sweden)
Ye Rui-Song
2017-01-01
Full Text Available A self-adaptive bit-level color image encryption algorithm based on generalized Arnold map is proposed. The red, green, blue components of the plain-image with height H and width W are decomposed into 8-bit planes and one three-dimensional bit matrix with size ze H×W×24 is obtained. The generalized Arnold map is used to generate pseudo-random sequences to scramble the resulted three-dimensional bit matrix by sort-based approach. The scrambled 3D bit matrix is then rearranged to be one scrambled color image. Chaotic sequences produced by another generalized Arnold map are used to diffuse the resulted red, green, blue components in a cross way to get more encryption effects. Self-adaptive strategy is adopted in both the scrambling stage and diffusion stage, meaning that the key streams are all related to the content of the plain-image and therefore the encryption algorithm show strong robustness against known/chosen plaintext attacks. Some other performances are carried out, including key space, key sensitivity, histogram, correlation coefficients between adjacent pixels, information entropy and difference attack analysis, etc. All the experimental results show that the proposed image encryption algorithm is secure and effective for practical application.
Cascade Chaotic System With Applications.
Zhou, Yicong; Hua, Zhongyun; Pun, Chi-Man; Chen, C L Philip
2015-09-01
Chaotic maps are widely used in different applications. Motivated by the cascade structure in electronic circuits, this paper introduces a general chaotic framework called the cascade chaotic system (CCS). Using two 1-D chaotic maps as seed maps, CCS is able to generate a huge number of new chaotic maps. Examples and evaluations show the CCS's robustness. Compared with corresponding seed maps, newly generated chaotic maps are more unpredictable and have better chaotic performance, more parameters, and complex chaotic properties. To investigate applications of CCS, we introduce a pseudo-random number generator (PRNG) and a data encryption system using a chaotic map generated by CCS. Simulation and analysis demonstrate that the proposed PRNG has high quality of randomness and that the data encryption system is able to protect different types of data with a high-security level.
Phase-Image Encryption Based on 3D-Lorenz Chaotic System and Double Random Phase Encoding
Sharma, Neha; Saini, Indu; Yadav, AK; Singh, Phool
2017-12-01
In this paper, an encryption scheme for phase-images based on 3D-Lorenz chaotic system in Fourier domain under the 4f optical system is presented. The encryption scheme uses a random amplitude mask in the spatial domain and a random phase mask in the frequency domain. Its inputs are phase-images, which are relatively more secure as compared to the intensity images because of non-linearity. The proposed scheme further derives its strength from the use of 3D-Lorenz transform in the frequency domain. Although the experimental setup for optical realization of the proposed scheme has been provided, the results presented here are based on simulations on MATLAB. It has been validated for grayscale images, and is found to be sensitive to the encryption parameters of the Lorenz system. The attacks analysis shows that the key-space is large enough to resist brute-force attack, and the scheme is also resistant to the noise and occlusion attacks. Statistical analysis and the analysis based on correlation distribution of adjacent pixels have been performed to test the efficacy of the encryption scheme. The results have indicated that the proposed encryption scheme possesses a high level of security.
Generalized projective synchronization of a unified chaotic system
International Nuclear Information System (INIS)
Yan Jianping; Li Changpin
2005-01-01
In the present paper, a simple but efficient control technique of the generalized projective synchronization is applied to a unified chaotic system. Numerical simulations show that this method works very well, which can also be applied to other chaotic systems
Jridi, Maher; Alfalou, Ayman
2018-03-01
In this paper, enhancement of an existing optical simultaneous fusion, compression and encryption (SFCE) scheme in terms of real-time requirements, bandwidth occupation and encryption robustness is proposed. We have used and approximate form of the DCT to decrease the computational resources. Then, a novel chaos-based encryption algorithm is introduced in order to achieve the confusion and diffusion effects. In the confusion phase, Henon map is used for row and column permutations, where the initial condition is related to the original image. Furthermore, the Skew Tent map is employed to generate another random matrix in order to carry out pixel scrambling. Finally, an adaptation of a classical diffusion process scheme is employed to strengthen security of the cryptosystem against statistical, differential, and chosen plaintext attacks. Analyses of key space, histogram, adjacent pixel correlation, sensitivity, and encryption speed of the encryption scheme are provided, and favorably compared to those of the existing crypto-compression system. The proposed method has been found to be digital/optical implementation-friendly which facilitates the integration of the crypto-compression system on a very broad range of scenarios.
Image encryption using random sequence generated from generalized information domain
International Nuclear Information System (INIS)
Zhang Xia-Yan; Wu Jie-Hua; Zhang Guo-Ji; Li Xuan; Ren Ya-Zhou
2016-01-01
A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security. (paper)
Chatterjee, Monish R.; Almehmadi, Fares S.
2014-09-01
In recent work, the propagation of a profiled optical beam through an open-loop acousto-optic Bragg cell was examined using a transfer function formalism. The device was also studied under closed-loop via intensity feedback, and shown to exhibit more extended chaotic band responses, thereby potentially increasing the dynamic range and parameter sensitivities of any applied signal and the device operation respectively. In this paper, simple low- to mid-RF signals (periodic waveforms and low BW audio) are transmitted through the closed-loop system and the resulting encryption and recovery at the receiver are examined especially from the perspective of overall robustness of the system.
Vaidyanathan, S.; Akgul, A.; Kaçar, S.; Çavuşoğlu, U.
2018-02-01
Hyperjerk systems have received significant interest in the literature because of their simple structure and complex dynamical properties. This work presents a new chaotic hyperjerk system having two exponential nonlinearities. Dynamical properties of the chaotic hyperjerk system are discovered through equilibrium point analysis, bifurcation diagram, dissipativity and Lyapunov exponents. Moreover, an adaptive backstepping controller is designed for the synchronization of the chaotic hyperjerk system. Also, a real circuit of the chaotic hyperjerk system has been carried out to show the feasibility of the theoretical hyperjerk model. The chaotic hyperjerk system can also be useful in scientific fields such as Random Number Generators (RNGs), data security, data hiding, etc. In this work, three implementations of the chaotic hyperjerk system, viz. RNG, image encryption and sound steganography have been performed by using complex dynamics characteristics of the system.
Li, Jiafu; Xiang, Shuiying; Wang, Haoning; Gong, Junkai; Wen, Aijun
2018-03-01
In this paper, a novel image encryption algorithm based on synchronization of physical random bit generated in a cascade-coupled semiconductor ring lasers (CCSRL) system is proposed, and the security analysis is performed. In both transmitter and receiver parts, the CCSRL system is a master-slave configuration consisting of a master semiconductor ring laser (M-SRL) with cross-feedback and a solitary SRL (S-SRL). The proposed image encryption algorithm includes image preprocessing based on conventional chaotic maps, pixel confusion based on control matrix extracted from physical random bit, and pixel diffusion based on random bit stream extracted from physical random bit. Firstly, the preprocessing method is used to eliminate the correlation between adjacent pixels. Secondly, physical random bit with verified randomness is generated based on chaos in the CCSRL system, and is used to simultaneously generate the control matrix and random bit stream. Finally, the control matrix and random bit stream are used for the encryption algorithm in order to change the position and the values of pixels, respectively. Simulation results and security analysis demonstrate that the proposed algorithm is effective and able to resist various typical attacks, and thus is an excellent candidate for secure image communication application.
Directory of Open Access Journals (Sweden)
Tongfeng Zhang
2016-01-01
Full Text Available A one-dimensional (1D hybrid chaotic system is constructed by three different 1D chaotic maps in parallel-then-cascade fashion. The proposed chaotic map has larger key space and exhibits better uniform distribution property in some parametric range compared with existing 1D chaotic map. Meanwhile, with the combination of compressive sensing (CS and Fibonacci-Lucas transform (FLT, a novel image compression and encryption scheme is proposed with the advantages of the 1D hybrid chaotic map. The whole encryption procedure includes compression by compressed sensing (CS, scrambling with FLT, and diffusion after linear scaling. Bernoulli measurement matrix in CS is generated by the proposed 1D hybrid chaotic map due to its excellent uniform distribution. To enhance the security and complexity, transform kernel of FLT varies in each permutation round according to the generated chaotic sequences. Further, the key streams used in the diffusion process depend on the chaotic map as well as plain image, which could resist chosen plaintext attack (CPA. Experimental results and security analyses demonstrate the validity of our scheme in terms of high security and robustness against noise attack and cropping attack.
GENERALIZED MATRIXES OF GALOIS PROTOCOLS EXCHANGE ENCRYPTION KEYS
Directory of Open Access Journals (Sweden)
Anatoly Beletsky
2016-03-01
Full Text Available The methods of construction of matrix formation the secret protocols legalized subscribers of public communications networks encryption keys. Based key exchange protocols laid asymmetric cryptography algorithms. The solution involves the calculation of one-way functions and is based on the use of generalized Galois arrays of isomorphism relationship with forming elements, and depending on the selected irreducible polynomial generating matrix. A simple method for constructing generalized Galois matrix by the method of filling the diagonal. In order to eliminate the isomorphism of Galois arrays and their constituent elements, limiting the possibility of building one-way functions, Galois matrix subjected to similarity transformation carried out by means of permutation matrices. The variant of the organization of the algebraic attacks on encryption keys sharing protocols and discusses options for easing the consequences of an attack.
Towards generalized synchronization of strictly different chaotic systems
International Nuclear Information System (INIS)
Femat, R.; Kocarev, L.; Gerven, L. van; Monsivais-Perez, M.E.
2005-01-01
This contribution addresses the problem of the generalized synchronization (GS) in different chaotic systems, and departs from chaotic systems in a triangular from, which can be derived from Lie derivatives. A state-feedback (full knowledge of both master and slave systems) scheme is designed, which achieves GS. The work includes illustrative examples; moreover an experimental setup is used to corroborate the obtained results
A simple observer design of the generalized Lorenz chaotic systems
International Nuclear Information System (INIS)
Sun, Y.-J.
2010-01-01
In this Letter, the generalized Lorenz chaotic system is considered and the state observation problem of such a system is investigated. Based on the time-domain approach, a simple observer for the generalized Lorenz chaotic system is developed to guarantee the global exponential stability of the resulting error system. Moreover, the guaranteed exponential convergence rate can be correctly estimated. Finally, a numerical example is given to show the effectiveness of the obtained result.
An exponential observer for the generalized Rossler chaotic system
International Nuclear Information System (INIS)
Sun, Y.-J.
2009-01-01
In this paper, the generalized Rossler chaotic system is considered and the state observation problem of such a system is investigated. Based on the time-domain approach, a state observer for the generalized Rossler chaotic system is developed to guarantee the global exponential stability of the resulting error system. Moreover, the guaranteed exponential convergence rate can be arbitrarily pre-specified. Finally, a numerical example is provided to illustrate the feasibility and effectiveness of the obtained result.
Partial Encryption of Entropy-Coded Video Compression Using Coupled Chaotic Maps
Directory of Open Access Journals (Sweden)
Fadi Almasalha
2014-10-01
Full Text Available Due to pervasive communication infrastructures, a plethora of enabling technologies is being developed over mobile and wired networks. Among these, video streaming services over IP are the most challenging in terms of quality, real-time requirements and security. In this paper, we propose a novel scheme to efficiently secure variable length coded (VLC multimedia bit streams, such as H.264. It is based on code word error diffusion and variable size segment shuffling. The codeword diffusion and the shuffling mechanisms are based on random operations from a secure and computationally efficient chaos-based pseudo-random number generator. The proposed scheme is ubiquitous to the end users and can be deployed at any node in the network. It provides different levels of security, with encrypted data volume fluctuating between 5.5–17%. It works on the compressed bit stream without requiring any decoding. It provides excellent encryption speeds on different platforms, including mobile devices. It is 200% faster and 150% more power efficient when compared with AES software-based full encryption schemes. Regarding security, the scheme is robust to well-known attacks in the literature, such as brute force and known/chosen plain text attacks.
Generalized double-humped logistic map-based medical image encryption
Directory of Open Access Journals (Sweden)
Samar M. Ismail
2018-03-01
Full Text Available This paper presents the design of the generalized Double Humped (DH logistic map, used for pseudo-random number key generation (PRNG. The generalized parameter added to the map provides more control on the map chaotic range. A new special map with a zooming effect of the bifurcation diagram is obtained by manipulating the generalization parameter value. The dynamic behavior of the generalized map is analyzed, including the study of the fixed points and stability ranges, Lyapunov exponent, and the complete bifurcation diagram. The option of designing any specific map is made possible through changing the general parameter increasing the randomness and controllability of the map. An image encryption algorithm is introduced based on pseudo-random sequence generation using the proposed generalized DH map offering secure communication transfer of medical MRI and X-ray images. Security analyses are carried out to consolidate system efficiency including: key sensitivity and key-space analyses, histogram analysis, correlation coefficients, MAE, NPCR and UACI calculations. System robustness against noise attacks has been proved along with the NIST test ensuring the system efficiency. A comparison between the proposed system with respect to previous works is presented.
Generalized projective synchronization of chaotic systems via adaptive learning control
International Nuclear Information System (INIS)
Yun-Ping, Sun; Jun-Min, Li; Hui-Lin, Wang; Jiang-An, Wang
2010-01-01
In this paper, a learning control approach is applied to the generalized projective synchronisation (GPS) of different chaotic systems with unknown periodically time-varying parameters. Using the Lyapunov–Krasovskii functional stability theory, a differential-difference mixed parametric learning law and an adaptive learning control law are constructed to make the states of two different chaotic systems asymptotically synchronised. The scheme is successfully applied to the generalized projective synchronisation between the Lorenz system and Chen system. Moreover, numerical simulations results are used to verify the effectiveness of the proposed scheme. (general)
General Impossibility of Group Homomorphic Encryption in the Quantum World
Armknecht, Frederik; Gagliardoni, Tommaso; Katzenbeisser, Stefan; Peter, Andreas
2014-01-01
Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation. Unfortunately, recent advances in quantum computation show that
International Nuclear Information System (INIS)
Wei Jun; Liao Xiaofeng; Wong, Kwok-wo; Xiang Tao
2006-01-01
Based on the study of some previously proposed chaotic encryption algorithms, we found that it is dangerous to mix chaotic state or iteration number of the chaotic system with ciphertext. In this paper, a new chaotic cryptosystem is proposed. Instead of simply mixing the chaotic signal of the proposed chaotic cryptosystem with the ciphertext, a noise-like variable is utilized to govern the encryption and decryption processes. This adds statistical sense to the new cryptosystem. Numerical simulations show that the new cryptosystem is practical whenever efficiency, ciphertext length or security is concerned
A chaotic modified-DFT encryption scheme for physical layer security and PAPR reduction in OFDM-PON
Fu, Xiaosong; Bi, Meihua; Zhou, Xuefang; Yang, Guowei; Li, Qiliang; Zhou, Zhao; Yang, Xuelin
2018-05-01
This letter proposes a modified discrete Fourier transform (DFT) encryption scheme with multi-dimensional chaos for the physical layer security and peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing passive optical network (OFDM-PON) system. This multiple-fold encryption algorithm is mainly composed by using the column vectors permutation and the random phase encryption in the standard DFT matrix, which can create ∼10551 key space. The transmission of ∼10 Gb/s encrypted OFDM signal is verified over 20-km standard single mode fiber (SMF). Moreover, experimental results show that, the proposed scheme can achieve ∼2.6-dB PAPR reduction and ∼1-dB improvement of receiver sensitivity if compared with the common OFDM-PON.
International Nuclear Information System (INIS)
Wang Xing-Yuan; Bao Xue-Mei
2013-01-01
In this paper, we propose a novel block cryptographic scheme based on a spatiotemporal chaotic system and a chaotic neural network (CNN). The employed CNN comprises a 4-neuron layer called a chaotic neuron layer (CNL), where the spatiotemporal chaotic system participates in generating its weight matrix and other parameters. The spatiotemporal chaotic system used in our scheme is the typical coupled map lattice (CML), which can be easily implemented in parallel by hardware. A 160-bit-long binary sequence is used to generate the initial conditions of the CML. The decryption process is symmetric relative to the encryption process. Theoretical analysis and experimental results prove that the block cryptosystem is secure and practical, and suitable for image encryption. (general)
Quantum image encryption based on generalized affine transform and logistic map
Liang, Hao-Ran; Tao, Xiang-Yang; Zhou, Nan-Run
2016-07-01
Quantum circuits of the generalized affine transform are devised based on the novel enhanced quantum representation of digital images. A novel quantum image encryption algorithm combining the generalized affine transform with logistic map is suggested. The gray-level information of the quantum image is encrypted by the XOR operation with a key generator controlled by the logistic map, while the position information of the quantum image is encoded by the generalized affine transform. The encryption keys include the independent control parameters used in the generalized affine transform and the logistic map. Thus, the key space is large enough to frustrate the possible brute-force attack. Numerical simulations and analyses indicate that the proposed algorithm is realizable, robust and has a better performance than its classical counterpart in terms of computational complexity.
A General Construction of IND-CCA2 Secure Public Key Encryption
DEFF Research Database (Denmark)
Kiltz, Eike; Malone-Lee, John
2003-01-01
We propose a general construction for public key encryption schemes that are IND-CCA2 secure in the random oracle model. We show that the scheme proposed in [1, 2] fits our general framework and moreover that our method of analysis leads to a more efficient security reduction....
Wang, Zhongpeng; Chen, Fangni; Qiu, Weiwei; Chen, Shoufa; Ren, Dongxiao
2018-03-01
In this paper, a two-layer image encryption scheme for a discrete cosine transform (DCT) precoded orthogonal frequency division multiplexing (OFDM) visible light communication (VLC) system is proposed. Firstly, in the proposed scheme the transmitted image is first encrypted by a chaos scrambling sequence,which is generated from the hybrid 4-D hyper- and Arnold map in the upper-layer. After that, the encrypted image is converted into digital QAM modulation signal, which is re-encrypted by chaos scrambling sequence based on Arnold map in physical layer to further enhance the security of the transmitted image. Moreover, DCT precoding is employed to improve BER performance of the proposed system and reduce the PAPR of OFDM signal. The BER and PAPR performances of the proposed system are evaluated by simulation experiments. The experiment results show that the proposed two-layer chaos scrambling schemes achieve image secure transmission for image-based OFDM VLC. Furthermore, DCT precoding can reduce the PAPR and improve the BER performance of OFDM-based VLC.
Directory of Open Access Journals (Sweden)
Junwei Sun
2014-01-01
Full Text Available Some important dynamical properties of the memristor chaotic oscillator system have been studied in the paper. A novel hybrid dislocated control method and a general hybrid projective dislocated synchronization scheme have been realized for memristor chaotic oscillator system. The paper firstly presents hybrid dislocated control method for stabilizing chaos to the unstable equilibrium point. Based on the Lyapunov stability theorem, general hybrid projective dislocated synchronization has been studied for the drive memristor chaotic oscillator system and the same response memristor chaotic oscillator system. For the different dimensions, the memristor chaotic oscillator system and the other chaotic system have realized general hybrid projective dislocated synchronization. Numerical simulations are given to show the effectiveness of these methods.
Hardware Realization of Chaos Based Symmetric Image Encryption
Barakat, Mohamed L.
2012-06-01
This thesis presents a novel work on hardware realization of symmetric image encryption utilizing chaos based continuous systems as pseudo random number generators. Digital implementation of chaotic systems results in serious degradations in the dynamics of the system. Such defects are illuminated through a new technique of generalized post proceeding with very low hardware cost. The thesis further discusses two encryption algorithms designed and implemented as a block cipher and a stream cipher. The security of both systems is thoroughly analyzed and the performance is compared with other reported systems showing a superior results. Both systems are realized on Xilinx Vetrix-4 FPGA with a hardware and throughput performance surpassing known encryption systems.
Chaos based encryption system for encrypting electroencephalogram signals.
Lin, Chin-Feng; Shih, Shun-Han; Zhu, Jin-De
2014-05-01
In the paper, we use the Microsoft Visual Studio Development Kit and C# programming language to implement a chaos-based electroencephalogram (EEG) encryption system involving three encryption levels. A chaos logic map, initial value, and bifurcation parameter for the map were used to generate Level I chaos-based EEG encryption bit streams. Two encryption-level parameters were added to these elements to generate Level II chaos-based EEG encryption bit streams. An additional chaotic map and chaotic address index assignment process was used to implement the Level III chaos-based EEG encryption system. Eight 16-channel EEG Vue signals were tested using the encryption system. The encryption was the most rapid and robust in the Level III system. The test yielded superior encryption results, and when the correct deciphering parameter was applied, the EEG signals were completely recovered. However, an input parameter error (e.g., a 0.00001 % initial point error) causes chaotic encryption bit streams, preventing the recovery of 16-channel EEG Vue signals.
The existence of generalized synchronization of chaotic systems in complex networks.
Hu, Aihua; Xu, Zhenyuan; Guo, Liuxiao
2010-03-01
The paper studies the existence of generalized synchronization in complex networks, which consist of chaotic systems. When a part of modified nodes are chaotic, and the others have asymptotically stable equilibriums or orbital asymptotically stable periodic solutions, under certain conditions, the existence of generalized synchronization can be turned to the problem of contractive fixed point in the family of Lipschitz functions. In addition, theoretical proofs are proposed to the exponential attractive property of generalized synchronization manifold. Numerical simulations validate the theory.
Energy Technology Data Exchange (ETDEWEB)
Xu Yuhua [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teacher' s College, Hubei 442000 (China)], E-mail: yuhuaxu2004@163.com; Zhou Wuneng [College of Information Science and Technology, Donghua University, Shanghai 201620 (China)], E-mail: wnzhou@163.com; Fang Jianan [College of Information Science and Technology, Donghua University, Shanghai 201620 (China)
2009-11-15
This paper introduces a modified Lue chaotic system, and some basic dynamical properties are studied. Based on these properties, we present hybrid dislocated control method for stabilizing chaos to unstable equilibrium and limit cycle. In addition, based on the Lyapunov stability theorem, general hybrid projective dislocated synchronization (GHPDS) is proposed, which includes complete dislocated synchronization, dislocated anti-synchronization and projective dislocated synchronization as its special item. The drive and response systems discussed in this paper can be strictly different dynamical systems (including different dimensional systems). As examples, the modified Lue chaotic system, Chen chaotic system and hyperchaotic Chen system are discussed. Numerical simulations are given to show the effectiveness of these methods.
Stabilization of generalized fractional order chaotic systems using state feedback control
International Nuclear Information System (INIS)
Ahmad, Wajdi M.; El-Khazali, Reyad; Al-Assaf, Yousef
2004-01-01
In this paper, we address the problem of chaos control of three types of fractional order systems using simple state feedback gains. Electronic chaotic oscillators, mechanical 'jerk' systems, and the Chen system are investigated when they assume generalized fractional orders. We design the static gains to place the eigenvalues of the system Jacobian matrices in a stable region whose boundaries are determined by the orders of the fractional derivatives. We numerically demonstrate the effectiveness of the controller in eliminating the chaotic behavior from the state trajectories, and driving the states to the nearest equilibrium point in the basin of attraction. For the recently introduced Chen system, in particular, we demonstrate that with a proper choice of model parameters, chaotic behavior is preserved when the system order becomes fractional. Both state and output feedback controllers are then designed to stabilize a generalized fractional order Chen system
Hung, Yung-Ching; Hwang, Chi-Chuan; Liao, Teh-Lu; Yan, Jun-Juh
2006-09-01
In this paper we investigate the synchronization problem of drive-response chaotic systems with a scalar coupling signal. By using the scalar transmitted signal from the drive chaotic system, an observer-based response chaotic system with dead-zone nonlinear input is designed. An output feedback control technique is derived to achieve generalized projective synchronization between the drive system and the response system. Furthermore, an adaptive control law is established that guarantees generalized projective synchronization without the knowledge of system nonlinearity, and/or system parameters as well as that of parameters in dead-zone input nonlinearity. Two illustrative examples are given to demonstrate the effectiveness of the proposed synchronization scheme.
International Nuclear Information System (INIS)
Wu Xiangjun; Lu Hongtao
2011-01-01
Highlights: → Adaptive generalized function projective lag synchronization (AGFPLS) is proposed. → Two uncertain chaos systems are lag synchronized up to a scaling function matrix. → The synchronization speed is sensitively influenced by the control gains. → The AGFPLS scheme is robust against noise perturbation. - Abstract: In this paper, a novel projective synchronization scheme called adaptive generalized function projective lag synchronization (AGFPLS) is proposed. In the AGFPLS method, the states of two different chaotic systems with fully uncertain parameters are asymptotically lag synchronized up to a desired scaling function matrix. By means of the Lyapunov stability theory, an adaptive controller with corresponding parameter update rule is designed for achieving AGFPLS between two diverse chaotic systems and estimating the unknown parameters. This technique is employed to realize AGFPLS between uncertain Lue chaotic system and uncertain Liu chaotic system, and between Chen hyperchaotic system and Lorenz hyperchaotic system with fully uncertain parameters, respectively. Furthermore, AGFPLS between two different uncertain chaotic systems can still be achieved effectively with the existence of noise perturbation. The corresponding numerical simulations are performed to demonstrate the validity and robustness of the presented synchronization method.
Generalized projective synchronization of chaotic nonlinear gyros coupled with dead-zone input
International Nuclear Information System (INIS)
Hung, M.-L.; Yan, J.-J.; Liao, T.-L.
2008-01-01
This paper addresses the synchronization problem of drive-response chaotic gyros coupled with dead-zone nonlinear input. Using the sliding mode control technique, a novel control law is established which guarantees generalized projective synchronization even when the dead-zone nonlinearity is present. Numerical simulations are presented to verify that the synchronization can be achieved by using the proposed synchronization scheme
A Bidirectional Generalized Synchronization Theorem-Based Chaotic Pseudo-random Number Generator
Han Shuangshuang; Min Lequan
2013-01-01
Based on a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS), whose prototype is a novel chaotic system introduced in [12]. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H.A chaos-based pseudo-random number generator (CPNG) was designed by the new BGCSDS. Using the FIPS-140-2 tests iss...
Czech Academy of Sciences Publication Activity Database
Čelikovský, Sergej; Lynnyk, Volodymyr
2016-01-01
Roč. 26, č. 8 (2016), 1650140-1-1650140-15 ISSN 0218-1274 R&D Projects: GA ČR GA13-20433S Institutional support: RVO:67985556 Keywords : Chaotic masking * generalized Lorenz system * message embedded synchronization Subject RIV: BC - Control System s Theory Impact factor: 1.329, year: 2016 http://library.utia.cas.cz/separaty/2016/TR/celikovsky-0461536.pdf
A new chaotic secure communication scheme
Energy Technology Data Exchange (ETDEWEB)
Hua Changchun [Institute of Electrical Engineering, Yanshan University, Qinhuangdao 066004 (China)]. E-mail: cch@ysu.edu.cn; Yang Bo [Institute of Electrical Engineering, Yanshan University, Qinhuangdao 066004 (China); Ouyang Gaoxiang [Institute of Electrical Engineering, Yanshan University, Qinhuangdao 066004 (China); Guan Xinping [Institute of Electrical Engineering, Yanshan University, Qinhuangdao 066004 (China)]. E-mail: xpguan@ysu.edu.cn
2005-07-18
A new chaotic secure communication scheme is constructed. Unified chaotic system is used to encrypt the emitted signal. Different from the existing chaotic secure communication methods, the useful information is embodied in the parameter of chaotic systems in this Letter. The receiver is designed which can succeed in recovering the former signal. Finally computer simulations are done to verify the proposed methods, and the results show that the obtained theoretic results are feasible and efficient.
International Nuclear Information System (INIS)
Farivar, Faezeh; Aliyari Shoorehdeli, Mahdi; Nekoui, Mohammad Ali; Teshnehlab, Mohammad
2012-01-01
Highlights: ► A systematic procedure for GPS of unknown heavy chaotic gyroscope systems. ► Proposed methods are based on Lyapunov stability theory. ► Without calculating Lyapunov exponents and Eigen values of the Jacobian matrix. ► Capable to extend for a variety of chaotic systems. ► Useful for practical applications in the future. - Abstract: This paper proposes the chaos control and the generalized projective synchronization methods for heavy symmetric gyroscope systems via Gaussian radial basis adaptive variable structure control. Because of the nonlinear terms of the gyroscope system, the system exhibits chaotic motions. Occasionally, the extreme sensitivity to initial states in a system operating in chaotic mode can be very destructive to the system because of unpredictable behavior. In order to improve the performance of a dynamic system or avoid the chaotic phenomena, it is necessary to control a chaotic system with a periodic motion beneficial for working with a particular condition. As chaotic signals are usually broadband and noise like, synchronized chaotic systems can be used as cipher generators for secure communication. This paper presents chaos synchronization of two identical chaotic motions of symmetric gyroscopes. In this paper, the switching surfaces are adopted to ensure the stability of the error dynamics in variable structure control. Using the neural variable structure control technique, control laws are established which guarantees the chaos control and the generalized projective synchronization of unknown gyroscope systems. In the neural variable structure control, Gaussian radial basis functions are utilized to on-line estimate the system dynamic functions. Also, the adaptation laws of the on-line estimator are derived in the sense of Lyapunov function. Thus, the unknown gyro systems can be guaranteed to be asymptotically stable. Also, the proposed method can achieve the control objectives. Numerical simulations are presented to
Chatterjee, Sanjit
2011-01-01
Identity Based Encryption (IBE) is a type of public key encryption and has been intensely researched in the past decade. Identity-Based Encryption summarizes the available research for IBE and the main ideas that would enable users to pursue further work in this area. This book will also cover a brief background on Elliptic Curves and Pairings, security against chosen Cipher text Attacks, standards and more. Advanced-level students in computer science and mathematics who specialize in cryptology, and the general community of researchers in the area of cryptology and data security will find Ide
Yang, Ningning; Xu, Cheng; Wu, Chaojun; Jia, Rong; Liu, Chongxin
2017-12-01
Memristor is a nonlinear “missing circuit element”, that can easily achieve chaotic oscillation. Memristor-based chaotic systems have received more and more attention. Research shows that fractional-order systems are more close to real systems. As an important parameter, the order can increase the flexibility and degree of freedom of the system. In this paper, a fractional-order generalized memristor, which consists of a diode bridge and a parallel circuit with an equivalent unit circuit and a linear resistance, is proposed. Frequency and electrical characteristics of the fractional-order memristor are analyzed. A chain structure circuit is used to implement the fractional-order unit circuit. Then replacing the conventional Chua’s diode by the fractional-order generalized memristor, a fractional-order memristor-based chaotic circuit is proposed. A large amount of research work has been done to investigate the influence of the order on the dynamical behaviors of the fractional-order memristor-based chaotic circuit. Varying with the order, the system enters the chaotic state from the periodic state through the Hopf bifurcation and period-doubling bifurcation. The chaotic state of the system has two types of attractors: single-scroll and double-scroll attractor. The stability theory of fractional-order systems is used to determine the minimum order occurring Hopf bifurcation. And the influence of the initial value on the system is analyzed. Circuit simulations are designed to verify the results of theoretical analysis and numerical simulation.
Decoding Generalized Reed-Solomon Codes and Its Application to RLCE Encryption Schemes
Wang, Yongge
2017-01-01
This paper compares the efficiency of various algorithms for implementing quantum resistant public key encryption scheme RLCE on 64-bit CPUs. By optimizing various algorithms for polynomial and matrix operations over finite fields, we obtained several interesting (or even surprising) results. For example, it is well known (e.g., Moenck 1976 \\cite{moenck1976practical}) that Karatsuba's algorithm outperforms classical polynomial multiplication algorithm from the degree 15 and above (practically...
A Bidirectional Generalized Synchronization Theorem-Based Chaotic Pseudo-random Number Generator
Directory of Open Access Journals (Sweden)
Han Shuangshuang
2013-07-01
Full Text Available Based on a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS, whose prototype is a novel chaotic system introduced in [12]. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H.A chaos-based pseudo-random number generator (CPNG was designed by the new BGCSDS. Using the FIPS-140-2 tests issued by the National Institute of Standard and Technology (NIST verified the randomness of the 1000 binary number sequences generated via the CPNG and the RC4 algorithm respectively. The results showed that all the tested sequences passed the FIPS-140-2 tests. The confidence interval analysis showed the statistical properties of the randomness of the sequences generated via the CPNG and the RC4 algorithm do not have significant differences.
Directory of Open Access Journals (Sweden)
Wafaa S. Sayed
2017-01-01
Full Text Available 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.
Substring-Searchable Symmetric Encryption
Directory of Open Access Journals (Sweden)
Chase Melissa
2015-06-01
Full Text Available In this paper, we consider a setting where a client wants to outsource storage of a large amount of private data and then perform substring search queries on the data – given a data string s and a search string p, find all occurrences of p as a substring of s. First, we formalize an encryption paradigm that we call queryable encryption, which generalizes searchable symmetric encryption (SSE and structured encryption. Then, we construct a queryable encryption scheme for substring queries. Our construction uses suffix trees and achieves asymptotic efficiency comparable to that of unencrypted suffix trees. Encryption of a string of length n takes O(λn time and produces a ciphertext of size O(λn, and querying for a substring of length m that occurs k times takes O(λm+k time and three rounds of communication. Our security definition guarantees correctness of query results and privacy of data and queries against a malicious adversary. Following the line of work started by Curtmola et al. (ACM CCS 2006, in order to construct more efficient schemes we allow the query protocol to leak some limited information that is captured precisely in the definition. We prove security of our substring-searchable encryption scheme against malicious adversaries, where the query protocol leaks limited information about memory access patterns through the suffix tree of the encrypted string.
Towards a General Theory of Extremes for Observables of Chaotic Dynamical Systems.
Lucarini, Valerio; Faranda, Davide; Wouters, Jeroen; Kuna, Tobias
2014-01-01
In this paper we provide a connection between the geometrical properties of the attractor of a chaotic dynamical system and the distribution of extreme values. We show that the extremes of so-called physical observables are distributed according to the classical generalised Pareto distribution and derive explicit expressions for the scaling and the shape parameter. In particular, we derive that the shape parameter does not depend on the chosen observables, but only on the partial dimensions of the invariant measure on the stable, unstable, and neutral manifolds. The shape parameter is negative and is close to zero when high-dimensional systems are considered. This result agrees with what was derived recently using the generalized extreme value approach. Combining the results obtained using such physical observables and the properties of the extremes of distance observables, it is possible to derive estimates of the partial dimensions of the attractor along the stable and the unstable directions of the flow. Moreover, by writing the shape parameter in terms of moments of the extremes of the considered observable and by using linear response theory, we relate the sensitivity to perturbations of the shape parameter to the sensitivity of the moments, of the partial dimensions, and of the Kaplan-Yorke dimension of the attractor. Preliminary numerical investigations provide encouraging results on the applicability of the theory presented here. The results presented here do not apply for all combinations of Axiom A systems and observables, but the breakdown seems to be related to very special geometrical configurations.
A novel block encryption scheme based on chaos and an S-box for wireless sensor networks
International Nuclear Information System (INIS)
Tong Xiao-Jun; Zuo Ke; Wang Zhu
2012-01-01
The wireless sensor network (WSN) has been widely used in various fields, but it still remains in the preliminary discovery and research phase with a lack of various related mature technologies. Traditional encryption schemes are not suitable for wireless sensor networks due to intrinsic features of the nodes such as low energy, limited computation capability, and lack of storage resources. In this paper, we present a novel block encryption scheme based on the integer discretization of a chaotic map, the Feistel network structure, and an S-box. The novel scheme is fast, secure, has low resource consumption and is suitable for wireless sensor network node encryption schemes. The experimental tests are carried out with detailed analysis, showing that the novel block algorithm has a large key space, very good diffusion and disruptive performances, a strict avalanche effect, excellent statistical balance, and fast encryption speed. These features enable the encryption scheme to pass the SP800-22 test. Meanwhile, the analysis and the testing of speed, time, and storage space on the simulator platform show that this new encryption scheme is well able to hide data information in wireless sensor networks. (general)
Chaos-based image encryption algorithm
International Nuclear Information System (INIS)
Guan Zhihong; Huang Fangjun; Guan Wenjie
2005-01-01
In this Letter, a new image encryption scheme is presented, in which shuffling the positions and changing the grey values of image pixels are combined to confuse the relationship between the cipher-image and the plain-image. Firstly, the Arnold cat map is used to shuffle the positions of the image pixels in the spatial-domain. Then the discrete output signal of the Chen's chaotic system is preprocessed to be suitable for the grayscale image encryption, and the shuffled image is encrypted by the preprocessed signal pixel by pixel. The experimental results demonstrate that the key space is large enough to resist the brute-force attack and the distribution of grey values of the encrypted image has a random-like behavior
DEFF Research Database (Denmark)
2013-01-01
Disclosed is a method of transmitting a data set using encryption, wherein the method comprises the steps of: selecting a first encryption technique, wherein said first encryption technique comprises a first encryption algorithm for encrypting plain data into cipher data, and a first decryption...
A Novel Audio Cryptosystem Using Chaotic Maps and DNA Encoding
Directory of Open Access Journals (Sweden)
S. J. Sheela
2017-01-01
Full Text Available Chaotic maps have good potential in security applications due to their inherent characteristics relevant to cryptography. This paper introduces a new audio cryptosystem based on chaotic maps, hybrid chaotic shift transform (HCST, and deoxyribonucleic acid (DNA encoding rules. The scheme uses chaotic maps such as two-dimensional modified Henon map (2D-MHM and standard map. The 2D-MHM which has sophisticated chaotic behavior for an extensive range of control parameters is used to perform HCST. DNA encoding technology is used as an auxiliary tool which enhances the security of the cryptosystem. The performance of the algorithm is evaluated for various speech signals using different encryption/decryption quality metrics. The simulation and comparison results show that the algorithm can achieve good encryption results and is able to resist several cryptographic attacks. The various types of analysis revealed that the algorithm is suitable for narrow band radio communication and real-time speech encryption applications.
Image encryption a communication perspective
Abd El-Samie, Fathi E; Elashry, Ibrahim F; Shahieen, Mai H; Faragallah, Osama S; El-Rabaie, El-Sayed M; Alshebeili, Saleh A
2013-01-01
Presenting encryption algorithms with diverse characteristics, Image Encryption: A Communication Perspective examines image encryption algorithms for the purpose of secure wireless communication. It considers two directions for image encryption: permutation-based approaches encryption and substitution-based approaches.Covering the spectrum of image encryption principles and techniques, the book compares image encryption with permutation- and diffusion-based approaches. It explores number theory-based encryption algorithms such as the Data Encryption Standard, the Advanced Encryption Standard,
Yuan, Fang; Wang, Guangyi; Wang, Xiaowei
2017-03-01
In this paper, smooth curve models of meminductor and memcapacitor are designed, which are generalized from a memristor. Based on these models, a new five-dimensional chaotic oscillator that contains a meminductor and memcapacitor is proposed. By dimensionality reducing, this five-dimensional system can be transformed into a three-dimensional system. The main work of this paper is to give the comparisons between the five-dimensional system and its dimensionality reduction model. To investigate dynamics behaviors of the two systems, equilibrium points and stabilities are analyzed. And the bifurcation diagrams and Lyapunov exponent spectrums are used to explore their properties. In addition, digital signal processing technologies are used to realize this chaotic oscillator, and chaotic sequences are generated by the experimental device, which can be used in encryption applications.
A fractal-based image encryption system
Abd-El-Hafiz, S. K.
2014-12-01
This study introduces a novel image encryption system based on diffusion and confusion processes in which the image information is hidden inside the complex details of fractal images. A simplified encryption technique is, first, presented using a single-fractal image and statistical analysis is performed. A general encryption system utilising multiple fractal images is, then, introduced to improve the performance and increase the encryption key up to hundreds of bits. This improvement is achieved through several parameters: feedback delay, multiplexing and independent horizontal or vertical shifts. The effect of each parameter is studied separately and, then, they are combined to illustrate their influence on the encryption quality. The encryption quality is evaluated using different analysis techniques such as correlation coefficients, differential attack measures, histogram distributions, key sensitivity analysis and the National Institute of Standards and Technology (NIST) statistical test suite. The obtained results show great potential compared to other techniques.
Optical image encryption topology.
Yong-Liang, Xiao; Xin, Zhou; Qiong-Hua, Wang; Sheng, Yuan; Yao-Yao, Chen
2009-10-15
Optical image encryption topology is proposed based on the principle of random-phase encoding. Various encryption topological units, involving peer-to-peer, ring, star, and tree topologies, can be realized by an optical 6f system. These topological units can be interconnected to constitute an optical image encryption network. The encryption and decryption can be performed in both digital and optical methods.
A novel block cryptosystem based on iterating a chaotic map
International Nuclear Information System (INIS)
Xiang Tao; Liao Xiaofeng; Tang Guoping; Chen Yong; Wong, Kwok-wo
2006-01-01
A block cryptographic scheme based on iterating a chaotic map is proposed. With random binary sequences generated from the real-valued chaotic map, the plaintext block is permuted by a key-dependent shift approach and then encrypted by the classical chaotic masking technique. Simulation results show that performance and security of the proposed cryptographic scheme are better than those of existing algorithms. Advantages and security of our scheme are also discussed in detail
Discrete-Time Biomedical Signal Encryption
Directory of Open Access Journals (Sweden)
Victor Grigoraş
2017-12-01
Full Text Available Chaotic modulation is a strong method of improving communication security. Analog and discrete chaotic systems are presented in actual literature. Due to the expansion of digital communication, discrete-time systems become more efficient and closer to actual technology. The present contribution offers an in-depth analysis of the effects chaos encryption produce on 1D and 2D biomedical signals. The performed simulations show that modulating signals are precisely recovered by the synchronizing receiver if discrete systems are digitally implemented and the coefficients precisely correspond. Channel noise is also applied and its effects on biomedical signal demodulation are highlighted.
File compression and encryption based on LLS and arithmetic coding
Yu, Changzhi; Li, Hengjian; Wang, Xiyu
2018-03-01
e propose a file compression model based on arithmetic coding. Firstly, the original symbols, to be encoded, are input to the encoder one by one, we produce a set of chaotic sequences by using the Logistic and sine chaos system(LLS), and the values of this chaotic sequences are randomly modified the Upper and lower limits of current symbols probability. In order to achieve the purpose of encryption, we modify the upper and lower limits of all character probabilities when encoding each symbols. Experimental results show that the proposed model can achieve the purpose of data encryption while achieving almost the same compression efficiency as the arithmetic coding.
The security energy encryption in wireless power transfer
Sadzali, M. N.; Ali, A.; Azizan, M. M.; Albreem, M. A. M.
2017-09-01
This paper presents a concept of security in wireless power transfer (WPT) by applying chaos theory. Chaos theory is applied as a security system in order to safeguard the transfer of energy from a transmitter to the intended receiver. The energy encryption of the wireless power transfer utilizes chaos theory to generate the possibility of a logistic map for the chaotic security key. The simulation for energy encryption wireless power transfer system was conducted by using MATLAB and Simulink. By employing chaos theory, the chaotic key ensures the transmission of energy from transmitter to its intended receiver.
A Novel Image Encryption Algorithm Based on DNA Subsequence Operation
Directory of Open Access Journals (Sweden)
Qiang Zhang
2012-01-01
Full Text Available We present a novel image encryption algorithm based on DNA subsequence operation. Different from the traditional DNA encryption methods, our algorithm does not use complex biological operation but just uses the idea of DNA subsequence operations (such as elongation operation, truncation operation, deletion operation, etc. combining with the logistic chaotic map to scramble the location and the value of pixel points from the image. The experimental results and security analysis show that the proposed algorithm is easy to be implemented, can get good encryption effect, has a wide secret key's space, strong sensitivity to secret key, and has the abilities of resisting exhaustive attack and statistic attack.
Chaotic Image Scrambling Algorithm Based on S-DES
International Nuclear Information System (INIS)
Yu, X Y; Zhang, J; Ren, H E; Xu, G S; Luo, X Y
2006-01-01
With the security requirement improvement of the image on the network, some typical image encryption methods can't meet the demands of encryption, such as Arnold cat map and Hilbert transformation. S-DES system can encrypt the input binary flow of image, but the fixed system structure and few keys will still bring some risks. However, the sensitivity of initial value that Logistic chaotic map can be well applied to the system of S-DES, which makes S-DES have larger random and key quantities. A dual image encryption algorithm based on S-DES and Logistic map is proposed. Through Matlab simulation experiments, the key quantities will attain 10 17 and the encryption speed of one image doesn't exceed one second. Compared to traditional methods, it has some merits such as easy to understand, rapid encryption speed, large keys and sensitivity to initial value
Suzuki, Hideyuki; Imura, Jun-ichi; Horio, Yoshihiko; Aihara, Kazuyuki
2013-01-01
The chaotic Boltzmann machine proposed in this paper is a chaotic pseudo-billiard system that works as a Boltzmann machine. Chaotic Boltzmann machines are shown numerically to have computing abilities comparable to conventional (stochastic) Boltzmann machines. Since no randomness is required, efficient hardware implementation is expected. Moreover, the ferromagnetic phase transition of the Ising model is shown to be characterised by the largest Lyapunov exponent of the proposed system. In general, a method to relate probabilistic models to nonlinear dynamics by derandomising Gibbs sampling is presented. PMID:23558425
A Survey of Image Encryption Algorithms
Kumari, Manju; Gupta, Shailender; Sardana, Pranshul
2017-12-01
Security of data/images is one of the crucial aspects in the gigantic and still expanding domain of digital transfer. Encryption of images is one of the well known mechanisms to preserve confidentiality of images over a reliable unrestricted public media. This medium is vulnerable to attacks and hence efficient encryption algorithms are necessity for secure data transfer. Various techniques have been proposed in literature till date, each have an edge over the other, to catch-up to the ever growing need of security. This paper is an effort to compare the most popular techniques available on the basis of various performance metrics like differential, statistical and quantitative attacks analysis. To measure the efficacy, all the modern and grown-up techniques are implemented in MATLAB-2015. The results show that the chaotic schemes used in the study provide highly scrambled encrypted images having uniform histogram distribution. In addition, the encrypted images provided very less degree of correlation coefficient values in horizontal, vertical and diagonal directions, proving their resistance against statistical attacks. In addition, these schemes are able to resist differential attacks as these showed a high sensitivity for the initial conditions, i.e. pixel and key values. Finally, the schemes provide a large key spacing, hence can resist the brute force attacks, and provided a very less computational time for image encryption/decryption in comparison to other schemes available in literature.
Image encryption using the Sudoku matrix
Wu, Yue; Zhou, Yicong; Noonan, Joseph P.; Panetta, Karen; Agaian, Sos
2010-04-01
This paper introduces a new effective and lossless image encryption algorithm using a Sudoku Matrix to scramble and encrypt the image. The new algorithm encrypts an image through a three stage process. In the first stage, a reference Sudoku matrix is generated as the foundation for the encryption and scrambling processes. The image pixels' intensities are then changed by using the reference Sudoku matrix values, and then the pixels' positions are shuffled using the Sudoku matrix as a mapping process. The advantages of this method is useful for efficiently encrypting a variety of digital images, such as binary images, gray images, and RGB images without any quality loss. The security keys of the presented algorithm are the combination of the parameters in a 1D chaotic logistic map, a parameter to control the size of Sudoku Matrix and the number of iteration times desired for scrambling. The possible security key space is extremely large. The principles of the presented scheme could be applied to provide security for a variety of systems including image, audio and video systems.
A novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism
Ye, Ruisong
2011-10-01
This paper proposes a novel chaos-based image encryption scheme with an efficient permutation-diffusion mechanism, in which permuting the positions of image pixels incorporates with changing the gray values of image pixels to confuse the relationship between cipher-image and plain-image. In the permutation process, a generalized Arnold map is utilized to generate one chaotic orbit used to get two index order sequences for the permutation of image pixel positions; in the diffusion process, a generalized Arnold map and a generalized Bernoulli shift map are employed to yield two pseudo-random gray value sequences for a two-way diffusion of gray values. The yielded gray value sequences are not only sensitive to the control parameters and initial conditions of the considered chaotic maps, but also strongly depend on the plain-image processed, therefore the proposed scheme can resist statistical attack, differential attack, known-plaintext as well as chosen-plaintext attack. Experimental results are carried out with detailed analysis to demonstrate that the proposed image encryption scheme possesses large key space to resist brute-force attack as well.
Fully Digital Chaotic Oscillators Applied to Pseudo Random Number Generation
Mansingka, Abhinav S.
2012-05-01
This thesis presents a generalized approach for the fully digital design and implementation of chaos generators through the numerical solution of chaotic ordinary differential equations. In particular, implementations use the Euler approximation with a fixed-point twos complement number representation system for optimal hardware and performance. In general, digital design enables significant benefits in terms of power, area, throughput, reliability, repeatability and portability over analog implementations of chaos due to lower process, voltage and temperature sensitivities and easy compatibility with other digital systems such as microprocessors, digital signal processing units, communication systems and encryption systems. Furthermore, this thesis introduces the idea of implementing multidimensional chaotic systems rather than 1-D chaotic maps to enable wider throughputs and multiplier-free architectures that provide significant performance and area benefits. This work focuses efforts on the well-understood family of autonomous 3rd order "jerk" chaotic systems. The effect of implementation precision, internal delay cycles and external delay cycles on the chaotic response are assessed. Multiplexing of parameters is implemented to enable switching between chaotic and periodic modes of operation. Enhanced chaos generators that exploit long-term divergence in two identical systems of different precision are also explored. Digital design is shown to enable real-time controllability of 1D multiscroll systems and 4th order hyperchaotic systems, essentially creating non-autonomous chaos that has thus far been difficult to implement in the analog domain. Seven different systems are mathematically assessed for chaotic properties, implemented at the register transfer level in Verilog HDL and experimentally verified on a Xilinx Virtex 4 FPGA. The statistical properties of the output are rigorously studied using the NIST SP. 800-22 statistical testing suite. The output is
Chaos-Based Simultaneous Compression and Encryption for Hadoop.
Usama, Muhammad; Zakaria, Nordin
2017-01-01
Data compression and encryption are key components of commonly deployed platforms such as Hadoop. Numerous data compression and encryption tools are presently available on such platforms and the tools are characteristically applied in sequence, i.e., compression followed by encryption or encryption followed by compression. This paper focuses on the open-source Hadoop framework and proposes a data storage method that efficiently couples data compression with encryption. A simultaneous compression and encryption scheme is introduced that addresses an important implementation issue of source coding based on Tent Map and Piece-wise Linear Chaotic Map (PWLM), which is the infinite precision of real numbers that result from their long products. The approach proposed here solves the implementation issue by removing fractional components that are generated by the long products of real numbers. Moreover, it incorporates a stealth key that performs a cyclic shift in PWLM without compromising compression capabilities. In addition, the proposed approach implements a masking pseudorandom keystream that enhances encryption quality. The proposed algorithm demonstrated a congruent fit within the Hadoop framework, providing robust encryption security and compression.
Security Analysis of A Chaos-based Image Encryption Algorithm
Lian, Shiguo; Sun, Jinsheng; Wang, Zhiquan
2006-01-01
The security of Fridrich Image Encryption Algorithm against brute-force attack, statistical attack, known-plaintext attack and select-plaintext attack is analyzed by investigating the properties of the involved chaotic maps and diffusion functions. Based on the given analyses, some means are proposed to strengthen the overall performance of the focused cryptosystem.
A one-time pad color image cryptosystem based on SHA-3 and multiple chaotic systems
Wang, Xingyuan; Wang, Siwei; Zhang, Yingqian; Luo, Chao
2018-04-01
A novel image encryption algorithm is proposed that combines the SHA-3 hash function and two chaotic systems: the hyper-chaotic Lorenz and Chen systems. First, 384 bit keystream hash values are obtained by applying SHA-3 to plaintext. The sensitivity of the SHA-3 algorithm and chaotic systems ensures the effect of a one-time pad. Second, the color image is expanded into three-dimensional space. During permutation, it undergoes plane-plane displacements in the x, y and z dimensions. During diffusion, we use the adjacent pixel dataset and corresponding chaotic value to encrypt each pixel. Finally, the structure of alternating between permutation and diffusion is applied to enhance the level of security. Furthermore, we design techniques to improve the algorithm's encryption speed. Our experimental simulations show that the proposed cryptosystem achieves excellent encryption performance and can resist brute-force, statistical, and chosen-plaintext attacks.
Han, Dandan; Min, Lequan; Chen, Guanrong
Based on a stream encryption scheme with avalanche effect (SESAE), a stream encryption scheme with both key avalanche effect and plaintext avalanche effect (SESKPAE) is introduced. Using this scheme and an ideal 2d-word (d-segment) pseudorandom number generator (PRNG), a plaintext can be encrypted such that each bit of the ciphertext block has a change with the probable probability of (2d - 1)/2d when any word of the key is changed or any bit of the plaintext is changed. To that end, a novel four-dimensional discrete chaotic system (4DDCS) is proposed. Combining the 4DDCS with a generalized synchronization (GS) theorem, a novel eight-dimensional discrete GS chaotic system (8DDGSCS) is constructed. Using the 8DDGSCS, a 216-word chaotic pseudorandom number generator (CPRNG) is designed. The keyspace of the 216-word CPRNG is larger than 21195. Then, the FIPS 140-2 test suit/generalized FIPS 140-2 test suit is used to test the randomness of the 1000-key streams consisting of 20000 bits generated by the 216-word CPRNG, the RC4 algorithm PRNG and the ZUC algorithm PRNG, respectively. The test results show that for the three PRNGs, there are 100%/98.9%, 99.9%/98.8%, 100%/97.9% key streams passing the tests, respectively. Furthermore, the SP800-22 test suite is used to test the randomness of four 100-key streams consisting of 1000000 bits generated by four PRNGs, respectively. The numerical results show that the randomness performances of the 216-word CPRNG is promising, showing that there are no significant correlations between the key streams and the perturbed key streams generated via the 216-word CPRNG. Finally, using the 216-word CPRNG and the SESKPAE to encrypt two gray-scale images, test results demonstrate that the 216-word CPRNG is able to generate both key avalanche effect and plaintext avalanche effect, which are similar to those generated via an ideal CPRNG, and performs better than other comparable schemes.
Homomorphic encryption and secure comparison
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Geisler, Martin; Krøigaard, Mikkel
2008-01-01
We propose a protocol for secure comparison of integers based on homomorphic encryption.We also propose a homomorphic encryption scheme that can be used in our protocol, makes it more efficient than previous solutions, and can also be used as the basis of efficient and general secure Multiparty...... Computation (MPC). We show how our comparison protocol can be used to improve security of online auctions, and demonstrate that it is efficient enough to be used in practice. For comparison of 16 bits numbers with security based on 1024 bits RSA (executed by two parties), our implementation takes 0.28 sec...
Chaos-based image encryption algorithm [rapid communication
Guan, Zhi-Hong; Huang, Fangjun; Guan, Wenjie
2005-10-01
In this Letter, a new image encryption scheme is presented, in which shuffling the positions and changing the grey values of image pixels are combined to confuse the relationship between the cipher-image and the plain-image. Firstly, the Arnold cat map is used to shuffle the positions of the image pixels in the spatial-domain. Then the discrete output signal of the Chen's chaotic system is preprocessed to be suitable for the grayscale image encryption, and the shuffled image is encrypted by the preprocessed signal pixel by pixel. The experimental results demonstrate that the key space is large enough to resist the brute-force attack and the distribution of grey values of the encrypted image has a random-like behavior.
Hardware Realization of Chaos-based Symmetric Video Encryption
Ibrahim, Mohamad A.
2013-05-01
This thesis reports original work on hardware realization of symmetric video encryption using chaos-based continuous systems as pseudo-random number generators. The thesis also presents some of the serious degradations caused by digitally implementing chaotic systems. Subsequently, some techniques to eliminate such defects, including the ultimately adopted scheme are listed and explained in detail. Moreover, the thesis describes original work on the design of an encryption system to encrypt MPEG-2 video streams. Information about the MPEG-2 standard that fits this design context is presented. Then, the security of the proposed system is exhaustively analyzed and the performance is compared with other reported systems, showing superiority in performance and security. The thesis focuses more on the hardware and the circuit aspect of the system’s design. The system is realized on Xilinx Vetrix-4 FPGA with hardware parameters and throughput performance surpassing conventional encryption systems.
Belazi, Akram; Abd El-Latif, Ahmed A.; Diaconu, Adrian-Viorel; Rhouma, Rhouma; Belghith, Safya
2017-01-01
In this paper, a new chaos-based partial image encryption scheme based on Substitution-boxes (S-box) constructed by chaotic system and Linear Fractional Transform (LFT) is proposed. It encrypts only the requisite parts of the sensitive information in Lifting-Wavelet Transform (LWT) frequency domain based on hybrid of chaotic maps and a new S-box. In the proposed encryption scheme, the characteristics of confusion and diffusion are accomplished in three phases: block permutation, substitution, and diffusion. Then, we used dynamic keys instead of fixed keys used in other approaches, to control the encryption process and make any attack impossible. The new S-box was constructed by mixing of chaotic map and LFT to insure the high confidentiality in the inner encryption of the proposed approach. In addition, the hybrid compound of S-box and chaotic systems strengthened the whole encryption performance and enlarged the key space required to resist the brute force attacks. Extensive experiments were conducted to evaluate the security and efficiency of the proposed approach. In comparison with previous schemes, the proposed cryptosystem scheme showed high performances and great potential for prominent prevalence in cryptographic applications.
International Nuclear Information System (INIS)
Ge Zhengming; Chang Chingming
2009-01-01
By applying pure error dynamics and elaborate nondiagonal Lyapunov function, the nonlinear generalized synchronization is studied in this paper. Instead of current mixed error dynamics in which master state variables and slave state variables are presented, the nonlinear generalized synchronization can be obtained by pure error dynamics without auxiliary numerical simulation. The elaborate nondiagonal Lyapunov function is applied rather than current monotonous square sum Lyapunov function deeply weakening the powerfulness of Lyapunov direct method. Both autonomous and nonautonomous double Mathieu systems are used as examples with numerical simulations.
Vehicle security encryption based on unlicensed encryption
Huang, Haomin; Song, Jing; Xu, Zhijia; Ding, Xiaoke; Deng, Wei
2018-03-01
The current vehicle key is easy to be destroyed and damage, proposing the use of elliptical encryption algorithm is improving the reliability of vehicle security system. Based on the encryption rules of elliptic curve, the chip's framework and hardware structure are designed, then the chip calculation process simulation has been analyzed by software. The simulation has been achieved the expected target. Finally, some issues pointed out in the data calculation about the chip's storage control and other modules.
A novel secret image sharing scheme based on chaotic system
Li, Li; Abd El-Latif, Ahmed A.; Wang, Chuanjun; Li, Qiong; Niu, Xiamu
2012-04-01
In this paper, we propose a new secret image sharing scheme based on chaotic system and Shamir's method. The new scheme protects the shadow images with confidentiality and loss-tolerance simultaneously. In the new scheme, we generate the key sequence based on chaotic system and then encrypt the original image during the sharing phase. Experimental results and analysis of the proposed scheme demonstrate a better performance than other schemes and confirm a high probability to resist brute force attack.
Communicating via robust synchronization of chaotic lasers
Energy Technology Data Exchange (ETDEWEB)
Lopez-Gutierrez, R.M. [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103 Carret. Tij-Ens., 22860 Ensenada, B.C. (Mexico); Posadas-Castillo, C. [Engineering Faculty, Baja California Autonomous University (UABC), Km. 103 Carret. Tij-Ens., 22860 Ensenada, B.C. (Mexico); FIME, Autonomous University of Nuevo Leon (UANL), Pedro de Alba, S.N., Cd. Universitaria, San Nicolas de los Garza, NL (Mexico); Lopez-Mancilla, D. [Departamento de Ciencias Exactas y Tecnologicas, Centro Universitario de los Lagos, Universidad de Guadalajara (CULagos-UdeG), Enrique Diaz de Leon s/n, 47460 Lagos de Moreno, Jal. (Mexico); Cruz-Hernandez, C. [Electronics and Telecommunications Department, Scientific Research and Advanced Studies of Ensenada (CICESE), Km. 107 Carret. Tij-Ens., 22860 Ensenada, B.C. (Mexico)], E-mail: ccruz@cicese.mx
2009-10-15
In this paper, the robust synchronization problem for coupled chaotic Nd:YAG lasers is addressed. We resort to complex systems theory to achieve chaos synchronization. Based on stability theory, it is shown that the state trajectories of the perturbed error synchronization are ultimately bounded, provided the unperturbed synchronization error system is exponentially stable, and some conditions on the bounds of the perturbation terms are satisfied. So that, encoding, transmission, and decoding in chaotic optical communications are presented. We analyze the transmission and recovery of encrypted information when parameter mismatches are considered. Computer simulations are provided to show the effectiveness of this robustness synchronization property, we present the encrypted transmission of image messages, and we show that, the transmitted image is faithfully recovered.
Communicating via robust synchronization of chaotic lasers
International Nuclear Information System (INIS)
Lopez-Gutierrez, R.M.; Posadas-Castillo, C.; Lopez-Mancilla, D.; Cruz-Hernandez, C.
2009-01-01
In this paper, the robust synchronization problem for coupled chaotic Nd:YAG lasers is addressed. We resort to complex systems theory to achieve chaos synchronization. Based on stability theory, it is shown that the state trajectories of the perturbed error synchronization are ultimately bounded, provided the unperturbed synchronization error system is exponentially stable, and some conditions on the bounds of the perturbation terms are satisfied. So that, encoding, transmission, and decoding in chaotic optical communications are presented. We analyze the transmission and recovery of encrypted information when parameter mismatches are considered. Computer simulations are provided to show the effectiveness of this robustness synchronization property, we present the encrypted transmission of image messages, and we show that, the transmitted image is faithfully recovered.
Hierarchy of rational order families of chaotic maps with an invariant ...
Indian Academy of Sciences (India)
with the requirement of pseudo-random coding and cryptography [15,16] are exam- ples of interesting features of chaotic systems and it is natural to use chaos as a new source to construct new encryption systems [17]. In the present paper, we introduce the rational order families of chaotic maps as a new hierarchy of ...
Cryptanalysis and improvement on a block cryptosystem based on iteration a chaotic map
International Nuclear Information System (INIS)
Wang Yong; Liao Xiaofeng; Xiang Tao; Wong, Kwok-Wo; Yang Degang
2007-01-01
Recently, a novel block encryption system has been proposed as an improved version of the chaotic cryptographic method based on iterating a chaotic map. In this Letter, a flaw of this cryptosystem is pointed out and a chosen plaintext attack is presented. Furthermore, a remedial improvement is suggested, which avoids the flaw while keeping all the merits of the original cryptosystem
Enhanced Tiny Encryption Algorithm with Embedding (ETEA)
Virmani, Deepali; Beniwal, Nidhi; Mandal, Gargi; Talwar, Saloni
2013-01-01
As computer systems become more pervasive and complex, security is increasingly important. Secure Transmission refers to the transfer of data such as confidential or proprietary information over a secure channel. Many secure transmission methods require a type of encryption. Secure transmissions are put in place to prevent attacks such as ARP spoofing and general data loss. Hence, in order to provide a better security mechanism, in this paper we propose Enhanced Tiny Encryption Algorithm with...
Encryption for digital content
Kiayias, Aggelos
2010-01-01
Encryption for Digital Content is an area in cryptography that is widely used in commercial productions (e.g., Blu-Ray and HD-DVDs). This book provides a comprehensive mathematical treatment of combinatorial encryption techniques used in digital content distribution systems and related attack models. A complete description of broadcast encryption with various revocation and tracing functionalities is included. ""Encryption for Digital Content"" introduces the subset cover framework (currently used in AACS, Blu-Ray and HD-DVDs,) and tracking/revocation mechanisms in various attack models. Pirat
Color image encryption based on gyrator transform and Arnold transform
Sui, Liansheng; Gao, Bo
2013-06-01
A color image encryption scheme using gyrator transform and Arnold transform is proposed, which has two security levels. In the first level, the color image is separated into three components: red, green and blue, which are normalized and scrambled using the Arnold transform. The green component is combined with the first random phase mask and transformed to an interim using the gyrator transform. The first random phase mask is generated with the sum of the blue component and a logistic map. Similarly, the red component is combined with the second random phase mask and transformed to three-channel-related data. The second random phase mask is generated with the sum of the phase of the interim and an asymmetrical tent map. In the second level, the three-channel-related data are scrambled again and combined with the third random phase mask generated with the sum of the previous chaotic maps, and then encrypted into a gray scale ciphertext. The encryption result has stationary white noise distribution and camouflage property to some extent. In the process of encryption and decryption, the rotation angle of gyrator transform, the iterative numbers of Arnold transform, the parameters of the chaotic map and generated accompanied phase function serve as encryption keys, and hence enhance the security of the system. Simulation results and security analysis are presented to confirm the security, validity and feasibility of the proposed scheme.
Cracking Advanced Encryption Standard-A Review
Directory of Open Access Journals (Sweden)
Jashnil Kumar
2017-07-01
Full Text Available Password protection is a major security concern the world is facing today. While there are many publications available that discuss ways to protect passwords and data how widely user from around the world adhere to these rules are unknown. The novelty of this study is that this is the first time a review is done on software tools that can be used to crack Advanced Encryption Standards. Firstly the study does a review on top 10 software tools that are available to crack Advanced Encryption Standards. After which an analysis on two software tools was performed to see how long each software tool took to crack a password. The result of the study gives Advanced Encryption Standard researcher Network security researcher and the general public helpful information on how to strengthen advanced encryption standards and strengthen passwords that are hard for the software tools discussed above to crack.
Quantum Secure Dialogue with Quantum Encryption
International Nuclear Information System (INIS)
Ye Tian-Yu
2014-01-01
How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the initial quantum state is omitted, thus the information leakage problem is overcome. The information-theoretical efficiency of the proposed protocol is nearly 100%, much higher than previous information leakage resistant quantum dialogue protocols. Moreover, the proposed protocol only needs single-photon measurements and nearly uses single photons as quantum resource so that it is convenient to implement in practice. (general)
Directory of Open Access Journals (Sweden)
Tzu-Hsiang Hung
2012-06-01
Full Text Available This study used the complex dynamic characteristics of chaotic systems and Bluetooth to explore the topic of wireless chaotic communication secrecy and develop a communication security system. The PID controller for chaos synchronization control was applied, and the optimum parameters of this PID controller were obtained using a Particle Swarm Optimization (PSO algorithm. Bluetooth was used to realize wireless transmissions, and a chaotic wireless communication security system was developed in the design concept of a chaotic communication security system. The experimental results show that this scheme can be used successfully in image encryption.
Yau, Her-Terng; Hung, Tzu-Hsiang; Hsieh, Chia-Chun
2012-01-01
This study used the complex dynamic characteristics of chaotic systems and Bluetooth to explore the topic of wireless chaotic communication secrecy and develop a communication security system. The PID controller for chaos synchronization control was applied, and the optimum parameters of this PID controller were obtained using a Particle Swarm Optimization (PSO) algorithm. Bluetooth was used to realize wireless transmissions, and a chaotic wireless communication security system was developed in the design concept of a chaotic communication security system. The experimental results show that this scheme can be used successfully in image encryption.
Bildirici, Melike; Sonustun, Fulya Ozaksoy; Sonustun, Bahri
2018-01-01
In the regards of chaos theory, new concepts such as complexity, determinism, quantum mechanics, relativity, multiple equilibrium, complexity, (continuously) instability, nonlinearity, heterogeneous agents, irregularity were widely questioned in economics. It is noticed that linear models are insufficient for analyzing unpredictable, irregular and noncyclical oscillations of economies, and for predicting bubbles, financial crisis, business cycles in financial markets. Therefore, economists gave great consequence to use appropriate tools for modelling non-linear dynamical structures and chaotic behaviors of the economies especially in macro and the financial economy. In this paper, we aim to model the chaotic structure of exchange rates (USD-TL and EUR-TL). To determine non-linear patterns of the selected time series, daily returns of the exchange rates were tested by BDS during the period from January 01, 2002 to May 11, 2017 which covers after the era of the 2001 financial crisis. After specifying the non-linear structure of the selected time series, it was aimed to examine the chaotic characteristic for the selected time period by Lyapunov Exponents. The findings verify the existence of the chaotic structure of the exchange rate returns in the analyzed time period.
Generalized logistic map and its application in chaos based cryptography
Lawnik, M.
2017-12-01
The logistic map is commonly used in, for example, chaos based cryptography. However, its properties do not render a safe construction of encryption algorithms. Thus, the scope of the paper is a proposal of generalization of the logistic map by means of a wellrecognized family of chaotic maps. In the next step, an analysis of Lyapunov exponent and the distribution of the iterative variable are studied. The obtained results confirm that the analyzed model can safely and effectively replace a classic logistic map for applications involving chaotic cryptography.
Asymmetric Image Encryption Approach with Plaintext-Related Diffusion
Directory of Open Access Journals (Sweden)
J. Oravec
2018-04-01
Full Text Available This paper deals with topic of image encryption based on chaotic maps. A solution which has advantage of robustness against chosen-plaintext attacks is proposed. Permutations of image pixels are carried out in a way that enables operations on grayscale images with arbitrary resolution. All calculations done with user key and also all diffusion processes employ the same chaotic map. This feature enables usage of look-up tables which reduce computational times. The paper includes several experiments which verify achieved results and also briefly describes advantages and drawbacks of proposed solution.
Directory of Open Access Journals (Sweden)
Hongjuan Liu
2014-01-01
Full Text Available A new general and systematic coupling scheme is developed to achieve the modified projective synchronization (MPS of different fractional-order systems under parameter mismatch via the Open-Plus-Closed-Loop (OPCL control. Based on the stability theorem of linear fractional-order systems, some sufficient conditions for MPS are proposed. Two groups of numerical simulations on the incommensurate fraction-order system and commensurate fraction-order system are presented to justify the theoretical analysis. Due to the unpredictability of the scale factors and the use of fractional-order systems, the chaotic data from the MPS is selected to encrypt a plain image to obtain higher security. Simulation results show that our method is efficient with a large key space, high sensitivity to encryption keys, resistance to attack of differential attacks, and statistical analysis.
Bit-level plane image encryption based on coupled map lattice with time-varying delay
Lv, Xiupin; Liao, Xiaofeng; Yang, Bo
2018-04-01
Most of the existing image encryption algorithms had two basic properties: confusion and diffusion in a pixel-level plane based on various chaotic systems. Actually, permutation in a pixel-level plane could not change the statistical characteristics of an image, and many of the existing color image encryption schemes utilized the same method to encrypt R, G and B components, which means that the three color components of a color image are processed three times independently. Additionally, dynamical performance of a single chaotic system degrades greatly with finite precisions in computer simulations. In this paper, a novel coupled map lattice with time-varying delay therefore is applied in color images bit-level plane encryption to solve the above issues. Spatiotemporal chaotic system with both much longer period in digitalization and much excellent performances in cryptography is recommended. Time-varying delay embedded in coupled map lattice enhances dynamical behaviors of the system. Bit-level plane image encryption algorithm has greatly reduced the statistical characteristics of an image through the scrambling processing. The R, G and B components cross and mix with one another, which reduces the correlation among the three components. Finally, simulations are carried out and all the experimental results illustrate that the proposed image encryption algorithm is highly secure, and at the same time, also demonstrates superior performance.
New Encrypted Steganography Approach
Directory of Open Access Journals (Sweden)
Saba Mohammed Husain
2017-12-01
Full Text Available The proposed research Provides an approach for hiding an encrypted text in side a digital image. Where the text is encrypted in a complex manner used method of PlayFair to encrypt clear text and to increase security put lettering ciphertext on the geometric shape clockwise and then we write the ciphertext output in the form of lines, taken new ciphertext and converted to Ascii code and then to binary and hidden text in bits least importance in the picture. The results were good by PNSR scale
Investigating Encrypted Material
McGrath, Niall; Gladyshev, Pavel; Kechadi, Tahar; Carthy, Joe
When encrypted material is discovered during a digital investigation and the investigator cannot decrypt the material then s/he is faced with the problem of how to determine the evidential value of the material. This research is proposing a methodology of extracting probative value from the encrypted file of a hybrid cryptosystem. The methodology also incorporates a technique for locating the original plaintext file. Since child pornography (KP) images and terrorist related information (TI) are transmitted in encrypted format the digital investigator must ask the question Cui Bono? - who benefits or who is the recipient? By doing this the scope of the digital investigation can be extended to reveal the intended recipient.
An image encryption algorithm utilizing julia sets and hilbert curves.
Directory of Open Access Journals (Sweden)
Yuanyuan Sun
Full Text Available Image encryption is an important and effective technique to protect image security. In this paper, a novel image encryption algorithm combining Julia sets and Hilbert curves is proposed. The algorithm utilizes Julia sets' parameters to generate a random sequence as the initial keys and gets the final encryption keys by scrambling the initial keys through the Hilbert curve. The final cipher image is obtained by modulo arithmetic and diffuse operation. In this method, it needs only a few parameters for the key generation, which greatly reduces the storage space. Moreover, because of the Julia sets' properties, such as infiniteness and chaotic characteristics, the keys have high sensitivity even to a tiny perturbation. The experimental results indicate that the algorithm has large key space, good statistical property, high sensitivity for the keys, and effective resistance to the chosen-plaintext attack.
An image encryption algorithm utilizing julia sets and hilbert curves.
Sun, Yuanyuan; Chen, Lina; Xu, Rudan; Kong, Ruiqing
2014-01-01
Image encryption is an important and effective technique to protect image security. In this paper, a novel image encryption algorithm combining Julia sets and Hilbert curves is proposed. The algorithm utilizes Julia sets' parameters to generate a random sequence as the initial keys and gets the final encryption keys by scrambling the initial keys through the Hilbert curve. The final cipher image is obtained by modulo arithmetic and diffuse operation. In this method, it needs only a few parameters for the key generation, which greatly reduces the storage space. Moreover, because of the Julia sets' properties, such as infiniteness and chaotic characteristics, the keys have high sensitivity even to a tiny perturbation. The experimental results indicate that the algorithm has large key space, good statistical property, high sensitivity for the keys, and effective resistance to the chosen-plaintext attack.
Hardware realization of chaos based block cipher for image encryption
Barakat, Mohamed L.
2011-12-01
Unlike stream ciphers, block ciphers are very essential for parallel processing applications. In this paper, the first hardware realization of chaotic-based block cipher is proposed for image encryption applications. The proposed system is tested for known cryptanalysis attacks and for different block sizes. When implemented on Virtex-IV, system performance showed high throughput and utilized small area. Passing successfully in all tests, our system proved to be secure with all block sizes. © 2011 IEEE.
A chaos-based image encryption algorithm with variable control parameters
International Nuclear Information System (INIS)
Wang Yong; Wong, K.-W.; Liao Xiaofeng; Xiang Tao; Chen Guanrong
2009-01-01
In recent years, a number of image encryption algorithms based on the permutation-diffusion structure have been proposed. However, the control parameters used in the permutation stage are usually fixed in the whole encryption process, which favors attacks. In this paper, a chaos-based image encryption algorithm with variable control parameters is proposed. The control parameters used in the permutation stage and the keystream employed in the diffusion stage are generated from two chaotic maps related to the plain-image. As a result, the algorithm can effectively resist all known attacks against permutation-diffusion architectures. Theoretical analyses and computer simulations both confirm that the new algorithm possesses high security and fast encryption speed for practical image encryption.
Batch Image Encryption Using Generated Deep Features Based on Stacked Autoencoder Network
Directory of Open Access Journals (Sweden)
Fei Hu
2017-01-01
Full Text Available Chaos-based algorithms have been widely adopted to encrypt images. But previous chaos-based encryption schemes are not secure enough for batch image encryption, for images are usually encrypted using a single sequence. Once an encrypted image is cracked, all the others will be vulnerable. In this paper, we proposed a batch image encryption scheme into which a stacked autoencoder (SAE network was introduced to generate two chaotic matrices; then one set is used to produce a total shuffling matrix to shuffle the pixel positions on each plain image, and another produces a series of independent sequences of which each is used to confuse the relationship between the permutated image and the encrypted image. The scheme is efficient because of the advantages of parallel computing of SAE, which leads to a significant reduction in the run-time complexity; in addition, the hybrid application of shuffling and confusing enhances the encryption effect. To evaluate the efficiency of our scheme, we compared it with the prevalent “logistic map,” and outperformance was achieved in running time estimation. The experimental results and analysis show that our scheme has good encryption effect and is able to resist brute-force attack, statistical attack, and differential attack.
Homomorphic encryption and applications
Yi, Xun; Bertino, Elisa
2014-01-01
This book introduces the fundamental concepts of homomorphic encryption. From these foundations, applications are developed in the fields of private information retrieval, private searching on streaming data, privacy-preserving data mining, electronic voting and cloud computing. The content is presented in an instructional and practical style, with concrete examples to enhance the reader's understanding. This volume achieves a balance between the theoretical and the practical components of modern information security. Readers will learn key principles of homomorphic encryption as well as their
Encrypting personal identifiers.
Meux, E
1994-01-01
STUDY SETTING. A statewide patient discharge database contained only one unique identifier: the social security number (SSN). A method was developed to transform (encrypt) the SSN so that it could be made publicly available, for purposes of linking discharge records, without revealing the SSN itself. The method of encrypting the SSN into a Record Linkage Number (RLN) is described. PRINCIPAL FINDINGS. The same RLN will always result from the same SSN; it is highly improbable that the same RLN ...
Dynamic Parameter-Control Chaotic System.
Hua, Zhongyun; Zhou, Yicong
2016-12-01
This paper proposes a general framework of 1-D chaotic maps called the dynamic parameter-control chaotic system (DPCCS). It has a simple but effective structure that uses the outputs of a chaotic map (control map) to dynamically control the parameter of another chaotic map (seed map). Using any existing 1-D chaotic map as the control/seed map (or both), DPCCS is able to produce a huge number of new chaotic maps. Evaluations and comparisons show that chaotic maps generated by DPCCS are very sensitive to their initial states, and have wider chaotic ranges, better unpredictability and more complex chaotic behaviors than their seed maps. Using a chaotic map of DPCCS as an example, we provide a field-programmable gate array design of this chaotic map to show the simplicity of DPCCS in hardware implementation, and introduce a new pseudo-random number generator (PRNG) to investigate the applications of DPCCS. Analysis and testing results demonstrate the excellent randomness of the proposed PRNG.
Czech Academy of Sciences Publication Activity Database
Lynnyk, Volodymyr; Čelikovský, Sergej
2010-01-01
Roč. 46, č. 1 (2010), s. 1-18 ISSN 0023-5954 R&D Projects: GA ČR(CZ) GA102/08/0186 Institutional research plan: CEZ:AV0Z10750506 Keywords : observer * nonlinear system * chaos shift keying * generalized Lorenz system * synchronization * anti-synchronization * secure communication Subject RIV: BC - Control Systems Theory Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/TR/lynnyk-0342105.pdf
Hyper-chaos encryption using convolutional masking and model free unmasking
International Nuclear Information System (INIS)
Qi Guo-Yuan; Matondo Sandra Bazebo
2014-01-01
In this paper, during the masking process the encrypted message is convolved and embedded into a Qi hyper-chaotic system characterizing a high disorder degree. The masking scheme was tested using both Qi hyper-chaos and Lorenz chaos and indicated that Qi hyper-chaos based masking can resist attacks of the filtering and power spectrum analysis, while the Lorenz based scheme fails for high amplitude data. To unmask the message at the receiving end, two methods are proposed. In the first method, a model-free synchronizer, i.e. a multivariable higher-order differential feedback controller between the transmitter and receiver is employed to de-convolve the message embedded in the receiving signal. In the second method, no synchronization is required since the message is de-convolved using the information of the estimated derivative. (general)
Synchronization and an application of a novel fractional order King Cobra chaotic system
Energy Technology Data Exchange (ETDEWEB)
Muthukumar, P., E-mail: muthukumardgl@gmail.com; Balasubramaniam, P., E-mail: balugru@gmail.com [Department of Mathematics, Gandhigram Rural Institute‐Deemed University, Gandhigram 624 302, Tamilnadu (India); Ratnavelu, K., E-mail: kuru052001@gmail.com [Faculty of Science, Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur (Malaysia)
2014-09-01
In this paper, we design a new three dimensional King Cobra face shaped fractional order chaotic system. The multi-scale synchronization scheme of two fractional order chaotic systems is described. The necessary conditions for the multi-scale synchronization of two identical fractional order King Cobra chaotic systems are derived through feedback control. A new cryptosystem is proposed for an image encryption and decryption by using synchronized fractional order King Cobra chaotic systems with the supports of multiple cryptographic assumptions. The security of the proposed cryptosystem is analyzed by the well known algebraic attacks. Numerical simulations are given to show the effectiveness of the proposed theoretical results.
Bishop, Matt
1988-01-01
The organization of some tools to help improve passwork security at a UNIX-based site is described along with how to install and use them. These tools and their associated library enable a site to force users to pick reasonably safe passwords (safe being site configurable) and to enable site management to try to crack existing passworks. The library contains various versions of a very fast implementation of the Data Encryption Standard and of the one-way encryption functions used to encryp the password.
Dual plane multiple spatial watermarking with self-encryption
Indian Academy of Sciences (India)
general social networking user may require watermarking but with less computational costs and with no compulsion of manually providing and maintaining different secrete keys. This type of user can be benefitted by using self-encryption and skip-.
Doumen, J.M.; Brinkman, Richard; Jonker, Willem
2004-01-01
The amount of data an average person has, is becoming so huge that in the near future this cannot be stored locally anymore, and an external server will have to be used. When this server is not (entirely) trusted, the data should be encrypted. However, the data should still be accessible as a
A self-cited pixel summation based image encryption algorithm
International Nuclear Information System (INIS)
Ye Guo-Dong; Huang Xiao-Ling; Zhang Leo Yu; Wang Zheng-Xia
2017-01-01
In this paper, a novel image encryption algorithm is presented based on self-cited pixel summation. With the classical mechanism of permutation plus diffusion, a pixel summation of the plain image is employed to make a gravity influence on the pixel positions in the permutation stage. Then, for each pixel in every step of the diffusion stage, the pixel summation calculated from the permuted image is updated. The values from a chaotic sequence generated by an intertwining logistic map are selected by this summation. Consequently, the keystreams generated in both stages are dependent on both the plain image and the permuted image. Because of the sensitivity of the chaotic map to its initial conditions and the plain-image-dependent keystreams, any tiny change in the secret key or the plain image would lead to a significantly different cipher image. As a result, the proposed encryption algorithm is immune to the known plaintext attack (KPA) and the chosen plaintext attack (CPA). Moreover, experimental simulations and security analyses show that the proposed permutation-diffusion encryption scheme can achieve a satisfactory level of security. (paper)
A Novel Image Encryption Algorithm Based on DNA Encoding and Spatiotemporal Chaos
Directory of Open Access Journals (Sweden)
Chunyan Song
2015-10-01
Full Text Available DNA computing based image encryption is a new, promising field. In this paper, we propose a novel image encryption scheme based on DNA encoding and spatiotemporal chaos. In particular, after the plain image is primarily diffused with the bitwise Exclusive-OR operation, the DNA mapping rule is introduced to encode the diffused image. In order to enhance the encryption, the spatiotemporal chaotic system is used to confuse the rows and columns of the DNA encoded image. The experiments demonstrate that the proposed encryption algorithm is of high key sensitivity and large key space, and it can resist brute-force attack, entropy attack, differential attack, chosen-plaintext attack, known-plaintext attack and statistical attack.
Multimedia Security Application of a Ten-Term Chaotic System without Equilibrium
Directory of Open Access Journals (Sweden)
Xiong Wang
2017-01-01
Full Text Available A system without equilibrium has been proposed in this work. Although there is an absence of equilibrium points, the system displays chaos, which has been confirmed by phase portraits and Lyapunov exponents. The system is realized on an electronic card, which exhibits chaotic signals. Furthermore, chaotic property of the system is applied in multimedia security such as image encryption and sound steganography.
Proving Chaotic Behavior of CBC Mode of Operation
Abidi, Abdessalem; Wang, Qianxue; Bouallegue, Belgacem; Machhout, Mohsen; Guyeux, Christophe
2016-06-01
The cipher block chaining (CBC) mode of operation was invented by IBM (International Business Machine) in 1976. It presents a very popular way of encrypting that is used in various applications. In this paper, we have mathematically proven that, under some conditions, the CBC mode of operation can admit a chaotic behavior according to Devaney. Some cases will be properly studied in order to provide evidence for this idea.
Chaotic secure content-based hidden transmission of biometric templates
International Nuclear Information System (INIS)
Khan, Muhammad Khurram; Zhang Jiashu; Tian Lei
2007-01-01
The large-scale proliferation of biometric verification systems creates a demand for effective and reliable security and privacy of its data. Like passwords and PIN codes, biometric data is also not secret and if it is compromised, the integrity of the whole verification system could be at high risk. To address these issues, this paper presents a novel chaotic secure content-based hidden transmission scheme of biometric data. Encryption and data hiding techniques are used to improve the security and secrecy of the transmitted templates. Secret keys are generated by the biometric image and used as the parameter value and initial condition of the chaotic map, and each transaction session has different secret keys to protect from the attacks. Two chaotic maps are incorporated for the encryption to resolve the finite word length effect and to improve the system's resistance against attacks. Encryption is applied on the biometric templates before hiding into the cover/host images to make them secure, and then templates are hidden into the cover image. Experimental results show that the security, performance, and accuracy of the presented scheme are encouraging comparable with other methods found in the current literature
Single-channel color image encryption using phase retrieve algorithm in fractional Fourier domain
Sui, Liansheng; Xin, Meiting; Tian, Ailing; Jin, Haiyan
2013-12-01
A single-channel color image encryption is proposed based on a phase retrieve algorithm and a two-coupled logistic map. Firstly, a gray scale image is constituted with three channels of the color image, and then permuted by a sequence of chaotic pairs generated by the two-coupled logistic map. Secondly, the permutation image is decomposed into three new components, where each component is encoded into a phase-only function in the fractional Fourier domain with a phase retrieve algorithm that is proposed based on the iterative fractional Fourier transform. Finally, an interim image is formed by the combination of these phase-only functions and encrypted into the final gray scale ciphertext with stationary white noise distribution by using chaotic diffusion, which has camouflage property to some extent. In the process of encryption and decryption, chaotic permutation and diffusion makes the resultant image nonlinear and disorder both in spatial domain and frequency domain, and the proposed phase iterative algorithm has faster convergent speed. Additionally, the encryption scheme enlarges the key space of the cryptosystem. Simulation results and security analysis verify the feasibility and effectiveness of this method.
A novel image encryption scheme based on the ergodicity of baker map
Ye, Ruisong; Chen, Yonghong
2012-01-01
Thanks to the exceptionally good properties in chaotic systems, such as sensitivity to initial conditions and control parameters, pseudo-randomness and ergodicity, chaos-based image encryption algorithms have been widely studied and developed in recent years. A novel digital image encryption scheme based on the chaotic ergodicity of Baker map is proposed in this paper. Different from traditional encryption schemes based on Baker map, we permute the pixel positions by their corresponding order numbers deriving from the approximating points in one chaotic orbit. To enhance the resistance to statistical and differential attacks, a diffusion process is suggested as well in the proposed scheme. The proposed scheme enlarges the key space significantly to resist brute-force attack. Additionally, the distribution of gray values in the cipher-image has a random-like behavior to resist statistical analysis. The proposed scheme is robust against cropping, tampering and noising attacks as well. It therefore suggests a high secure and efficient way for real-time image encryption and transmission in practice.
IT Department
2011-01-01
This week FTP (the file transfer protocol) celebrated its 40th birthday - and will hopefully retire soon! While a nice and simple means of transferring files, it is totally insecure: both the transferred contents and the authentication password are transfered unencrypted. FTP is not the only protocol that transfers data unencrypted: standard web traffic (“HTTP”) and e-mail (“SMTP”) are not encrypted either. Not an issue? Think again! Nowadays, we all use wireless Ethernet from our laptops and mobile phones. This means that your traffic can be intercepted by anyone*… What if I could your web browsing history, read your last e-mail to your boyfriend/girlfriend, or see which commands you’ve just executed? I could easily intercept your Facebook session… If this worries you, check for secrecy and encryption. Usually this is shown by an “S” in your communication protocol: · “HTTPS&...
Computer Security Team
2013-01-01
Sigh! Pandora’s box has been opened (once again). Recent documents leaked by whistle-blower Edward Snowden have revealed that the NSA project “Bullrun” is intruding deeply into the confidentiality of our documents and the privacy of our lives. In their continuous effort to kill privacy on the Internet, the US National Security Agency (NSA) and the British Government Communications Headquarters (GCHQ) have made significant progress in breaking almost every basic encryption protocol or have developed the means to bypass them. “US and British intelligence agencies have successfully cracked much of the online encryption relied upon by hundreds of millions of people to protect the privacy of their personal data, online transactions and e-mails.” - The Guardian So what’s left? With “Prism” and “Tempora”, our public communication on the Internet was already filtered and analysed (see our Bulletin ar...
International Nuclear Information System (INIS)
Cook, A.
1990-09-01
An elementary account of the origin of chaotic behaviour in classical dynamics is given with examples from geophysics, and in conclusion some thoughts about what can be predicted of chaotic behaviour and what sorts of arguments can be used to guide human behaviour in chaotic conditions are presented. 4 refs
Single-channel color image encryption based on iterative fractional Fourier transform and chaos
Sui, Liansheng; Gao, Bo
2013-06-01
A single-channel color image encryption is proposed based on iterative fractional Fourier transform and two-coupled logistic map. Firstly, a gray scale image is constituted with three channels of the color image, and permuted by a sequence of chaotic pairs which is generated by two-coupled logistic map. Firstly, the permutation image is decomposed into three components again. Secondly, the first two components are encrypted into a single one based on iterative fractional Fourier transform. Similarly, the interim image and third component are encrypted into the final gray scale ciphertext with stationary white noise distribution, which has camouflage property to some extent. In the process of encryption and description, chaotic permutation makes the resulting image nonlinear and disorder both in spatial domain and frequency domain, and the proposed iterative fractional Fourier transform algorithm has faster convergent speed. Additionally, the encryption scheme enlarges the key space of the cryptosystem. Simulation results and security analysis verify the feasibility and effectiveness of this method.
A Fast Enhanced Secure Image Chaotic Cryptosystem Based on Hybrid Chaotic Magic Transform
Directory of Open Access Journals (Sweden)
Srinivas Koppu
2017-01-01
Full Text Available An enhanced secure image chaotic cryptosystem has been proposed based on hybrid CMT-Lanczos algorithm. We have achieved fast encryption and decryption along with privacy of images. The pseudorandom generator has been used along with Lanczos algorithm to generate root characteristics and eigenvectors. Using hybrid CMT image, pixels are shuffled to accomplish excellent randomness. Compared with existing methods, the proposed method had more robustness to various attacks: brute-force attack, known cipher plaintext, chosen-plaintext, security key space, key sensitivity, correlation analysis and information entropy, and differential attacks. Simulation results show that the proposed methods give better result in protecting images with low-time complexity.
A new block cipher based on chaotic map and group theory
International Nuclear Information System (INIS)
Yang Huaqian; Liao Xiaofeng; Wong Kwokwo; Zhang Wei; Wei Pengcheng
2009-01-01
Based on the study of some existing chaotic encryption algorithms, a new block cipher is proposed. In the proposed cipher, two sequences of decimal numbers individually generated by two chaotic piecewise linear maps are used to determine the noise vectors by comparing the element of the two sequences. Then a sequence of decimal numbers is used to define a bijection map. The modular multiplication operation in the group Z 2 8 +1 * and permutations are alternately applied on plaintext with block length of multiples of 64 bits to produce ciphertext blocks of the same length. Analysis show that the proposed block cipher does not suffer from the flaws of pure chaotic cryptosystems.
Empirically characteristic analysis of chaotic PID controlling particle swarm optimization.
Yan, Danping; Lu, Yongzhong; Zhou, Min; Chen, Shiping; Levy, David
2017-01-01
Since chaos systems generally have the intrinsic properties of sensitivity to initial conditions, topological mixing and density of periodic orbits, they may tactfully use the chaotic ergodic orbits to achieve the global optimum or their better approximation to given cost functions with high probability. During the past decade, they have increasingly received much attention from academic community and industry society throughout the world. To improve the performance of particle swarm optimization (PSO), we herein propose a chaotic proportional integral derivative (PID) controlling PSO algorithm by the hybridization of chaotic logistic dynamics and hierarchical inertia weight. The hierarchical inertia weight coefficients are determined in accordance with the present fitness values of the local best positions so as to adaptively expand the particles' search space. Moreover, the chaotic logistic map is not only used in the substitution of the two random parameters affecting the convergence behavior, but also used in the chaotic local search for the global best position so as to easily avoid the particles' premature behaviors via the whole search space. Thereafter, the convergent analysis of chaotic PID controlling PSO is under deep investigation. Empirical simulation results demonstrate that compared with other several chaotic PSO algorithms like chaotic PSO with the logistic map, chaotic PSO with the tent map and chaotic catfish PSO with the logistic map, chaotic PID controlling PSO exhibits much better search efficiency and quality when solving the optimization problems. Additionally, the parameter estimation of a nonlinear dynamic system also further clarifies its superiority to chaotic catfish PSO, genetic algorithm (GA) and PSO.
Energy Technology Data Exchange (ETDEWEB)
Castro-Ramírez, Joel, E-mail: ingcastro.7@gmail.com [Universidad Politécnica de Tlaxcala Av. Universidad Politecnica de Tlaxcala No.1, San Pedro Xalcaltzinco, Tepeyanco, Tlaxcala, C.P. 90180 (Mexico); Martínez-Guerra, Rafael, E-mail: rguerra@ctrl.cinvestav.mx [Departamento de Control Automático CINVESTAV-IPN, A.P. 14-740, D.F., México C.P. 07360 (Mexico); Cruz-Victoria, Juan Crescenciano, E-mail: juancrescenciano.cruz@uptlax.edu.mx [Universidad Politécnica de Tlaxcala Av. Universidad Politécnica de Tlaxcala No.1, San Pedro Xalcaltzinco, Tepeyanco, Tlaxcala, C.P. 90180 (Mexico)
2015-10-15
This paper deals with the master-slave synchronization scheme for partially known nonlinear chaotic systems, where the unknown dynamics is considered as the master system and we propose the slave system structure which estimates the unknown states. It introduced a new reduced order observer, using the concept of Algebraic Observability; we applied the results to a Sundarapandian chaotic system, and by means of some numerical simulations we show the effectiveness of the suggested approach. Finally, the proposed observer is utilized for encryption, where encryption key is the master system and decryption key is the slave system.
International Nuclear Information System (INIS)
Castro-Ramírez, Joel; Martínez-Guerra, Rafael; Cruz-Victoria, Juan Crescenciano
2015-01-01
This paper deals with the master-slave synchronization scheme for partially known nonlinear chaotic systems, where the unknown dynamics is considered as the master system and we propose the slave system structure which estimates the unknown states. It introduced a new reduced order observer, using the concept of Algebraic Observability; we applied the results to a Sundarapandian chaotic system, and by means of some numerical simulations we show the effectiveness of the suggested approach. Finally, the proposed observer is utilized for encryption, where encryption key is the master system and decryption key is the slave system
Directory of Open Access Journals (Sweden)
Abdelhakim Chillali
2017-05-01
Full Text Available In classical cryptography, the Hill cipher is a polygraphic substitution cipher based on linear algebra. In this work, we proposed a new problem applicable to the public key cryptography, based on the Matrices, called “Matrix discrete logarithm problem”, it uses certain elements formed by matrices whose coefficients are elements in a finite field. We have constructed an abelian group and, for the cryptographic part in this unreliable group, we then perform the computation corresponding to the algebraic equations, Returning the encrypted result to a receiver. Upon receipt of the result, the receiver can retrieve the sender’s clear message by performing the inverse calculation.
A Novel Image Encryption Algorithm Based on a Fractional-Order Hyperchaotic System and DNA Computing
Directory of Open Access Journals (Sweden)
Taiyong Li
2017-01-01
Full Text Available In the era of the Internet, image encryption plays an important role in information security. Chaotic systems and DNA operations have been proven to be powerful for image encryption. To further enhance the security of image, in this paper, we propose a novel algorithm that combines the fractional-order hyperchaotic Lorenz system and DNA computing (FOHCLDNA for image encryption. Specifically, the algorithm consists of four parts: firstly, we use a fractional-order hyperchaotic Lorenz system to generate a pseudorandom sequence that will be utilized during the whole encryption process; secondly, a simple but effective diffusion scheme is performed to spread the little change in one pixel to all the other pixels; thirdly, the plain image is encoded by DNA rules and corresponding DNA operations are performed; finally, global permutation and 2D and 3D permutation are performed on pixels, bits, and acid bases. The extensive experimental results on eight publicly available testing images demonstrate that the encryption algorithm can achieve state-of-the-art performance in terms of security and robustness when compared with some existing methods, showing that the FOHCLDNA is promising for image encryption.
Privacy-Aware Image Encryption Based on Logistic Map and Data Hiding
Sun, Jianglin; Liao, Xiaofeng; Chen, Xin; Guo, Shangwei
The increasing need for image communication and storage has created a great necessity for securely transforming and storing images over a network. Whereas traditional image encryption algorithms usually consider the security of the whole plain image, region of interest (ROI) encryption schemes, which are of great importance in practical applications, protect the privacy regions of plain images. Existing ROI encryption schemes usually adopt approximate techniques to detect the privacy region and measure the quality of encrypted images; however, their performance is usually inconsistent with a human visual system (HVS) and is sensitive to statistical attacks. In this paper, we propose a novel privacy-aware ROI image encryption (PRIE) scheme based on logistical mapping and data hiding. The proposed scheme utilizes salient object detection to automatically, adaptively and accurately detect the privacy region of a given plain image. After private pixels have been encrypted using chaotic cryptography, the significant bits are embedded into the nonprivacy region of the plain image using data hiding. Extensive experiments are conducted to illustrate the consistency between our automatic ROI detection and HVS. Our experimental results also demonstrate that the proposed scheme exhibits satisfactory security performance.
Security scheme in IMDD-OFDM-PON system with the chaotic pilot interval and scrambling
Chen, Qianghua; Bi, Meihua; Fu, Xiaosong; Lu, Yang; Zeng, Ran; Yang, Guowei; Yang, Xuelin; Xiao, Shilin
2018-01-01
In this paper, a random chaotic pilot interval and permutations scheme without any requirement of redundant sideband information is firstly proposed for the physical layer security-enhanced intensity modulation direct detection orthogonal frequency division multiplexing passive optical network (IMDD-OFDM-PON) system. With the help of the position feature of inserting the pilot, a simple logistic chaos map is used to generate the random pilot interval and scramble the chaotic subcarrier allocation of each column pilot data for improving the physical layer confidentiality. Due to the dynamic chaotic permutations of pilot data, the enhanced key space of ∼103303 is achieved in OFDM-PON. Moreover, the transmission experiment of 10-Gb/s 16-QAM encrypted OFDM data is successfully demonstrated over 20-km single-mode fiber, which indicates that the proposed scheme not only improves the system security, but also can achieve the same performance as in the common IMDD-OFDM-PON system without encryption scheme.
Kingni, Sifeu Takougang; Mbé, Jimmi Hervé Talla; Woafo, Paul
2012-09-01
In this work, we numerically study the dynamics of vertical cavity surface emitting laser (VCSEL) firstly when it is driven by Chua's oscillator, secondly in case where it is driven by a broad frequency spectral bandwidth chaotic oscillator developed by Nana et al. [Commun. Nonlinear Sci. Numer. Simul. 14, 2266 (2009)]. We demonstrated that the VCSEL generated robust chaotic dynamics compared to the ones found in VCSEL subject to a sinusoidally modulated current and therefore it is more suitable for chaos encryption techniques. The synchronization characteristics and the communication performances of unidirectional coupled VCSEL driven by the broad frequency spectral bandwidth chaotic oscillators are investigated numerically. The results show that high-quality synchronization and transmission of messages can be realized for suitable system parameters. Chaos shift keying method is successfully applied to encrypt a message at a high bitrate.
de Oliveira, G. L.; Ramos, R. V.
2018-03-01
In this work, it is presented an optical scheme for quantum key distribution employing two synchronized optoelectronic oscillators (OEO) working in the chaotic regime. The produced key depends on the chaotic dynamic, and the synchronization between Alice's and Bob's OEOs uses quantum states. An attack on the synchronization signals will disturb the synchronization of the chaotic systems increasing the error rate in the final key.
Digital chaos-masked optical encryption scheme enhanced by two-dimensional key space
Liu, Ling; Xiao, Shilin; Zhang, Lu; Bi, Meihua; Zhang, Yunhao; Fang, Jiafei; Hu, Weisheng
2017-09-01
A digital chaos-masked optical encryption scheme is proposed and demonstrated. The transmitted signal is completely masked by interference chaotic noise in both bandwidth and amplitude with analog method via dual-drive Mach-Zehnder modulator (DDMZM), making the encrypted signal analog, noise-like and unrecoverable by post-processing techniques. The decryption process requires precise matches of both the amplitude and phase between the cancellation and interference chaotic noises, which provide a large two-dimensional key space with the help of optical interference cancellation technology. For 10-Gb/s 16-quadrature amplitude modulation (QAM) orthogonal frequency division multiplexing (OFDM) signal over the maximum transmission distance of 80 km without dispersion compensation or inline amplifier, the tolerable mismatch ranges of amplitude and phase/delay at the forward error correction (FEC) threshold of 3.8×10-3 are 0.44 dB and 0.08 ns respectively.
Directory of Open Access Journals (Sweden)
Xiuchun Li
2013-01-01
Full Text Available When the parameters of both drive and response systems are all unknown, an adaptive sliding mode controller, strongly robust to exotic perturbations, is designed for realizing generalized function projective synchronization. Sliding mode surface is given and the controlled system is asymptotically stable on this surface with the passage of time. Based on the adaptation laws and Lyapunov stability theory, an adaptive sliding controller is designed to ensure the occurrence of the sliding motion. Finally, numerical simulations are presented to verify the effectiveness and robustness of the proposed method even when both drive and response systems are perturbed with external disturbances.
SDMS-based Disk Encryption Method
An, Dokjun; Ri, Myongchol; Choe, Changil; Han, Sunam; Kim, Yongmin
2012-01-01
We propose a disk encryption method, called secure disk mixed system (SDMS) in this paper, for data protection of disk storages such as USB flash memory, USB hard disk and CD/DVD. It is aimed to solve temporal and spatial limitation problems of existing disk encryption methods and to control security performance flexibly according to the security requirement of system. SDMS stores data by encrypting with different encryption key per sector and updates sector encryption keys each time data is ...
Lakshmi, C; Thenmozhi, K; Rayappan, John Bosco Balaguru; Amirtharajan, Rengarajan
2018-06-01
Digital Imaging and Communications in Medicine (DICOM) is one among the significant formats used worldwide for the representation of medical images. Undoubtedly, medical-image security plays a crucial role in telemedicine applications. Merging encryption and watermarking in medical-image protection paves the way for enhancing the authentication and safer transmission over open channels. In this context, the present work on DICOM image encryption has employed a fuzzy chaotic map for encryption and the Discrete Wavelet Transform (DWT) for watermarking. The proposed approach overcomes the limitation of the Arnold transform-one of the most utilised confusion mechanisms in image ciphering. Various metrics have substantiated the effectiveness of the proposed medical-image encryption algorithm. Copyright © 2018 Elsevier B.V. All rights reserved.
Image Encryption Using a Lightweight Stream Encryption Algorithm
Directory of Open Access Journals (Sweden)
Saeed Bahrami
2012-01-01
Full Text Available Security of the multimedia data including image and video is one of the basic requirements for the telecommunications and computer networks. In this paper, we consider a simple and lightweight stream encryption algorithm for image encryption, and a series of tests are performed to confirm suitability of the described encryption algorithm. These tests include visual test, histogram analysis, information entropy, encryption quality, correlation analysis, differential analysis, and performance analysis. Based on this analysis, it can be concluded that the present algorithm in comparison to A5/1 and W7 stream ciphers has the same security level, is better in terms of the speed of performance, and is used for real-time applications.
Chaos based video encryption using maps and Ikeda time delay system
Valli, D.; Ganesan, K.
2017-12-01
Chaos based cryptosystems are an efficient method to deal with improved speed and highly secured multimedia encryption because of its elegant features, such as randomness, mixing, ergodicity, sensitivity to initial conditions and control parameters. In this paper, two chaos based cryptosystems are proposed: one is the higher-dimensional 12D chaotic map and the other is based on the Ikeda delay differential equation (DDE) suitable for designing a real-time secure symmetric video encryption scheme. These encryption schemes employ a substitution box (S-box) to diffuse the relationship between pixels of plain video and cipher video along with the diffusion of current input pixel with the previous cipher pixel, called cipher block chaining (CBC). The proposed method enhances the robustness against statistical, differential and chosen/known plain text attacks. Detailed analysis is carried out in this paper to demonstrate the security and uniqueness of the proposed scheme.
Cracking chaos-based encryption systems ruled by nonlinear time delay differential equations
International Nuclear Information System (INIS)
Udaltsov, Vladimir S.; Goedgebuer, Jean-Pierre; Larger, Laurent; Cuenot, Jean-Baptiste; Levy, Pascal; Rhodes, William T.
2003-01-01
We report that signal encoding with high-dimensional chaos produced by delayed feedback systems with a strong nonlinearity can be broken. We describe the procedure and illustrate the method with chaotic waveforms obtained from a strongly nonlinear optical system that we used previously to demonstrate signal encryption/decryption with chaos in wavelength. The method can be extended to any systems ruled by nonlinear time-delayed differential equations
Quantum computing on encrypted data.
Fisher, K A G; Broadbent, A; Shalm, L K; Yan, Z; Lavoie, J; Prevedel, R; Jennewein, T; Resch, K J
2014-01-01
The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.
Security analysis of optical encryption
Frauel, Yann; Castro, Albertina; Naughton, Thomas J.; Javidi, Bahram
2005-01-01
This paper analyzes the security of amplitude encoding for double random phase encryption. We describe several types of attack. The system is found to be resistant to brute-force attacks but vulnerable to chosen and known plaintext attacks.
Security analysis of optical encryption
Frauel, Yann; Castro, Albertina; Naughton, Thomas J.; Javidi, Bahram
2005-10-01
This paper analyzes the security of amplitude encoding for double random phase encryption. We describe several types of attack. The system is found to be resistant to brute-force attacks but vulnerable to chosen and known plaintext attacks.
The Lure of Wireless Encryption
Computer Security Team
2013-01-01
Following our article entitled “Jekyll or Hyde? Better browse securely” in the last issue of the Bulletin, some people wondered why the CERN wireless network is not encrypted… There are many arguments why it is not. The simplest is usability: the communication and management of the corresponding access keys would be challenging given the sheer number of wireless devices the CERN network hosts. Keys would quickly become public, e.g. at conferences, and might be shared, written on whiteboards, etc. Then there are all the devices which cannot be easily configured to use encryption protocols - a fact which would create plenty of calls to the CERN Service Desk… But our main argument is that wireless encryption is DECEPTIVE. Wireless encryption is deceptive as it only protects the wireless network against unauthorised access (and the CERN network already has other means to protect against that). Wireless encryption however, does not really help you. You ...
Sneutrino chaotic inflation and landscape
Directory of Open Access Journals (Sweden)
Hitoshi Murayama
2014-11-01
Full Text Available The most naive interpretation of the BICEP2 data is the chaotic inflation by an inflaton with a quadratic potential. When combined with supersymmetry, we argue that the inflaton plays the role of right-handed scalar neutrino based on rather general considerations. The framework suggests that the right-handed sneutrino tunneled from a false vacuum in a landscape to our vacuum with a small negative curvature and suppressed scalar perturbations at large scales.
Synchronization of chaotic systems
International Nuclear Information System (INIS)
Pecora, Louis M.; Carroll, Thomas L.
2015-01-01
We review some of the history and early work in the area of synchronization in chaotic systems. We start with our own discovery of the phenomenon, but go on to establish the historical timeline of this topic back to the earliest known paper. The topic of synchronization of chaotic systems has always been intriguing, since chaotic systems are known to resist synchronization because of their positive Lyapunov exponents. The convergence of the two systems to identical trajectories is a surprise. We show how people originally thought about this process and how the concept of synchronization changed over the years to a more geometric view using synchronization manifolds. We also show that building synchronizing systems leads naturally to engineering more complex systems whose constituents are chaotic, but which can be tuned to output various chaotic signals. We finally end up at a topic that is still in very active exploration today and that is synchronization of dynamical systems in networks of oscillators
Logistic chaotic maps for binary numbers generations
International Nuclear Information System (INIS)
Kanso, Ali; Smaoui, Nejib
2009-01-01
Two pseudorandom binary sequence generators, based on logistic chaotic maps intended for stream cipher applications, are proposed. The first is based on a single one-dimensional logistic map which exhibits random, noise-like properties at given certain parameter values, and the second is based on a combination of two logistic maps. The encryption step proposed in both algorithms consists of a simple bitwise XOR operation of the plaintext binary sequence with the keystream binary sequence to produce the ciphertext binary sequence. A threshold function is applied to convert the floating-point iterates into binary form. Experimental results show that the produced sequences possess high linear complexity and very good statistical properties. The systems are put forward for security evaluation by the cryptographic committees.
Directory of Open Access Journals (Sweden)
Ari Shawakat Tahir
2015-12-01
Full Text Available The Steganography is an art and science of hiding information by embedding messages within other, seemingly harmless messages and lots of researches are working in it. Proposed system is using AES Algorithm and Lossy technique to overcome the limitation of previous work and increasing the process’s speed. The sender uses AES Algorithm to encrypt message and image, then using LSB technique to hide encrypted data in encrypted message. The receive get the original data using the keys that had been used in encryption process. The proposed system has been implemented in NetBeans 7.3 software uses image and data in different size to find the system’s speed.
Optics based biometric encryption using log polar transform
Saini, Nirmala; Sinha, Aloka
2010-01-01
We propose an optics based biometric encryption technique using log polar transform. In this method, the key of the encryption process has been linked to the fingerprint of the enrolled person. The order of fractional Fourier transform and the seed values of the chaotic random phase masks in combination act as the key for the encryption process. In order to link the combined key to the fingerprint, a lookup table has been formed by the key and the log polar transform of the fingerprint. The linking algorithm not only encrypts the image of the enrolled person but also authenticates the input image. The main advantage of this method is its capability to retrieve the same key in the decryption process by using the live fingerprint. The key is not required to be communicated to the receiver side. The retrieval of the image is possible only when the live fingerprint of the enrolled person is presented at the decryption side. The real life fingerprints have been used to demonstrate the proposed technique. Simulations have been performed on the Matlab platform to validate the proposed technique. The signal to noise ratio and mean square error has been calculated in order to support the proposed technique. The effect of the rotation and the scaling of the fingerprints have been studied to check the key retrieval from the live fingerprint of the enrolled person. The study of the different whorl types of fingerprint of different persons has also been done to check the efficacy of the key retrieval from the whorl types of the live fingerprints of different person.
Encryption Technology based on Human Biometrics
Directory of Open Access Journals (Sweden)
Wei Yang
2017-08-01
Full Text Available The research progress of encryption technologies based on human biometrics is reviewed in this paper.The technologies that utilize human biometrics to make information encryption and identity authentication,and the technologies which combine biometrics encryption with optical encryption methods are introduced in detail.The advantages and disadvantages of these encryption systems are discussed,and the obstacles in practical applications are pointed out.Finally,the prospect of the new encryption technologies that are based on human biometrics are predicted.
Image Encryption on Mobile Phone Using Super Encryption Algorithm
Directory of Open Access Journals (Sweden)
Catur Iswahyudi
2012-12-01
Full Text Available This study aims to obtain the digital image encryption algorithm with a simple but secure process, fast and efficient computing resources. The algorithms developed in this study were super-encryption algorithm that combines two of cipher called Playfair cipher and the Vigenere cipher. To improve security, a keystream generator was used to randomize the order of the next key in Vigenere cipher. In order to evaluate performance, the proposed algorithm was measured through a series of tests. These tests were implemented with Matlab included visual test and histogram analysis, information entropy, encryption quality, correlation analysis, and also time analysis. The test results show that cipher image looks visually random.The image histogram of the plain image and cipher image also seen a significant difference between the two of them. Testing was also performed on mobile phones with Symbian and BADA operating system based on Java Micro Edition Programming. Trial results show that the algorithm was require less computational resources; with average time for image encryption is 3.76 seconds, and the average time for image decryption is 0.97 seconds. The new proposed image encryption scheme has satisfactory security which makes it a potential candidate for encryption of image data. Keywords: Image encryption, Vigenere cipher, Playfair cipher, Security test
Li, Chuang; Min, Fuhong; Jin, Qiusen; Ma, Hanyuan
2017-12-01
An active charge-controlled memristive Chua's circuit is implemented, and its basic properties are analyzed. Firstly, with the system trajectory starting from an equilibrium point, the dynamic behavior of multiple coexisting attractors depending on the memristor initial value and the system parameter is studied, which shows the coexisting behaviors of point, period, chaos, and quasic-period. Secondly, with the system motion starting from a non-equilibrium point, the dynamics of extreme multistability in a wide initial value domain are easily conformed by new analytical methods. Furthermore, the simulation results indicate that some strange chaotic attractors like multi-wing type and multi-scroll type are observed when the observed signals are extended from voltage and current to power and energy, respectively. Specially, when different initial conditions are taken, the coexisting strange chaotic attractors between the power and energy signals are exhibited. Finally, the chaotic sequences of the new system are used for encrypting color image to protect image information security. The encryption performance is analyzed by statistic histogram, correlation, key spaces and key sensitivity. Simulation results show that the new memristive chaotic system has high security in color image encryption.
Lin, Zhuosheng; Yu, Simin; Li, Chengqing; Lü, Jinhu; Wang, Qianxue
This paper proposes a chaotic secure video remote communication scheme that can perform on real WAN networks, and implements it on a smartphone hardware platform. First, a joint encryption and compression scheme is designed by embedding a chaotic encryption scheme into the MJPG-Streamer source codes. Then, multiuser smartphone communications between the sender and the receiver are implemented via WAN remote transmission. Finally, the transmitted video data are received with the given IP address and port in an Android smartphone. It should be noted that, this is the first time that chaotic video encryption schemes are implemented on such a hardware platform. The experimental results demonstrate that the technical challenges on hardware implementation of secure video communication are successfully solved, reaching a balance amongst sufficient security level, real-time processing of massive video data, and utilization of available resources in the hardware environment. The proposed scheme can serve as a good application example of chaotic secure communications for smartphone and other mobile facilities in the future.
Cryptanalysis of a spatiotemporal chaotic image/video cryptosystem
International Nuclear Information System (INIS)
Rhouma, Rhouma; Belghith, Safya
2008-01-01
This Letter proposes two different attacks on a recently proposed chaotic cryptosystem for images and videos in [S. Lian, Chaos Solitons Fractals (2007), (doi: 10.1016/j.chaos.2007.10.054)]. The cryptosystem under study displays weakness in the generation of the keystream. The encryption is made by generating a keystream mixed with blocks generated from the plaintext and the ciphertext in a CBC mode design. The so obtained keystream remains unchanged for every encryption procedure. Guessing the keystream leads to guessing the key. Two possible attacks are then able to break the whole cryptosystem based on this drawback in generating the keystream. We propose also to change the description of the cryptosystem to be robust against the described attacks by making it in a PCBC mode design
Chaotic attractors with separated scrolls
International Nuclear Information System (INIS)
Bouallegue, Kais
2015-01-01
This paper proposes a new behavior of chaotic attractors with separated scrolls while combining Julia's process with Chua's attractor and Lorenz's attractor. The main motivation of this work is the ability to generate a set of separated scrolls with different behaviors, which in turn allows us to choose one or many scrolls combined with modulation (amplitude and frequency) for secure communication or synchronization. This set seems a new class of hyperchaos because each element of this set looks like a simple chaotic attractor with one positive Lyapunov exponent, so the cardinal of this set is greater than one. This new approach could be used to generate more general higher-dimensional hyperchaotic attractor for more potential application. Numerical simulations are given to show the effectiveness of the proposed theoretical results
Al-Hayani, Nazar; Al-Jawad, Naseer; Jassim, Sabah A.
2014-05-01
Video compression and encryption became very essential in a secured real time video transmission. Applying both techniques simultaneously is one of the challenges where the size and the quality are important in multimedia transmission. In this paper we proposed a new technique for video compression and encryption. Both encryption and compression are based on edges extracted from the high frequency sub-bands of wavelet decomposition. The compression algorithm based on hybrid of: discrete wavelet transforms, discrete cosine transform, vector quantization, wavelet based edge detection, and phase sensing. The compression encoding algorithm treats the video reference and non-reference frames in two different ways. The encryption algorithm utilized A5 cipher combined with chaotic logistic map to encrypt the significant parameters and wavelet coefficients. Both algorithms can be applied simultaneously after applying the discrete wavelet transform on each individual frame. Experimental results show that the proposed algorithms have the following features: high compression, acceptable quality, and resistance to the statistical and bruteforce attack with low computational processing.
A Generalized Stability Theorem for Discrete-Time Nonautonomous Chaos System with Applications
Directory of Open Access Journals (Sweden)
Mei Zhang
2015-01-01
Full Text Available Firstly, this study introduces a definition of generalized stability (GST in discrete-time nonautonomous chaos system (DNCS, which is an extension for chaos generalized synchronization. Secondly, a constructive theorem of DNCS has been proposed. As an example, a GST DNCS is constructed based on a novel 4-dimensional discrete chaotic map. Numerical simulations show that the dynamic behaviors of this map have chaotic attractor characteristics. As one application, we design a chaotic pseudorandom number generator (CPRNG based on the GST DNCS. We use the SP800-22 test suite to test the randomness of four 100-key streams consisting of 1,000,000 bits generated by the CPRNG, the RC4 algorithm, the ZUC algorithm, and a 6-dimensional CGS-based CPRNG, respectively. The numerical results show that the randomness performances of the two CPRNGs are promising. In addition, theoretically the key space of the CPRNG is larger than 21116. As another application, this study designs a stream avalanche encryption scheme (SAES in RGB image encryption. The results show that the GST DNCS is able to generate the avalanche effects which are similar to those generated via ideal CPRNGs.
Generalized Smooth Transition Map Between Tent and Logistic Maps
Sayed, Wafaa S.; Fahmy, Hossam A. H.; Rezk, Ahmed A.; Radwan, Ahmed G.
There is a continuous demand on novel chaotic generators to be employed in various modeling and pseudo-random number generation applications. This paper proposes a new chaotic map which is a general form for one-dimensional discrete-time maps employing the power function with the tent and logistic maps as special cases. The proposed map uses extra parameters to provide responses that fit multiple applications for which conventional maps were not enough. The proposed generalization covers also maps whose iterative relations are not based on polynomials, i.e. with fractional powers. We introduce a framework for analyzing the proposed map mathematically and predicting its behavior for various combinations of its parameters. In addition, we present and explain the transition map which results in intermediate responses as the parameters vary from their values corresponding to tent map to those corresponding to logistic map case. We study the properties of the proposed map including graph of the map equation, general bifurcation diagram and its key-points, output sequences, and maximum Lyapunov exponent. We present further explorations such as effects of scaling, system response with respect to the new parameters, and operating ranges other than transition region. Finally, a stream cipher system based on the generalized transition map validates its utility for image encryption applications. The system allows the construction of more efficient encryption keys which enhances its sensitivity and other cryptographic properties.
Semi-Homomorphic Encryption and Multiparty Computation
DEFF Research Database (Denmark)
Bendlin, Rikke; Damgård, Ivan Bjerre; Orlandi, Claudio
2011-01-01
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a semi-homomorphic encryption scheme, where the plaintext can be recovered as long as the computed function does not incre......An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a semi-homomorphic encryption scheme, where the plaintext can be recovered as long as the computed function does...... not increase the size of the input “too much”. We show that a number of existing cryptosystems are captured by our relaxed notion. In particular, we give examples of semi-homomorphic encryption schemes based on lattices, subset sum and factoring. We then demonstrate how semi-homomorphic encryption schemes...
Hardware stream cipher with controllable chaos generator for colour image encryption
Barakat, Mohamed L.
2014-01-01
This study presents hardware realisation of chaos-based stream cipher utilised for image encryption applications. A third-order chaotic system with signum non-linearity is implemented and a new post processing technique is proposed to eliminate the bias from the original chaotic sequence. The proposed stream cipher utilises the processed chaotic output to mask and diffuse input pixels through several stages of XORing and bit permutations. The performance of the cipher is tested with several input images and compared with previously reported systems showing superior security and higher hardware efficiency. The system is experimentally verified on XilinxVirtex 4 field programmable gate array (FPGA) achieving small area utilisation and a throughput of 3.62 Gb/s. © The Institution of Engineering and Technology 2013.
Adaptive control for chaotic systems
Energy Technology Data Exchange (ETDEWEB)
Hua Changchun E-mail: cch@ysu.edu.cn; Guan Xinping
2004-10-01
Control problem of chaotic system is investigated via adaptive method. A fairly simple adaptive controller is constructed, which can control chaotic systems to unstable fixed points. The precise mathematical models of chaotic systems need not be known and only the fixed points and the dimensions of chaotic systems are required to be known. Simulations on controlling different chaotic systems are investigated and the results show the validity and feasibility of the proposed controller.
A novel one equilibrium hyper-chaotic system generated upon Lü attractor
International Nuclear Information System (INIS)
Hong-Yan, Jia; Zeng-Qiang, Chen; Zhu-Zhi, Yuan
2010-01-01
By introducing an additional state feedback into a three-dimensional autonomous chaotic attractor Lü system, this paper presents a novel four-dimensional continuous autonomous hyper-chaotic system which has only one equilibrium. There are only 8 terms in all four equations of the new hyper-chaotic system, which may be less than any other four-dimensional continuous autonomous hyper-chaotic systems generated by three-dimensional (3D) continuous autonomous chaotic systems. The hyper-chaotic system undergoes Hopf bifurcation when parameter c varies, and becomes the 3D modified Lü system when parameter k varies. Although the hyper-chaotic system does not undergo Hopf bifurcation when parameter k varies, many dynamic behaviours such as periodic attractor, quasi periodic attractor, chaotic attractor and hyper-chaotic attractor can be observed. A circuit is also designed when parameter k varies and the results of the circuit experiment are in good agreement with those of simulation. (general)
Chaotic inflation in supergravity
Kawasaki, M
2001-01-01
It is shown that chaotic inflation naturally takes place in the framework of supergravity if we assume hat the Kahler potential has a shift symmetry of the inflaton chiral multiplet and introduce a small breaking parameter.
Selective Document Retrieval from Encrypted Database
Bösch, C.T.; Tang, Qiang; Hartel, Pieter H.; Jonker, Willem
We propose the concept of selective document retrieval (SDR) from an encrypted database which allows a client to store encrypted data on a third-party server and perform efficient search remotely. We propose a new SDR scheme based on the recent advances in fully homomorphic encryption schemes. The
A novel chaotic block cryptosystem based on iterating map with output-feedback
International Nuclear Information System (INIS)
Yang Degang; Liao Xiaofeng; Wang Yong; Yang Huaqian; Wei Pengcheng
2009-01-01
A novel method for encryption based on iterating map with output-feedback is presented in this paper. The output-feedback, instead of simply mixing the chaotic signal of the proposed chaotic cryptosystem with the cipher-text, is relating to previous cipher-text that is obtained through the plaintext and key. Some simulated experiments are performed to substantiate that our method can make cipher-text more confusion and diffusion and that the proposed method is practical whenever efficiency, cipher-text length or security is concerned.
Freeman, Walter J.
2013-01-01
The first step of the sensory systems is to construct the meaning of the information they receive from the senses. They do this by generating random noise and then filtering the noise with adaptive filters. We simulate the operation with the solutions of matrices of ordinary differential equations that predict subcritical Hopf bifurcations between point and limit cycle attractors. The second step is integration of the outputs from the several sensory systems into a multisensory percept, called a gestalt, which in the third step is consolidated and stored as knowledge. Simulation of the second step requires use of landscapes of nonconvergent chaotic attractors. This is not deterministic chaos, which is much too brittle owing to the infinite sensitivity to initial conditions. It is a hybrid form we call stochastic chaos, which is stabilized by additive noise modeled on noise sources in the sensory systems. Thus bifurcation and chaos theory provides tools for succinct empirical models of cortical dynamics performing the most basic cognitive operations: generalization, abstraction, and categorization in constructing knowledge. The descriptions are in a form that is suitable for more advanced modeling using analog VLSI, neuropercolation from random graph theory, non-equilibrium dissipative thermodynamics, and macroscopic many-body physics. This review concludes with a summary of the applications of stochastic chaos in pattern classification and some prescriptions for neurobiologists on what to look for in large-scale anatomical formations.
Generalized hardware post-processing technique for chaos-based pseudorandom number generators
Barakat, Mohamed L.
2013-06-01
This paper presents a generalized post-processing technique for enhancing the pseudorandomness of digital chaotic oscillators through a nonlinear XOR-based operation with rotation and feedback. The technique allows full utilization of the chaotic output as pseudorandom number generators and improves throughput without a significant area penalty. Digital design of a third-order chaotic system with maximum function nonlinearity is presented with verified chaotic dynamics. The proposed post-processing technique eliminates statistical degradation in all output bits, thus maximizing throughput compared to other processing techniques. Furthermore, the technique is applied to several fully digital chaotic oscillators with performance surpassing previously reported systems in the literature. The enhancement in the randomness is further examined in a simple image encryption application resulting in a better security performance. The system is verified through experiment on a Xilinx Virtex 4 FPGA with throughput up to 15.44 Gbit/s and logic utilization less than 0.84% for 32-bit implementations. © 2013 ETRI.
Empirically characteristic analysis of chaotic PID controlling particle swarm optimization
Yan, Danping; Lu, Yongzhong; Zhou, Min; Chen, Shiping; Levy, David
2017-01-01
Since chaos systems generally have the intrinsic properties of sensitivity to initial conditions, topological mixing and density of periodic orbits, they may tactfully use the chaotic ergodic orbits to achieve the global optimum or their better approximation to given cost functions with high probability. During the past decade, they have increasingly received much attention from academic community and industry society throughout the world. To improve the performance of particle swarm optimization (PSO), we herein propose a chaotic proportional integral derivative (PID) controlling PSO algorithm by the hybridization of chaotic logistic dynamics and hierarchical inertia weight. The hierarchical inertia weight coefficients are determined in accordance with the present fitness values of the local best positions so as to adaptively expand the particles’ search space. Moreover, the chaotic logistic map is not only used in the substitution of the two random parameters affecting the convergence behavior, but also used in the chaotic local search for the global best position so as to easily avoid the particles’ premature behaviors via the whole search space. Thereafter, the convergent analysis of chaotic PID controlling PSO is under deep investigation. Empirical simulation results demonstrate that compared with other several chaotic PSO algorithms like chaotic PSO with the logistic map, chaotic PSO with the tent map and chaotic catfish PSO with the logistic map, chaotic PID controlling PSO exhibits much better search efficiency and quality when solving the optimization problems. Additionally, the parameter estimation of a nonlinear dynamic system also further clarifies its superiority to chaotic catfish PSO, genetic algorithm (GA) and PSO. PMID:28472050
Empirically characteristic analysis of chaotic PID controlling particle swarm optimization.
Directory of Open Access Journals (Sweden)
Danping Yan
Full Text Available Since chaos systems generally have the intrinsic properties of sensitivity to initial conditions, topological mixing and density of periodic orbits, they may tactfully use the chaotic ergodic orbits to achieve the global optimum or their better approximation to given cost functions with high probability. During the past decade, they have increasingly received much attention from academic community and industry society throughout the world. To improve the performance of particle swarm optimization (PSO, we herein propose a chaotic proportional integral derivative (PID controlling PSO algorithm by the hybridization of chaotic logistic dynamics and hierarchical inertia weight. The hierarchical inertia weight coefficients are determined in accordance with the present fitness values of the local best positions so as to adaptively expand the particles' search space. Moreover, the chaotic logistic map is not only used in the substitution of the two random parameters affecting the convergence behavior, but also used in the chaotic local search for the global best position so as to easily avoid the particles' premature behaviors via the whole search space. Thereafter, the convergent analysis of chaotic PID controlling PSO is under deep investigation. Empirical simulation results demonstrate that compared with other several chaotic PSO algorithms like chaotic PSO with the logistic map, chaotic PSO with the tent map and chaotic catfish PSO with the logistic map, chaotic PID controlling PSO exhibits much better search efficiency and quality when solving the optimization problems. Additionally, the parameter estimation of a nonlinear dynamic system also further clarifies its superiority to chaotic catfish PSO, genetic algorithm (GA and PSO.
An Ultra-Lightweight Encryption Scheme in Underwater Acoustic Networks
Directory of Open Access Journals (Sweden)
Chunyan Peng
2016-01-01
Full Text Available We tackle a fundamental security problem in underwater acoustic networks (UANs. The S-box in the existing block encryption algorithm is more energy consuming and unsuitable for resources-constrained UANs. In this paper, instead of S-box, we present a lightweight, 8-round iteration block cipher algorithm for UANs communication based on chaotic theory and increase the key space by changing the number of iteration round. We further propose secure network architecture of UANs. By analysis, our algorithm can resist brute-force searches and adversarial attacks. Simulation results show that, compared with traditional AES-128 and PRESENT algorithms, our cryptographic algorithm can make a good trade-off between security and overhead, has better energy efficiency, and applies to UANs.
Mediated Encryption: Analysis and Design
Directory of Open Access Journals (Sweden)
I. Elashry1
2015-01-01
Full Text Available Boneh, Ding and Tsudik presented identity-based mediated RSA encryption and signature systems in which the users are not allowed to decrypt/sign messages without the authorisation of a security mediator.We show that ID-MRSA is not secure and we present a secure modified version of it which is as efficient as the original system. We also propose a generic mediated encryption that translates any identity based encryption to a mediated version of this IBE. It envelops an IBE encrypted message using a user’s identity into an IBE envelope using the identity of the SEM. We present two security models based on the role of the adversary whether it is a revoked user or a hacked SEM. We prove that GME is as secure as the SEM’s IBE against a revoked user and as secure as the user’s IBE against a hacked SEM. We also present two implementations of GME based on Boneh-Franklin FullIBE system which is a pairing-based system and Boneh, Gentry and Hamburg (BGH system which is pairing-free system.
Polarisation Encryption/Decryption Module
DEFF Research Database (Denmark)
2002-01-01
A polarisation encryption/decryption module comprising at least two array based modulating devices, preferably spatial light modulators (SLMs), at least one array based intensity detector, and at least one source of electromagnetic radiation. A local region of information displayed on a first...
Chaotic distributions for relativistic particles
Mustafa, Dawan; Wennberg, Bernt
2015-01-01
We study a modified Kac model where the classical kinetic energy is replaced by an arbitrary energy function $\\phi(v)$, $v \\in \\mathbb{R}$. The aim of this paper is to show that the uniform density with respect to the microcanonical measure is $Ce^{-z_0\\phi(v)}$-chaotic, $C,z_0 \\in \\mathbb{R}_+$. The kinetic energy for relativistic particles is a special case. A generalization to the case $v\\in \\mathbb{R}^d$ which involves conservation momentum is also formally discussed.
Cryptography with chaotic mixing
International Nuclear Information System (INIS)
Oliveira, Luiz P.L. de; Sobottka, Marcelo
2008-01-01
We propose a cryptosystem based on one-dimensional chaotic maps of the form H p (x)=r p -1 0G0r p (x) defined in the interval [0, 10 p ) for a positive integer parameter p, where G(x)=10x(mod10) and r p (x)= p √(x), which is a topological conjugacy between G and the shift map σ on the space Σ of the sequences with 10 symbols. There are three advantages in comparison with the recently proposed cryptosystem based on chaotic logistic maps F μ (x)=μx(1-x) with 3 p is always chaotic for all parameters p, (b) the knowledge of an ergodic measure allows assignments of the alphabetic symbols to equiprobable sites of H p 's domain and (c) for each p, the security of the cryptosystem is manageable against brute force attacks
Directory of Open Access Journals (Sweden)
Filipp B. Burtyka
2017-06-01
Full Text Available The processing of queries to an encrypted database without its decryption has been actively investigated recently by both cryptographers and database researchers. Such a work is allowed by various types of so-called Processable encryption (PE, as well as special architectures of database management systems (DBMS which use these types of encryption. The most known types of PEs are order-preserving encryption, homomorphic encryption, functional encryption, searchable encryption, and property-preserving encryption. Based on these types of encryption, various DBMSs are built, the most famous of which are CryptDB, Mo- nomi, Arx and DBMS by researchers from Novosibirsk. These DBMSs are built on the basis of various types of PEs, for example order-preserving encryption, homomorphic encryption and traditional block encryption. However, this approach can cause privacy problems. The best approach from the security viewpoint is to build a cryptographic database using only homomorphic encryption. An obstacle to this is insufficient efficiency of the existing homomorphic encryption schemes and incomplete solution of a set of issues related to ensuring the confidentiality of decisions making in an untrusted environment. In this paper, we propose the techniques for solving these problems, in particular for organization of execution arbitrary secure query to the encrypted relational database using fully homomorphic encryption. Also we propose a model of query condition that splits query into atomic predicates and linking condition. One of roposed technique is aimed at ensuring the security of linking condition of queries, others keep security of atomic predicates. The parameters of the proposed techniques make it possible to implement them using the already existing homomorphic encryption schemes. The proposed techniques can be a basis for building secure cryptographic cloud databases.
Chaotic Maps Dynamics, Fractals, and Rapid Fluctuations
Chen, Goong
2011-01-01
This book consists of lecture notes for a semester-long introductory graduate course on dynamical systems and chaos taught by the authors at Texas A&M University and Zhongshan University, China. There are ten chapters in the main body of the book, covering an elementary theory of chaotic maps in finite-dimensional spaces. The topics include one-dimensional dynamical systems (interval maps), bifurcations, general topological, symbolic dynamical systems, fractals and a class of infinite-dimensional dynamical systems which are induced by interval maps, plus rapid fluctuations of chaotic maps as a
Initial conditions for chaotic inflation
International Nuclear Information System (INIS)
Brandenberger, R.; Kung, J.; Feldman, H.
1991-01-01
In contrast to many other inflationary Universe models, chaotic inflation does not depend on fine tuning initial conditions. Within the context of linear perturbation theory, it is shown that chaotic inflation is stable towards both metric and matter perturbations. Neglecting gravitational perturbations, it is shown that chaotic inflation is an attractor in initial condition space. (orig.)
Zhang, Yushu; Zhou, Jiantao; Chen, Fei; Zhang, Leo Yu; Xiao, Di; Chen, Bin; Liao, Xiaofeng
The existing Block Compressive Sensing (BCS) based image ciphers adopted the same sampling rate for all the blocks, which may lead to the desirable result that after subsampling, significant blocks lose some more-useful information while insignificant blocks still retain some less-useful information. Motivated by this observation, we propose a scalable encryption framework (SEF) based on BCS together with a Sobel Edge Detector and Cascade Chaotic Maps. Our work is firstly dedicated to the design of two new fusion techniques, chaos-based structurally random matrices and chaos-based random convolution and subsampling. The basic idea is to divide an image into some blocks with an equal size and then diagnose their respective significance with the help of the Sobel Edge Detector. For significant block encryption, chaos-based structurally random matrix is applied to significant blocks whereas chaos-based random convolution and subsampling are responsible for the remaining insignificant ones. In comparison with the BCS based image ciphers, the SEF takes lightweight subsampling and severe sensitivity encryption for the significant blocks and severe subsampling and lightweight robustness encryption for the insignificant ones in parallel, thus better protecting significant image regions.
International Nuclear Information System (INIS)
Linde, A.D.
1986-05-01
It is shown that the universe evolution in the chaotic inflation scenario has no end and may have no beginning. According to this scenario, the universe consists of exponentially large number of different mini-universes inside which all possible metastable vacuum states and all possible types of compactification are realized. (author)
DEFF Research Database (Denmark)
Schäfer, Mirko; Greiner, Martin
Chaotic strings are coupled Tchebyscheff maps on a ring-network. With a well-specified empirical prescription they are able to explain the coupling constants of the standard model of elementary particle physics. This empirical relationship is tested further by introducing a tunable disorder to ch...
DEFF Research Database (Denmark)
Schäfer, Mirko; Greiner, Martin
2011-01-01
Chaotic strings are coupled Tchebyscheff maps on a ring-network. With a well-specified empirical prescription they are able to explain the coupling constants of the standard model of elementary particle physics. This empirical relationship is tested further by introducing a tunable disorder to ch...
Color Image Encryption Using Three-Dimensional Sine ICMIC Modulation Map and DNA Sequence Operations
Liu, Wenhao; Sun, Kehui; He, Yi; Yu, Mengyao
Derived from Sine map and iterative chaotic map with infinite collapse (ICMIC), a three-dimensional hyperchaotic Sine ICMIC modulation map (3D-SIMM) is proposed based on a close-loop modulation coupling (CMC) method. Based on this map, a novel color image encryption algorithm is designed by employing a hybrid model of multidirectional circular permutation and deoxyribonucleic acid (DNA) masking. In this scheme, the pixel positions of image are scrambled by multidirectional circular permutation, and the pixel values are substituted by DNA sequence operations. The simulation results and security analysis show that the algorithm has good encryption effect and strong key sensitivity, and can resist brute-force, statistical, differential, known-plaintext and chosen-plaintext attacks.
A light weight secure image encryption scheme based on chaos & DNA computing
Directory of Open Access Journals (Sweden)
Bhaskar Mondal
2017-10-01
Full Text Available This paper proposed a new light weight secure cryptographic scheme for secure image communication. In this scheme the plain image is permuted first using a sequence of pseudo random number (PRN and encrypted by DeoxyriboNucleic Acid (DNA computation. Two PRN sequences are generated by a Pseudo Random Number Generator (PRNG based on cross coupled chaotic logistic map using two sets of keys. The first PRN sequence is used for permuting the plain image whereas the second PRN sequence is used for generating random DNA sequence. The number of rounds of permutation and encryption may be variable to increase security. The scheme is proposed for gray label images but the scheme may be extended for color images and text data. Simulation results exhibit that the proposed scheme can defy any kind of attack.
Frequency-Hiding Order-Preserving Encryption
Kerschbaum, Florian
2015-01-01
Order-preserving encryption allows encrypting data, while still enabling efficient range queries on the encrypted data. This makes its performance and functionality very suitable for data outsourcing in cloud computing scenarios, but the security of order-preserving is still debatable. We present a scheme that achieves a strictly stronger notion of security than any other scheme so far. The basic idea is to randomize the ciphertexts to hide the frequency of plaintexts. Still, the client stora...
Optical voice encryption based on digital holography.
Rajput, Sudheesh K; Matoba, Osamu
2017-11-15
We propose an optical voice encryption scheme based on digital holography (DH). An off-axis DH is employed to acquire voice information by obtaining phase retardation occurring in the object wave due to sound wave propagation. The acquired hologram, including voice information, is encrypted using optical image encryption. The DH reconstruction and decryption with all the correct parameters can retrieve an original voice. The scheme has the capability to record the human voice in holograms and encrypt it directly. These aspects make the scheme suitable for other security applications and help to use the voice as a potential security tool. We present experimental and some part of simulation results.
Directory of Open Access Journals (Sweden)
Mohadeseh Kanafchian
2017-04-01
In this paper, we first give a brief introduction into chaotic image encryption and then we investigate some important properties and behaviour of the logistic map. The logistic map, aperiodic trajectory, or random-like fluctuation, could not be obtained with some choice of initial condition. Therefore, a noisy logistic map with an additive system noise is introduced. The proposed scheme is based on the extended map of the Clifford strange attractor, where each dimension has a specific role in the encryption process. Two dimensions are used for pixel permutation and the third dimension is used for pixel diffusion. In order to optimize the Clifford encryption system we increase the space key by using the noisy logistic map and a novel encryption scheme based on the Clifford attractor and the noisy logistic map for secure transfer images is proposed. This algorithm consists of two parts: the noisy logistic map shuffle of the pixel position and the pixel value. We use times for shuffling the pixel position and value then we generate the new pixel position and value by the Clifford system. To illustrate the efficiency of the proposed scheme, various types of security analysis are tested. It can be concluded that the proposed image encryption system is a suitable choice for practical applications.
An image encryption scheme based on the MLNCML system using DNA sequences
Zhang, Ying-Qian; Wang, Xing-Yuan; Liu, Jia; Chi, Ze-Lin
2016-07-01
We propose a new image scheme based on the spatiotemporal chaos of the Mixed Linear-Nonlinear Coupled Map Lattices (MLNCML). This spatiotemporal chaotic system has more cryptographic features in dynamics than the system of Coupled Map Lattices (CML). In the proposed scheme, we employ the strategy of DNA computing and one time pad encryption policy, which can enhance the sensitivity to the plaintext and resist differential attack, brute-force attack, statistical attack and plaintext attack. Simulation results and theoretical analysis indicate that the proposed scheme has superior high security.
Experimental scrambling and noise reduction applied to the optical encryption of QR codes.
Barrera, John Fredy; Vélez, Alejandro; Torroba, Roberto
2014-08-25
In this contribution, we implement two techniques to reinforce optical encryption, which we restrict in particular to the QR codes, but could be applied in a general encoding situation. To our knowledge, we present the first experimental-positional optical scrambling merged with an optical encryption procedure. The inclusion of an experimental scrambling technique in an optical encryption protocol, in particular dealing with a QR code "container", adds more protection to the encoding proposal. Additionally, a nonlinear normalization technique is applied to reduce the noise over the recovered images besides increasing the security against attacks. The opto-digital techniques employ an interferometric arrangement and a joint transform correlator encrypting architecture. The experimental results demonstrate the capability of the methods to accomplish the task.
Dynamical fractional chaotic inflation
Harigaya, Keisuke; Ibe, Masahiro; Schmitz, Kai; Yanagida, Tsutomu T.
2014-12-01
Chaotic inflation based on a simple monomial scalar potential, V (ϕ )∝ϕp, is an attractive large-field model of inflation capable of generating a sizable tensor-to-scalar ratio r . Therefore, assuming that future cosmic microwave background observations will confirm the large r value reported by BICEP2, it is important to determine what kind of dynamical mechanism could possibly endow the inflaton field with such a simple effective potential. In this paper, we answer this question in the context of field theory, i.e. in the framework of dynamical chaotic inflation, where strongly interacting supersymmetric gauge dynamics around the scale of grand unification dynamically generate a fractional power-law potential via the quantum effect of dimensional transmutation. In constructing explicit models, we significantly extend our previous work, as we now consider a large variety of possible underlying gauge dynamics and relax our conditions on the field content of the model. This allows us to realize almost arbitrary rational values for the power p in the inflaton potential. The present paper may hence be regarded as a first step toward a more complete theory of dynamical chaotic inflation.
Different search strategies on encrypted data compared
Brinkman, Richard; Petkovic, M.; Jonker, W.; Jonker, Willem
When private information is stored in databases that are under the control of others, the only possible way to protect it, is to encrypt it before storing it. In order to efficiently retrieve the data, a search mechanism is needed that still works over the encrypted data. In this chapter an overview
Modified scaling function projective synchronization of chaotic systems
International Nuclear Information System (INIS)
Xu Yu-Hua; Zhou Wu-Neng; Fang Jian-An
2011-01-01
This paper investigates a kind of modified scaling function projective synchronization of uncertain chaotic systems using an adaptive controller. The given scaling function in the new method can be an equilibrium point, a periodic orbit, or even a chaotic attractor in the phase space. Based on LaSalle's invariance set principle, the adaptive control law is derived to make the states of two chaotic systems function projective synchronized. Some numerical examples are also given to show the effectiveness of the proposed method. (general)
Image encryption using the fractional wavelet transform
International Nuclear Information System (INIS)
Vilardy, Juan M; Useche, J; Torres, C O; Mattos, L
2011-01-01
In this paper a technique for the coding of digital images is developed using Fractional Wavelet Transform (FWT) and random phase masks (RPMs). The digital image to encrypt is transformed with the FWT, after the coefficients resulting from the FWT (Approximation, Details: Horizontal, vertical and diagonal) are multiplied each one by different RPMs (statistically independent) and these latest results is applied an Inverse Wavelet Transform (IWT), obtaining the encrypted digital image. The decryption technique is the same encryption technique in reverse sense. This technique provides immediate advantages security compared to conventional techniques, in this technique the mother wavelet family and fractional orders associated with the FWT are additional keys that make access difficult to information to an unauthorized person (besides the RPMs used), thereby the level of encryption security is extraordinarily increased. In this work the mathematical support for the use of the FWT in the computational algorithm for the encryption is also developed.
Dynamic control of chaotic resonators
Di Falco, A.
2016-02-16
We report on the all-optical control of chaotic optical resonators based on silicon on insulator (SOI) platform. We show that simple non-chaotic cavities can be tuned to exhibit chaotic behavior via intense optical pump- ing, inducing a local change of refractive index. To this extent we have fabricated a number of devices and demonstrated experimentally and theoretically that chaos can be triggered on demand on an optical chip. © 2016 SPIE.
Pitchfork bifurcation and circuit implementation of a novel Chen hyper-chaotic system
International Nuclear Information System (INIS)
Dong En-Zeng; Chen Zeng-Qiang; Chen Zai-Ping; Ni Jian-Yun
2012-01-01
In this paper, a novel four dimensional hyper-chaotic system is coined based on the Chen system, which contains two quadratic terms and five system parameters. The proposed system can generate a hyper-chaotic attractor in wide parameters regions. By using the center manifold theorem and the local bifurcation theory, a pitchfork bifurcation is demonstrated to arise at the zero equilibrium point. Numerical analysis demonstrates that the hyper-chaotic system can generate complex dynamical behaviors, e.g., a direct transition from quasi-periodic behavior to hyper-chaotic behavior. Finally, an electronic circuit is designed to implement the hyper-chaotic system, the experimental results are consist with the numerical simulations, which verifies the existence of the hyper-chaotic attractor. Due to the complex dynamic behaviors, this new hyper-chaotic system is useful in the secure communication. (general)
On robust control of uncertain chaotic systems: a sliding-mode synthesis via chaotic optimization
International Nuclear Information System (INIS)
Lu Zhao; Shieh Leangsan; Chen GuanRong
2003-01-01
This paper presents a novel Lyapunov-based control approach which utilizes a Lyapunov function of the nominal plant for robust tracking control of general multi-input uncertain nonlinear systems. The difficulty of constructing a control Lyapunov function is alleviated by means of predefining an optimal sliding mode. The conventional schemes for constructing sliding modes of nonlinear systems stipulate that the system of interest is canonical-transformable or feedback-linearizable. An innovative approach that exploits a chaotic optimizing algorithm is developed thereby obtaining the optimal sliding manifold for the control purpose. Simulations on the uncertain chaotic Chen's system illustrate the effectiveness of the proposed approach
Secure Communication Based on a Hybrid of Chaos and Ica Encryptions
Chen, Wei Ching; Yuan, John
Chaos and independent component analysis (ICA) encryptions are two novel schemes for secure communications. In this paper, a new scheme combining chaos and ICA techniques is proposed to enhance the security level during communication. In this scheme, a master chaotic system is embedded at the transmitter. The message signal is mixed with a chaotic signal and a Gaussian white noise into two mixed signals and then transmitted to the receiver through the public channels. A signal for synchronization is transmitted through another public channel to the receiver where a slave chaotic system is embedded to reproduce the chaotic signal. A modified ICA is used to recover the message signal at the receiver. Since only two of the three transmitted signals contain the information of message signal, a hacker would not be able to retrieve the message signal by using ICA even though all the transmitted signals are intercepted. Spectrum analyses are used to prove that the message signal can be securely hidden under this scheme.
A simple chaotic delay differential equation
International Nuclear Information System (INIS)
Sprott, J.C.
2007-01-01
The simplest chaotic delay differential equation with a sinusoidal nonlinearity is described, including the route to chaos, Lyapunov exponent spectrum, and chaotic diffusion. It is prototypical of many other high-dimensional chaotic systems
CMAC-based adaptive backstepping synchronization of uncertain chaotic systems
International Nuclear Information System (INIS)
Lin, C.-M.; Peng, Y.-F.; Lin, M.-H.
2009-01-01
This study proposes an adaptive backstepping control system for synchronizing uncertain chaotic system by using cerebellar model articulation controller (CMAC). CMAC is a nonlinear network with simple computation, good generalization capability and fast learning property. The proposed CMAC-based adaptive backstepping control (CABC) system uses backstepping method and adaptive cerebellar model articulation controller (ACMAC) for synchronizing uncertain chaotic system. Finally, simulation results for the Genesio system are presented to illustrate the effectiveness of the proposed control system.
Building Chaotic Model From Incomplete Time Series
Siek, Michael; Solomatine, Dimitri
2010-05-01
This paper presents a number of novel techniques for building a predictive chaotic model from incomplete time series. A predictive chaotic model is built by reconstructing the time-delayed phase space from observed time series and the prediction is made by a global model or adaptive local models based on the dynamical neighbors found in the reconstructed phase space. In general, the building of any data-driven models depends on the completeness and quality of the data itself. However, the completeness of the data availability can not always be guaranteed since the measurement or data transmission is intermittently not working properly due to some reasons. We propose two main solutions dealing with incomplete time series: using imputing and non-imputing methods. For imputing methods, we utilized the interpolation methods (weighted sum of linear interpolations, Bayesian principle component analysis and cubic spline interpolation) and predictive models (neural network, kernel machine, chaotic model) for estimating the missing values. After imputing the missing values, the phase space reconstruction and chaotic model prediction are executed as a standard procedure. For non-imputing methods, we reconstructed the time-delayed phase space from observed time series with missing values. This reconstruction results in non-continuous trajectories. However, the local model prediction can still be made from the other dynamical neighbors reconstructed from non-missing values. We implemented and tested these methods to construct a chaotic model for predicting storm surges at Hoek van Holland as the entrance of Rotterdam Port. The hourly surge time series is available for duration of 1990-1996. For measuring the performance of the proposed methods, a synthetic time series with missing values generated by a particular random variable to the original (complete) time series is utilized. There exist two main performance measures used in this work: (1) error measures between the actual
HOMOMORPHIC ENCRYPTION: CLOUD COMPUTING SECURITY AND OTHER APPLICATIONS (A SURVEY
Directory of Open Access Journals (Sweden)
A. I. Trubei
2015-01-01
Full Text Available Homomorphic encryption is a form of encryption which allows specific types of computations to be carried out on cipher text and to obtain an encrypted result which matches the result of operations performed on the plain text. The article presents a basic concept of the homomorphic encryption and various encryption algorithms in accordance with the fundamental properties of the homomorphic encryption. The examples of various principles and properties of homomorphic encryption, some homomorphic algorithms using asymmetric key systems such as RSA, ElGamal, Paillier algorithms as well as various homomorphic encryption schemes are given. Prospects of homomorphic encryption application in the field of secure cloud computing, electronic voting, cipher text searching, encrypted mail filtering, mobile cipher and secure feedback systems are considered.
Easy encryption for CERN laptops
Computer Security Team
2014-01-01
The number of laptops stolen from or lost by CERN staff and users is not negligible. On average, four to five devices are reported lost or stolen to the CERN Fire Brigade every month. The real number might be even higher as not everyone is aware that such thefts/losses should be reported in this way. Along with each laptop, private e-mails and personal documents, as well as MARS forms, contracts, NDAs, etc. are also lost. Fortunately, CERN has not lost any sensitive data so far (unlike other companies). In parallel with the approval by the Enlarged Directorate at its latest session of the development of a CERN-wide Data Protection Policy, the IT Department has prepared measures allowing you to protect the data on your laptop using full hard-disk encryption. While the word “encryption” might sounds complicated, the IT Department has fully automated the encryption process. For centrally managed Windows PCs, you just have to install the corresponding CMF package (“M...
Predicting chaotic time series
International Nuclear Information System (INIS)
Farmer, J.D.; Sidorowich, J.J.
1987-01-01
We present a forecasting technique for chaotic data. After embedding a time series in a state space using delay coordinates, we ''learn'' the induced nonlinear mapping using local approximation. This allows us to make short-term predictions of the future behavior of a time series, using information based only on past values. We present an error estimate for this technique, and demonstrate its effectiveness by applying it to several examples, including data from the Mackey-Glass delay differential equation, Rayleigh-Benard convection, and Taylor-Couette flow
Extraction of dynamical equations from chaotic data
International Nuclear Information System (INIS)
Rowlands, G.; Sprott, J.C.
1991-02-01
A method is described for extracting from a chaotic time series a system of equations whose solution reproduces the general features of the original data even when these are contaminated with noise. The equations facilitate calculation of fractal dimension, Lyapunov exponents and short-term predictions. The method is applied to data derived from numerical solutions of the Logistic equation, the Henon equations, the Lorenz equations and the Roessler equations. 10 refs., 5 figs
Stochastic and Chaotic Relaxation Oscillations
Grasman, J.; Roerdink, J.B.T.M.
1988-01-01
For relaxation oscillators stochastic and chaotic dynamics are investigated. The effect of random perturbations upon the period is computed. For an extended system with additional state variables chaotic behavior can be expected. As an example, the Van der Pol oscillator is changed into a
Video Encryption and Decryption on Quantum Computers
Yan, Fei; Iliyasu, Abdullah M.; Venegas-Andraca, Salvador E.; Yang, Huamin
2015-08-01
A method for video encryption and decryption on quantum computers is proposed based on color information transformations on each frame encoding the content of the encoding the content of the video. The proposed method provides a flexible operation to encrypt quantum video by means of the quantum measurement in order to enhance the security of the video. To validate the proposed approach, a tetris tile-matching puzzle game video is utilized in the experimental simulations. The results obtained suggest that the proposed method enhances the security and speed of quantum video encryption and decryption, both properties required for secure transmission and sharing of video content in quantum communication.
An improved chaotic cryptosystem based on circular bit shift and XOR operations
International Nuclear Information System (INIS)
Xu, Shu-Jiang; Chen, Xiu-Bo; Zhang, Ru; Yang, Yi-Xian; Guo, Yu-Cui
2012-01-01
A type of chaotic encryption scheme by combining circular bit shift with XOR operations was proposed in 2006 based on iterating chaotic maps. Soon after the proposal, it was cryptanalyzed and improved. Unfortunately, there are still two drawbacks in the two improved schemes. To strengthen the performance of the focused type of scheme, a new improved scheme based on Chen's chaotic system is proposed in this Letter. Simulation results and theoretical analysis show that our improved scheme is immune to information extracting by chosen plaintext attack and has expected cryptographic properties. -- Highlights: ► There are 2 drawbacks in 2 improved chaos-based encryption schemes by bit shift and XOR operation. ► FIPS 140-2 test show the random number sequence generated by CCS is statistical random. ► The plaintext is first permuted byte by byte, and then masked in the inverse order. ► Small perturbation based on output ciphertext is given to c of CCS after iterating it every time.
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-01
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information.
Yang, Yu-Guang; Xu, Peng; Yang, Rui; Zhou, Yi-Hua; Shi, Wei-Min
2016-01-01
Quantum information and quantum computation have achieved a huge success during the last years. In this paper, we investigate the capability of quantum Hash function, which can be constructed by subtly modifying quantum walks, a famous quantum computation model. It is found that quantum Hash function can act as a hash function for the privacy amplification process of quantum key distribution systems with higher security. As a byproduct, quantum Hash function can also be used for pseudo-random number generation due to its inherent chaotic dynamics. Further we discuss the application of quantum Hash function to image encryption and propose a novel image encryption algorithm. Numerical simulations and performance comparisons show that quantum Hash function is eligible for privacy amplification in quantum key distribution, pseudo-random number generation and image encryption in terms of various hash tests and randomness tests. It extends the scope of application of quantum computation and quantum information. PMID:26823196
Aydiner, Ekrem
2018-01-15
In this study, we consider nonlinear interactions between components such as dark energy, dark matter, matter and radiation in the framework of the Friedman-Robertson-Walker space-time and propose a simple interaction model based on the time evolution of the densities of these components. By using this model we show that these interactions can be given by Lotka-Volterra type equations. We numerically solve these coupling equations and show that interaction dynamics between dark energy-dark matter-matter or dark energy-dark matter-matter-radiation has a strange attractor for 0 > w de >-1, w dm ≥ 0, w m ≥ 0 and w r ≥ 0 values. These strange attractors with the positive Lyapunov exponent clearly show that chaotic dynamics appears in the time evolution of the densities. These results provide that the time evolution of the universe is chaotic. The present model may have potential to solve some of the cosmological problems such as the singularity, cosmic coincidence, big crunch, big rip, horizon, oscillation, the emergence of the galaxies, matter distribution and large-scale organization of the universe. The model also connects between dynamics of the competing species in biological systems and dynamics of the time evolution of the universe and offers a new perspective and a new different scenario for the universe evolution.
Key management and encryption under the bounded storage model.
Energy Technology Data Exchange (ETDEWEB)
Draelos, Timothy John; Neumann, William Douglas; Lanzone, Andrew J.; Anderson, William Erik
2005-11-01
There are several engineering obstacles that need to be solved before key management and encryption under the bounded storage model can be realized. One of the critical obstacles hindering its adoption is the construction of a scheme that achieves reliable communication in the event that timing synchronization errors occur. One of the main accomplishments of this project was the development of a new scheme that solves this problem. We show in general that there exist message encoding techniques under the bounded storage model that provide an arbitrarily small probability of transmission error. We compute the maximum capacity of this channel using the unsynchronized key-expansion as side-channel information at the decoder and provide tight lower bounds for a particular class of key-expansion functions that are pseudo-invariant to timing errors. Using our results in combination with Dziembowski et al. [11] encryption scheme we can construct a scheme that solves the timing synchronization error problem. In addition to this work we conducted a detailed case study of current and future storage technologies. We analyzed the cost, capacity, and storage data rate of various technologies, so that precise security parameters can be developed for bounded storage encryption schemes. This will provide an invaluable tool for developing these schemes in practice.
Encrypted Data Storage in EGEE
Frohner, Ákos
2006-01-01
The medical community is routinely using clinical images and associated medical data for diagnosis, intervention planning and therapy follow-up. Medical imaging is producing an increasing number of digital images for which computerized archiving, processing and analysis are needed. Grids are promising infrastructures for managing and analyzing the huge medical databases. Given the sensitive nature of medical images, practiotionners are often reluctant to use distributed systems though. Security if often implemented by isolating the imaging network from the outside world inside hospitals. Given the wide scale distribution of grid infrastructures and their multiple administrative entities, the level of security for manipulating medical data should be particularly high. In this presentation we describe the architecture of a solution, the gLite Encrypted Data Storage (EDS), which was developed in the framework of Enabling Grids for E-sciencE (EGEE), a project of the European Commission (contract number INFSO--508...
Efficient multimedia encryption via entropy codec design
Wu, Chung-Ping; Kuo, C.-C. Jay
2001-08-01
Efficient encryption algorithms are essential to multimedia data security, since the data size is large and real-time processing is often required. After discussing limitations of previous work on multimedia encryption, we propose a novel methodology for confidentiality, which turns entropy coders into encryption ciphers by using multiple statistical models. The choice of statistical models and the order in which they are applied are kept secret as the key Two encryption schemes are constructed by applying this methodology to the Huffman coder and the QM coder. It is shown that security is achieved without sacrificing the compression performance and the computational speed. The schemes can be applied to most modern compression systems such as MPEG audio, MPEG video and JPEG/JPEG2000 image compression.
Compressive sensing based ptychography image encryption
Rawat, Nitin
2015-09-01
A compressive sensing (CS) based ptychography combined with an optical image encryption is proposed. The diffraction pattern is recorded through ptychography technique further compressed by non-uniform sampling via CS framework. The system requires much less encrypted data and provides high security. The diffraction pattern as well as the lesser measurements of the encrypted samples serves as a secret key which make the intruder attacks more difficult. Furthermore, CS shows that the linearly projected few random samples have adequate information for decryption with a dramatic volume reduction. Experimental results validate the feasibility and effectiveness of our proposed technique compared with the existing techniques. The retrieved images do not reveal any information with the original information. In addition, the proposed system can be robust even with partial encryption and under brute-force attacks.
Quantum chaotic dynamics and random polynomials
International Nuclear Information System (INIS)
Bogomolny, E.; Bohigas, O.; Leboeuf, P.
1995-11-01
The distribution of roots of polynomials of high degree with random coefficients is investigated which, among others, appear naturally in the context of 'quantum chaotic dynamics'. It is shown that under quite general conditions their roots tend to concentrate near the unit circle in the complex plane. In order to further increase this tendency, the particular case of self-inverse random polynomials is studied, and it is shown that for them a finite portion of all roots lies exactly on the unit circle. Correlation functions of these roots are also computed analytically, and compared to the correlations of eigenvalues of random matrices. The problem of ergodicity of chaotic wavefunctions is also considered. Special attention is devoted to the role of symmetries in the distribution of roots of random polynomials. (author)
Multidimensional data encryption with virtual optics
Yu, Lingfeng
Information security is very important in many application areas in the field of information technology. Recently, a number of optical encryption methods have been proposed for the purpose of information hiding and data security, because optical information processing techniques have obvious advantages such as high degrees of freedom (e.g. amplitude, phase, polarization, wavelength) for encryption and decryption, and high-level data security. However, the limitations of current optical encryption methods relate to the complexity of their optical hardware, the requirements of the information type, lack of flexibility, and the lack of compact and low-cost optoelectronics devices and systems. These problems make it difficult to move optical encryption out of the research lab and into real world application areas. In this thesis, a novel parameterized multidimensional data encryption method based on the concept of "virtual optics" is proposed. A strong motivation for the research in this thesis is to overcome the abovementioned problems currently existing in optical encryption and to retain most of the favorable features of optical encryption. The phrase "virtual optics" means that both the optical encryption and decryption processes are implemented in an all-digital manner, adopting optical information processing technologies such as optical holography, optical diffraction or other relevant optical processes. In addition to utilizing some geometric and physical parameters derived from a configuration of digital optics, some information disarrangement actions have also been suggested as tools for designing multiple locks and keys for data encryption in hyperspace. The sensitivities of these supposed keys are quantitatively analyzed and the possible security level of the proposed cryptosystem is assessed. Security of the cryptosystem is also analyzed by examining some possible attacks on the cryptosystem from the viewpoint of a cryptanalysis. This thesis has shown the
Secret Sharing Schemes and Advanced Encryption Standard
2015-09-01
Secret Sharing Scheme, they have only been better under certain parameters; there is always a trade -off with some parameter of the scheme. xiv...NAVAL POSTGRADUATE SCHOOL MONTEREY, CALIFORNIA THESIS SECRET SHARING SCHEMES AND ADVANCED ENCRYPTION STANDARD by Bing Yong Lim September 2015 Thesis...AND SUBTITLE SECRET SHARING SCHEMES AND ADVANCED ENCRYPTION STANDARD 5. FUNDING NUMBERS 6. AUTHOR(S) Lim, Bin Yong 7. PERFORMING ORGANIZATION NAME(S
Binary DNA Nanostructures for Data Encryption
Halvorsen, Ken; Wong, Wesley P.
2012-01-01
We present a simple and secure system for encrypting and decrypting information using DNA self-assembly. Binary data is encoded in the geometry of DNA nanostructures with two distinct conformations. Removing or leaving out a single component reduces these structures to an encrypted solution of ssDNA, whereas adding back this missing "decryption key" causes the spontaneous formation of the message through self-assembly, enabling rapid read out via gel electrophoresis. Applications include auth...
Binary DNA nanostructures for data encryption.
Halvorsen, Ken; Wong, Wesley P
2012-01-01
We present a simple and secure system for encrypting and decrypting information using DNA self-assembly. Binary data is encoded in the geometry of DNA nanostructures with two distinct conformations. Removing or leaving out a single component reduces these structures to an encrypted solution of ssDNA, whereas adding back this missing "decryption key" causes the spontaneous formation of the message through self-assembly, enabling rapid read out via gel electrophoresis. Applications include authentication, secure messaging, and barcoding.
Correlation control theory of chaotic laser systems
International Nuclear Information System (INIS)
Li Fuli.
1986-04-01
A novel control theory of chaotic systems is studied. The correlation functions are calculated and used as feedback signals of the chaotic lasers. Computer experiments have shown that in this way the chaotic systems can be controlled to have time-independent output when the external control parameters are in chaotic domain. (author)
International Nuclear Information System (INIS)
Mitchel, G.; Shriner, J.
2005-01-01
Although the predictions of Random Matrix Theory (RMT) were available by the early 1960s, data of sufficiently high quality to adequately test the theory were only obtained a decade later by Rainwater. It was another decade later that Bohigas, Haq and Pandey combined the best available nuclear resonance data - the Columbia neutron resonances in heavy nuclei and the TUNL proton resonances in lighter nuclei - to form the Nuclear Data Ensemble. They obtained excellent agreement for the level statistics with the RMT predictions. The expected Porter-Thomas (PT) distribution was considered very early. However, since the widths (amplitudes squared) are measured, the predicted Gaussian distribution for the amplitudes was only qualitatively confirmed. A much more sensitive test was performed by measuring two widths and the relative phase between the two amplitudes. By comparison of the width and amplitude correlations, the Gaussian distribution was confirmed at the 1% level. Following the Bohigas conjecture - that quantum analogs of classically chaotic systems obey RMT - there was an explosion of activity utilizing level statistics in many different quantum systems. In nuclei the focus was verifying the range of applicability of RMT. Of particular interest was the effect of collectivity and of excitation energy on statistical properties. The effect of symmetry breaking on level statistics was examined and early predictions by Dyson were confirmed. The effect of symmetry breaking on the width distribution was also measured for the first time. Although heuristic arguments predicted no change from the PT distribution, experimentally there was a large deviation from the PT prediction. Later theoretical efforts were consistent with this result. The stringent conditions placed on the experiments - for eigenvalue tests the data need to be essentially perfect (few or no missing levels or mis assigned quantum numbers) - has limited the amount of suitable experimental data. The
Eigenfunctions in chaotic quantum systems
International Nuclear Information System (INIS)
Baecker, Arnd
2007-01-01
The structure of wavefunctions of quantum systems strongly depends on the underlying classical dynamics. In this text a selection of articles on eigenfunctions in systems with fully chaotic dynamics and systems with a mixed phase space is summarized. Of particular interest are statistical properties like amplitude distribution and spatial autocorrelation function and the implication of eigenfunction structures on transport properties. For systems with a mixed phase space the separation into regular and chaotic states does not always hold away from the semiclassical limit, such that chaotic states may completely penetrate into the region of the regular island. The consequences of this flooding are discussed and universal aspects highlighted. (orig.)
Eigenfunctions in chaotic quantum systems
Energy Technology Data Exchange (ETDEWEB)
Baecker, Arnd
2007-07-01
The structure of wavefunctions of quantum systems strongly depends on the underlying classical dynamics. In this text a selection of articles on eigenfunctions in systems with fully chaotic dynamics and systems with a mixed phase space is summarized. Of particular interest are statistical properties like amplitude distribution and spatial autocorrelation function and the implication of eigenfunction structures on transport properties. For systems with a mixed phase space the separation into regular and chaotic states does not always hold away from the semiclassical limit, such that chaotic states may completely penetrate into the region of the regular island. The consequences of this flooding are discussed and universal aspects highlighted. (orig.)
Energy cycle and bound of Qi chaotic system
International Nuclear Information System (INIS)
Qi, Guoyuan; Zhang, Jiangfeng
2017-01-01
Highlights: • Vector field of Qi chaotic system is decomposed into four types of torques. • Dissipative and supplied energy exchange governs orbital behavior and cycling. • Rate of change of Casimir energy gives analytical bound of chaotic attractor. • Energy cycling analysis uncovers key factors producing the different dynamic modes. - Abstract: The Qi chaotic system is transformed into a Kolmogorov-type system, thereby facilitating the analysis of energy exchange in its different forms. Regarding four forms of energy, the vector field of this chaotic system is decomposed into four forms of torque: inertial, internal, dissipative, and external. The rate of change of the Casimir function is equal to the exchange power between the dissipative energy and the supplied energy. The exchange power governs the orbital behavior and the cycling of energy. With the rate of change of Casimir function, a general bound and least upper bound of the Qi chaotic attractor are proposed. A detailed analysis with illustrations is conducted to uncover insights, in particular, cycling among the different types of energy for this chaotic attractor and key factors producing the different types of dynamic modes.
Chaotic Fluid Mixing in Crystalline Sphere Arrays
Turuban, Regis; Lester, Daniel; Meheust, Yves; Le Borgne, Tanguy
2017-11-01
We study the Lagrangian dynamics of steady 3D Stokes flow over simple cubic (SC) and body-centered cubic (BCC) lattices of close-packed spheres, and uncover the mechanisms governing chaotic mixing. Due to the cusp-shaped sphere contacts, the topology of the skin friction field is fundamentally different to that of continuous (non-granular) media (e.g. open pore networks), with significant implications for fluid mixing. Weak symmetry breaking of the flow orientation with respect to the lattice symmetries imparts a transition from regular to strong chaotic mixing in the BCC lattice, whereas the SC lattice only exhibits weak mixing. Whilst the SC and BCC lattices share the same symmetry point group, these differences are explained in terms of their space groups, and we find that a glide symmetry of the BCC lattice generates chaotic mixing. These insights are used to develop accurate predictions of the Lyapunov exponent distribution over the parameter space of mean flow orientation, and point to a general theory of mixing and dispersion based upon the inherent symmetries of arbitrary crystalline structures. The authors acknowledge the support of ERC project ReactiveFronts (648377).
Chaotic Fluid Mixing in Crystalline Sphere Arrays
Turuban, R.; Lester, D. R.; Le Borgne, T.; Méheust, Y.
2017-12-01
We study the Lagrangian dynamics of steady 3D Stokes flow over simple cubic (SC) and body-centered cubic (BCC) lattices of close-packed spheres, and uncover the mechanisms governing chaotic mixing. Due to the cusp-shaped sphere contacts, the topology of the skin friction field is fundamentally different to that of continuous (non-granular) media (e.g. open pore networks), with significant implications for fluid mixing. Weak symmetry breaking of the flow orientation with respect to the lattice symmetries imparts a transition from regular to strong chaotic mixing in the BCC lattice, whereas the SC lattice only exhibits weak mixing. Whilst the SC and BCC lattices share the same symmetry point group, these differences are explained in terms of their space groups, and we find that a glide symmetry of the BCC lattice generates chaotic mixing. These insight are used to develop accurate predictions of the Lyapunov exponent distribution over the parameter space of mean flow orientation, and point to a general theory of mixing and dispersion based upon the inherent symmetries of arbitrary crystalline structures.
Wave dynamics of regular and chaotic rays
International Nuclear Information System (INIS)
McDonald, S.W.
1983-09-01
In order to investigate general relationships between waves and rays in chaotic systems, I study the eigenfunctions and spectrum of a simple model, the two-dimensional Helmholtz equation in a stadium boundary, for which the rays are ergodic. Statistical measurements are performed so that the apparent randomness of the stadium modes can be quantitatively contrasted with the familiar regularities observed for the modes in a circular boundary (with integrable rays). The local spatial autocorrelation of the eigenfunctions is constructed in order to indirectly test theoretical predictions for the nature of the Wigner distribution corresponding to chaotic waves. A portion of the large-eigenvalue spectrum is computed and reported in an appendix; the probability distribution of successive level spacings is analyzed and compared with theoretical predictions. The two principal conclusions are: 1) waves associated with chaotic rays may exhibit randomly situated localized regions of high intensity; 2) the Wigner function for these waves may depart significantly from being uniformly distributed over the surface of constant frequency in the ray phase space
Targeting engineering synchronization in chaotic systems
Bhowmick, Sourav K.; Ghosh, Dibakar
2016-07-01
A method of targeting engineering synchronization states in two identical and mismatch chaotic systems is explained in detail. The method is proposed using linear feedback controller coupling for engineering synchronization such as mixed synchronization, linear and nonlinear generalized synchronization and targeting fixed point. The general form of coupling design to target any desire synchronization state under unidirectional coupling with the help of Lyapunov function stability theory is derived analytically. A scaling factor is introduced in the coupling definition to smooth control without any loss of synchrony. Numerical results are done on two mismatch Lorenz systems and two identical Sprott oscillators.
Chaotic diagonal recurrent neural network
International Nuclear Information System (INIS)
Wang Xing-Yuan; Zhang Yi
2012-01-01
We propose a novel neural network based on a diagonal recurrent neural network and chaos, and its structure and learning algorithm are designed. The multilayer feedforward neural network, diagonal recurrent neural network, and chaotic diagonal recurrent neural network are used to approach the cubic symmetry map. The simulation results show that the approximation capability of the chaotic diagonal recurrent neural network is better than the other two neural networks. (interdisciplinary physics and related areas of science and technology)
International Nuclear Information System (INIS)
Sudheer, K. Sebastian; Sabir, M.
2011-01-01
In this Letter we consider modified function projective synchronization of unidirectionally coupled multiple time-delayed Rossler chaotic systems using adaptive controls. Recently, delay differential equations have attracted much attention in the field of nonlinear dynamics. The high complexity of the multiple time-delayed systems can provide a new architecture for enhancing message security in chaos based encryption systems. Adaptive control can be used for synchronization when the parameters of the system are unknown. Based on Lyapunov stability theory, the adaptive control law and the parameter update law are derived to make the state of two chaotic systems are function projective synchronized. Numerical simulations are presented to demonstrate the effectiveness of the proposed adaptive controllers.
Lang, Jun
2015-03-01
In this paper, we propose a novel color image encryption method by using Color Blend (CB) and Chaos Permutation (CP) operations in the reality-preserving multiple-parameter fractional Fourier transform (RPMPFRFT) domain. The original color image is first exchanged and mixed randomly from the standard red-green-blue (RGB) color space to R‧G‧B‧ color space by rotating the color cube with a random angle matrix. Then RPMPFRFT is employed for changing the pixel values of color image, three components of the scrambled RGB color space are converted by RPMPFRFT with three different transform pairs, respectively. Comparing to the complex output transform, the RPMPFRFT transform ensures that the output is real which can save storage space of image and convenient for transmission in practical applications. To further enhance the security of the encryption system, the output of the former steps is scrambled by juxtaposition of sections of the image in the reality-preserving multiple-parameter fractional Fourier domains and the alignment of sections is determined by two coupled chaotic logistic maps. The parameters in the Color Blend, Chaos Permutation and the RPMPFRFT transform are regarded as the key in the encryption algorithm. The proposed color image encryption can also be applied to encrypt three gray images by transforming the gray images into three RGB color components of a specially constructed color image. Numerical simulations are performed to demonstrate that the proposed algorithm is feasible, secure, sensitive to keys and robust to noise attack and data loss.
Directory of Open Access Journals (Sweden)
Jian-feng Zhao
2017-01-01
Full Text Available This paper presents a three-dimensional autonomous chaotic system with high fraction dimension. It is noted that the nonlinear characteristic of the improper fractional-order chaos is interesting. Based on the continuous chaos and the discrete wavelet function map, an image encryption algorithm is put forward. The key space is formed by the initial state variables, parameters, and orders of the system. Every pixel value is included in secret key, so as to improve antiattack capability of the algorithm. The obtained simulation results and extensive security analyses demonstrate the high level of security of the algorithm and show its robustness against various types of attacks.
Machkour, M.; Saaidi, A.; Benmaati, M. L.
2015-12-01
In this paper, we introduce a new hybrid system consisting of a permutation-substitution network based on two different encryption techniques: chaotic systems and the Latin square. This homogeneity between the two systems allows us to provide the good properties of confusion and diffusion, robustness to the integration of noise in decryption. The security analysis shows that the system is secure enough to resist brute-force attack, differential attack, chosen-plaintext attack, known-plaintext attack and statistical attack. Therefore, this robustness is proven and justified.
Chaotic behaviour of nonlinear coupled reaction–diffusion system in ...
Indian Academy of Sciences (India)
When two parameters in the discrete system are unknown, we first give the existing condition of the chaos in four-dimensional space by the generalized definitions of spatial periodic orbits and spatial chaos. In addition, the chaotic behaviour will vary with the parameters. Then we propose a generalized Lyapunov exponent ...
Air-clad fibers: pump absorption assisted by chaotic wave dynamics?
DEFF Research Database (Denmark)
Mortensen, Niels Asger
2007-01-01
Wave chaos is a concept which has already proved its practical usefulness in design of double-clad fibers for cladding-pumped fiber lasers and fiber amplifiers. In general, classically chaotic geometries will favor strong pump absorption and we address the extent of chaotic wave dynamics in typical...
Finite-time synchronization of a class of autonomous chaotic systems
Indian Academy of Sciences (India)
chaotic systems are derived by the finite-time stability theory and Gerschgorin disc theorem. Numerical simulations are shown to illustrate the effectiveness of the proposed method. Keywords. Finite-time synchronization; autonomous chaotic systems; finite-time stability theory; generalized linear state-error feedback control.
Topological charge number multiplexing for JTC multiple-image encryption
Chen, Qi; Shen, Xueju; Dou, Shuaifeng; Lin, Chao; Wang, Long
2018-04-01
We propose a method of topological charge number multiplexing based on the JTC encryption system to achieve multiple-image encryption. Using this method, multi-image can be encrypted into single ciphertext, and the original images can be recovered according to the authority level. The number of encrypted images is increased, moreover, the quality of decrypted images is improved. Results of computer simulation and initial experiment identify the validity of our proposed method.
International Nuclear Information System (INIS)
Oppenheim, Jonathan; Horodecki, Michal
2005-01-01
Quantum information is a valuable resource which can be encrypted in order to protect it. We consider the size of the one-time pad that is needed to protect quantum information in a number of cases. The situation is dramatically different from the classical case: we prove that one can recycle the one-time pad without compromising security. The protocol for recycling relies on detecting whether eavesdropping has occurred, and further relies on the fact that information contained in the encrypted quantum state cannot be fully accessed. We prove the security of recycling rates when authentication of quantum states is accepted, and when it is rejected. We note that recycling schemes respect a general law of cryptography which we introduce relating the size of private keys, sent qubits, and encrypted messages. We discuss applications for encryption of quantum information in light of the resources needed for teleportation. Potential uses include the protection of resources such as entanglement and the memory of quantum computers. We also introduce another application: encrypted secret sharing and find that one can even reuse the private key that is used to encrypt a classical message. In a number of cases, one finds that the amount of private key needed for authentication or protection is smaller than in the general case
Synchronization of chaotic neural networks via output or state coupling
International Nuclear Information System (INIS)
Lu Hongtao; Leeuwen, C. van
2006-01-01
We consider the problem of global exponential synchronization between two identical chaotic neural networks that are linearly and unidirectionally coupled. We formulate a general framework for the synchronization problem in which one chaotic neural network, working as the driving system (or master), sends its output or state values to the other, which serves as the response system (or slave). We use Lyapunov functions to establish general theoretical conditions for designing the coupling matrix. Neither symmetry nor negative (positive) definiteness of the coupling matrix are required; under less restrictive conditions, the two coupled chaotic neural networks can achieve global exponential synchronization regardless of their initial states. Detailed comparisons with existing results are made and numerical simulations are carried out to demonstrate the effectiveness of the established synchronization laws
Type-based Proxy Re-encryption and its Construction
Tang, Qiang
Recently, the concept of proxy re-encryption has been shown very useful in a number of applications, especially in enforcing access control policies. In existing proxy re-encryption schemes, the delegatee can decrypt all ciphertexts targeted to the delegator after re-encryption by the proxy.
Type-Based Proxy Re-encryption and Its Construction
Tang, Qiang
2008-01-01
Recently, the concept of proxy re-encryption has been shown very useful in a number of applications, especially in enforcing access control policies. In existing proxy re-encryption schemes, the delegatee can decrypt all ciphertexts for the delegator after re-encryption by the proxy. Consequently,
Compound Synchronization of Four Chaotic Complex Systems
Directory of Open Access Journals (Sweden)
Junwei Sun
2015-01-01
Full Text Available The chaotic complex system is designed from the start of the chaotic real system. Dynamical properties of a chaotic complex system in complex space are investigated. In this paper, a compound synchronization scheme is achieved for four chaotic complex systems. According to Lyapunov stability theory and the adaptive control method, four chaotic complex systems are considered and the corresponding controllers are designed to realize the compound synchronization scheme. Four novel design chaotic complex systems are given as an example to verify the validity and feasibility of the proposed control scheme.
Generic Adaptively Secure Searchable Phrase Encryption
Directory of Open Access Journals (Sweden)
Kissel Zachary A.
2017-01-01
Full Text Available In recent years searchable symmetric encryption has seen a rapid increase in query expressiveness including keyword, phrase, Boolean, and fuzzy queries. With this expressiveness came increasingly complex constructions. Having these facts in mind, we present an efficient and generic searchable symmetric encryption construction for phrase queries. Our construction is straightforward to implement, and is proven secure under adaptively chosen query attacks (CQA2 in the random oracle model with an honest-but-curious adversary. To our knowledge, this is the first encrypted phrase search system that achieves CQA2 security. Moreover, we demonstrate that our document collection preprocessing algorithm allows us to extend a dynamic SSE construction so that it supports phrase queries. We also provide a compiler theorem which transforms any CQA2-secure SSE construction for keyword queries into a CQA2-secure SSE construction that supports phrase queries.
Frontpage and Dreamweaver users must use encryption
Web Services
2006-01-01
In order to ensure document confidentiality and protect users from the possible theft of their passwords, all web authoring actions will be required to use encryption as of 15 February 2006. Most Frontpage and Dreamweaver users will have to slightly change the way they connect to their web sites in order to enable encryption. Please note that only the initial connection to the web site from Frontpage or Dreamweaver is affected: there is no change in the use of these applications after the initial connection, and the web site itself is not affected. Further details, as well as instructions on how to enable encryption, are available at: http://cern.ch/web/docs/AuthDoc/SecureAuthoring. In case of problems, please contact the computer helpdesk or web.support@cern.ch. The Web Services Team
On the quantization of classically chaotic system
International Nuclear Information System (INIS)
Godoy, N.F. de.
1988-01-01
Some propeties of a quantization in terms of observables of a classically chaotic system, which exhibits a strange are studied. It is shown in particular that convenient expected values of some observables have the correct classical limit and that in these cases the limits ℎ → O and t → ∞ (t=time) rigorously comute. This model was alternatively quantized by R.Graham in terms of Wigner function. The Graham's analysis is completed a few points, in particular, we find out a remarkable analogy with general results about the semi-classical limit of Wigner function. Finally the expected values obtained by both methods of quantization were compared. (author) [pt
Cracking Advanced Encryption Standard-A Review
Jashnil Kumar; Mohammed Farik
2017-01-01
Password protection is a major security concern the world is facing today. While there are many publications available that discuss ways to protect passwords and data how widely user from around the world adhere to these rules are unknown. The novelty of this study is that this is the first time a review is done on software tools that can be used to crack Advanced Encryption Standards. Firstly the study does a review on top 10 software tools that are available to crack Advanced Encryption Sta...
Multimedia encryption and authentication techniques and applications
Furht, Borko
2006-01-01
Intellectual property owners must continually exploit new ways of reproducing, distributing, and marketing their products. However, the threat of piracy looms as a major problem with digital distribution and storage technologies. Multimedia Encryption and Authentication Techniques and Applications covers current and future trends in the design of modern systems that use encryption and authentication to protect multimedia content. Containing the works of contributing authors who are worldwide experts in their fields, this volume is intended for researchers and practitioners, as well as for thos
Binary DNA nanostructures for data encryption.
Directory of Open Access Journals (Sweden)
Ken Halvorsen
Full Text Available We present a simple and secure system for encrypting and decrypting information using DNA self-assembly. Binary data is encoded in the geometry of DNA nanostructures with two distinct conformations. Removing or leaving out a single component reduces these structures to an encrypted solution of ssDNA, whereas adding back this missing "decryption key" causes the spontaneous formation of the message through self-assembly, enabling rapid read out via gel electrophoresis. Applications include authentication, secure messaging, and barcoding.
Identity-Based Verifiably Encrypted Signatures without Random Oracles
Zhang, Lei; Wu, Qianhong; Qin, Bo
Fair exchange protocol plays an important role in electronic commerce in the case of exchanging digital contracts. Verifiably encrypted signatures provide an optimistic solution to these scenarios with an off-line trusted third party. In this paper, we propose an identity-based verifiably encrypted signature scheme. The scheme is non-interactive to generate verifiably encrypted signatures and the resulting encrypted signature consists of only four group elements. Based on the computational Diffie-Hellman assumption, our scheme is proven secure without using random oracles. To the best of our knowledge, this is the first identity-based verifiably encrypted signature scheme provably secure in the standard model.
On the Design of Chaotic Oscillators
DEFF Research Database (Denmark)
Lindberg, Erik; Tamasevicius, A; Cenys, A.
1998-01-01
A discussion of the chaotic oscillator concept from a design methodology pointof view. The attributes of some chaoticoscillators are discussed and a systematicdesign method based on eigenvalue investigation is proposed. The method isillustrated with a chaotic Wien-bridgeoscillator design....
On synchronization of three chaotic systems
International Nuclear Information System (INIS)
Yan Jianping; Li Changpin
2005-01-01
In this paper, a simple but efficient method is applied to the synchronization of three chaotic systems, i.e., the chaotic Lorenz, Chua, and Chen systems. Numerical simulations show this method works very well
Intermittent chaotic chimeras for coupled rotators
DEFF Research Database (Denmark)
Olmi, Simona; Martens, Erik Andreas; Thutupalli, Shashi
2015-01-01
Two symmetrically coupled populations of N oscillators with inertia m display chaotic solutions with broken symmetry similar to experimental observations with mechanical pendulums. In particular, we report evidence of intermittent chaotic chimeras, where one population is synchronized and the other...
QR code optical encryption using spatially incoherent illumination
Cheremkhin, P. A.; Krasnov, V. V.; Rodin, V. G.; Starikov, R. S.
2017-02-01
Optical encryption is an actively developing field of science. The majority of encryption techniques use coherent illumination and suffer from speckle noise, which severely limits their applicability. The spatially incoherent encryption technique does not have this drawback, but its effectiveness is dependent on the Fourier spectrum properties of the image to be encrypted. The application of a quick response (QR) code in the capacity of a data container solves this problem, and the embedded error correction code also enables errorless decryption. The optical encryption of digital information in the form of QR codes using spatially incoherent illumination was implemented experimentally. The encryption is based on the optical convolution of the image to be encrypted with the kinoform point spread function, which serves as an encryption key. Two liquid crystal spatial light modulators were used in the experimental setup for the QR code and the kinoform imaging, respectively. The quality of the encryption and decryption was analyzed in relation to the QR code size. Decryption was conducted digitally. The successful decryption of encrypted QR codes of up to 129 × 129 pixels was demonstrated. A comparison with the coherent QR code encryption technique showed that the proposed technique has a signal-to-noise ratio that is at least two times higher.
MATRIX ALGORITHMS OF ENCRYPTIC PROTECTION OF INFORMATION AND EXCHANGE OF ENCRYPTION KEY
Directory of Open Access Journals (Sweden)
A. Beletsky
2010-07-01
Full Text Available The algorithms of the exchange of encryption keys between users of computer networks and cryptographic protection of information transmitted over open communications channels. The algorithm is based a modified asymmetric protocol Diffie-Hellman (DH. The essence of the modification amounts to the replacement of large prime numbers algorithm DH guaranteed nonsingular n-complete binary matrices of high order. The methods of synthesis of these matrices. Discussed ways to counter attacks on the encryption algorithm.
Test and Verification of AES Used for Image Encryption
Zhang, Yong
2018-03-01
In this paper, an image encryption program based on AES in cipher block chaining mode was designed with C language. The encryption/decryption speed and security performance of AES based image cryptosystem were tested and used to compare the proposed cryptosystem with some existing image cryptosystems based on chaos. Simulation results show that AES can apply to image encryption, which refutes the widely accepted point of view that AES is not suitable for image encryption. This paper also suggests taking the speed of AES based image encryption as the speed benchmark of image encryption algorithms. And those image encryption algorithms whose speeds are lower than the benchmark should be discarded in practical communications.
An end to end secure CBIR over encrypted medical database.
Bellafqira, Reda; Coatrieux, Gouenou; Bouslimi, Dalel; Quellec, Gwenole
2016-08-01
In this paper, we propose a new secure content based image retrieval (SCBIR) system adapted to the cloud framework. This solution allows a physician to retrieve images of similar content within an outsourced and encrypted image database, without decrypting them. Contrarily to actual CBIR approaches in the encrypted domain, the originality of the proposed scheme stands on the fact that the features extracted from the encrypted images are themselves encrypted. This is achieved by means of homomorphic encryption and two non-colluding servers, we however both consider as honest but curious. In that way an end to end secure CBIR process is ensured. Experimental results carried out on a diabetic retinopathy database encrypted with the Paillier cryptosystem indicate that our SCBIR achieves retrieval performance as good as if images were processed in their non-encrypted form.
Chaotic structure of oil prices
Bildirici, Melike; Sonustun, Fulya Ozaksoy
2018-01-01
The fluctuations in oil prices are very complicated and therefore, it is unable to predict its effects on economies. For modelling complex system of oil prices, linear economic models are not sufficient and efficient tools. Thus, in recent years, economists attached great attention to non-linear structure of oil prices. For analyzing this relationship, GARCH types of models were used in some papers. Distinctively from the other papers, in this study, we aimed to analyze chaotic pattern of oil prices. Thus, it was used the Lyapunov Exponents and Hennon Map to determine chaotic behavior of oil prices for the selected time period.
Chaotic signals in digital communications
Eisencraft, Marcio; Suyama, Ricardo
2013-01-01
Chaotic Signals in Digital Communications combines fundamental background knowledge with state-of-the-art methods for using chaotic signals and systems in digital communications. The book builds a bridge between theoretical works and practical implementation to help researchers attain consistent performance in realistic environments. It shows the possible shortcomings of the chaos-based communication systems proposed in the literature, particularly when they are subjected to non-ideal conditions. It also presents a toolbox of techniques for researchers working to actually implement such system
Lectures on chaotic dynamical systems
Afraimovich, Valentin
2002-01-01
This book is devoted to chaotic nonlinear dynamics. It presents a consistent, up-to-date introduction to the field of strange attractors, hyperbolic repellers, and nonlocal bifurcations. The authors keep the highest possible level of "physical" intuition while staying mathematically rigorous. In addition, they explain a variety of important nonstandard algorithms and problems involving the computation of chaotic dynamics. The book will help readers who are not familiar with nonlinear dynamics to understand and appreciate sophisticated modern dynamical systems and chaos. Intended for courses in either mathematics, physics, or engineering, prerequisites are calculus, differential equations, and functional analysis.
Estimating the state of large spatio-temporally chaotic systems
Energy Technology Data Exchange (ETDEWEB)
Ott, E. [University of Maryland, College Park, MD 20742 (United States); Hunt, B.R. [University of Maryland, College Park, MD 20742 (United States); Szunyogh, I. [University of Maryland, College Park, MD 20742 (United States)]. E-mail: szunyogh@ipst.umd.edu; Zimin, A.V. [University of Maryland, College Park, MD 20742 (United States); Kostelich, E.J. [University of Maryland, College Park, MD 20742 (United States); Department of Mathematics and Statistics, Arizona State University, Tempe, AZ 85287 (United States); Corazza, M. [University of Maryland, College Park, MD 20742 (United States); Kalnay, E. [University of Maryland, College Park, MD 20742 (United States); Patil, D.J. [University of Maryland, College Park, MD 20742 (United States); Yorke, J.A. [University of Maryland, College Park, MD 20742 (United States)
2004-09-27
We consider the estimation of the state of a large spatio-temporally chaotic system from noisy observations and knowledge of a system model. Standard state estimation techniques using the Kalman filter approach are not computationally feasible for systems with very many effective degrees of freedom. We present and test a new technique (called a Local Ensemble Kalman Filter), generally applicable to large spatio-temporally chaotic systems for which correlations between system variables evaluated at different points become small at large separation between the points.
Estimating the state of large spatio-temporally chaotic systems
International Nuclear Information System (INIS)
Ott, E.; Hunt, B.R.; Szunyogh, I.; Zimin, A.V.; Kostelich, E.J.; Corazza, M.; Kalnay, E.; Patil, D.J.; Yorke, J.A.
2004-01-01
We consider the estimation of the state of a large spatio-temporally chaotic system from noisy observations and knowledge of a system model. Standard state estimation techniques using the Kalman filter approach are not computationally feasible for systems with very many effective degrees of freedom. We present and test a new technique (called a Local Ensemble Kalman Filter), generally applicable to large spatio-temporally chaotic systems for which correlations between system variables evaluated at different points become small at large separation between the points
The weak-password problem: Chaos, criticality, and encrypted p-CAPTCHAs
Laptyeva, T. V.; Flach, S.; Kladko, K.
2011-09-01
Vulnerabilities related to weak passwords are a pressing global economic and security issue. We report a novel, simple, and effective approach to address the weak-password problem. Building upon chaotic dynamics, criticality at phase transitions, CAPTCHA recognition, and computational round-off errors, we design an algorithm that strengthens the security of passwords. The core idea of our simple method is to split a long and secure password into two components. The first component is memorized by the user. The second component is transformed into a CAPTCHA image and then protected using the evolution of a two-dimensional dynamical system close to a phase transition, in such a way that standard brute-force attacks become ineffective. We expect our approach to have wide applications for authentication and encryption technologies.
Application of chaotic noise reduction techniques to chaotic data ...
Indian Academy of Sciences (India)
We propose a novel method of combining artiﬁcial neural networks (ANNs) with chaotic noise reduction techniques that captures the metric and dynamic invariants of a ... Computational Materials Science, Unit-I,Regional Research Laboratory (CSIR) Thiruvananthapuram 695 019, India; Department of Computer Science, ...
Projective synchronization of chaotic systems with bidirectional ...
Indian Academy of Sciences (India)
Sufficient conditions for PS of two bidirectionally coupled chaotic systems are derived. We discuss the proposed theory by considering two bidirectionally coupled unified chaotic systems, Lorenz–Stenflo (LS) systems and the chaotic Van der Pol–Duffing oscillators. Finally, simulation results are presented and discussed. 2.
A Chaotic Cryptosystem for Images Based on Henon and Arnold Cat Map
Sundararajan, Elankovan
2014-01-01
The rapid evolution of imaging and communication technologies has transformed images into a widespread data type. Different types of data, such as personal medical information, official correspondence, or governmental and military documents, are saved and transmitted in the form of images over public networks. Hence, a fast and secure cryptosystem is needed for high-resolution images. In this paper, a novel encryption scheme is presented for securing images based on Arnold cat and Henon chaotic maps. The scheme uses Arnold cat map for bit- and pixel-level permutations on plain and secret images, while Henon map creates secret images and specific parameters for the permutations. Both the encryption and decryption processes are explained, formulated, and graphically presented. The results of security analysis of five different images demonstrate the strength of the proposed cryptosystem against statistical, brute force and differential attacks. The evaluated running time for both encryption and decryption processes guarantee that the cryptosystem can work effectively in real-time applications. PMID:25258724
A one-time pad encryption method combining full-phase image encryption and hiding
Li, Jiaosheng; Xiong, Jiaxiang; Zhang, Qinnan; Zhong, Liyun; Zhou, Yunfei; Li, Jun; Lu, Xiaoxu
2017-08-01
A one-time pad encryption method combining full-phase image encryption and hiding is proposed. Firstly, original images are encoded in the phase and encrypted by phase keys loaded on the phase-only liquid crystal spatial light modulator, where the phase keys can be distributed using a quantum key distribution method. Subsequently, a host image is introduced to produce a reference wave, and overlap with an object wave to form an interferogram. Finally, based on phase-shifting interferometry, we can achieve the above encrypted image hiding. Both the simulation and experiment research demonstrate the feasibility of the proposed method, meanwhile the key and the encrypted image can be changed randomly, so the proposed system reveals the high flexibility, anti-attack ability and can be used to implement the one-time pad to achieve absolute secure transmission with the quantum key distribution method. Moreover, system security will be improved due to the fact that encryption information hidden in the host image can be treated as background noise, which does not attract the attention of the attacker.
Chaotic behaviour of a predator-prey system
Kooi, B.W.; Boer, M.P.
2003-01-01
Generally a predator-prey system is modelled by two ordinary differential equations which describe the rate of changes of the biomasses. Since such a system is two-dimensional no chaotic behaviour can occur. In the popular Rosenzweig-MacArthur model, which replaced the Lotka-Volterra model, a stable
Adaptive projective synchronization of different chaotic systems with nonlinearity inputs
International Nuclear Information System (INIS)
Niu Yu-Jun; Pei Bing-Nan; Wang Xing-Yuan
2012-01-01
We investigate the projective synchronization of different chaotic systems with nonlinearity inputs. Based on the adaptive technique, sliding mode control method and pole assignment technique, a novel adaptive projective synchronization scheme is proposed to ensure the drive system and the response system with nonlinearity inputs can be rapidly synchronized up to the given scaling factor. (general)
Critical Junctures in the life of a Chaotic Attractor
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 6; Issue 3. Crises-Critical Junctures in the Life of a Chaotic Attractor. N Ananthkrishnan Tuhin Sahai. General Article Volume 6 Issue 3 March 2001 pp 19-33. Fulltext. Click here to view fulltext PDF. Permanent link:
Dynamic Rule Encryption for Mobile Payment
Directory of Open Access Journals (Sweden)
Emir Husni
2017-01-01
Full Text Available The trend of financial transactions by using a mobile phone or mobile payment increases. By using the mobile payment service, users can save money on mobile phone (handset and separate from the pulse. For protecting users, mobile payment service providers must complete the mobile payment service with the transaction security. One way to provide transaction security is to utilize a secure mobile payment application. This research provides a safety feature used for an Android-based mobile payment application. This security feature is making encryption rules dynamically named Dynamic Rule Encryption (DRE. DRE has the ability to protect data by means of encrypting data with dynamic rules, and DRE also has a token function for an authentication. DRE token raised with dynamic time-based rules. Here, the time is used as a reference with the order of the day in the year (day of the year. The processes of the DRE’s encryption, decryption, and the DRE’s functionality as the token are discussed in this paper. Here, the Hamming distance metric is employed for having maximum differences between plaintext and ciphertext.
A Verifiable Secret Shuffle of Homomorphic Encryptions
DEFF Research Database (Denmark)
Groth, Jens
2003-01-01
We show how to prove in honest verifier zero-knowledge the correctness of a shuffle of homomorphic encryptions (or homomorphic commitments.) A shuffle consists in a rearrangement of the input ciphertexts and a reencryption of them so that the permutation is not revealed....
Efficient Tree Search in Encrypted Data
Brinkman, Richard; Feng, L.; Doumen, J.M.; Hartel, Pieter H.; Jonker, Willem
Sometimes there is a need to store sensitive data on an untrusted database server. Song Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document. The search speed is linear in the size of the document. It does not scale well for a large database.
Efficient Tree Search in Encrypted Data
Brinkman, Richard; Fernández-Medina, E.; Hernández Castro, J.C.; Feng, L.; Doumen, J.M.; García-Villalba, L.J.; Hartel, Pieter H.; Jonker, Willem
Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document. The search speed is linear in the size of the document. It does not scale well for a large
2010-10-01
... January 23, 2001, Telecommunications Industry Association, ANSI/TIA/EIA-102.AAAA-A-2001. (c) The Director... 47 Telecommunication 5 2010-10-01 2010-10-01 false Encryption. 90.553 Section 90.553 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) SAFETY AND SPECIAL RADIO SERVICES PRIVATE LAND...
International Nuclear Information System (INIS)
Mahmoud, S.; Ayad, N.; Elsayed, F.; Elbendary, M.
2016-01-01
Full text: Due to the widespread usage of the internet and other wired and wireless communication methods, the security of the transmitted data has become a major requirement. Nuclear knowledge is mainly built upon the exchange of nuclear information which is considered highly sensitive information, so its security has to be enhanced by using high level security mechanisms. Data confidentiality is concerned with the achievement of higher protection for confidential information from unauthorized disclosure or access. Cryptography and steganography are famous and widely used techniques that process information in order to achieve its confidentiality, but sometimes, when used individually, they don’t satisfy a required level of security for highly sensitive data. In this paper, cryptography is accompanied with steganography for constituting a multilayer security techniques that can strengthen the level of security of highly confidential nuclear data that are archived or transmitted through different channel types and noise conditions. (author)
FPGA BASED HARDWARE KEY FOR TEMPORAL ENCRYPTION
Directory of Open Access Journals (Sweden)
B. Lakshmi
2010-09-01
Full Text Available In this paper, a novel encryption scheme with time based key technique on an FPGA is presented. Time based key technique ensures right key to be entered at right time and hence, vulnerability of encryption through brute force attack is eliminated. Presently available encryption systems, suffer from Brute force attack and in such a case, the time taken for breaking a code depends on the system used for cryptanalysis. The proposed scheme provides an effective method in which the time is taken as the second dimension of the key so that the same system can defend against brute force attack more vigorously. In the proposed scheme, the key is rotated continuously and four bits are drawn from the key with their concatenated value representing the delay the system has to wait. This forms the time based key concept. Also the key based function selection from a pool of functions enhances the confusion and diffusion to defend against linear and differential attacks while the time factor inclusion makes the brute force attack nearly impossible. In the proposed scheme, the key scheduler is implemented on FPGA that generates the right key at right time intervals which is then connected to a NIOS – II processor (a virtual microcontroller which is brought out from Altera FPGA that communicates with the keys to the personal computer through JTAG (Joint Test Action Group communication and the computer is used to perform encryption (or decryption. In this case the FPGA serves as hardware key (dongle for data encryption (or decryption.
Feature Selection via Chaotic Antlion Optimization.
Zawbaa, Hossam M; Emary, E; Grosan, Crina
2016-01-01
Selecting a subset of relevant properties from a large set of features that describe a dataset is a challenging machine learning task. In biology, for instance, the advances in the available technologies enable the generation of a very large number of biomarkers that describe the data. Choosing the more informative markers along with performing a high-accuracy classification over the data can be a daunting task, particularly if the data are high dimensional. An often adopted approach is to formulate the feature selection problem as a biobjective optimization problem, with the aim of maximizing the performance of the data analysis model (the quality of the data training fitting) while minimizing the number of features used. We propose an optimization approach for the feature selection problem that considers a "chaotic" version of the antlion optimizer method, a nature-inspired algorithm that mimics the hunting mechanism of antlions in nature. The balance between exploration of the search space and exploitation of the best solutions is a challenge in multi-objective optimization. The exploration/exploitation rate is controlled by the parameter I that limits the random walk range of the ants/prey. This variable is increased iteratively in a quasi-linear manner to decrease the exploration rate as the optimization progresses. The quasi-linear decrease in the variable I may lead to immature convergence in some cases and trapping in local minima in other cases. The chaotic system proposed here attempts to improve the tradeoff between exploration and exploitation. The methodology is evaluated using different chaotic maps on a number of feature selection datasets. To ensure generality, we used ten biological datasets, but we also used other types of data from various sources. The results are compared with the particle swarm optimizer and with genetic algorithm variants for feature selection using a set of quality metrics.
Feature Selection via Chaotic Antlion Optimization.
Directory of Open Access Journals (Sweden)
Hossam M Zawbaa
Full Text Available Selecting a subset of relevant properties from a large set of features that describe a dataset is a challenging machine learning task. In biology, for instance, the advances in the available technologies enable the generation of a very large number of biomarkers that describe the data. Choosing the more informative markers along with performing a high-accuracy classification over the data can be a daunting task, particularly if the data are high dimensional. An often adopted approach is to formulate the feature selection problem as a biobjective optimization problem, with the aim of maximizing the performance of the data analysis model (the quality of the data training fitting while minimizing the number of features used.We propose an optimization approach for the feature selection problem that considers a "chaotic" version of the antlion optimizer method, a nature-inspired algorithm that mimics the hunting mechanism of antlions in nature. The balance between exploration of the search space and exploitation of the best solutions is a challenge in multi-objective optimization. The exploration/exploitation rate is controlled by the parameter I that limits the random walk range of the ants/prey. This variable is increased iteratively in a quasi-linear manner to decrease the exploration rate as the optimization progresses. The quasi-linear decrease in the variable I may lead to immature convergence in some cases and trapping in local minima in other cases. The chaotic system proposed here attempts to improve the tradeoff between exploration and exploitation. The methodology is evaluated using different chaotic maps on a number of feature selection datasets. To ensure generality, we used ten biological datasets, but we also used other types of data from various sources. The results are compared with the particle swarm optimizer and with genetic algorithm variants for feature selection using a set of quality metrics.
Chaotic dynamics from interspike intervals
DEFF Research Database (Denmark)
Pavlov, A N; Sosnovtseva, Olga; Mosekilde, Erik
2001-01-01
Considering two different mathematical models describing chaotic spiking phenomena, namely, an integrate-and-fire and a threshold-crossing model, we discuss the problem of extracting dynamics from interspike intervals (ISIs) and show that the possibilities of computing the largest Lyapunov expone...
Abrupt bifurcations in chaotic scattering: view from the anti-integrable limit
International Nuclear Information System (INIS)
Baesens, Claude; MacKay, Robert S; Chen, Yi-Chiuan
2013-01-01
Bleher, Ott and Grebogi found numerically an interesting chaotic phenomenon in 1989 for the scattering of a particle in a plane from a potential field with several peaks of equal height. They claimed that when the energy E of the particle is slightly less than the peak height E c there is a hyperbolic suspension of a topological Markov chain from which chaotic scattering occurs, whereas for E > E c there are no bounded orbits. They called the bifurcation at E = E c an abrupt bifurcation to chaotic scattering. The aim of this paper is to establish a rigorous mathematical explanation for how chaotic orbits occur via the bifurcation, from the viewpoint of the anti-integrable limit, and to do so for a general range of chaotic scattering problems. (paper)
Applications of Chaotic Dynamics in Robotics
Directory of Open Access Journals (Sweden)
Xizhe Zang
2016-03-01
Full Text Available This article presents a summary of applications of chaos and fractals in robotics. Firstly, basic concepts of deterministic chaos and fractals are discussed. Then, fundamental tools of chaos theory used for identifying and quantifying chaotic dynamics will be shared. Principal applications of chaos and fractal structures in robotics research, such as chaotic mobile robots, chaotic behaviour exhibited by mobile robots interacting with the environment, chaotic optimization algorithms, chaotic dynamics in bipedal locomotion and fractal mechanisms in modular robots will be presented. A brief survey is reported and an analysis of the reviewed publications is also presented.
Encryption and validation of multiple signals for optical identification systems
Energy Technology Data Exchange (ETDEWEB)
Perez-Cabre, E [Universitat PoliteGcnica de Catalunya, Department Optica i Optometria, Violinista Vellsola 37, 08222 Terrassa (Spain); Millan, M S [Universitat PoliteGcnica de Catalunya, Department Optica i Optometria, Violinista Vellsola 37, 08222 Terrassa (Spain); Javidi, B [University of Connecticut, Electrical and Computer Engineering Department, 371 Fairfield Road, CT 06269 Storrs (United States)
2007-07-15
Multifactor encryption-authentication technique reinforces optical security by allowing the simultaneous A N D-verification of more than one primary image. Instead of basing the identification on a unique signature or piece of information, our goal is to authenticate a given person, object, vehicle by the simultaneous recognition of several factors. Some of them are intrinsic to the person and object or vehicle under control. Other factors, act as keys of the authentication step. Such a system is proposed for situations such as the access control to restricted areas, where the demand of security is high. The multifactor identification method involves double random-phase encoding, fully phase-based encryption and a combined nonlinear joint transform correlator and a classical 4f-correlator for simultaneous recognition and authentication of multiple images. The encoded signal fulfils the general requirements of invisible content, extreme difficulty in counterfeiting and real-time automatic verification. Four reference double-phase encoded images are compared with the retrieved input images obtained in situ from the person or the vehicle whose authentication is wanted and from a database. A recognition step based on the correlation between the signatures and the stored references determines the authentication or rejection of the person and object under surveillance.
Attribute-Based Proxy Re-Encryption with Keyword Search
Shi, Yanfeng; Liu, Jiqiang; Han, Zhen; Zheng, Qingji; Zhang, Rui; Qiu, Shuo
2014-01-01
Keyword search on encrypted data allows one to issue the search token and conduct search operations on encrypted data while still preserving keyword privacy. In the present paper, we consider the keyword search problem further and introduce a novel notion called attribute-based proxy re-encryption with keyword search (), which introduces a promising feature: In addition to supporting keyword search on encrypted data, it enables data owners to delegate the keyword search capability to some other data users complying with the specific access control policy. To be specific, allows (i) the data owner to outsource his encrypted data to the cloud and then ask the cloud to conduct keyword search on outsourced encrypted data with the given search token, and (ii) the data owner to delegate other data users keyword search capability in the fine-grained access control manner through allowing the cloud to re-encrypted stored encrypted data with a re-encrypted data (embedding with some form of access control policy). We formalize the syntax and security definitions for , and propose two concrete constructions for : key-policy and ciphertext-policy . In the nutshell, our constructions can be treated as the integration of technologies in the fields of attribute-based cryptography and proxy re-encryption cryptography. PMID:25549257
NES++: number system for encryption based privacy preserving speaker verification
Xu, Lei; Feng, Tao; Zhao, Xi; Shi, Weidong
2014-05-01
As speech based operation becomes a main hand-free interaction solution between human and mobile devices (i.e., smartphones, Google Glass), privacy preserving speaker verification receives much attention nowadays. Privacy preserving speaker verification can be achieved through many different ways, such as fuzzy vault and encryption. Encryption based solutions are promising as cryptography is based on solid mathematic foundations and the security properties can be easily analyzed in a well established framework. Most current asymmetric encryption schemes work on finite algebraic structures, such as finite group and finite fields. However, the encryption scheme for privacy preserving speaker verification must handle floating point numbers. This gap must be filled to make the overall scheme practical. In this paper, we propose a number system that meets the requirements of both speaker verification and the encryption scheme used in the process. It also supports addition homomorphic property of Pailliers encryption, which is crucial for privacy preserving speaker verification. As asymmetric encryption is expensive, we propose a method of packing several numbers into one plain-text and the computation overhead is greatly reduced. To evaluate the performance of this method, we implement Pailliers encryption scheme over proposed number system and the packing technique. Our findings show that the proposed solution can fulfill the gap between speaker verification and encryption scheme very well, and the packing technique improves the overall performance. Furthermore, our solution is a building block of encryption based privacy preserving speaker verification, the privacy protection and accuracy rate are not affected.
Advances and applications in chaotic systems
Volos, Christos
2016-01-01
This book reports on the latest advances and applications of chaotic systems. It consists of 25 contributed chapters by experts who are specialized in the various topics addressed in this book. The chapters cover a broad range of topics of chaotic systems such as chaos, hyperchaos, jerk systems, hyperjerk systems, conservative and dissipative systems, circulant chaotic systems, multi-scroll chaotic systems, finance chaotic system, highly chaotic systems, chaos control, chaos synchronization, circuit realization and applications of chaos theory in secure communications, mobile robot, memristors, cellular neural networks, etc. Special importance was given to chapters offering practical solutions, modeling and novel control methods for the recent research problems in chaos theory. This book will serve as a reference book for graduate students and researchers with a basic knowledge of chaos theory and control systems. The resulting design procedures on the chaotic systems are emphasized using MATLAB software.
Visibility graphlet approach to chaotic time series
Energy Technology Data Exchange (ETDEWEB)
Mutua, Stephen [Business School, University of Shanghai for Science and Technology, Shanghai 200093 (China); Computer Science Department, Masinde Muliro University of Science and Technology, P.O. Box 190-50100, Kakamega (Kenya); Gu, Changgui, E-mail: gu-changgui@163.com, E-mail: hjyang@ustc.edu.cn; Yang, Huijie, E-mail: gu-changgui@163.com, E-mail: hjyang@ustc.edu.cn [Business School, University of Shanghai for Science and Technology, Shanghai 200093 (China)
2016-05-15
Many novel methods have been proposed for mapping time series into complex networks. Although some dynamical behaviors can be effectively captured by existing approaches, the preservation and tracking of the temporal behaviors of a chaotic system remains an open problem. In this work, we extended the visibility graphlet approach to investigate both discrete and continuous chaotic time series. We applied visibility graphlets to capture the reconstructed local states, so that each is treated as a node and tracked downstream to create a temporal chain link. Our empirical findings show that the approach accurately captures the dynamical properties of chaotic systems. Networks constructed from periodic dynamic phases all converge to regular networks and to unique network structures for each model in the chaotic zones. Furthermore, our results show that the characterization of chaotic and non-chaotic zones in the Lorenz system corresponds to the maximal Lyapunov exponent, thus providing a simple and straightforward way to analyze chaotic systems.
Super-Encryption Implementation Using Monoalphabetic Algorithm and XOR Algorithm for Data Security
Rachmawati, Dian; Andri Budiman, Mohammad; Aulia, Indra
2018-03-01
The exchange of data that occurs offline and online is very vulnerable to the threat of data theft. In general, cryptography is a science and art to maintain data secrecy. An encryption is a cryptography algorithm in which data is transformed into cipher text, which is something that is unreadable and meaningless so it cannot be read or understood by other parties. In super-encryption, two or more encryption algorithms are combined to make it more secure. In this work, Monoalphabetic algorithm and XOR algorithm are combined to form a super- encryption. Monoalphabetic algorithm works by changing a particular letter into a new letter based on existing keywords while the XOR algorithm works by using logic operation XOR Since Monoalphabetic algorithm is a classical cryptographic algorithm and XOR algorithm is a modern cryptographic algorithm, this scheme is expected to be both easy-to-implement and more secure. The combination of the two algorithms is capable of securing the data and restoring it back to its original form (plaintext), so the data integrity is still ensured.
A chaos-based digital image encryption scheme with an improved diffusion strategy.
Fu, Chong; Chen, Jun-jie; Zou, Hao; Meng, Wei-hong; Zhan, Yong-feng; Yu, Ya-wen
2012-01-30
Chaos-based image cipher has been widely investigated over the last decade or so to meet the increasing demand for real-time secure image transmission over public networks. In this paper, an improved diffusion strategy is proposed to promote the efficiency of the most widely investigated permutation-diffusion type image cipher. By using the novel bidirectional diffusion strategy, the spreading process is significantly accelerated and hence the same level of security can be achieved with fewer overall encryption rounds. Moreover, to further enhance the security of the cryptosystem, a plain-text related chaotic orbit turbulence mechanism is introduced in diffusion procedure by perturbing the control parameter of the employed chaotic system according to the cipher-pixel. Extensive cryptanalysis has been performed on the proposed scheme using differential analysis, key space analysis, various statistical analyses and key sensitivity analysis. Results of our analyses indicate that the new scheme has a satisfactory security level with a low computational complexity, which renders it a good candidate for real-time secure image transmission applications.
Quantum Fully Homomorphic Encryption with Verification
DEFF Research Database (Denmark)
Alagic, Gorjan; Dulek, Yfke; Schaffner, Christian
2017-01-01
Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.......) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantum setting. However, a crucial ingredient in almost all applications of FHE is circuit verification. Classically, verification is performed by checking a transcript of the homomorphic computation. Quantumly, this strategy...... is impossible due to no-cloning. This leads to an important open question: can quantum computations be delegated and verified in a non-interactive manner? In this work, we answer this question in the affirmative, by constructing a scheme for QFHE with verification (vQFHE). Our scheme provides authenticated...
Efficient Dynamic Searchable Encryption with Forward Privacy
Directory of Open Access Journals (Sweden)
Etemad Mohammad
2018-01-01
Full Text Available Searchable symmetric encryption (SSE enables a client to perform searches over its outsourced encrypted files while preserving privacy of the files and queries. Dynamic schemes, where files can be added or removed, leak more information than static schemes. For dynamic schemes, forward privacy requires that a newly added file cannot be linked to previous searches. We present a new dynamic SSE scheme that achieves forward privacy by replacing the keys revealed to the server on each search. Our scheme is efficient and parallelizable and outperforms the best previous schemes providing forward privacy, and achieves competitive performance with dynamic schemes without forward privacy. We provide a full security proof in the random oracle model. In our experiments on the Wikipedia archive of about four million pages, the server takes one second to perform a search with 100,000 results.
Steganography and encrypting based on immunochemical systems.
Kim, Kyung-Woo; Bocharova, Vera; Halámek, Jan; Oh, Min-Kyu; Katz, Evgeny
2011-05-01
Steganography and encrypting were demonstrated with immuno-specific systems. IgG-proteins were used as invisible ink developed with complementary antibodies labeled with enzymes producing color spots. The information security was achieved by mixing the target protein-antigens used for the text encoding with masking proteins of similar composition but having different bioaffinity. Two different texts were simultaneously encoded by using two different encoding proteins in a mixture. Various encrypting techniques were exemplified with the immuno-systems used for the steganography. Future use of the developed approach for information protection and watermark-technology was proposed. Scaling down the encoded text to a micro-size is feasible with the use of nanotechnology. Copyright © 2010 Wiley Periodicals, Inc.
Illusion optics in chaotic light
International Nuclear Information System (INIS)
Zhang Suheng; Gan Shu; Xiong Jun; Zhang Xiangdong; Wang Kaige
2010-01-01
The time-reversal process provides the possibility to counteract the time evolution of a physical system. Recent research has shown that such a process can occur in the first-order field correlation of chaotic light and result in the spatial interference and phase-reversal diffraction in an unbalanced interferometer. Here we report experimental investigations on the invisibility cloak and illusion phenomena in chaotic light. In an unbalanced interferometer illuminated by thermal light, we have observed the cloak effect and the optical transformation of one object into another object. The experimental results can be understood by the phase-reversal diffraction, and they demonstrate the theoretical proposal of similar effects in complementary media.
New Security Results on Encrypted Key Exchange
Energy Technology Data Exchange (ETDEWEB)
Bresson, Emmanuel; Chevassut, Olivier; Pointcheval, David
2003-12-15
Schemes for encrypted key exchange are designed to provide two entities communicating over a public network, and sharing a (short) password only, with a session key to be used to achieve data integrity and/or message confidentiality. An example of a very efficient and ''elegant'' scheme for encrypted key exchange considered for standardization by the IEEE P1363 Standard working group is AuthA. This scheme was conjectured secure when the symmetric-encryption primitive is instantiated via either a cipher that closely behaves like an ''ideal cipher,'' or a mask generation function that is the product of the message with a hash of the password. While the security of this scheme in the former case has been recently proven, the latter case was still an open problem. For the first time we prove in this paper that this scheme is secure under the assumptions that the hash function closely behaves like a random oracle and that the computational Diffie-Hellman problem is difficult. Furthermore, since Denial-of-Service (DoS) attacks have become a common threat we enhance AuthA with a mechanism to protect against them.
A hash-based image encryption algorithm
Cheddad, Abbas; Condell, Joan; Curran, Kevin; McKevitt, Paul
2010-03-01
There exist several algorithms that deal with text encryption. However, there has been little research carried out to date on encrypting digital images or video files. This paper describes a novel way of encrypting digital images with password protection using 1D SHA-2 algorithm coupled with a compound forward transform. A spatial mask is generated from the frequency domain by taking advantage of the conjugate symmetry of the complex imagery part of the Fourier Transform. This mask is then XORed with the bit stream of the original image. Exclusive OR (XOR), a logical symmetric operation, that yields 0 if both binary pixels are zeros or if both are ones and 1 otherwise. This can be verified simply by modulus (pixel1, pixel2, 2). Finally, confusion is applied based on the displacement of the cipher's pixels in accordance with a reference mask. Both security and performance aspects of the proposed method are analyzed, which prove that the method is efficient and secure from a cryptographic point of view. One of the merits of such an algorithm is to force a continuous tone payload, a steganographic term, to map onto a balanced bits distribution sequence. This bit balance is needed in certain applications, such as steganography and watermarking, since it is likely to have a balanced perceptibility effect on the cover image when embedding.
A privacy-preserving parallel and homomorphic encryption scheme
Directory of Open Access Journals (Sweden)
Min Zhaoe
2017-04-01
Full Text Available In order to protect data privacy whilst allowing efficient access to data in multi-nodes cloud environments, a parallel homomorphic encryption (PHE scheme is proposed based on the additive homomorphism of the Paillier encryption algorithm. In this paper we propose a PHE algorithm, in which plaintext is divided into several blocks and blocks are encrypted with a parallel mode. Experiment results demonstrate that the encryption algorithm can reach a speed-up ratio at about 7.1 in the MapReduce environment with 16 cores and 4 nodes.
Quantum Encryption Minimising Key Leakage under Known Plaintext Attacks
DEFF Research Database (Denmark)
Pedersen, Thomas Brochmann
2006-01-01
In this dissertation we show how, by using a quantum channel, we can get more unconditionally secret communication with a symmetric key under known plaintext attacks. In unconditionally secret encryption schemes the key is necessarily an expensive resource since it cannot safely be reused for more......, or interactive encryption schemes, where the interaction does not need to occur online. In our model we show that the amount of key leaked under a known plaintext attack can be made arbitrarily small even in non-interactive encryption schemes. We also give an encryption scheme where eavesdropping can be detected...
Modelling chaotic vibrations using NASTRAN
Sheerer, T. J.
1993-01-01
Due to the unavailability and, later, prohibitive cost of the computational power required, many phenomena in nonlinear dynamic systems have in the past been addressed in terms of linear systems. Linear systems respond to periodic inputs with periodic outputs, and may be characterized in the time domain or in the frequency domain as convenient. Reduction to the frequency domain is frequently desireable to reduce the amount of computation required for solution. Nonlinear systems are only soluble in the time domain, and may exhibit a time history which is extremely sensitive to initial conditions. Such systems are termed chaotic. Dynamic buckling, aeroelasticity, fatigue analysis, control systems and electromechanical actuators are among the areas where chaotic vibrations have been observed. Direct transient analysis over a long time period presents a ready means of simulating the behavior of self-excited or externally excited nonlinear systems for a range of experimental parameters, either to characterize chaotic behavior for development of load spectra, or to define its envelope and preclude its occurrence.
Chaotic dynamics of respiratory sounds
International Nuclear Information System (INIS)
Ahlstrom, C.; Johansson, A.; Hult, P.; Ask, P.
2006-01-01
There is a growing interest in nonlinear analysis of respiratory sounds (RS), but little has been done to justify the use of nonlinear tools on such data. The aim of this paper is to investigate the stationarity, linearity and chaotic dynamics of recorded RS. Two independent data sets from 8 + 8 healthy subjects were recorded and investigated. The first set consisted of lung sounds (LS) recorded with an electronic stethoscope and the other of tracheal sounds (TS) recorded with a contact accelerometer. Recurrence plot analysis revealed that both LS and TS are quasistationary, with the parts corresponding to inspiratory and expiratory flow plateaus being stationary. Surrogate data tests could not provide statistically sufficient evidence regarding the nonlinearity of the data. The null hypothesis could not be rejected in 4 out of 32 LS cases and in 15 out of 32 TS cases. However, the Lyapunov spectra, the correlation dimension (D 2 ) and the Kaplan-Yorke dimension (D KY ) all indicate chaotic behavior. The Lyapunov analysis showed that the sum of the exponents was negative in all cases and that the largest exponent was found to be positive. The results are partly ambiguous, but provide some evidence of chaotic dynamics of RS, both concerning LS and TS. The results motivate continuous use of nonlinear tools for analysing RS data
Jakimowicz, Aleksander
In contemporary economies classic business cycles are increasingly changing their form undergoing a transformation into phenomena that have been nicknamed financial tornados. A generalization of the Lotka-Volterra model can be used to describe these fast-changing processes. Economically speaking, the most useful are such dynamical systems in which wormholes appear. This article features application of a model with one population of prey and two populations of predators in order to explain the global financial crisis and the consequent phenomena.
Hassan, Waleed K.; Al-Assam, Hisham
2017-05-01
The main problem associated with using symmetric/ asymmetric keys is how to securely store and exchange the keys between the parties over open networks particularly in the open environment such as cloud computing. Public Key Infrastructure (PKI) have been providing a practical solution for session key exchange for loads of web services. The key limitation of PKI solution is not only the need for a trusted third partly (e.g. certificate authority) but also the absent link between data owner and the encryption keys. The latter is arguably more important where accessing data needs to be linked with identify of the owner. Currently available key exchange protocols depend on using trusted couriers or secure channels, which can be subject to man-in-the-middle attack and various other attacks. This paper proposes a new protocol for Key Exchange using Biometric Identity Based Encryption (KE-BIBE) that enables parties to securely exchange cryptographic keys even an adversary is monitoring the communication channel between the parties. The proposed protocol combines biometrics with IBE in order to provide a secure way to access symmetric keys based on the identity of the users in unsecure environment. In the KE-BIOBE protocol, the message is first encrypted by the data owner using a traditional symmetric key before migrating it to a cloud storage. The symmetric key is then encrypted using public biometrics of the users selected by data owner to decrypt the message based on Fuzzy Identity-Based Encryption. Only the selected users will be able to decrypt the message by providing a fresh sample of their biometric data. The paper argues that the proposed solution eliminates the needs for a key distribution centre in traditional cryptography. It will also give data owner the power of finegrained sharing of encrypted data by control who can access their data.
Analysis of transition between chaos and hyper-chaos of an improved hyper-chaotic system
International Nuclear Information System (INIS)
Qiao-Lun, Gu; Tie-Gang, Gao
2009-01-01
An improved hyper-chaotic system based on the hyper-chaos generated from Chen's system is presented, and some basic dynamical properties of the system are investigated by means of Lyapunov exponent spectrum, bifurcation diagrams and characteristic equation roots. Simulations show that the new improved system evolves into hyper-chaotic, chaotic, various quasi-periodic or periodic orbits when one parameter of the system is fixed to be a certain value while the other one is variable. Some computer simulations and bifurcation analyses are given to testify the findings. (general)
CHAOS-BASED ADVANCED ENCRYPTION STANDARD
Abdulwahed, Naif B.
2013-05-01
This thesis introduces a new chaos-based Advanced Encryption Standard (AES). The AES is a well-known encryption algorithm that was standardized by U.S National Institute of Standard and Technology (NIST) in 2001. The thesis investigates and explores the behavior of the AES algorithm by replacing two of its original modules, namely the S-Box and the Key Schedule, with two other chaos- based modules. Three chaos systems are considered in designing the new modules which are Lorenz system with multiplication nonlinearity, Chen system with sign modules nonlinearity, and 1D multiscroll system with stair case nonlinearity. The three systems are evaluated on their sensitivity to initial conditions and as Pseudo Random Number Generators (PRNG) after applying a post-processing technique to their output then performing NIST SP. 800-22 statistical tests. The thesis presents a hardware implementation of dynamic S-Boxes for AES that are populated using the three chaos systems. Moreover, a full MATLAB package to analyze the chaos generated S-Boxes based on graphical analysis, Walsh-Hadamard spectrum analysis, and image encryption analysis is developed. Although these S-Boxes are dynamic, meaning they are regenerated whenever the encryption key is changed, the analysis results show that such S-Boxes exhibit good properties like the Strict Avalanche Criterion (SAC) and the nonlinearity and in the application of image encryption. Furthermore, the thesis presents a new Lorenz-chaos-based key expansion for the AES. Many researchers have pointed out that there are some defects in the original key expansion of AES and thus have motivated such chaos-based key expansion proposal. The new proposed key schedule is analyzed and assessed in terms of confusion and diffusion by performing the frequency and SAC test respectively. The obtained results show that the new proposed design is more secure than the original AES key schedule and other proposed designs in the literature. The proposed
Working Towards Führer: A Chaotic View
Cakar, Ulas
Leadership is a concept that has been discussed since the beginning of history. Even though there have been many theories in the field accepting leadership's role in bringing order, chaotic aspects of leadership are generally neglected. This chapter aims to examine the leadership beyond an orderly interpretation of universe. For this purpose, Third Reich period and leadership during this period will be examined. Ian Kershaw's "Working Towards Führer" concept provides a unique understanding of leadership concept. It goes beyond the dualist depiction of Third Reich, it does not state Adolf Hitler as an all powerful dictator, or a weak one. Rather, he expresses that due to the conditions in the Third Reich, Adolf Hitler was both of this. This complex situation can be understood deeper when it is examined through the lens of chaos theory. This study contributes to the field by being the first in using chaos theory for examining "Working Towards Führer" concept and its development. Seemingly orderly nature of synchronization process and its vortex will be shown. Adolf Hitler's storm spot position in the chaotic system and its dynamics are explained. War's entropic power and its effect on the downfall of the system is crucial in understanding this unique chaotic system. The chaotic pattern of "Working Towards Führer" offers an opportunity to analyze the complexities of the leadership concept.
Jamming and chaotic dynamics in different granular systems
Maghsoodi, Homayoon; Luijten, Erik
Although common in nature and industry, the jamming transition has long eluded a concrete, mechanistic explanation. Recently, Banigan et al. (Nat. Phys. 9, 288-292, 2013) proposed a method for characterizing this transition in a granular system in terms of the system's chaotic properties, as quantified by the largest Lyapunov exponent. They demonstrated that in a two-dimensional shear cell the jamming transition coincides with the bulk density at which the system's largest Lyapunov exponent changes sign, indicating a transition between chaotic and non-chaotic regimes. To examine the applicability of this observation to realistic granular systems, we study a model that includes frictional forces within an expanded phase space. Furthermore, we test the generality of the relation between chaos and jamming by investigating the relationship between jamming and the chaotic properties of several other granular systems, notably sheared systems (Howell, D., Behringer R. P., Veje C., Phys. Rev. Lett. 82, 5241-5244, 1999) and systems with a free boundary. Finally, we quantify correlations between the largest Lyapunov vector and collective rearrangements of the system to demonstrate the predictive capabilities enabled by adopting this perspective of jamming.
The transient ladder synchronization of chaotic systems
International Nuclear Information System (INIS)
Chen, H.-K.; Sheu, L.-J.
2006-01-01
A new type for chaotically synchronizing systems, transient ladder chaos synchronization, is proposed in this Letter. For some physical systems, chaotic synchronization is possible in only some of the variables. It is shown that, for the non-synchronizing variable, synchronization up to a constant difference for t 1 = 2 is possible. The transient ladder chaos synchronization and anti-synchronization are illustrated by using two identical chaotic Froude pendulums. Numerical simulations are shown for demonstration
Chaotic behaviour of high Mach number flows
Varvoglis, H.; Ghosh, S.
1985-01-01
The stability of the super-Alfvenic flow of a two-fluid plasma model with respect to the Mach number and the angle between the flow direction and the magnetic field is investigated. It is found that, in general, a large scale chaotic region develops around the initial equilibrium of the laminar flow when the Mach number exceeds a certain threshold value. After reaching a maximum the size of this region begins shrinking and goes to zero as the Mach number tends to infinity. As a result high Mach number flows in time independent astrophysical plasmas may lead to the formation of 'quasi-shocks' in the presence of little or no dissipation.
Chaotic inflation in higher derivative gravity theories
Energy Technology Data Exchange (ETDEWEB)
Myrzakul, Shynaray; Myrzakulov, Ratbay; Sebastiani, Lorenzo [Eurasian National University, Department of General and Theoretical Physics, Eurasian Center for Theoretical Physics, Astana (Kazakhstan)
2015-03-01
In this paper, we investigate chaotic inflation from a scalar field subjected to a potential in the framework of f(R{sup 2}, P, Q)-gravity, where we add a correction to Einstein's gravity based on a function of the square of the Ricci scalar R{sup 2}, the contraction of the Ricci tensor P, and the contraction of the Riemann tensor Q. The Gauss-Bonnet case is also discussed. We give the general formalism of inflation, deriving the slow-roll parameters, the e-fold number, and the spectral indices. Several explicit examples are furnished; namely, we will consider the cases of a massive scalar field and a scalar field with quartic potential and some power-law function of the curvature invariants under investigation in the gravitational action of the theory. A viable approach to inflation according with observations is analyzed. (orig.)
TOWARDS THRESHOLD FREQUENCY IN CHAOTIC COLPITTS OSCILLATOR
DEFF Research Database (Denmark)
Lindberg, Erik; Tamasevicius, Arunas; Mykolaitis, Gytis
2007-01-01
A novel version of chaotic Colpitts oscillator is described. Instead of a linear loss resistor, it includes an extra inductor and diode in the collector circuit of the transistor. The modified circuit in comparison with the common Colpitts oscillator may generate chaotic oscillations at the funda......A novel version of chaotic Colpitts oscillator is described. Instead of a linear loss resistor, it includes an extra inductor and diode in the collector circuit of the transistor. The modified circuit in comparison with the common Colpitts oscillator may generate chaotic oscillations...
DYNAMICS OF FRACTIONAL ORDER CHAOTIC SYSTEM
Directory of Open Access Journals (Sweden)
M. Jana
2017-02-01
Full Text Available This paper deals with the dynamics of chaos and synchronization for fractional order chaotic system. For fractional order derivative Captuo definition is used here and numerical simulations are done using Predictor-Correctors scheme by Diethlm based on the Adams-Baseforth-Moulton algorithm. Stability analysis is discussed here for non linear fractional order chaotic system and synchronization is achieved between two non identical fractional order chaotic systems: Finance chaotic system(driving systemand Lorenz system(response systemvia active control.Numerical simulations are performed to show the effectiveness of these approaches.
Directory of Open Access Journals (Sweden)
Lilian Huang
2016-01-01
Full Text Available A new Lorenz-like chaotic system with varying parameter is proposed by adding a state feedback function. The structure of the new designed system is simple and has more complex dynamic behaviors. The chaos behavior of the new system is studied by theoretical analysis and numerical simulation. And the bifurcation diagram shows a chaos-cycle-chaos evolution when the new parameter changes. Then a new synchronization scheme by a single state variable drive is given based on the new system and a chaotic parameter modulation digital secure communication system is also constructed. The results of simulation demonstrate that the new proposed system could be well applied in secure communication. Otherwise, based on the new system, the encryption and decryption of image could be achieved also.
Synchronization and parameter identification of one class of realistic chaotic circuit
International Nuclear Information System (INIS)
Chun-Ni, Wang; Jun, Ma; Run-Tong, Chu; Shi-Rong, Li
2009-01-01
In this paper, the synchronization and the parameter identification of the chaotic Pikovsky–Rabinovich (PR) circuits are investigated. The linear error of the second corresponding variables is used to change the driven chaotic PR circuit, and the complete synchronization of the two identical chaotic PR circuits is realized with feedback intensity k increasing to a certain threshold. The Lyapunov exponents of the chaotic PR circuits are calculated by using different feedback intensities and our results are confirmed. The case where the two chaotic PR circuits are not identical is also investigated. A general positive Lyapunov function V, which consists of all the errors of the corresponding variables and parameters and changeable gain coefficient, is constructed by using the Lyapunov stability theory to study the parameter identification and complete synchronization of two non-identical chaotic circuits. The controllers and the parameter observers could be obtained analytically only by simplifying the criterion dV/dt < 0 (differential coefficient of Lyapunov function V with respect to time is negative). It is confirmed that the two non-identical chaotic PR circuits could still reach complete synchronization and all the unknown parameters in the drive system are estimated exactly within a short transient period
Function Projective Synchronization in Discrete-Time Chaotic System with Uncertain Parameters
International Nuclear Information System (INIS)
Chen Yong; Li Xin
2009-01-01
The function projective synchronization of discrete-time chaotic systems is presented. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate function projective synchronization (FPS) of discrete-time chaotic systems with uncertain parameters. With the aid of symbolic-numeric computation, we use the proposed scheme to illustrate FPS between two identical 3D Henon-like maps with uncertain parameters. Numeric simulations are used to verify the effectiveness of our scheme. (general)
Investigation of a Unified Chaotic System and Its Synchronization by Simulations
International Nuclear Information System (INIS)
Qing-Chu, Wu; Xin-Chu, Fu; Small, Michael
2010-01-01
We investigate a unified chaotic system and its synchronization including feedback synchronization and adaptive synchronization by numerical simulations. We propose a new dynamical quantity denoted by K, which connects adaptive synchronization and feedback synchronization, to analyze synchronization schemes. We find that K can estimate the smallest coupling strength for a unified chaotic system whether it is complete feedback or one-sided feedback. Based on the previous work, we also give a new dynamical method to compute the leading Lyapunov exponent. (general)
An Optical Encryption and Decryption Method and System
DEFF Research Database (Denmark)
2000-01-01
The invention relates to securing of information utilising optical imaging technologies and more specifically to phase encryption and decryption of images. An image is encrypted into a mask having a plurality of mask resolution elements (Xm, Ym) by encoding the image using e.g. a phase mask...
Using secret sharing for searching in encrypted data
Brinkman, Richard; Doumen, J.M.; Jonker, Willem; Jonker, W.; Petkovic, M.
2004-01-01
When outsourcing data to an untrusted database server, the data should be encrypted. When using thin clients or low-bandwidth networks it is best to perform most of the work at the server. We present a method, inspired by secure multi-party computation, to search efficiently in encrypted data. XML
Efficient reversible data hiding in encrypted H.264/AVC videos
Xu, Dawen; Wang, Rangding
2014-09-01
Due to the security and privacy-preserving requirements for cloud data management, it is sometimes desired that video content is accessible in an encrypted form. Reversible data hiding in the encrypted domain is an emerging technology, as it can perform data hiding in encrypted videos without decryption, which preserves the confidentiality of the content. Furthermore, the original cover can be losslessly restored after decryption and data extraction. An efficient reversible data hiding scheme for encrypted H.264/AVC videos is proposed. During H.264/AVC encoding, the intraprediction mode, motion vector difference, and the sign bits of the residue coefficients are encrypted using a standard stream cipher. Then, the data-hider who does not know the original video content, may reversibly embed secret data into the encrypted H.264/AVC video by using a modified version of the histogram shifting technique. A scale factor is utilized for selecting the embedding zone, which is scalable for different capacity requirements. With an encrypted video containing hidden data, data extraction can be carried out either in the encrypted or decrypted domain. In addition, real reversibility is realized so that data extraction and video recovery are free of any error. Experimental results demonstrate the feasibility and efficiency of the proposed scheme.
Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal
2017-12-01
Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graphs. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and nonresource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.
Three-dimensional information encryption and anticounterfeiting using digital holography.
Shiu, Min-Tzung; Chew, Yang-Kun; Chan, Huang-Tian; Wong, Xin-Yu; Chang, Chi-Ching
2015-01-01
In this work, arbitrary micro phase-step digital holography with optical interferometry and digital image processing is utilized to obtain information about an image of a three-dimensional object and encrypting keys. Then, a computer-generated hologram is used for the purpose of holographic encryption. All information about the keys is required to perform the decryption, comprising the amplitude and phase distribution of the encrypting key, the distance of image reconstruction, zero-order term elimination, and twin-image term suppression. In addition to using identifiable information on different image planes and linear superposition processing hidden within the encrypted information, not only can we convey an important message, but we can also achieve anticounterfeiting. This approach retains the strictness of traditional holographic encryption and the convenience of digital holographic processing without image distortion. Therefore, this method provides better solutions to earlier methods for the security of the transmission of holographic information.
A Contents Encryption Mechanism Using Reused Key in IPTV
Jeong, Yoon-Su; Kim, Yong-Tae; Cho, Young-Bok; Lee, Ki-Jeong; Park, Gil-Cheol; Lee, Sang-Ho
Recently IPTV is being spotlighted as a new stream service to stably provide video, audio and control signals to subscribers through the application of IP protocol. However, the IPTV system is facing more security threats than the traditional TV. This study proposes a multicasting encryption mechanism for secure transmission of the contents of IPTV by which the content provider encrypts their contents and send the encrypted contents and the key used for encryption of the contents to the user. In order to reduce the time and cost of Head-End, the proposed mechanism encrypts the media contents at the Head-End, embeds the code of the IPTV terminal used at the Head-End in the media contents for user tracking, and performs desynchronization for protection of the media contents from various attacks.
Key-space analysis of double random phase encryption technique
Monaghan, David S.; Gopinathan, Unnikrishnan; Naughton, Thomas J.; Sheridan, John T.
2007-09-01
We perform a numerical analysis on the double random phase encryption/decryption technique. The key-space of an encryption technique is the set of possible keys that can be used to encode data using that technique. In the case of a strong encryption scheme, many keys must be tried in any brute-force attack on that technique. Traditionally, designers of optical image encryption systems demonstrate only how a small number of arbitrary keys cannot decrypt a chosen encrypted image in their system. However, this type of demonstration does not discuss the properties of the key-space nor refute the feasibility of an efficient brute-force attack. To clarify these issues we present a key-space analysis of the technique. For a range of problem instances we plot the distribution of decryption errors in the key-space indicating the lack of feasibility of a simple brute-force attack.
Chaotic dynamics from interspike intervals
DEFF Research Database (Denmark)
Pavlov, A N; Sosnovtseva, Olga; Mosekilde, Erik
2001-01-01
Considering two different mathematical models describing chaotic spiking phenomena, namely, an integrate-and-fire and a threshold-crossing model, we discuss the problem of extracting dynamics from interspike intervals (ISIs) and show that the possibilities of computing the largest Lyapunov exponent...... (LE) from point processes differ between the two models. We also consider the problem of estimating the second LE and the possibility to diagnose hyperchaotic behavior by processing spike trains. Since the second exponent is quite sensitive to the structure of the ISI series, we investigate...
Chaotic dynamics from interspike intervals
DEFF Research Database (Denmark)
Pavlov, A.N.; Sosnovtseva, Olga V.; Mosekilde, Erik
2001-01-01
Considering two different mathematical models describing chaotic spiking phenomena, namely, an integrate-and-fire and a threshold-crossing model, we discuss the problem of extracting dynamics from interspike intervals (ISIs) and show that the possibilities of computing the largest Lyapunov exponent...... (LE) from paint processes differ between the two models. We also consider the problem of estimating the second LE and the possibility to diagnose hyperchaotic behavior by processing spike trains. Since the second exponent is quite sensitive to the structure of the ISI series, we investigate...
Chaotic bursting in semiconductor lasers
Ruschel, Stefan; Yanchuk, Serhiy
2017-11-01
We investigate the dynamic mechanisms for low frequency fluctuations in semiconductor lasers subjected to delayed optical feedback, using the Lang-Kobayashi model. This system of delay differential equations displays pronounced envelope dynamics, ranging from erratic, so called low frequency fluctuations to regular pulse packages, if the time scales of fast oscillations and envelope dynamics are well separated. We investigate the parameter regions where low frequency fluctuations occur and compute their Lyapunov spectra. Using the geometric singular perturbation theory, we study this intermittent chaotic behavior and characterize these solutions as bursting slow-fast oscillations.
Chaotic Patterns in Aeroelastic Signals
Directory of Open Access Journals (Sweden)
F. D. Marques
2009-01-01
patterns. With the reconstructed state spaces, qualitative analyses may be done, and the attractors evolutions with parametric variation are presented. Overall results reveal complex system dynamics associated with highly separated flow effects together with nonlinear coupling between aeroelastic modes. Bifurcations to the nonlinear aeroelastic system are observed for two investigations, that is, considering oscillations-induced aeroelastic evolutions with varying freestream speed, and aeroelastic evolutions at constant freestream speed and varying oscillations. Finally, Lyapunov exponent calculation is proceeded in order to infer on chaotic behavior. Poincaré mappings also suggest bifurcations and chaos, reinforced by the attainment of maximum positive Lyapunov exponents.
Private genome analysis through homomorphic encryption.
Kim, Miran; Lauter, Kristin
2015-01-01
The rapid development of genome sequencing technology allows researchers to access large genome datasets. However, outsourcing the data processing o the cloud poses high risks for personal privacy. The aim of this paper is to give a practical solution for this problem using homomorphic encryption. In our approach, all the computations can be performed in an untrusted cloud without requiring the decryption key or any interaction with the data owner, which preserves the privacy of genome data. We present evaluation algorithms for secure computation of the minor allele frequencies and χ2 statistic in a genome-wide association studies setting. We also describe how to privately compute the Hamming distance and approximate Edit distance between encrypted DNA sequences. Finally, we compare performance details of using two practical homomorphic encryption schemes--the BGV scheme by Gentry, Halevi and Smart and the YASHE scheme by Bos, Lauter, Loftus and Naehrig. The approach with the YASHE scheme analyzes data from 400 people within about 2 seconds and picks a variant associated with disease from 311 spots. For another task, using the BGV scheme, it took about 65 seconds to securely compute the approximate Edit distance for DNA sequences of size 5K and figure out the differences between them. The performance numbers for BGV are better than YASHE when homomorphically evaluating deep circuits (like the Hamming distance algorithm or approximate Edit distance algorithm). On the other hand, it is more efficient to use the YASHE scheme for a low-degree computation, such as minor allele frequencies or χ2 test statistic in a case-control study.
A New Measurement Method of Iimage Encryption
International Nuclear Information System (INIS)
Yu, X Y; Zhang, J; Ren, H E; Li, S; Zhang, X D
2006-01-01
Image scrambling transformation is applied widely in the digital watermarking and image encryption. Although more and more scrambling algorithms appear, they lack a method to evaluate the image scrambling degree. According to the relative differences of a point and adjacent point in scrambling front and back, a new method which judges the scrambling degree is proposed. Not only it can evaluate the change of each pixel's position, but also evaluate the change of adjacent pixel's value. Apply Matlab to the simulation experiment, the result indicated that this method can evaluate image scrambling degree well, and it accorded with people's vision too
Parameter estimation methods for chaotic intercellular networks.
Directory of Open Access Journals (Sweden)
Inés P Mariño
Full Text Available We have investigated simulation-based techniques for parameter estimation in chaotic intercellular networks. The proposed methodology combines a synchronization-based framework for parameter estimation in coupled chaotic systems with some state-of-the-art computational inference methods borrowed from the field of computational statistics. The first method is a stochastic optimization algorithm, known as accelerated random search method, and the other two techniques are based on approximate Bayesian computation. The latter is a general methodology for non-parametric inference that can be applied to practically any system of interest. The first method based on approximate Bayesian computation is a Markov Chain Monte Carlo scheme that generates a series of random parameter realizations for which a low synchronization error is guaranteed. We show that accurate parameter estimates can be obtained by averaging over these realizations. The second ABC-based technique is a Sequential Monte Carlo scheme. The algorithm generates a sequence of "populations", i.e., sets of randomly generated parameter values, where the members of a certain population attain a synchronization error that is lesser than the error attained by members of the previous population. Again, we show that accurate estimates can be obtained by averaging over the parameter values in the last population of the sequence. We have analysed how effective these methods are from a computational perspective. For the numerical simulations we have considered a network that consists of two modified repressilators with identical parameters, coupled by the fast diffusion of the autoinducer across the cell membranes.
Adaptive projective synchronization between different chaotic ...
Indian Academy of Sciences (India)
... with adaptive projective synchronization between two different chaotic systems with parametric uncertainties and external disturbances. Based on Lyapunov stability theory, the projective synchronization between a pair of different chaotic systems with fully unknown parameters are derived. An adaptive control law and a ...
Repetitive learning control of continuous chaotic systems
International Nuclear Information System (INIS)
Chen Maoyin; Shang Yun; Zhou Donghua
2004-01-01
Combining a shift method and the repetitive learning strategy, a repetitive learning controller is proposed to stabilize unstable periodic orbits (UPOs) within chaotic attractors in the sense of least mean square. If nonlinear parts in chaotic systems satisfy Lipschitz condition, the proposed controller can be simplified into a simple proportional repetitive learning controller
Adaptive projective synchronization between different chaotic ...
Indian Academy of Sciences (India)
An adaptive control law and a parameter update rule for uncertain parameters are designed such that the chaotic response system controls the chaotic drive system. Numerical simulation results are performed to explain the effectiveness and feasibility of the techniques. Keywords. Chaos; uncertainty; external disturbance; ...
Formulation of statistical mechanics for chaotic systems
Indian Academy of Sciences (India)
The study of statistical mechanics and thermodynamics of chaotic systems with few degrees of freedom is very important in understanding its various formal aspects from a dynamical point of view [1] and for the study of chaotic system using the well-developed concepts of statistical mechanics [2,3]. Since the trajectory of a.
Approximating chaotic saddles for delay differential equations.
Taylor, S Richard; Campbell, Sue Ann
2007-04-01
Chaotic saddles are unstable invariant sets in the phase space of dynamical systems that exhibit transient chaos. They play a key role in mediating transport processes involving scattering and chaotic transients. Here we present evidence (long chaotic transients and fractal basins of attraction) of transient chaos in a "logistic" delay differential equation. We adapt an existing method (stagger-and-step) to numerically construct the chaotic saddle for this system. This is the first such analysis of transient chaos in an infinite-dimensional dynamical system, and in delay differential equations in particular. Using Poincaré section techniques we illustrate approaches to visualizing the saddle set, and confirm that the saddle has the Cantor-like fractal structure consistent with a chaotic saddle generated by horseshoe-type dynamics.
Approximating chaotic saddles for delay differential equations
Taylor, S. Richard; Campbell, Sue Ann
2007-04-01
Chaotic saddles are unstable invariant sets in the phase space of dynamical systems that exhibit transient chaos. They play a key role in mediating transport processes involving scattering and chaotic transients. Here we present evidence (long chaotic transients and fractal basins of attraction) of transient chaos in a “logistic” delay differential equation. We adapt an existing method (stagger-and-step) to numerically construct the chaotic saddle for this system. This is the first such analysis of transient chaos in an infinite-dimensional dynamical system, and in delay differential equations in particular. Using Poincaré section techniques we illustrate approaches to visualizing the saddle set, and confirm that the saddle has the Cantor-like fractal structure consistent with a chaotic saddle generated by horseshoe-type dynamics.
A novel method to design S-box based on chaotic map and genetic algorithm
International Nuclear Information System (INIS)
Wang, Yong; Wong, Kwok-Wo; Li, Changbing; Li, Yang
2012-01-01
The substitution box (S-box) is an important component in block encryption algorithms. In this Letter, the problem of constructing S-box is transformed to a Traveling Salesman Problem and a method for designing S-box based on chaos and genetic algorithm is proposed. Since the proposed method makes full use of the traits of chaotic map and evolution process, stronger S-box is obtained. The results of performance test show that the presented S-box has good cryptographic properties, which justify that the proposed algorithm is effective in generating strong S-boxes. -- Highlights: ► The problem of constructing S-box is transformed to a Traveling Salesman Problem. ► We present a new method for designing S-box based on chaos and genetic algorithm. ► The proposed algorithm is effective in generating strong S-boxes.
A novel method to design S-box based on chaotic map and genetic algorithm
Energy Technology Data Exchange (ETDEWEB)
Wang, Yong, E-mail: wangyong_cqupt@163.com [State Key Laboratory of Power Transmission Equipment and System Security and New Technology, Chongqing University, Chongqing 400044 (China); Key Laboratory of Electronic Commerce and Logistics, Chongqing University of Posts and Telecommunications, Chongqing 400065 (China); Wong, Kwok-Wo [Department of Electronic Engineering, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong (Hong Kong); Li, Changbing [Key Laboratory of Electronic Commerce and Logistics, Chongqing University of Posts and Telecommunications, Chongqing 400065 (China); Li, Yang [Department of Automatic Control and Systems Engineering, The University of Sheffield, Mapping Street, S1 3DJ (United Kingdom)
2012-01-30
The substitution box (S-box) is an important component in block encryption algorithms. In this Letter, the problem of constructing S-box is transformed to a Traveling Salesman Problem and a method for designing S-box based on chaos and genetic algorithm is proposed. Since the proposed method makes full use of the traits of chaotic map and evolution process, stronger S-box is obtained. The results of performance test show that the presented S-box has good cryptographic properties, which justify that the proposed algorithm is effective in generating strong S-boxes. -- Highlights: ► The problem of constructing S-box is transformed to a Traveling Salesman Problem. ► We present a new method for designing S-box based on chaos and genetic algorithm. ► The proposed algorithm is effective in generating strong S-boxes.
Wireless Networks Speed Depending on the Encryption using Windows 8.1 x64 Operating System
Directory of Open Access Journals (Sweden)
Tamás Krausz
2014-12-01
Full Text Available We can use variety of encryption standards to encrypt data traffic to ensure the safety of wireless networks. The question is to what extent the security of the network affects network performance. For answering this question, experiments were performed without data encryption, and the use of various encryption standards.
A Type-and-Identity-based Proxy Re-Encryption Scheme and its Application in Healthcare
Ibraimi, L.; Tang, Qiang; Hartel, Pieter H.; Jonker, Willem
2008-01-01
Proxy re-encryption is a cryptographic primitive developed to delegate the decryption right from one party (the delegator) to another (the delegatee). In a proxy re-encryption scheme, the delegator assigns a key to a proxy to re-encrypt all messages encrypted with his public key such that the
Investigation of a chaotic thermostat
Morales, G. J.
2018-03-01
A numerical study is presented of a free particle interacting with a deterministic thermostat in which the usual friction force is supplemented with a fluctuating force that depends on the self-consistent damping coefficient associated with coupling to the heat bath. It is found that this addition results in a chaotic environment in which a particle self-heats from rest and moves in positive and negative directions, exhibiting a characteristic diffusive behavior. The frequency power spectrum of the dynamical quantities displays the exponential frequency dependence ubiquitous to chaotic dynamics. The velocity distribution function approximates a Maxwellian distribution, but it does show departures from perfect thermal equilibrium, while the distribution function for the damping coefficient shows a closer fit. The behavior for the classic Nosé-Hoover (NH) thermostat is compared to that of the enlarged Martyna-Klein-Tuckerman (MKT) model. Over a narrow amplitude range, the application of a constant external force results quantitatively in the Einstein relation for the NH thermostat, and for the MKT model it differs by a factor of 2.
Chaotic Transport in Circumterrestrial Orbits
Rosengren, Aaron Jay
2018-04-01
The slow deformation of circumterrestrial orbits in the medium region, subject to lunisolar secular resonances, is well approximated by a Hamiltonian system with 2.5 degrees of freedom. This dynamical model is referred to in the astrophysical and celestial dynamics communities as the quadrupolar, secular, hierarchical three-body problem, and, in the non-autonomous case, gives rise to the classical Kozai-Lidov mechanism. In the time-dependent model, brought about in our case by the Moon's perturbed motion, the action variables of the system may experience chaotic variations and large drifts due to the possible overlap of nearby resonances. Using variational chaos indicators, we compute high-resolution portraits of the action space, revealing the existence of tori and structures filling chaotic regions. Our refined and elaborate calculations allow us to isolate precise initial conditions near specific areas of interest and to study their asymptotic behavior in time. We highlight in particular how the drift in phase space is mediated by the complement of the numerically detected KAM tori. Despite their reputed normality, Earth satellite orbits can possess an extraordinarily rich spectrum of dynamical behaviors, and, like the small body remnants of Solar system formation, they have all the complications that make them very interesting candidates for testing the modern tools of chaos theory.
Energy Technology Data Exchange (ETDEWEB)
Enqvist, Kari [Physics Department, University of Helsinki, and Helsinki Institute of Physics, FIN-00014 Helsinki (Finland); Koivisto, Tomi [Institute for Theoretical Physics and Spinoza Institute, Leuvenlaan 4, 3584 CE Utrecht (Netherlands); Rigopoulos, Gerasimos, E-mail: kari.enqvist@helsinki.fi, E-mail: T.S.Koivisto@astro.uio.no, E-mail: rigopoulos@physik.rwth-aachen.de [Institut für Theoretische Teilchenphysik und Kosmologie, RWTH Aachen University, D-52056 Aachen (Germany)
2012-05-01
We consider inflation within the context of what is arguably the simplest non-metric extension of Einstein gravity. There non-metricity is described by a single graviscalar field with a non-minimal kinetic coupling to the inflaton field Ψ, parameterized by a single parameter γ. There is a simple equivalent description in terms of a massless field and an inflaton with a modified potential. We discuss the implications of non-metricity for chaotic inflation and find that it significantly alters the inflaton dynamics for field values Ψ∼>M{sub P}/γ, dramatically changing the qualitative behaviour in this regime. In the equivalent single-field description this is described as a cuspy potential that forms of barrier beyond which the inflation becomes a ghost field. This imposes an upper bound on the possible number of e-folds. For the simplest chaotic inflation models, the spectral index and the tensor-to-scalar ratio receive small corrections dependent on the non-metricity parameter. We also argue that significant post-inflationary non-metricity may be generated.
Hybrid chaotic ant swarm optimization
International Nuclear Information System (INIS)
Li Yuying; Wen Qiaoyan; Li Lixiang; Peng Haipeng
2009-01-01
Chaotic ant swarm optimization (CASO) is a powerful chaos search algorithm that is used to find the global optimum solution in search space. However, the CASO algorithm has some disadvantages, such as lower solution precision and longer computational time, when solving complex optimization problems. To resolve these problems, an improved CASO, called hybrid chaotic swarm optimization (HCASO), is proposed in this paper. The new algorithm introduces preselection operator and discrete recombination operator into the CASO; meanwhile it replaces the best position found by own and its neighbors' ants with the best position found by preselection operator and discrete recombination operator in evolution equation. Through testing five benchmark functions with large dimensionality, the experimental results show the new method enhances the solution accuracy and stability greatly, as well as reduces the computational time and computer memory significantly when compared to the CASO. In addition, we observe the results can become better with swarm size increasing from the sensitivity study to swarm size. And we gain some relations between problem dimensions and swam size according to scalability study.
Optimizing homogenization by chaotic unmixing?
Weijs, Joost; Bartolo, Denis
2016-11-01
A number of industrial processes rely on the homogeneous dispersion of non-brownian particles in a viscous fluid. An ideal mixing would yield a so-called hyperuniform particle distribution. Such configurations are characterized by density fluctuations that grow slower than the standard √{ N}-fluctuations. Even though such distributions have been found in several natural structures, e.g. retina receptors in birds, they have remained out of experimental reach until very recently. Over the last 5 years independent experiments and numerical simulations have shown that periodically driven suspensions can self-assemble hyperuniformally. Simple as the recipe may be, it has one important disadvantage. The emergence of hyperuniform states co-occurs with a critical phase transition from reversible to non reversible particle dynamics. As a consequence the homogenization dynamics occurs over a time that diverges with the system size (critical slowing down). Here, we discuss how this process can be sped up by exploiting the stirring properties of chaotic advection. Among the questions that we answer are: What are the physical mechanisms in a chaotic flow that are relevant for hyperuniformity? How can we tune the flow parameters such to obtain optimal hyperuniformity in the fastest way? JW acknowledges funding by NWO (Netherlands Organisation for Scientific Research) through a Rubicon Grant.
3-D Image Encryption Based on Rubik's Cube and RC6 Algorithm
Helmy, Mai; El-Rabaie, El-Sayed M.; Eldokany, Ibrahim M.; El-Samie, Fathi E. Abd
2017-12-01
A novel encryption algorithm based on the 3-D Rubik's cube is proposed in this paper to achieve 3D encryption of a group of images. This proposed encryption algorithm begins with RC6 as a first step for encrypting multiple images, separately. After that, the obtained encrypted images are further encrypted with the 3-D Rubik's cube. The RC6 encrypted images are used as the faces of the Rubik's cube. From the concepts of image encryption, the RC6 algorithm adds a degree of diffusion, while the Rubik's cube algorithm adds a degree of permutation. The simulation results demonstrate that the proposed encryption algorithm is efficient, and it exhibits strong robustness and security. The encrypted images are further transmitted over wireless Orthogonal Frequency Division Multiplexing (OFDM) system and decrypted at the receiver side. Evaluation of the quality of the decrypted images at the receiver side reveals good results.
PDES, Fips Standard Data Encryption Algorithm
International Nuclear Information System (INIS)
Nessett, D.N.
1991-01-01
Description of program or function: PDES performs the National Bureau of Standards FIPS Pub. 46 data encryption/decryption algorithm used for the cryptographic protection of computer data. The DES algorithm is designed to encipher and decipher blocks of data consisting of 64 bits under control of a 64-bit key. The key is generated in such a way that each of the 56 bits used directly by the algorithm are random and the remaining 8 error-detecting bits are set to make the parity of each 8-bit byte of the key odd, i. e. there is an odd number of '1' bits in each 8-bit byte. Each member of a group of authorized users of encrypted computer data must have the key that was used to encipher the data in order to use it. Data can be recovered from cipher only by using exactly the same key used to encipher it, but with the schedule of addressing the key bits altered so that the deciphering process is the reverse of the enciphering process. A block of data to be enciphered is subjected to an initial permutation, then to a complex key-dependent computation, and finally to a permutation which is the inverse of the initial permutation. Two PDES routines are included; both perform the same calculation. One, identified as FDES.MAR, is designed to achieve speed in execution, while the other identified as PDES.MAR, presents a clearer view of how the algorithm is executed
Comb to Pipeline: Fast Software Encryption Revisited
DEFF Research Database (Denmark)
Bogdanov, Andrey; Lauridsen, Martin Mehl; Tischhauser, Elmar Wolfgang
2015-01-01
AES-NI, or Advanced Encryption Standard New Instructions, is an extension of the x86 architecture proposed by Intel in 2008. With a pipelined implementation utilizing AES-NI, parallelizable modes such as AES-CTR become extremely efficient. However, out of the four non-trivial NIST-recommended enc......AES-NI, or Advanced Encryption Standard New Instructions, is an extension of the x86 architecture proposed by Intel in 2008. With a pipelined implementation utilizing AES-NI, parallelizable modes such as AES-CTR become extremely efficient. However, out of the four non-trivial NIST...... look-ahead strategy, featuring a low overhead – with which sequential modes profit from the AES-NI pipeline in real-world settings by filling it with multiple, independent messages. We apply the comb scheduler to implementations on Haswell, Intel’s latest microarchitecture, for a wide range of modes...... significantly speeds up CLOC/SILC, JAMBU, and POET, with the mostly sequential nonce-misuse resistant design of POET, performing at 2.14 cpb, becoming faster than the well-parallelizable COPA. Finally, this paper provides the first optimized AES-NI implementations for the novel AE modes OTR, CLOC/SILC, COBRA...
Practical somewhat-secure quantum somewhat-homomorphic encryption with coherent states
Tan, Si-Hui; Ouyang, Yingkai; Rohde, Peter P.
2018-04-01
We present a scheme for implementing homomorphic encryption on coherent states encoded using phase-shift keys. The encryption operations require only rotations in phase space, which commute with computations in the code space performed via passive linear optics, and with generalized nonlinear phase operations that are polynomials of the photon-number operator in the code space. This encoding scheme can thus be applied to any computation with coherent-state inputs, and the computation proceeds via a combination of passive linear optics and generalized nonlinear phase operations. An example of such a computation is matrix multiplication, whereby a vector representing coherent-state amplitudes is multiplied by a matrix representing a linear optics network, yielding a new vector of coherent-state amplitudes. By finding an orthogonal partitioning of the support of our encoded states, we quantify the security of our scheme via the indistinguishability of the encrypted code words. While we focus on coherent-state encodings, we expect that this phase-key encoding technique could apply to any continuous-variable computation scheme where the phase-shift operator commutes with the computation.
Secure Chaotic Map Based Block Cryptosystem with Application to Camera Sensor Networks
Directory of Open Access Journals (Sweden)
Muhammad Khurram Khan
2011-01-01
Full Text Available Recently, Wang et al. presented an efficient logistic map based block encryption system. The encryption system employs feedback ciphertext to achieve plaintext dependence of sub-keys. Unfortunately, we discovered that their scheme is unable to withstand key stream attack. To improve its security, this paper proposes a novel chaotic map based block cryptosystem. At the same time, a secure architecture for camera sensor network is constructed. The network comprises a set of inexpensive camera sensors to capture the images, a sink node equipped with sufficient computation and storage capabilities and a data processing server. The transmission security between the sink node and the server is gained by utilizing the improved cipher. Both theoretical analysis and simulation results indicate that the improved algorithm can overcome the flaws and maintain all the merits of the original cryptosystem. In addition, computational costs and efficiency of the proposed scheme are encouraging for the practical implementation in the real environment as well as camera sensor network.
New modified map for digital image encryption and its performance
Suryadi, MT; Yus Trinity Irsan, Maria; Satria, Yudi
2017-10-01
Protection to classified digital data becomes so important in avoiding data manipulation and alteration. The focus of this paper is in data and information protection of digital images form. Protection is provided in the form of encrypted digital image. The encryption process uses a new map, {x}n+1=\\frac{rλ {x}n}{1+λ {(1-{x}n)}2}\\quad ({mod} 1), which is called MS map. This paper will show: the results of digital image encryption using MS map and how the performance is regarding the average time needed for encryption/decryption process; randomness of key stream sequence with NIST test, histogram analysis and goodness of fit test, quality of the decrypted image by PSNR, initial value sensitivity level, and key space. The results show that the average time of the encryption process is relatively same as the decryption process and it depends to types and sizes of the image. Cipherimage (encrypted image) is uniformly distributed since: it passes the goodness of fit test and also the histogram of the cipherimage is flat; key stream, that are generated by MS map, passes frequency (monobit) test, and runs test, which means the key stream is a random sequence; the decrypted image has same quality as the original image; and initial value sensitivity reaches 10-17, and key space reaches 3.24 × 10634. So, that encryption algorithm generated by MS map is more resistant to brute-force attack and known plaintext attack.
A Review Of Encryption Algorithms-RSA And Diffie-Hellman
Directory of Open Access Journals (Sweden)
Nilesh A. Lal
2017-07-01
Full Text Available Network security is protecting data and message from cybercrime. Cryptography system is designed freely to communicate over a computer network. It is a process where sender sends encrypted message to the recipient. Symmetric encryption is known as the single key encryption. RSA algorithm is a symmetric key encryption.it uses public key and private key. Diffie Hellman cryptography is where both parties exchange secrets keys to encrypt message.
Simple Multi-Authority Attribute-Based Encryption for Short Messages
Viktoria I. Villanyi
2016-01-01
Central authority free multi-authority attribute based encryption scheme for short messages will be presented. Several multi-authority attribute based encryption schemes were recently proposed. We can divide these schemes into two groups, one of them are the ciphertext-policy attribute based encryption schemes (CP-ABE), the another one are the key-policy attribute based encryption schemes (KP-ABE). In our new multi-authority attribute based encryption scheme we combine them: the access struct...
Quantifiers for randomness of chaotic pseudo-random number generators.
De Micco, L; Larrondo, H A; Plastino, A; Rosso, O A
2009-08-28
We deal with randomness quantifiers and concentrate on their ability to discern the hallmark of chaos in time series used in connection with pseudo-random number generators (PRNGs). Workers in the field are motivated to use chaotic maps for generating PRNGs because of the simplicity of their implementation. Although there exist very efficient general-purpose benchmarks for testing PRNGs, we feel that the analysis provided here sheds additional didactic light on the importance of the main statistical characteristics of a chaotic map, namely (i) its invariant measure and (ii) the mixing constant. This is of help in answering two questions that arise in applications: (i) which is the best PRNG among the available ones? and (ii) if a given PRNG turns out not to be good enough and a randomization procedure must still be applied to it, which is the best applicable randomization procedure? Our answer provides a comparative analysis of several quantifiers advanced in the extant literature.
System for processing an encrypted instruction stream in hardware
Griswold, Richard L.; Nickless, William K.; Conrad, Ryan C.
2016-04-12
A system and method of processing an encrypted instruction stream in hardware is disclosed. Main memory stores the encrypted instruction stream and unencrypted data. A central processing unit (CPU) is operatively coupled to the main memory. A decryptor is operatively coupled to the main memory and located within the CPU. The decryptor decrypts the encrypted instruction stream upon receipt of an instruction fetch signal from a CPU core. Unencrypted data is passed through to the CPU core without decryption upon receipt of a data fetch signal.
A joint asymmetric watermarking and image encryption scheme
Boato, G.; Conotter, V.; De Natale, F. G. B.; Fontanari, C.
2008-02-01
Here we introduce a novel watermarking paradigm designed to be both asymmetric, i.e., involving a private key for embedding and a public key for detection, and commutative with a suitable encryption scheme, allowing both to cipher watermarked data and to mark encrypted data without interphering with the detection process. In order to demonstrate the effectiveness of the above principles, we present an explicit example where the watermarking part, based on elementary linear algebra, and the encryption part, exploiting a secret random permutation, are integrated in a commutative scheme.
Chaotic inflation: A numerical approach
International Nuclear Information System (INIS)
Biller, P.; Pertuccione, F.
1991-01-01
A numerical study of chaotic inflation is presented. Following a semiclassical treatment of quantum effects, the dynamics is described as a random process. The relevant Langevin equation is then integrated numerically for a large number of realizations and results are evaluated as ensemble averages. For the understanding of the global structure of the universe the fact that different domains of the universe have different growth rates is important. This is handled by a new modified algorithm. The simulation results for the probability distribution functions at constant and proper volume are given for two typical initial conditions. We compare them to the approximate results of an already existing analytical approach. The picture of an eternally existing self-reproducing universe is confirmed. (orig.)
Sui, Liansheng; Liu, Benqing; Wang, Qiang; Li, Ye; Liang, Junli
2015-12-01
A color image encryption scheme is proposed based on Yang-Gu mixture amplitude-phase retrieval algorithm and two-coupled logistic map in gyrator transform domain. First, the color plaintext image is decomposed into red, green and blue components, which are scrambled individually by three random sequences generated by using the two-dimensional Sine logistic modulation map. Second, each scrambled component is encrypted into a real-valued function with stationary white noise distribution in the iterative amplitude-phase retrieval process in the gyrator transform domain, and then three obtained functions are considered as red, green and blue channels to form the color ciphertext image. Obviously, the ciphertext image is real-valued function and more convenient for storing and transmitting. In the encryption and decryption processes, the chaotic random phase mask generated based on logistic map is employed as the phase key, which means that only the initial values are used as private key and the cryptosystem has high convenience on key management. Meanwhile, the security of the cryptosystem is enhanced greatly because of high sensitivity of the private keys. Simulation results are presented to prove the security and robustness of the proposed scheme.
Synchronization of Time-Continuous Chaotic Oscillators
DEFF Research Database (Denmark)
Yanchuk, S.; Maistrenko, Yuri; Mosekilde, Erik
2003-01-01
Considering a system of two coupled identical chaotic oscillators, the paper first establishes the conditions of transverse stability for the fully synchronized chaotic state. Periodic orbit threshold theory is applied to determine the bifurcations through which low-periodic orbits embedded...... the interacting chaotic oscillators causes a shift of the synchronization manifold. The presence of a coupling asymmetry is found to lead to further modifications of the destabilization process. Finally, the paper considers the problem of partial synchronization in a system of four coupled Rossler oscillators...
Chaotic inflation in models with flat directions
International Nuclear Information System (INIS)
Graziani, F.; Olive, K.
1989-01-01
We consider the chaotic inflationary scenario in models with flat directions. We find that unless the scalars along the flat directions have vacuum expectation values p or 10 14 M p 15 M p depending on the expectation values of the chaotic inflator, Ψ, one or two or more periods of inflation occur but with a resulting energy density perturbation δρ/ρ ≅ 10 -16 , far too small to be of any consequence for galaxy formation. Even with p only limited initial values of ≅ (3-200) M p result in inflation with reasonable density perturbations. Thus chaotic inflation in models with flat directions require rather special initial conditions. (orig.)
Chaotic inflation with curvaton induced running
DEFF Research Database (Denmark)
Sloth, Martin Snoager
2014-01-01
of the apparent tension, but which would be in conflict with prediction of the simplest model of chaotic inflation. The large field chaotic model is sensitive to UV physics, and the nontrivial running of the spectral index suggested by the BICEP2 collaboration could therefore, if true, be telling us some...... additional new information about the UV completion of inflation. However, before we would be able to draw such strong conclusions with confidence, we would first have to also carefully exclude all the alternatives. Assuming monomial chaotic inflation is the right theory of inflation, we therefore explore...
International Nuclear Information System (INIS)
Ahmadi, Mohamadreza; Mojallali, Hamed
2012-01-01
Highlights: ► A new meta-heuristic optimization algorithm. ► Integration of invasive weed optimization and chaotic search methods. ► A novel parameter identification scheme for chaotic systems. - Abstract: This paper introduces a novel hybrid optimization algorithm by taking advantage of the stochastic properties of chaotic search and the invasive weed optimization (IWO) method. In order to deal with the weaknesses associated with the conventional method, the proposed chaotic invasive weed optimization (CIWO) algorithm is presented which incorporates the capabilities of chaotic search methods. The functionality of the proposed optimization algorithm is investigated through several benchmark multi-dimensional functions. Furthermore, an identification technique for chaotic systems based on the CIWO algorithm is outlined and validated by several examples. The results established upon the proposed scheme are also supplemented which demonstrate superior performance with respect to other conventional methods.
Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption
Directory of Open Access Journals (Sweden)
Shuai Han
2017-01-01
Full Text Available KDM[F]-CCA security of public-key encryption (PKE ensures the privacy of key-dependent messages f(sk which are closely related to the secret key sk, where f∈F, even if the adversary is allowed to make decryption queries. In this paper, we study the design of KDM-CCA secure PKE. To this end, we develop a new primitive named Auxiliary-Input Authenticated Encryption (AIAE. For AIAE, we introduce two related-key attack (RKA security notions, including IND-RKA and weak-INT-RKA. We present a generic construction of AIAE from tag-based hash proof system (HPS and one-time secure authenticated encryption (AE and give an instantiation of AIAE under the Decisional Diffie-Hellman (DDH assumption. Using AIAE as an essential building block, we give two constructions of efficient KDM-CCA secure PKE based on the DDH and the Decisional Composite Residuosity (DCR assumptions. Specifically, (i our first PKE construction is the first one achieving KDM[Faff]-CCA security for the set of affine functions and compactness of ciphertexts simultaneously. (ii Our second PKE construction is the first one achieving KDM[Fpolyd]-CCA security for the set of polynomial functions and almost compactness of ciphertexts simultaneously. Our PKE constructions are very efficient; in particular, they are pairing-free and NIZK-free.
Eigenvalue study of a chaotic resonator
Energy Technology Data Exchange (ETDEWEB)
Banova, Todorka [Technische Universitaet Darmstadt, Institut fuer Theorie Elektromagnetischer Felder (TEMF), Schlossgartenstrasse 8, D-64289 Darmstadt (Germany); Technische Universitaet Darmstadt, Graduate School of Computational Engineering, Dolivostrasse 15, D-64293 Darmstadt (Germany); Ackermann, Wolfgang; Weiland, Thomas [Technische Universitaet Darmstadt, Institut fuer Theorie Elektromagnetischer Felder (TEMF), Schlossgartenstrasse 8, D-64289 Darmstadt (Germany)
2013-07-01
The field of quantum chaos comprises the study of the manifestations of classical chaos in the properties of the corresponding quantum systems. Within this work, we compute the eigenfrequencies that are needed for the level spacing analysis of a microwave resonator with chaotic characteristics. The major challenges posed by our work are: first, the ability of the approaches to tackle the large scale eigenvalue problem and second, the capability to extract many, i.e. order of thousands, eigenfrequencies for the considered cavity. The first proposed approach for an accurate eigenfrequency extraction takes into consideration the evaluated electric field computations in time domain of a superconducting cavity and by means of signal-processing techniques extracts the eigenfrequencies. The second approach is based on the finite element method with curvilinear elements, which transforms the continuous eigenvalue problem to a discrete generalized eigenvalue problem. Afterwards, the Lanczos algorithm is used for the solution of the generalized eigenvalue problem. In the poster, a summary of the applied algorithms, as well as, critical implementation details together with the simulation results are provided.
Muhammad, Riaz; Muhammad, Rehan; Keum-Shik, Hong; Muhammad, Ashraf; Haroon, Ur Rasheed
2014-11-01
This paper addresses the control law design for synchronization of two different chaotic oscillators with mutually Lipschitz nonlinearities. For analysis of the properties of two different nonlinearities, an advanced mutually Lipschitz condition is proposed. This mutually Lipschitz condition is more general than the traditional Lipschitz condition. Unlike the latter, it can be used for the design of a feedback controller for synchronization of chaotic oscillators of different dynamics. It is shown that any two different Lipschitz nonlinearities always satisfy the mutually Lipschitz condition. Applying the mutually Lipschitz condition, a quadratic Lyapunov function and uniformly ultimately bounded stability, easily designable and implementable robust control strategies utilizing algebraic Riccati equation and linear matrix inequalities, are derived for synchronization of two distinct chaotic oscillators. Furthermore, a novel adaptive control scheme for mutually Lipschitz chaotic systems is established by addressing the issue of adaptive cancellation of unknown mismatch between the dynamics of different chaotic systems. The proposed control technique is numerically tested for synchronization of two different chaotic Chua's circuits and for obtaining identical behavior between the modified Chua's circuit and the Rössler system.
Fine-grained Database Field Search Using Attribute-Based Encryption for E-Healthcare Clouds.
Guo, Cheng; Zhuang, Ruhan; Jie, Yingmo; Ren, Yizhi; Wu, Ting; Choo, Kim-Kwang Raymond
2016-11-01
An effectively designed e-healthcare system can significantly enhance the quality of access and experience of healthcare users, including facilitating medical and healthcare providers in ensuring a smooth delivery of services. Ensuring the security of patients' electronic health records (EHRs) in the e-healthcare system is an active research area. EHRs may be outsourced to a third-party, such as a community healthcare cloud service provider for storage due to cost-saving measures. Generally, encrypting the EHRs when they are stored in the system (i.e. data-at-rest) or prior to outsourcing the data is used to ensure data confidentiality. Searchable encryption (SE) scheme is a promising technique that can ensure the protection of private information without compromising on performance. In this paper, we propose a novel framework for controlling access to EHRs stored in semi-trusted cloud servers (e.g. a private cloud or a community cloud). To achieve fine-grained access control for EHRs, we leverage the ciphertext-policy attribute-based encryption (CP-ABE) technique to encrypt tables published by hospitals, including patients' EHRs, and the table is stored in the database with the primary key being the patient's unique identity. Our framework can enable different users with different privileges to search on different database fields. Differ from previous attempts to secure outsourcing of data, we emphasize the control of the searches of the fields within the database. We demonstrate the utility of the scheme by evaluating the scheme using datasets from the University of California, Irvine.
A Novel Method for Generating Encryption Keys
Directory of Open Access Journals (Sweden)
Dascalescu Ana Cristina
2009-12-01
Full Text Available The development of the informational society, which has led to an impressive growth of the information volume circulating in the computer networks, has accelerated the evolution and especially the use of modern cryptography instruments. Today, the commercial products use standard cryptographic libraries that implement certified and tested cryptographic algorithms. Instead, the fragility ofencryption algorithms is given by compositional operations like key handling or key generation. In this sense, the article proposes an innovative method to generate pseudorandom numbers which can be used for the construction of secure stream encryption keys. The proposed method is based on the mathematical complements based on the algebra of the finite fields and uses a particularized structure of the linear feedback shift registers.
Optical encryption using pseudorandom complex spatial modulation.
Sarkadi, Tamás; Koppa, Pál
2012-12-01
In this paper we propose a new (to our knowledge) complex spatial modulation method to encode data pages applicable in double random phase encryption (DRPE) to make the system more resistant to brute-force attack. The proposed modulation method uses data page pixels with random phase and amplitude values with the condition that the intensity of the interference of light from two adjacent pixels should correspond to the encoded information. A differential phase contrast technique is applied to recover the data page at the output of the system. We show that the proposed modulation method can enhance the robustness of the DRPE technique using point spread function analysis. Key space expansion is determined by numeric model calculations.
Quantum Image Encryption Algorithm Based on Image Correlation Decomposition
Hua, Tianxiang; Chen, Jiamin; Pei, Dongju; Zhang, Wenquan; Zhou, Nanrun
2015-02-01
A novel quantum gray-level image encryption and decryption algorithm based on image correlation decomposition is proposed. The correlation among image pixels is established by utilizing the superposition and measurement principle of quantum states. And a whole quantum image is divided into a series of sub-images. These sub-images are stored into a complete binary tree array constructed previously and then randomly performed by one of the operations of quantum random-phase gate, quantum revolving gate and Hadamard transform. The encrypted image can be obtained by superimposing the resulting sub-images with the superposition principle of quantum states. For the encryption algorithm, the keys are the parameters of random phase gate, rotation angle, binary sequence and orthonormal basis states. The security and the computational complexity of the proposed algorithm are analyzed. The proposed encryption algorithm can resist brute force attack due to its very large key space and has lower computational complexity than its classical counterparts.
Chaotic Zones around Rotating Small Bodies
Energy Technology Data Exchange (ETDEWEB)
Lages, José; Shevchenko, Ivan I. [Institut UTINAM, Observatoire des Sciences de l’Univers THETA, CNRS, Université de Franche-Comté, Besançon F-25030 (France); Shepelyansky, Dima L., E-mail: jose.lages@utinam.cnrs.fr [Laboratoire de Physique Théorique du CNRS, IRSAMC, Université de Toulouse, UPS, Toulouse F-31062 (France)
2017-06-01
Small bodies of the solar system, like asteroids, trans-Neptunian objects, cometary nuclei, and planetary satellites, with diameters smaller than 1000 km usually have irregular shapes, often resembling dumb-bells or contact binaries. The spinning of such a gravitating dumb-bell creates around it a zone of chaotic orbits. We determine its extent analytically and numerically. We find that the chaotic zone swells significantly if the rotation rate is decreased; in particular, the zone swells more than twice if the rotation rate is decreased 10 times with respect to the “centrifugal breakup” threshold. We illustrate the properties of the chaotic orbital zones in examples of the global orbital dynamics about asteroid 243 Ida (which has a moon, Dactyl, orbiting near the edge of the chaotic zone) and asteroid 25143 Itokawa.
A concise guide to chaotic electronic circuits
Buscarino, Arturo; Frasca, Mattia; Sciuto, Gregorio
2014-01-01
This brief provides a source of instruction from which students can be taught about the practicalities of designing and using chaotic circuits. The text provides information on suitable materials, circuit design and schemes for design realization. Readers are then shown how to reproduce experiments on chaos and to design new ones. The text guides the reader easily from the basic idea of chaos to the laboratory test providing an experimental basis that can be developed for such applications as secure communications. This brief provides introductory information on sample chaotic circuits, includes coverage of their development, and the “gallery” section provides information on a wide range of circuits. Concise Guide to Chaotic Electronic Circuits will be useful to anyone running a laboratory class involving chaotic circuits and to students wishing to learn about them.
Optical design of cipher block chaining (CBC) encryption mode by using digital holography
Gil, Sang Keun; Jeon, Seok Hee; Jung, Jong Rae; Kim, Nam
2016-03-01
We propose an optical design of cipher block chaining (CBC) encryption by using digital holographic technique, which has higher security than the conventional electronic method because of the analog-type randomized cipher text with 2-D array. In this paper, an optical design of CBC encryption mode is implemented by 2-step quadrature phase-shifting digital holographic encryption technique using orthogonal polarization. A block of plain text is encrypted with the encryption key by applying 2-step phase-shifting digital holography, and it is changed into cipher text blocks which are digital holograms. These ciphered digital holograms with the encrypted information are Fourier transform holograms and are recorded on CCDs with 256 gray levels quantized intensities. The decryption is computed by these encrypted digital holograms of cipher texts, the same encryption key and the previous cipher text. Results of computer simulations are presented to verify that the proposed method shows the feasibility in the high secure CBC encryption system.
Synchronizing a class of uncertain chaotic systems
International Nuclear Information System (INIS)
Chen Maoyin; Zhou Donghua; Shang Yun
2005-01-01
This Letter deals with the synchronization of a class of uncertain chaotic systems in the drive-response framework. A robust adaptive observer based response system is designed to synchronize a given chaotic system with unknown parameters and external disturbances. Lyapunov stability ensures the global synchronization between the drive and response systems even if Lipschitz constants on function matrices and bounds on uncertainties are unknown. Numerical simulation of Genesio-Tesi system verifies the effectiveness of this scheme
Pattern recognition using chaotic neural networks
Tan, Z.; Hepburn, B. S.; Tucker, C.; Ali, M. K.
1998-01-01
Pattern recognition by chaotic neural networks is studied using a hyperchaotic neural network as model. Virtual basins of attraction are introduced around unstable periodic orbits which are then used as patterns. Search for periodic orbits in dynamical systems is treated as a process of pattern recognition. The role of synapses on patterns in chaotic networks is discussed. It is shown that distorted states having only limited information of the patterns are successfully recognized.
Pattern recognition using chaotic neural networks
Directory of Open Access Journals (Sweden)
Z. Tan
1998-01-01
Full Text Available Pattern recognition by chaotic neural networks is studied using a hyperchaotic neural network as model. Virtual basins of attraction are introduced around unstable periodic orbits which are then used as patterns. Search for periodic orbits in dynamical systems is treated as a process of pattern recognition. The role of synapses on patterns in chaotic networks is discussed. It is shown that distorted states having only limited information of the patterns are successfully recognized.
Universal chaotic scattering on quantum graphs.
Pluhař, Z; Weidenmüller, H A
2013-01-18
We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random-matrix theory. We also calculate all higher S-matrix correlation functions in the Ericson regime. These, too, agree with random-matrix theory results as far as the latter are known. We conjecture that our results give a universal description of chaotic scattering.
Batch Attribute-Based Encryption for Secure Clouds
Directory of Open Access Journals (Sweden)
Chen Yang
2015-10-01
Full Text Available Cloud storage is widely used by organizations due to its advantage of allowing universal access with low cost. Attribute-based encryption (ABE is a kind of public key encryption suitable for cloud storage. The secret key of each user and the ciphertext are associated with an access policy and an attribute set, respectively; in addition to holding a secret key, one can decrypt a ciphertext only if the associated attributes match the predetermined access policy, which allows one to enforce fine-grained access control on outsourced files. One issue in existing ABE schemes is that they are designed for the users of a single organization. When one wants to share the data with the users of different organizations, the owner needs to encrypt the messages to the receivers of one organization and then repeats this process for another organization. This situation is deteriorated with more and more mobile devices using cloud services, as the ABE encryption process is time consuming and may exhaust the power supplies of the mobile devices quickly. In this paper, we propose a batch attribute-based encryption (BABE approach to address this problem in a provably-secure way. With our approach, the data owner can outsource data in batches to the users of different organizations simultaneously. The data owner is allowed to decide the receiving organizations and the attributes required for decryption. Theoretical and experimental analyses show that our approach is more efficient than traditional encryption implementations in computation and communication.
Experimental multiplexing protocol to encrypt messages of any length
Fredy Barrera, John; Vélez, Alejandro; Torroba, Roberto
2013-05-01
As optical systems are diffraction limited, it is not possible to encrypt in a single step texts containing a large amount of characters. We overcome this situation by separately encrypting several characters, along with a multiplexing procedure to obtain an encrypted keyboard. The experimental application is performed in a joint transform correlator architecture and using digital holography. We combine the different characters into a keyboard encrypted with a single phase mask together with a selection-position key that gives the right sequence to recover safe encrypted messages. The multiplexing operation we suggest is advantageous in the sense that the technique enables processing of messages that otherwise the optical system could not process in a single step. We also employ a repositioning technique to prevent both the natural background noise over recovered characters and the possible cross talk. The lack of any single key avoids the correct message recovery. Experimental results are presented to show the feasibility of our proposal, representing an actual application of the optical encrypting protocols.
Wu, Chensheng; Ko, Jonathan; Rzasa, John Robertson; Davis, Christopher C.
2017-08-01
The image encryption and decryption technique using lens components and random phase screens has attracted a great deal of research interest in the past few years. In general, the optical encryption technique can translate a positive image into an image with nearly a white speckle pattern that is impossible to decrypt. However, with the right keys as conjugated random phase screens, the white noise speckle pattern can be decoded into the original image. We find that the fundamental ideas in image encryption can be borrowed and applied to carry out beam corrections through turbulent channels. Based on our detailed analysis, we show that by using two deformable mirrors arranged in similar fashions as in the image encryption technique, a large number of controllable phase and amplitude distribution patterns can be generated from a collimated Gaussian beam. Such a result can be further coupled with wavefront sensing techniques to achieve laser beam correction against turbulence distortions. In application, our approach leads to a new type of phase conjugation mirror that could be beneficial for directed energy systems.
Mixed basin boundary structures of chaotic systems
International Nuclear Information System (INIS)
Rosa, E. Jr.; Ott, E.
1999-01-01
Motivated by recent numerical observations on a four-dimensional continuous-time dynamical system, we consider different types of basin boundary structures for chaotic systems. These general structures are essentially mixtures of the previously known types of basin boundaries where the character of the boundary assumes features of the previously known boundary types at different points arbitrarily finely interspersed in the boundary. For example, we discuss situations where an everywhere continuous boundary that is otherwise smooth and differentiable at almost every point has an embedded uncountable, zero Lebesgue measure set of points at which the boundary curve is nondifferentiable. Although the nondifferentiable set is only of zero Lebesgue measure, the curve close-quote s fractal dimension may (depending on parameters) still be greater than one. In addition, we discuss bifurcations from such a mixed boundary to a 'pure' boundary that is a fractal nowhere differentiable curve or surface and to a pure nonfractal boundary that is everywhere smooth. copyright 1999 The American Physical Society
Design and implementation of encrypted and decrypted file system based on USBKey and hardware code
Wu, Kehe; Zhang, Yakun; Cui, Wenchao; Jiang, Ting
2017-05-01
To protect the privacy of sensitive data, an encrypted and decrypted file system based on USBKey and hardware code is designed and implemented in this paper. This system uses USBKey and hardware code to authenticate a user. We use random key to encrypt file with symmetric encryption algorithm and USBKey to encrypt random key with asymmetric encryption algorithm. At the same time, we use the MD5 algorithm to calculate the hash of file to verify its integrity. Experiment results show that large files can be encrypted and decrypted in a very short time. The system has high efficiency and ensures the security of documents.
Chaos analysis of viscoelastic chaotic flows of polymeric fluids in a micro-channel
Energy Technology Data Exchange (ETDEWEB)
Lim, C. P.; Lam, Y. C., E-mail: myclam@ntu.edu.sg [School of Mechanical and Aerospace Engineering, Nanyang Technological University, 639798 (Singapore); BioSystems and Micromechanics (BioSyM) IRG, Singapore-MIT Alliance for Research and Technology (SMART) Centre, 138602 (Singapore); Han, J. [BioSystems and Micromechanics (BioSyM) IRG, Singapore-MIT Alliance for Research and Technology (SMART) Centre, 138602 (Singapore); Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States); Department of Biological Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States)
2015-07-15
Many fluids, including biological fluids such as mucus and blood, are viscoelastic. Through the introduction of chaotic flows in a micro-channel and the construction of maps of characteristic chaos parameters, differences in viscoelastic properties of these fluids can be measured. This is demonstrated by creating viscoelastic chaotic flows induced in an H-shaped micro-channel through the steady infusion of a polymeric fluid of polyethylene oxide (PEO) and another immiscible fluid (silicone oil). A protocol for chaos analysis was established and demonstrated for the analysis of the chaotic flows generated by two polymeric fluids of different molecular weight but with similar relaxation times. The flows were shown to be chaotic through the computation of their correlation dimension (D{sub 2}) and the largest Lyapunov exponent (λ{sub 1}), with D{sub 2} being fractional and λ{sub 1} being positive. Contour maps of D{sub 2} and λ{sub 1} of the respective fluids in the operating space, which is defined by the combination of polymeric fluids and silicone oil flow rates, were constructed to represent the characteristic of the chaotic flows generated. It was observed that, albeit being similar, the fluids have generally distinct characteristic maps with some similar trends. The differences in the D{sub 2} and λ{sub 1} maps are indicative of the difference in the molecular weight of the polymers in the fluids because the driving force of the viscoelastic chaotic flows is of molecular origin. This approach in constructing the characteristic maps of chaos parameters can be employed as a diagnostic tool for biological fluids and, more generally, chaotic signals.
Spread spectrum image data hiding in the encrypted discrete cosine transform coefficients
Zhang, Xiaoqiang; Wang, Z. Jane
2013-10-01
Digital watermarking and data hiding are important tools for digital rights protection of media data. Spread spectrum (SS)-based watermarking and data-hiding approaches are popular due to their outstanding robustness, but their security might not be sufficient. To improve the security of SS, a SS-based image data-hiding approach is proposed by encrypting the discrete cosine transform coefficients of the host image with the piecewise linear chaotic map, before the operation of watermark embedding. To evaluate the performance of the proposed approach, simulations and analyses of its robustness and security are carried out. The average bit-error-rate values on 100 real images from the Berkeley segmentation dataset under the JPEG compression, additive Gaussian noise, salt and pepper noise, and cropping attacks are reported. Experimental results show that the proposed approach can maintain the high robustness of traditional SS schemes and, meanwhile, also improve the security. The proposed approach can extend the key space of traditional SS schemes from 10 to 10 and thus can resist brute-force attack and unauthorized detection watermark attack.
Cros, Anne; Castillo Flores, Fernando; Le Gal, Patrice
2008-11-01
We present the experimental study of a collapsible tube conveying an ascending air flow. An extreme of the membrane tube is mounted on the air blower exit, while the other extreme is free. The flow velocity can be varied. For low speeds -- and tubes short enough -- the cylinder stands up (stable state). As the velocity is increased, the system presents sporadic turbulent fluctuations, when the tube bends and rises again. As the air speed is increased again, the intermittent events become more and more frequent. Films realized in front of the system permit to observe waves that propagate in the tube. We measure that these waves have a sonic speed, confirming previous results. Moreover, films taken from the top of the system allow a quantitative characterization of the transition to chaos. By processing the images, we can reduce the evolution of the system to two states: stable (when it is raised) and chaotic (when the tube fluctuates). The histograms of unstable / stable states are coherent with an intermittent transition in the theory of chaos.
Chaotic mixing across oceanic jets
Miller, P.; Jones, C. K. R. T.; Haller, G.; Pratt, L.
1996-06-01
The perspective of geometric dynamical systems is used to study the transport of fluid across oceanic jets. We study the mixing associated with the simplest analytical models for jets, namely, neutral modes superimposed on a base mean flow, where the base flow and the neutral modes are approximately potential vorticity conserving. The base jet plus a single neutral mode is an integrable flow in the appropriate moving frame, and heteroclinic orbits act as impenetrable boundaries separating different regions of phase space. Superimposing more than one neutral mode results in the breakup of these heteroclinic orbits and associated chaotic mixing. Using a cusped jet model we study the case where the perturbation is periodic in time. We present numerical simulations of the Poincaré map along with calculations of the Melnikov integral which characterizes the exchange rate across such boundaries. The analytical and numerical results show that these models explain mixing along the edges of the jet, but do not appear to explain mixing across the body of the jet.
Mahmoud, Emad E.; Abood, Fatimah S.
In this paper, we will demonstrate the adaptive complex anti-lag synchronization (CALS) of two indistinguishable complex chaotic nonlinear systems with the parameters which are uncertain. The significance of CALS is not advised well in the literature yet. The CALS contains or consolidate two sorts of synchronizations (anti-lag synchronization ALS and lag synchronization LS). The state variable of the master system synchronizes with an alternate state variable of the slave system. Depending on the function of Lyapunov, a plan is orchestrated to achieve CALS of chaotic attractors of complex systems with unverifiable parameters. CALS of two indistinguishable complexes of Lü systems is viewed as, for example, an occasion for affirming the likelihood of the plan exhibited. In physics, we can see complex chaotic systems in numerous different applications, for example, applied sciences or engineering. With a specific end goal to affirm the proposed synchronization plan viability and demonstrate the hypothetical outcomes, we can compute the numerical simulation. The above outcomes will give the hypothetical establishment to the secure communication applications. CALS of complex chaotic systems in which a state variable of the master system synchronizes with an alternate state variable of the slave system is an encouraging sort of synchronization as it contributes excellent security in secure communication. Amid this secure communication, the synchronization between transmitter and collector is shut and message signals are recouped. The encryption and restoration of the signals are simulated numerically.
Composing chaotic music from the letter m
Sotiropoulos, Anastasios D.
Chaotic music is composed from a proposed iterative map depicting the letter m, relating the pitch, duration and loudness of successive steps. Each of the two curves of the letter m is based on the classical logistic map. Thus, the generating map is xn+1 = r xn(1/2 - xn) for xn between 0 and 1/2 defining the first curve, and xn+1 = r (xn - 1/2)(1 - xn) for xn between 1/2 and 1 representing the second curve. The parameter r which determines the height(s) of the letter m varies from 2 to 16, the latter value ensuring fully developed chaotic solutions for the whole letter m; r = 8 yielding full chaotic solutions only for its first curve. The m-model yields fixed points, bifurcation points and chaotic regions for each separate curve, as well as values of the parameter r greater than 8 which produce inter-fixed points, inter-bifurcation points and inter-chaotic regions from the interplay of the two curves. Based on this, music is composed from mapping the m- recurrence model solutions onto actual notes. The resulting musical score strongly depends on the sequence of notes chosen by the composer to define the musical range corresponding to the range of the chaotic mathematical solutions x from 0 to 1. Here, two musical ranges are used; one is the middle chromatic scale and the other is the seven- octaves range. At the composer's will and, for aesthetics, within the same composition, notes can be the outcome of different values of r and/or shifted in any octave. Compositions with endings of non-repeating note patterns result from values of r in the m-model that do not produce bifurcations. Scores of chaotic music composed from the m-model and the classical logistic model are presented.
International Nuclear Information System (INIS)
Jing, Wang; Zhen-Yu, Tan; Xi-Kui, Ma; Jin-Feng, Gao
2009-01-01
A novel adaptive observer-based control scheme is presented for synchronization and suppression of a class of uncertain chaotic system. First, an adaptive observer based on an orthogonal neural network is designed. Subsequently, the sliding mode controllers via the proposed adaptive observer are proposed for synchronization and suppression of the uncertain chaotic systems. Theoretical analysis and numerical simulation show the effectiveness of the proposed scheme. (general)
Qualitative feature extractions of chaotic systems
International Nuclear Information System (INIS)
Vicha, T.; Dohnal, M.
2008-01-01
The theory of chaos offers useful tools for systems analysis. However, models of complex systems are based on a network of inconsistent, space and uncertain knowledge items. Traditional quantitative methods of chaos analysis are therefore not applicable. The paper by the same authors [Vicha T, Dohnal M. Qualitative identification of chaotic systems behaviours. Chaos, Solitons and Fractals, in press, [Log. No. 601019] ] presents qualitative interpretation of some chaos concepts. There are only three qualitative values positive/increasing, negative/decreasing and zero/constant. It means that any set of qualitative multidimensional descriptions of unsteady state behaviours is discrete and finite. A finite upper limit exists for the total number of qualitatively distinguishable scenarios. A set of 21 published chaotic models is solved qualitatively and 21 sets of all existing qualitative scenarios are presented. The intersection of all 21 scenario sets is empty. There is no such a behaviour which is common for all 21 models. The set of 21 qualitative models (e.g. Lorenz, Roessler) can be used to compare chaotic behaviours of an unknown qualitative model with them to evaluate if its chaotic behaviours is close to e.g. Lorenz chaotic model and how much
Universal Intelligent Data Encryption Standards: A Review
Directory of Open Access Journals (Sweden)
Renjith V Ravi
2014-06-01
Full Text Available -The most challenging aspects in the word of electronic communication is nothing but the data security. The significance of the exchanged data over the internet and other media types are increasing. One of the most interesting subjects in the security related communities is the hunt for the best solution to offer an essential protection against the data intruders’ attacks together with providing these services in time. Cryptography is the one of the main category of data security which converts information from its original form into an unreadable form. There are two main uniqueness to distinguish an encryption system from another are its ability to secure the protected data against cryptanalytic attacks and its speed and efficiency in the process.Cryptographic research has a common objective to design protocols that offer a confidential and authenticated transmission channel for messages over an insecure network. If a cryptographic algorithm is said to be computationally secured, it cannot be broken with typical resources, either present or future and apart from the algorithm, key distribution is also more important to make an proficient cryptographic system.
Session Initiation Protocol Network Encryption Device Plain Text Domain Discovery Service
National Research Council Canada - National Science Library
Robson, Christopher L
2007-01-01
... cryptographic devices implementing this technology, to find and exchange plain text domain (PTD) information. Additionally, SIP-DS will allow one encryption device to proxy PTD information for other encryption devices unable to implement this method.
Photonic encryption : modeling and functional analysis of all optical logic.
Energy Technology Data Exchange (ETDEWEB)
Tang, Jason D.; Schroeppel, Richard Crabtree; Robertson, Perry J.
2004-10-01
With the build-out of large transport networks utilizing optical technologies, more and more capacity is being made available. Innovations in Dense Wave Division Multiplexing (DWDM) and the elimination of optical-electrical-optical conversions have brought on advances in communication speeds as we move into 10 Gigabit Ethernet and above. Of course, there is a need to encrypt data on these optical links as the data traverses public and private network backbones. Unfortunately, as the communications infrastructure becomes increasingly optical, advances in encryption (done electronically) have failed to keep up. This project examines the use of optical logic for implementing encryption in the photonic domain to achieve the requisite encryption rates. This paper documents the innovations and advances of work first detailed in 'Photonic Encryption using All Optical Logic,' [1]. A discussion of underlying concepts can be found in SAND2003-4474. In order to realize photonic encryption designs, technology developed for electrical logic circuits must be translated to the photonic regime. This paper examines S-SEED devices and how discrete logic elements can be interconnected and cascaded to form an optical circuit. Because there is no known software that can model these devices at a circuit level, the functionality of S-SEED devices in an optical circuit was modeled in PSpice. PSpice allows modeling of the macro characteristics of the devices in context of a logic element as opposed to device level computational modeling. By representing light intensity as voltage, 'black box' models are generated that accurately represent the intensity response and logic levels in both technologies. By modeling the behavior at the systems level, one can incorporate systems design tools and a simulation environment to aid in the overall functional design. Each black box model takes certain parameters (reflectance, intensity, input response), and models the optical ripple
Comparable Encryption Scheme over Encrypted Cloud Data in Internet of Everything
Directory of Open Access Journals (Sweden)
Qian Meng
2017-01-01
Full Text Available User authentication has been widely deployed to prevent unauthorized access in the new era of Internet of Everything (IOE. When user passes the legal authentication, he/she can do series of operations in database. We mainly concern issues of data security and comparable queries over ciphertexts in IOE. In traditional database, a Short Comparable Encryption (SCE scheme has been widely used by authorized users to conduct comparable queries over ciphertexts, but existing SCE schemes still incur high storage and computational overhead as well as economic burden. In this paper, we first propose a basic Short Comparable Encryption scheme based on sliding window method (SCESW, which can significantly reduce computational and storage burden as well as enhance work efficiency. Unfortunately, as the cloud service provider is a semitrusted third party, public auditing mechanism needs to be furnished to protect data integrity. To further protect data integrity and reduce management overhead, we present an enhanced SCESW scheme based on position-aware Merkle tree, namely, PT-SCESW. Security analysis proves that PT-SCESW and SCESW schemes can guarantee completeness and weak indistinguishability in standard model. Performance evaluation indicates that PT-SCESW scheme is efficient and feasible in practical applications, especially for smarter and smaller computing devices in IOE.
Security encryption for video-on-radio devices
Perrone, Antonio L.; Basti, Gianfranco
2002-03-01
In this paper we present an encryption module included in the Subsidiary Communication Channel (SCC) System we are developing for video-on-FM radio broadcasting. This module is aimed to encrypt by symmetric key the video image archive and real-time database of the broadcaster, and by asymmetric key the video broadcasting to final users. The module includes our proprietary Techniteia Encryption Library (TEL), that is already successfully running and securing several e-commerce portals in Europe. TEL is written in C-ANSI language for its easy exportation onto all main platforms and it is optimized for real-time applications. It is based on the blowfish encryption algorithm and it is characterized by a physically separated sub-module for the automatic generation/recovering of the variable sub-keys of the blowfish algorithm. In this way, different parts of the database are encrypted by different keys, both in space and in time, for granting an optimal security.
Searchable Data Vault: Encrypted Queries in Secure Distributed Cloud Storage
Directory of Open Access Journals (Sweden)
Geong Sen Poh
2017-05-01
Full Text Available Cloud storage services allow users to efficiently outsource their documents anytime and anywhere. Such convenience, however, leads to privacy concerns. While storage providers may not read users’ documents, attackers may possibly gain access by exploiting vulnerabilities in the storage system. Documents may also be leaked by curious administrators. A simple solution is for the user to encrypt all documents before submitting them. This method, however, makes it impossible to efficiently search for documents as they are all encrypted. To resolve this problem, we propose a multi-server searchable symmetric encryption (SSE scheme and construct a system called the searchable data vault (SDV. A unique feature of the scheme is that it allows an encrypted document to be divided into blocks and distributed to different storage servers so that no single storage provider has a complete document. By incorporating the scheme, the SDV protects the privacy of documents while allowing for efficient private queries. It utilizes a web interface and a controller that manages user credentials, query indexes and submission of encrypted documents to cloud storage services. It is also the first system that enables a user to simultaneously outsource and privately query documents from a few cloud storage services. Our preliminary performance evaluation shows that this feature introduces acceptable computation overheads when compared to submitting documents directly to a cloud storage service.
2015-01-01
We present and discuss philosophy and methodology of chaotic evolution that is theoretically supported by chaos theory. We introduce four chaotic systems, that is, logistic map, tent map, Gaussian map, and Hénon map, in a well-designed chaotic evolution algorithm framework to implement several chaotic evolution (CE) algorithms. By comparing our previous proposed CE algorithm with logistic map and two canonical differential evolution (DE) algorithms, we analyse and discuss optimization performance of CE algorithm. An investigation on the relationship between optimization capability of CE algorithm and distribution characteristic of chaotic system is conducted and analysed. From evaluation result, we find that distribution of chaotic system is an essential factor to influence optimization performance of CE algorithm. We propose a new interactive EC (IEC) algorithm, interactive chaotic evolution (ICE) that replaces fitness function with a real human in CE algorithm framework. There is a paired comparison-based mechanism behind CE search scheme in nature. A simulation experimental evaluation is conducted with a pseudo-IEC user to evaluate our proposed ICE algorithm. The evaluation result indicates that ICE algorithm can obtain a significant better performance than or the same performance as interactive DE. Some open topics on CE, ICE, fusion of these optimization techniques, algorithmic notation, and others are presented and discussed. PMID:25879067
Directory of Open Access Journals (Sweden)
Yan Pei
2015-01-01
Full Text Available We present and discuss philosophy and methodology of chaotic evolution that is theoretically supported by chaos theory. We introduce four chaotic systems, that is, logistic map, tent map, Gaussian map, and Hénon map, in a well-designed chaotic evolution algorithm framework to implement several chaotic evolution (CE algorithms. By comparing our previous proposed CE algorithm with logistic map and two canonical differential evolution (DE algorithms, we analyse and discuss optimization performance of CE algorithm. An investigation on the relationship between optimization capability of CE algorithm and distribution characteristic of chaotic system is conducted and analysed. From evaluation result, we find that distribution of chaotic system is an essential factor to influence optimization performance of CE algorithm. We propose a new interactive EC (IEC algorithm, interactive chaotic evolution (ICE that replaces fitness function with a real human in CE algorithm framework. There is a paired comparison-based mechanism behind CE search scheme in nature. A simulation experimental evaluation is conducted with a pseudo-IEC user to evaluate our proposed ICE algorithm. The evaluation result indicates that ICE algorithm can obtain a significant better performance than or the same performance as interactive DE. Some open topics on CE, ICE, fusion of these optimization techniques, algorithmic notation, and others are presented and discussed.
Pei, Yan
2015-01-01
We present and discuss philosophy and methodology of chaotic evolution that is theoretically supported by chaos theory. We introduce four chaotic systems, that is, logistic map, tent map, Gaussian map, and Hénon map, in a well-designed chaotic evolution algorithm framework to implement several chaotic evolution (CE) algorithms. By comparing our previous proposed CE algorithm with logistic map and two canonical differential evolution (DE) algorithms, we analyse and discuss optimization performance of CE algorithm. An investigation on the relationship between optimization capability of CE algorithm and distribution characteristic of chaotic system is conducted and analysed. From evaluation result, we find that distribution of chaotic system is an essential factor to influence optimization performance of CE algorithm. We propose a new interactive EC (IEC) algorithm, interactive chaotic evolution (ICE) that replaces fitness function with a real human in CE algorithm framework. There is a paired comparison-based mechanism behind CE search scheme in nature. A simulation experimental evaluation is conducted with a pseudo-IEC user to evaluate our proposed ICE algorithm. The evaluation result indicates that ICE algorithm can obtain a significant better performance than or the same performance as interactive DE. Some open topics on CE, ICE, fusion of these optimization techniques, algorithmic notation, and others are presented and discussed.
A Hybrid Chaotic Quantum Evolutionary Algorithm
DEFF Research Database (Denmark)
Cai, Y.; Zhang, M.; Cai, H.
2010-01-01
and enhance the global search ability. A large number of tests show that the proposed algorithm has higher convergence speed and better optimizing ability than quantum evolutionary algorithm, real-coded quantum evolutionary algorithm and hybrid quantum genetic algorithm. Tests also show that when chaos......A hybrid chaotic quantum evolutionary algorithm is proposed to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm. The proposed algorithm adopts the chaotic initialization method to generate initial population which will form...... a perfect distribution in feasible solution space in advantage of randomicity and non-repetitive ergodicity of chaos, the simple quantum rotation gate to update non-optimal individuals of population to reduce amount of computation, and the hybrid chaotic search strategy to speed up its convergence...
Describing chaotic attractors: Regular and perpetual points
Dudkowski, Dawid; Prasad, Awadhesh; Kapitaniak, Tomasz
2018-03-01
We study the concepts of regular and perpetual points for describing the behavior of chaotic attractors in dynamical systems. The idea of these points, which have been recently introduced to theoretical investigations, is thoroughly discussed and extended into new types of models. We analyze the correlation between regular and perpetual points, as well as their relation with phase space, showing the potential usefulness of both types of points in the qualitative description of co-existing states. The ability of perpetual points in finding attractors is indicated, along with its potential cause. The location of chaotic trajectories and sets of considered points is investigated and the study on the stability of systems is shown. The statistical analysis of the observing desired states is performed. We focus on various types of dynamical systems, i.e., chaotic flows with self-excited and hidden attractors, forced mechanical models, and semiconductor superlattices, exhibiting the universality of appearance of the observed patterns and relations.
Chaotic behavior learning of Chua's circuit
International Nuclear Information System (INIS)
Sun Jian-Cheng
2012-01-01
Least-square support vector machines (LS-SVM) are applied for learning the chaotic behavior of Chua's circuit. The system is divided into three multiple-input single-output (MISO) structures and the LS-SVM are trained individually. Comparing with classical approaches, the proposed one reduces the structural complexity and the selection of parameters is avoided. Some parameters of the attractor are used to compare the chaotic behavior of the reconstructed and the original systems for model validation. Results show that the LS-SVM combined with the MISO can be trained to identify the underlying link among Chua's circuit state variables, and exhibit the chaotic attractors under the autonomous working mode
Semi-classical quantization of chaotic billiards
International Nuclear Information System (INIS)
Smilansky, U.
1992-02-01
The semi-classical quantization of chaotic billiards will be developed using scattering theory approach. This will be used to introduce and explain the inherent difficulties in the semi-classical quantization of chaos, and to show some of the modern tools which were developed recently to overcome these difficulties. To this end, we shall first obtain a semi-classical secular equation which is based on a finite number of classical periodic orbits. We shall use it to derive some spectral properties, and in particular to investigate the relationship between spectral statistics of quantum chaotic systems and the predictions of random-matrix theory. We shall finally discuss an important family of chaotic billiard, whose statistics does not follow any of the canonical ensembles, (GOE,GUE,...) but rather, corresponds to a new universality class. (author)
Efficient Conditional Proxy Re-encryption with Chosen-Ciphertext Security
Weng, Jiang; Yang, Yanjiang; Tang, Qiang; Deng, Robert H.; Bao, Feng
Recently, a variant of proxy re-encryption, named conditional proxy re-encryption (C-PRE), has been introduced. Compared with traditional proxy re-encryption, C-PRE enables the delegator to implement fine-grained delegation of decryption rights, and thus is more useful in many applications. In this
Improving the pseudo-randomness properties of chaotic maps using deep-zoom
Machicao, Jeaneth; Bruno, Odemir M.
2017-05-01
A generalized method is proposed to compose new orbits from a given chaotic map. The method provides an approach to examine discrete-time chaotic maps in a "deep-zoom" manner by using k-digits to the right from the decimal separator of a given point from the underlying chaotic map. Interesting phenomena have been identified. Rapid randomization was observed, i.e., chaotic patterns tend to become indistinguishable when compared to the original orbits of the underlying chaotic map. Our results were presented using different graphical analyses (i.e., time-evolution, bifurcation diagram, Lyapunov exponent, Poincaré diagram, and frequency distribution). Moreover, taking advantage of this randomization improvement, we propose a Pseudo-Random Number Generator (PRNG) based on the k-logistic map. The pseudo-random qualities of the proposed PRNG passed both tests successfully, i.e., DIEHARD and NIST, and were comparable with other traditional PRNGs such as the Mersenne Twister. The results suggest that simple maps such as the logistic map can be considered as good PRNG methods.
Will Quantum Cosmology Resurrect Chaotic Inflation Model?
Kim, Sang Pyo; Kim, Won
2016-07-01
The single field chaotic inflation model with a monomial power greater than one seems to be ruled out by the recent Planck and WMAP CMB data while Starobinsky model with a higher curvature term seems to be a viable model. Higher curvature terms being originated from quantum fluctuations, we revisit the quantum cosmology of the Wheeler-DeWitt equation for the chaotic inflation model. The semiclassical cosmology emerges from quantum cosmology with fluctuations of spacetimes and matter when the wave function is peaked around the semiclassical trajectory with quantum corrections a la the de Broglie-Bohm pilot theory.
Searching of Chaotic Elements in Hydrology
Directory of Open Access Journals (Sweden)
Sorin VLAD
2014-03-01
Full Text Available Chaos theory offers new means of understanding and prediction of phenomena otherwise considered random and unpredictable. The signatures of chaos can be isolated by performing nonlinear analysis of the time series available. The paper presents the results obtained by conducting a nonlinear analysis of the time series of daily Siret river flow (located in the North-Eastern part of Romania. The time series analysis is recorded starting with January 1999 to July 2009. The attractor is embedded in the reconstructed phase space then the chaotic dynamics is revealed computing the chaotic invariants - correlation dimension and the maximum Lyapunov Exponent.
Chaotic behavior of a quantum waveguide
Energy Technology Data Exchange (ETDEWEB)
Pérez-Aguilar, H., E-mail: hiperezag@yahoo.com [Facultad de Ciencias Físico-Matemáticas, Universidad Michoacana de San Nicolás de Hidalgo, Av. Francisco J. Mújica S/N 58030, Morelia, Michoacán (Mexico); Mendoza-Suárez, A.; Tututi, E.S. [Facultad de Ciencias Físico-Matemáticas, Universidad Michoacana de San Nicolás de Hidalgo, Av. Francisco J. Mújica S/N 58030, Morelia, Michoacán (Mexico); Herrera-González, I.F. [Instituto de Física, Benemérita Universidad Autónoma de Puebla, Apartado Postal J-48, 72570 Puebla (Mexico)
2013-02-15
In this work we consider an infinite quantum waveguide composed of two periodic, hard walls, one-dimensional rippled surfaces. We find that, under certain conditions, the proposed system presents some traces of quantum chaos, when the corresponding classical limit has chaotic behavior. Thus, it is possible to obtain disordered probability densities in a system with smooth surfaces. When the system has chaotic behavior we show numerically that the correlation length of the autocorrelation function of the probability density goes to zero. To corroborate some properties obtained for infinite waveguide that are physically admissible, we study the corresponding finite version of this system.
Chaotic behavior of a quantum waveguide
International Nuclear Information System (INIS)
Pérez-Aguilar, H.; Mendoza-Suárez, A.; Tututi, E.S.; Herrera-González, I.F.
2013-01-01
In this work we consider an infinite quantum waveguide composed of two periodic, hard walls, one-dimensional rippled surfaces. We find that, under certain conditions, the proposed system presents some traces of quantum chaos, when the corresponding classical limit has chaotic behavior. Thus, it is possible to obtain disordered probability densities in a system with smooth surfaces. When the system has chaotic behavior we show numerically that the correlation length of the autocorrelation function of the probability density goes to zero. To corroborate some properties obtained for infinite waveguide that are physically admissible, we study the corresponding finite version of this system
Transport phenomena in chaotic laminar flows.
Sundararajan, Pavithra; Stroock, Abraham D
2012-01-01
In many important chemical processes, the laminar flow regime is inescapable and defines the performance of reactors, separators, and analytical instruments. In the emerging field of microchemical process or lab-on-a-chip, this constraint is particularly rigid. Here, we review developments in the use of chaotic laminar flows to improve common transport processes in this regime. We focus on four: mixing, interfacial transfer, axial dispersion, and spatial sampling. Our coverage demonstrates the potential for chaos to improve these processes if implemented appropriately. Throughout, we emphasize the usefulness of familiar theoretical models of transport for processes occurring in chaotic flows. Finally, we point out open challenges and opportunities in the field.
SUGRA chaotic inflation and moduli stabilisation
International Nuclear Information System (INIS)
Davis, S.C.
2008-01-01
Chaotic inflation predicts a large gravitational wave signal which can be tested by the upcoming Planck satellite. We discuss a SUGRA implementation of chaotic inflation in the presence of moduli fields, and find that inflation does not work with a generic KKLT moduli stabilisation potential. A viable model can be constructed with a fine-tuned moduli sector, but only for a very specific choice of Kaeahler potential. Our analysis also shows that inflation models satisfying ∂ i W inf =0 for all inflation sector fields φ i can be combined successfully with a fine-tuned moduli sector. (orig.)
New prediction of chaotic time series based on local Lyapunov exponent
International Nuclear Information System (INIS)
Zhang Yong
2013-01-01
A new method of predicting chaotic time series is presented based on a local Lyapunov exponent, by quantitatively measuring the exponential rate of separation or attraction of two infinitely close trajectories in state space. After reconstructing state space from one-dimensional chaotic time series, neighboring multiple-state vectors of the predicting point are selected to deduce the prediction formula by using the definition of the local Lyapunov exponent. Numerical simulations are carried out to test its effectiveness and verify its higher precision over two older methods. The effects of the number of referential state vectors and added noise on forecasting accuracy are also studied numerically. (general)
Study of Wireless Authentication Center with Mixed Encryption in WSN
Directory of Open Access Journals (Sweden)
Yiqin Lu
2016-01-01
Full Text Available WSN (wireless sensor network has been used in a wide range of applications nowadays. Sensor networks may often relay critical data; thus, security must be a high priority. However, due to their limited computational, energy, and storage resources, sensor nodes are vulnerable to attack. So how to protect sensor nodes from attacks without raising computational capability and energy consumption is a worthwhile issue. A WAC (wireless authentication center with mixed encryption named “MEWAC” is proposed. MEWAC is based on MCU (Microcontroller Unit and WiFi (Wireless Fidelity module and uses RSA, AES (Advanced Encryption Standard, and SHA-1 (Secure Hash Algorithm 1 to provide high performance authentication and data encryption services for sensor nodes. The experimental results show that MEWAC has the advantages of low cost, low power consumption, good performance, and stability; moreover, the authentication protocol improves the security of WSN and reduces the overhead in node authentication.
Encrypted data inquiries using chained perfect hashing (CPH)
Kaabneh, Khalid; Tarawneh, Hassan; Alhadid, Issam
2017-09-01
Cryptography is the practice of transforming data to indecipherable by a third party, unless a particular piece of secret information is made available to them. Data encryption has been paid a great attention to protect data. As data sizes are growing, so does the need for efficient data search while being encrypted to protect it during transmission and storage. This research is based on our previous and continuous work to speed up and enhance global heuristic search on an encrypted data. This research is using chained hashing approach to reduce the search time and decrease the collision rate which most search techniques suffers from. The results were very encouraging and will be discussed in the experimental results section.
Cryptanalysis of an image encryption algorithm based on DNA encoding
Akhavan, A.; Samsudin, A.; Akhshani, A.
2017-10-01
Recently an image encryption algorithm based on DNA encoding and the Elliptic Curve Cryptography (ECC) is proposed. This paper aims to investigate the security the DNA-based image encryption algorithm and its resistance against chosen plaintext attack. The results of the analysis demonstrate that security of the algorithm mainly relies on one static shuffling step, with a simple confusion operation. In this study, a practical plain image recovery method is proposed, and it is shown that the images encrypted with the same key could easily be recovered using the suggested cryptanalysis method with as low as two chosen plain images. Also, a strategy to improve the security of the algorithm is presented in this paper.
Remote-sensing image encryption in hybrid domains
Zhang, Xiaoqiang; Zhu, Guiliang; Ma, Shilong
2012-04-01
Remote-sensing technology plays an important role in military and industrial fields. Remote-sensing image is the main means of acquiring information from satellites, which always contain some confidential information. To securely transmit and store remote-sensing images, we propose a new image encryption algorithm in hybrid domains. This algorithm makes full use of the advantages of image encryption in both spatial domain and transform domain. First, the low-pass subband coefficients of image DWT (discrete wavelet transform) decomposition are sorted by a PWLCM system in transform domain. Second, the image after IDWT (inverse discrete wavelet transform) reconstruction is diffused with 2D (two-dimensional) Logistic map and XOR operation in spatial domain. The experiment results and algorithm analyses show that the new algorithm possesses a large key space and can resist brute-force, statistical and differential attacks. Meanwhile, the proposed algorithm has the desirable encryption efficiency to satisfy requirements in practice.
An Efficient Symmetric Searchable Encryption Scheme for Cloud Storage
Directory of Open Access Journals (Sweden)
Xiuxiu Jiang
2017-05-01
Full Text Available Symmetric searchable encryption for cloud storage enables users to retrieve the documents they want in a privacy-preserving way, which has become a hotspot of research. In this paper, we propose an efficient keyword search scheme over encrypted cloud data. We firstly adopt a structure named as inverted matrix (IM to build search index. The IM is consisted of index vectors, each of which is associated with a keyword. Then we map a keyword to an address used to locate the corresponding index vector. Finally, we mask index vectors with pseudo-random bits to obtain an encrypted enlarged inverted matrix (EEIM. Through the security analysis and experimental evaluation, we demonstrate the privacy and efficiency of our scheme respectively. In addition, we further consider two extended practical search situations, i.e., occurrence queries and dynamic user management, and then give two relevant schemes.
A first approach on an RGB image encryption
Kumar, Manish; Mishra, D. C.; Sharma, R. K.
2014-01-01
Image encryption and decryption are essential for securing images from various types of security attacks. In this paper, we have proposed a first approach for an RGB image encryption and decryption using two stage random matrix affine cipher associated with discrete wavelet transformation. Earlier proposed schemes for encoding and decoding of images discussed only about the keys, but in our proposed approach, keys and the arrangement of RMAC parameters are mandatory. We have also formulated a formula for all the possible range to choose keys for encrypting and decrypting an RGB image. Computer simulation with a standard example and result is given to analyze the capability of the proposed approach. We have given security analysis and comparison between our proposed technique and others to support for robustness of the approach. This approach can be used for transmission of image data efficiently and securely.
Digital Sound Encryption with Logistic Map and Number Theoretic Transform
Satria, Yudi; Gabe Rizky, P. H.; Suryadi, MT
2018-03-01
Digital sound security has limits on encrypting in Frequency Domain. Number Theoretic Transform based on field (GF 2521 – 1) improve and solve that problem. The algorithm for this sound encryption is based on combination of Chaos function and Number Theoretic Transform. The Chaos function that used in this paper is Logistic Map. The trials and the simulations are conducted by using 5 different digital sound files data tester in Wave File Extension Format and simulated at least 100 times each. The key stream resulted is random with verified by 15 NIST’s randomness test. The key space formed is very big which more than 10469. The processing speed of algorithm for encryption is slightly affected by Number Theoretic Transform.
Optical cryptanalysis of DRPE-based encryption systems
Qin, Wan; He, Wenqi; Meng, Xiangfeng; Peng, Xiang
2009-11-01
In this paper, we analyze the security of the classical double random phase encoding (DRPE) technique in Fourier domain, as well as its extended schemes in Fresnel and fractional Fourier domains. These schemes are resistant to bruteforce attacks, for their large key spaces. However, due to the linearity property of their encryption transformations, they are vulnerable to other attacks, such as chosen-plaintext attack and known-plaintext attack. We successfully break each of the three encryption schemes with the help of a certain quantity of plaintext-ciphertext pairs. Each attack is validated by computer simulations. The cryptanalysis indicates that, to minimize the risks, it is recommendable to introduce nonlinear operations to optical encryption systems.
Chaotic dynamics in optimal monetary policy
Gomes, O.; Mendes, V. M.; Mendes, D. A.; Sousa Ramos, J.
2007-05-01
There is by now a large consensus in modern monetary policy. This consensus has been built upon a dynamic general equilibrium model of optimal monetary policy as developed by, e.g., Goodfriend and King [ NBER Macroeconomics Annual 1997 edited by B. Bernanke and J. Rotemberg (Cambridge, Mass.: MIT Press, 1997), pp. 231 282], Clarida et al. [J. Econ. Lit. 37, 1661 (1999)], Svensson [J. Mon. Econ. 43, 607 (1999)] and Woodford [ Interest and Prices: Foundations of a Theory of Monetary Policy (Princeton, New Jersey, Princeton University Press, 2003)]. In this paper we extend the standard optimal monetary policy model by introducing nonlinearity into the Phillips curve. Under the specific form of nonlinearity proposed in our paper (which allows for convexity and concavity and secures closed form solutions), we show that the introduction of a nonlinear Phillips curve into the structure of the standard model in a discrete time and deterministic framework produces radical changes to the major conclusions regarding stability and the efficiency of monetary policy. We emphasize the following main results: (i) instead of a unique fixed point we end up with multiple equilibria; (ii) instead of saddle-path stability, for different sets of parameter values we may have saddle stability, totally unstable equilibria and chaotic attractors; (iii) for certain degrees of convexity and/or concavity of the Phillips curve, where endogenous fluctuations arise, one is able to encounter various results that seem intuitively correct. Firstly, when the Central Bank pays attention essentially to inflation targeting, the inflation rate has a lower mean and is less volatile; secondly, when the degree of price stickiness is high, the inflation rate displays a larger mean and higher volatility (but this is sensitive to the values given to the parameters of the model); and thirdly, the higher the target value of the output gap chosen by the Central Bank, the higher is the inflation rate and its
International Nuclear Information System (INIS)
Yang Dong-Sheng; Liu Zhen-Wei; Liu Zhao-Bing; Zhao Yan
2012-01-01
The networked synchronization problem of a class of master-slave chaotic systems with time-varying communication topologies is investigated in this paper. Based on algebraic graph theory and matrix theory, a simple linear state feedback controller is designed to synchronize the master chaotic system and the slave chaotic systems with a time-varying communication topology connection. The exponential stability of the closed-loop networked synchronization error system is guaranteed by applying Lyapunov stability theory. The derived novel criteria are in the form of linear matrix inequalities (LMIs), which are easy to examine and tremendously reduce the computation burden from the feedback matrices. This paper provides an alternative networked secure communication scheme which can be extended conveniently. An illustrative example is given to demonstrate the effectiveness of the proposed networked synchronization method. (general)
Awrejcewicz, J.; Krysko, A. V.; Pavlov, S. P.; Zhigalov, M. V.; Krysko, V. A.
2017-09-01
Chaotic dynamics of microbeams made of functionally graded materials (FGMs) is investigated in this paper based on the modified couple stress theory and von Kármán geometric nonlinearity. We assume that the beam properties are graded along the thickness direction. The influence of size-dependent and functionally graded coefficients on the vibration characteristics, scenarios of transition from regular to chaotic vibrations as well as a series of static problems with an emphasis put on the load-deflection behavior are studied. Our theoretical/numerical analysis is supported by methods of nonlinear dynamics and the qualitative theory of differential equations supplemented by Fourier and wavelet spectra, phase portraits, and Lyapunov exponents spectra estimated by different algorithms, including Wolf's, Rosenstein's, Kantz's, and neural networks. We have also detected and numerically validated a general scenario governing transition into chaotic vibrations, which follows the classical Ruelle-Takens-Newhouse scenario for the considered values of the size-dependent and grading parameters.
A time-delayed method for controlling chaotic maps
International Nuclear Information System (INIS)
Chen Maoyin; Zhou Donghua; Shang Yun
2005-01-01
Combining the repetitive learning strategy and the optimality principle, this Letter proposes a time-delayed method to control chaotic maps. This method can effectively stabilize unstable periodic orbits within chaotic attractors in the sense of least mean square. Numerical simulations of some chaotic maps verify the effectiveness of this method
Pattern formations in chaotic spatio-temporal systems
Indian Academy of Sciences (India)
[2], synergetic self-organizations [3,4] and other pattern formation topics have stim- ulated continual interest in nonequilibrium statistics and thermodynamics as well as ..... chaotic spatio-temporal systems such as coupled chaotic maps and chaotic partial differential equations. Further investigations in this direction may be of ...
Synchronization of two different chaotic systems via nonlinear ...
African Journals Online (AJOL)
ADOWIE PERE
ABSTRACT: This work reports the synchronization of a pair of four chaotic systems via nonlinear control technique. This method has been found to be easy to implement and effective especially on two different chaotic systems. We paired four chaotic systems out of which one is new and we have six possible pairs.
Recognizing chaotic states in stadium billiard by calculating gyration radius
Directory of Open Access Journals (Sweden)
M. Barezi
2006-12-01
Full Text Available Nowadays study of chaotic quantum billiards because of their relation to Nano technology. In this paper distribution of zeros of wave function on the boundary of two circular and stadium billiards are investigated. By calculating gyration radius for these points chaotic and non-chaotic states are distinguished.
Directory of Open Access Journals (Sweden)
Boriša Ž. Jovanović
2010-10-01
Full Text Available Digitalni multimedijalni sadržaj postaje zastupljeniji i sve više se razmenjuje putem računarskih mreža i javnih kanala (satelitske komunikacije, bežične mreže, internet, itd. koji predstavljaju nebezbedne medijume za prenos informacija osetljive sadržine. Sve više na značaju dobijaju mehanizmi kriptološke zaštite slika i video sadržaja. Tradicionalni sistemi kriptografske obrade u sistemima za prenos ovih vrsta informacija garantuju visok stepen sigurnosti, ali i imaju svoje nedostatke - visoku cenu implementacije i znatno kašnjenje u prenosu podataka. Pomenuti nedostaci se prevazilaze primenom algoritama selektivnog šifrovanja. / Digital multimedia content is becoming widely used and increasingly exchanged over computer network and public channels (satelite, wireless networks, Internet, etc. which is unsecured transmission media for ex changing that kind of information. Mechanisms made to encrypt image and video data are becoming more and more significant. Traditional cryptographic techniques can guarantee a high level of security but at the cost of expensive implementation and important transmission delays. These shortcomings can be exceeded using selective encryption algorithms. Introduction In traditional image and video content protection schemes, called fully layered, the whole content is first compressed. Then, the compressed bitstream is entirely encrypted using a standard cipher (DES - Data Encryption Algorithm, IDEA - International Data Encryption Algorithm, AES - Advanced Encryption Algorithm etc.. The specific characteristics of this kind of data, high-transmission rate with limited bandwidth, make standard encryption algorithms inadequate. Another limitation of traditional systems consists of altering the whole bitstream syntax which may disable some codec functionalities on the delivery site coder and decoder on the receiving site. Selective encryption is a new trend in image and video content protection. As its
Sinha, Nitish; Singh, Arun K.; Singh, Trilok N.
2018-04-01
A fundamental understanding of frictional sliding at rock surfaces is of practical importance for nucleation and propagation of earthquakes and rock slope stability. We investigate numerically the effect of different physical parameters such as inertia, viscous damping, temperature and normal stress on the chaotic behaviour of the two state variables rate and state friction (2sRSF) model. In general, a slight variation in any of inertia, viscous damping, temperature and effective normal stress reduces the chaotic behaviour of the sliding system. However, the present study has shown the appearance of chaos for the specific values of normal stress before it disappears again as the normal stress varies further. It is also observed that magnitude of system stiffness at which chaotic motion occurs, is less than the corresponding value of critical stiffness determined by using the linear stability analysis. These results explain the practical observation why chaotic nucleation of an earthquake is a rare phenomenon as reported in literature.
On the synchronization of identical and non-identical 4-D chaotic systems using arrow form matrix
International Nuclear Information System (INIS)
Hammami, S.; Ben Saad, K.; Benrejeb, M.
2009-01-01
Using the Borne and Gentina practical criterion associated with the Benrejeb canonical arrow form matrix, to derive the stability property of dynamic complex systems, a new strategy of control is formulated for chaos synchronization of two identical Lorenz Stenflo systems and two new four-dimensional chaotic systems, namely the Qi chaotic systems. The designed controller ensures that the state variables of both controlled chaotic slave Lorenz Stenflo and Qi systems globally synchronizes with the state variables of the master systems, respectively. It is also shown that Qi system globally synchronizes with Lorenz Stenflo system under the afforded generalized strategy of control. Numerical simulations are carried out to assess the performance of the proposed contributions in the important field of chaotic synchronization.
Secure Count Query on Encrypted Genomic Data.
Hasan, Mohammad Zahidul; Rahman Mahdi, Md Safiur; Sadat, Md Nazmus; Mohammed, Noman
2018-03-14
Human genomic information can yield more effective healthcare by guiding medical decisions. Therefore, genomics research is gaining popularity as it can identify potential correlations between a disease and a certain gene, which improves the safety and efficacy of drug treatment and can also develop more effective prevention strategies [1]. To reduce the sampling error and to increase the statistical accuracy of this type of research projects, data from different sources need to be brought together since a single organization does not necessarily possess required amount of data. In this case, data sharing among multiple organizations must satisfy strict policies (for instance, HIPAA and PIPEDA) that have been enforced to regulate privacy-sensitive data sharing. Storage and computation on the shared data can be outsourced to a third party cloud service provider, equipped with enormous storage and computation resources. However, outsourcing data to a third party is associated with a potential risk of privacy violation of the participants, whose genomic sequence or clinical profile is used in these studies. In this article, we propose a method for secure sharing and computation on genomic data in a semi-honest cloud server. In particular, there are two main contributions. Firstly, the proposed method can handle biomedical data containing both genotype and phenotype. Secondly, our proposed index tree scheme reduces the computational overhead significantly for executing secure count query operation. In our proposed method, the confidentiality of shared data is ensured through encryption, while making the entire computation process efficient and scalable for cutting-edge biomedical applications. We evaluated our proposed method in terms of efficiency on a database of Single-Nucleotide Polymorphism (SNP) sequences, and experimental results demonstrate that the execution time for a query of 50 SNPs in a database of 50000 records is approximately 5 seconds, where each
Deformed GOE for systems with a few degrees of freedom in the chaotic regime
International Nuclear Information System (INIS)
Hussein, M.S.; Pato, M.P.
1990-01-01
New distribution laws for the energy level spacings and the eigenvector amplitudes, appropriate for systems with a few degrees of freedom in the chaotic regime, are derived by conveniently deforming the GOE. The cases of 2X2 and 3X3 matrices are fully worked out. Suggestions concerning the general case of matrices with large dimensions are made. (author)
The variation of the density functions on chaotic spheres in chaotic space-like Minkowski space time
International Nuclear Information System (INIS)
El-Ahmady, A.E.
2007-01-01
In this article we introduce types of chaotic spheres in chaotic space-like Minkowski space time M n+1 . The variations of the density functions under the folding of these chaotic spheres are defined. The foldings restriction imposed on the density function are also discussed. The relations between the folding of geometry and pure chaotic manifolds are deduced. Some theorems concerning these relations are presented
Interplay between chaotic and regular motion in a time-dependent barred galaxy model
Manos, T.; Bountis, T.; Skokos, Ch
2013-06-01
We study the distinction and quantification of chaotic and regular motion in a time-dependent Hamiltonian barred galaxy model. Recently, a strong correlation was found between the strength of the bar and the presence of chaotic motion in this system, as models with relatively strong bars were shown to exhibit stronger chaotic behavior compared to those having a weaker bar component. Here, we attempt to further explore this connection by studying the interplay between chaotic and regular behavior of star orbits when the parameters of the model evolve in time. This happens for example when one introduces linear time dependence in the mass parameters of the model to mimic, in some general sense, the effect of self-consistent interactions of the actual N-body problem. We thus observe, in this simple time-dependent model also, that the increase of the bar’s mass leads to an increase of the system’s chaoticity. We propose a new way of using the generalized alignment index (GALI) method as a reliable criterion to estimate the relative fraction of chaotic versus regular orbits in such time-dependent potentials, which proves to be much more efficient than the computation of Lyapunov exponents. In particular, GALI is able to capture subtle changes in the nature of an orbit (or ensemble of orbits) even for relatively small time intervals, which makes it ideal for detecting dynamical transitions in time-dependent systems. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Lyapunov analysis: from dynamical systems theory to applications’.
Characterizing cryptographic primitives for lightweight digital image encryption
Ahmed, Farid; Resch, Cheryl L.
2009-05-01
We present a statistical footprint-based method to characterize several symmetric cryptographic primitives as they are used in lightweight digital image encryption. In particular, using spatial-domain histogram and frequency-domain image analysis techniques, we identify a number of metrics from the encrypted images and use them to contrast the security performance of different cryptographic primitives. For each of the metrics, the best performing cryptographic primitive is identified. Complementary primitives are then combined to result in a product cipher with better cryptographic performance.
Public-Key Encryption with Non-interactive Opening
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Hofheinz, Dennis; Kiltz, Eike
2008-01-01
We formally define the primitive of public-key encryption with non-interactive opening (PKENO), where the receiver of a ciphertext C can, convincingly and without interaction, reveal what the result was of decrypting C, without compromising the scheme’s security. This has numerous applications in...... suggested that it could be implemented based on Identity-Based Encryption. In this paper, we give direct and optimized implementations, that work without having to keep state information, unlike what one obtains from directly using IBE....
Image Encryption Performance Evaluation Based on Poker Test
Directory of Open Access Journals (Sweden)
Shanshan Li
2016-01-01
Full Text Available The fast development of image encryption requires performance evaluation metrics. Traditional metrics like entropy do not consider the correlation between local pixel and its neighborhood. These metrics cannot estimate encryption based on image pixel coordinate permutation. A novel effectiveness evaluation metric is proposed in this paper to address the issue. The cipher text image is transformed to bit stream. Then, Poker Test is implemented. The proposed metric considers the neighbor correlations of image by neighborhood selection and clip scan. The randomness of the cipher text image is tested by calculating the chi-square test value. Experiment results verify the efficiency of the proposed metrics.
Encryption of 3D Point Cloud Object with Deformed Fringe
Directory of Open Access Journals (Sweden)
Xin Yang
2016-01-01
Full Text Available A 3D point cloud object encryption method was proposed with this study. With the method, a mapping relationship between 3D coordinates was formulated and Z coordinate was transformed to deformed fringe by a phase coding method. The deformed fringe and gray image were used for encryption and decryption with simulated off-axis digital Fresnel hologram. Results indicated that the proposed method is able to accurately decrypt the coordinates and gray image of the 3D object. The method is also robust against occlusion attacks.
Stochastic perturbations in open chaotic systems: random versus noisy maps.
Bódai, Tamás; Altmann, Eduardo G; Endler, Antonio
2013-04-01
We investigate the effects of random perturbations on fully chaotic open systems. Perturbations can be applied to each trajectory independently (white noise) or simultaneously to all trajectories (random map). We compare these two scenarios by generalizing the theory of open chaotic systems and introducing a time-dependent conditionally-map-invariant measure. For the same perturbation strength we show that the escape rate of the random map is always larger than that of the noisy map. In random maps we show that the escape rate κ and dimensions D of the relevant fractal sets often depend nonmonotonically on the intensity of the random perturbation. We discuss the accuracy (bias) and precision (variance) of finite-size estimators of κ and D, and show that the improvement of the precision of the estimations with the number of trajectories N is extremely slow ([proportionality]1/lnN). We also argue that the finite-size D estimators are typically biased. General theoretical results are combined with analytical calculations and numerical simulations in area-preserving baker maps.
Resonances in a Chaotic Attractor Crisis of the Lorenz Flow
Tantet, Alexis; Lucarini, Valerio; Dijkstra, Henk A.
2018-02-01
Local bifurcations of stationary points and limit cycles have successfully been characterized in terms of the critical exponents of these solutions. Lyapunov exponents and their associated covariant Lyapunov vectors have been proposed as tools for supporting the understanding of critical transitions in chaotic dynamical systems. However, it is in general not clear how the statistical properties of dynamical systems change across a boundary crisis during which a chaotic attractor collides with a saddle. This behavior is investigated here for a boundary crisis in the Lorenz flow, for which neither the Lyapunov exponents nor the covariant Lyapunov vectors provide a criterion for the crisis. Instead, the convergence of the time evolution of probability densities to the invariant measure, governed by the semigroup of transfer operators, is expected to slow down at the approach of the crisis. Such convergence is described by the eigenvalues of the generator of this semigroup, which can be divided into two families, referred to as the stable and unstable Ruelle-Pollicott resonances, respectively. The former describes the convergence of densities to the attractor (or escape from a repeller) and is estimated from many short time series sampling the state space. The latter is responsible for the decay of correlations, or mixing, and can be estimated from a long times series, invoking ergodicity. It is found numerically for the Lorenz flow that the stable resonances do approach the imaginary axis during the crisis, as is indicative of the loss of global stability of the attractor. On the other hand, the unstable resonances, and a fortiori the decay of correlations, do not flag the proximity of the crisis, thus questioning the usual design of early warning indicators of boundary crises of chaotic attractors and the applicability of response theory close to such crises.
Review Article: Hazards of Chaotic Importation, Certification ...
African Journals Online (AJOL)
Review Article: Hazards of Chaotic Importation, Certification, Distribution and Marketing of Medical Laboratory Consumables in Nigeria. BC Nlemadim. Abstract. No abstract. Journal of Medical Laboratory Science Vol.12(2) 2003: 25 - 27. Full Text: EMAIL FULL TEXT EMAIL FULL TEXT · DOWNLOAD FULL TEXT ...
Resonance eigenfunctions in chaotic scattering systems
Indian Academy of Sciences (India)
PRAMANA c Indian Academy of Sciences. Vol. 73, No. 3. — journal of. September 2009 physics pp. 543–551. Resonance eigenfunctions in chaotic scattering systems ... particularly convenient model is the baker map because its backward and forward ... One time step of the triadic baker map consists of stretching in.
Multiswitching compound antisynchronization of four chaotic systems
Indian Academy of Sciences (India)
Ayub Khan
2017-11-28
Nov 28, 2017 ... communication and information processing. (c) Suit- able controllers are constructed which, in special cases, adjust themselves accordingly to achieve novel modi- fied function projective antisynchronization where the scaling factor is a chaotic system. The paper is organized as follows. In §2 the formula-.
CHAOTIC DUFFING TYPE OSCILLATOR WITH INERTIAL DAMPING
DEFF Research Database (Denmark)
Tamaševicius, Arunas; Mykolaitis, Gytis; Kirvaitis, Raimundas
2009-01-01
A novel Duffing-Holmes type autonomous chaotic oscillator is described. In comparison with the well-known non-autonomous Duffing-Holmes circuit it lacks the external periodic drive, but includes two extra linear feedback sub-circuits, namely a direct positive feedback loop, and an inertial negati...
The transition to chaotic phase synchronization
Mosekilde, E.; Laugesen, J. L.; Zhusubaliyev, Zh. T.
2012-08-01
The transition to chaotic phase synchronization for a periodically driven spiral-type chaotic oscillator is known to involve a dense set of saddle-node bifurcations. By following the synchronization transition through the cascade of period-doubling bifurcations in a forced Rössler system, this paper describes how these saddle-node bifurcations arise and how their characteristic cyclic organisation develops. We identify the cycles that are involved in the various saddle-node bifurcations and descibe how the formation of multi-layered resonance cycles in the synchronization domain is related to the torus doubling bifurcations that take place outside this domain. By examining a physiology-based model of the blood flow regulation to the individual functional unit (nephron) of the kidney we demonstrate how a similar bifurcation structure may arise in this system as a response to a periodically varying arterial blood pressure. The paper finally discusses how an alternative transition to chaotic phase synchronization may occur in the mutual synchronization of two chaotically oscillating period-doubling systems.
Entanglement production in quantized chaotic systems
Indian Academy of Sciences (India)
eigenangles of UT , is Wigner distributed which is typical of any quantized chaotic systems [7,8]. Therefore, it is quite reasonable to expect that the statistical bound on entanglement can be estimated by random matrix modeling. The two RDMs, corresponding to two subsystems, have the structures A†A and AA†, where A is.
Design of Threshold Controller Based Chaotic Circuits
DEFF Research Database (Denmark)
Mohamed, I. Raja; Murali, K.; Sinha, Sudeshna
2010-01-01
We propose a very simple implementation of a second-order nonautonomous chaotic oscillator, using a threshold controller as the only source of nonlinearity. We demonstrate the efficacy and simplicity of our design through numerical and experimental results. Further, we show that this approach...
Economic dispatch using chaotic bat algorithm
International Nuclear Information System (INIS)
Adarsh, B.R.; Raghunathan, T.; Jayabarathi, T.; Yang, Xin-She
2016-01-01
This paper presents the application of a new metaheuristic optimization algorithm, the chaotic bat algorithm for solving the economic dispatch problem involving a number of equality and inequality constraints such as power balance, prohibited operating zones and ramp rate limits. Transmission losses and multiple fuel options are also considered for some problems. The chaotic bat algorithm, a variant of the basic bat algorithm, is obtained by incorporating chaotic sequences to enhance its performance. Five different example problems comprising 6, 13, 20, 40 and 160 generating units are solved to demonstrate the effectiveness of the algorithm. The algorithm requires little tuning by the user, and the results obtained show that it either outperforms or compares favorably with several existing techniques reported in literature. - Highlights: • The chaotic bat algorithm, a new metaheuristic optimization algorithm has been used. • The problem solved – the economic dispatch problem – is nonlinear, discontinuous. • It has number of equality and inequality constraints. • The algorithm has been demonstrated to be applicable on high dimensional problems.
Formulation of statistical mechanics for chaotic systems
Indian Academy of Sciences (India)
Here, we again strengthen the idea of statistical mechanics of chaotic systems using Kinchin's formulation based on microcanonical ensemble [13]. Further, we extend the study to canonical ensemble of such a system and as an example, we consider QO and obtain various thermodynamic quantities and the results are.
Resonance eigenfunctions in chaotic scattering systems
Indian Academy of Sciences (India)
We study the semiclassical structure of resonance eigenstates of open chaotic systems. We obtain semiclassical estimates for the weight of these states on different regions in phase space. These results imply that the long-lived right (left) eigenstates of the non-unitary propagator are concentrated in the semiclassical limit ħ ...
Chaotic behaviour of photonic crystals resonators
Di Falco, A.
2015-02-08
We show here theoretically and experimentally how chaotic Photonic Crystal resonators can be used for en- ergy harvesting applications and the demonstration of fundamental theories, like the onset of superradiance in quantum systems. © (2015) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Study of chaos in chaotic satellite systems
Indian Academy of Sciences (India)
Ayub Khan
2017-12-27
Dec 27, 2017 ... In this paper, we study the qualitative behaviour of satellite systems using bifurcation diagrams, Poincaré section, Lyapunov exponents .... The quantitative test for the chaotic behaviour can sometimes distinguish it ..... design and applications (CRC Press, Taylor and Francis. Group, 2013). [2] SDjaouida, Int.
Autonomous Duffing-Holmes Type Chaotic Oscillator
DEFF Research Database (Denmark)
Tamaševičius, A.; Bumelienė, S.; Kirvaitis, R.
2009-01-01
We have designed and built a novel Duffing type autonomous 3rd-order chaotic oscillator. In comparison with the common non-autonomous DuffingHolmes type oscillator the autonomous circuit has an internal positive feedback loop instead of an external periodic drive source. In addition...
Control of partial synchronization in chaotic oscillators
Indian Academy of Sciences (India)
2015-02-07
Feb 7, 2015 ... Abstract. A design of coupling is proposed to control partial synchronization in two chaotic oscil- lators in a driver–response mode. A control of synchrony between one response variables is made possible (a transition from a complete synchronization to antisynchronization via amplitude death and vice ...
Bidirectional communication using delay coupled chaotic directly ...
Indian Academy of Sciences (India)
Abstract. Chaotic synchronization of two directly modulated semiconductor lasers with negative delayed optoelectronic feedback is investigated and this scheme is found to be useful for efficient bidirectional communication between the lasers. A symmetric bidirec- tional coupling is identified as a suitable method for ...
Multiswitching combination–combination synchronization of chaotic ...
Indian Academy of Sciences (India)
2017-02-09
Feb 9, 2017 ... Abstract. In this paper, a novel synchronization scheme is investigated for a class of chaotic systems. The multiswitching synchronization scheme is extended to the combination–combination synchronization scheme such that the combination of state variables of two drive systems synchronize with different ...
Multiswitching compound antisynchronization of four chaotic systems
Indian Academy of Sciences (India)
Ayub Khan
2017-11-28
Nov 28, 2017 ... Abstract. Based on three drive–one response system, in this article, the authors investigate a novel synchronization scheme for a class of chaotic systems. The new scheme, multiswitching compound antisynchronization (MSCoAS), is a notable extension of the earlier multiswitching schemes concerning ...
Multiswitching combination–combination synchronization of chaotic ...
Indian Academy of Sciences (India)
In this paper, a novel synchronization scheme is investigated for a class of chaotic systems. Themultiswitching synchronization scheme is extended to the combination–combination synchronization scheme such that the combination of state variables of two drive systems synchronize with different combination of state ...
Multiswitching compound antisynchronization of four chaotic systems
Indian Academy of Sciences (India)
Based on three drive–one response system, in this article, the authors investigate a novel synchronization scheme for a class of chaotic systems. The new scheme, multiswitching compound antisynchronization (MSCoAS), is a notable extension of the earlier multiswitching schemes concerning only one drive–one response ...
Formulation of statistical mechanics for chaotic systems
Indian Academy of Sciences (India)
We formulate the statistical mechanics of chaotic system with few degrees of freedom and investigated the quartic oscillator system using microcanonical and canonical ensembles. Results of statistical mechanics are numerically verified by considering the dynamical evolution of quartic oscillator system with two degrees of ...
Comment on two papers of chaotic synchronization
International Nuclear Information System (INIS)
Li Lixiang; Peng Haipeng; Wang Xiangdong; Yang Yixian
2004-01-01
This Letter comments on two papers of chaotic synchronization, namely [Phys. Rev. Lett. 76 (1996) 1232] and [Phys. Lett. A 321 (2004) 50]. We find that some statements in the two papers are incorrect by numerical simulations. The consequence of the incorrectness is analyzed as well
Control of partial synchronization in chaotic oscillators
Indian Academy of Sciences (India)
2015-02-07
Feb 7, 2015 ... and vice versa without loss of synchrony) keeping the other pairs of variables undisturbed in their pre-desired states of ... follow the dynamics of an external signal (periodic or chaotic) while keeping the coherent status of other variables ...... Selected Papers on Mathematical Trends in Control Theory (1964).
Quantum Statistical Operator and Classically Chaotic Hamiltonian ...
African Journals Online (AJOL)
Quantum Statistical Operator and Classically Chaotic Hamiltonian System. ... Journal of the Nigerian Association of Mathematical Physics ... In a Hamiltonian system von Neumann Statistical Operator is used to tease out the quantum consequence of (classical) chaos engendered by the nonlinear coupling of system to its ...