Published on Oct 1, 2006in International Journal of Bifurcation and Chaos2.836
路 DOI :10.1142/S0218127406016574
Ping Li63
Estimated H-index: 63
(Rolf C. Hagen Group),
Zhong Li14
Estimated H-index: 14
(Rolf C. Hagen Group)
+ 1 AuthorsGuanrong Chen158
Estimated H-index: 158
(CityU: City University of Hong Kong)
A novel multiple-output pseudo-random-bit generator (PRBG) based on a coupled map lattice (CML) consisting of skew tent maps, which generates spatiotemporal chaos, is presented. In order to guarantee PRBG highly effective, avoiding synchronization among the sites in the CML is discussed. The cryptographic properties, such as probability distribution, auto-correlation and cross-correlation, of the PRBG with various parameters, are investigated numerically. The randomness of the PRBG is verified via FIPS 140-2. In addition, as compared with the PRBG based on the CML consisting of the logistic maps, which are often used in chaos-based PRBGs by many other researchers, the ranges of the parameters within which this multiple-output PRBG have good cryptographic properties are much bigger in terms of their cryptographic properties. It lays a foundation for designing a faster and more secure encryption.
馃摉 Papers frequently viewed together
7 Authors (Huaping Lu, ..., Gang Hu)
4 Authors (Ping Li, ..., Guanrong Chen)
#1Huaping Lu (BNU: Beijing Normal University)H-Index: 7
#2Shihong WangH-Index: 5
Last. Gang HuH-Index: 39
view all 7 authors...
A one-way-coupled chaotic map lattice is proposed for cryptography of self-synchronizing stream cipher. The system performs basic floating-point analytical computation on real numbers, incorporating auxiliarily with few simple algebraic operations on integer numbers. Parallel encryption (decryption) operations of multiple chaotic sites are conducted. It is observed that the system has high practical security, fast encryption (decryption) speed with software realization, and excellent reliability...
#1Shihong Wang (BNU: Beijing Normal University)H-Index: 5
#2Weirong Liu (BNU: Beijing Normal University)H-Index: 2
Last. Gang Hu (BNU: Beijing Normal University)H-Index: 39
view all 5 authors...
Fundamental problems of periodicity and transient process to periodicity of chaotic trajectories in computer realization with finite computation precision is investigated by taking single and coupled Logistic maps as examples. Empirical power law relations of the period and transient iterations with the computation precisions and the sizes of coupled systems are obtained. For each computation we always find, by randomly choosing initial conditions, a single dominant periodic trajectory which is ...
#1Shujun LiH-Index: 39
=漏A聡) Since 1980s, the idea of using digital chaotic systems to design new ciphers has attractedmore andmore attention. The use of chaos in cryptography depends on the natural relation between the two research areas: strong dynamical properties of chaotic systems implies strong cryptographical properties of cryptosystems, and the basic way to make cryptosystems have good strong cryptographical properties implies quasi-chaos (we even can find the phantom of chaos in Shanon鈥檚 classic paper on theo...
#1Ljupco Kocarev (UCSD: University of California, San Diego)H-Index: 44
#2Goce Jakimoski (UCSD: University of California, San Diego)H-Index: 6
Different possibilities of using chaotic maps as pseudorandom number generators are discussed. A class of chaos-based pseudorandom bit generators is constructed. We give simple arguments to explain the unpredictability of the generators.
Many kinds of chaotic cryptosystems have been proposed. Chaotic systems dissipate information due to orbital instability with positive Lyapunov exponents and ergodicity. If these properties are appropriately utilized, chaotic cryptosystems are supposed to realize high security. However, most of the existing secure communication techniques using chaos do not have enough security. For example, secure communication protocols based on chaos synchronization require robustness which gives useful infor...
#3Wai-Kai Chen (UIC: University of Illinois at Chicago)H-Index: 4
Based on chaotic maps, a simple method is given for obtaining the novel oversampled chaotic map (OSCM) binary sequences. Such sequences are a priori to chaotic map sequences in terms of the security. Furthermore, their balance property is optimal, the correlation properties of the two families are not clearly different, and the generation is easy. In this paper we also discuss the topological conjugation properties of the chaotic maps, analyze in details the reconstruction process of the chaotic...
#1Li Shujun (Xi'an Jiaotong University)H-Index: 2
#2Mou Xuanqin (Xi'an Jiaotong University)H-Index: 3
Last. Cai Yuanlong (Xi'an Jiaotong University)H-Index: 2
view all 3 authors...
Chaotic cryptology is widely investigated recently. This paper reviews the progress in this area and points out some existent problems in digital chaotic ciphers. As a comprehensive solution to these problems, a novel pseudo-random bit generator based on a couple of chaotic systems called CCS-PRBG is presented. Detailed theoretical analyses show that it has perfect cryptographic properties, and can be used to construct stream ciphers with higher security than other chaotic ciphers. Some experime...
#1Ljupco Kocarev (UCSD: University of California, San Diego)H-Index: 44
Over the past decade, there has been tremendous interest in studying the behavior of chaotic systems. They are characterized by sensitive dependence on initial conditions, similarity to random behavior, and continuous broad-band power spectrum. Chaos has potential applications in several functional blocks of a digital communication system: compression, encryption and modulation. The possibility for self-synchronization of chaotic oscillations has sparked an avalanche of works on application of c...
#1Robert C. HilbornH-Index: 1
#1Sang TaoH-Index: 1
#2Wang Ruli (CAS: Chinese Academy of Sciences)H-Index: 2
Last. Yan Yixun (CAS: Chinese Academy of Sciences)H-Index: 1
view all 3 authors...
The authors propose an algorithm based on a class of perturbance to solve the short cycle problem for chaotic cryptography systems. The lower bound of the extended cycle length can be specified theoretically, and the original good statistical properties of chaotic dynamics can be maintained.
Cited By25
#1Tulasi Radhika Patnala (Gokaraju Rangaraju Institute of Engineering and Technology)H-Index: 3
#2D. Jayanthi (Gokaraju Rangaraju Institute of Engineering and Technology)H-Index: 1
view all 6 authors...
Present day's data security plays a vital role in digital human life. Data is a valuable asset to any organization and hence its security from external attacks is very important. Information security is not only an important aspect but essential, to secure data from unapproved access. Data encryption, decryption and key management are the key factors in data protection. It is very important to have the right data security solution to meet the challenging threats. Cryptosystem implementation and ...
#1Ping Wang (SWU: Southwest University)
#2Jing Qiu (SWU: Southwest University)
In recent years, chaos-based cryptography is widely studied, especially in the field of pseudorandom bit generators. The paper describes a novel pseudorandom bit generator (PRBG) based on chaotic couple map lattice. The state variables of the couple map lattice are combined to produce a block of 32 random bits at each iteration. Various experiments are carefully conducted to evaluate the quality of the proposed pseudorandom bit generator. The obtained results showed the proposed pseudorandom bit...
#1Zhipeng WangH-Index: 8
#2Xiaodong LvH-Index: 2
Last. Yi QinH-Index: 8
view all 6 authors...
Based on the chaos and phase retrieval algorithm, a hierarchical multiple binary image encryption is proposed. In the encryption process, each plaintext is encrypted into a diffraction intensity pattern by two chaos-generated random phase masks (RPMs). Thereafter, the captured diffraction intensity patterns are partially selected by different binary masks and then combined together to form a single intensity pattern. The combined intensity pattern is saved as ciphertext. For decryption, an itera...
Pseudo Random Number Generator (PRNG) is an algorithm for generating a sequence of numbers. Due to speed in number generation pseudorandom numbers are very important. They are mostly used for cryptography applications. In cryptography there are mainly two mechanisms. They are Encryption and Decryption. In Encryption the sender will convert the original message called plain text into cipher text which is unreadable, using an encryption key. This cipher text will be send through communication chan...
#1Wang WeiH-Index: 2
#2Liu Fen-linH-Index: 2
view all 4 authors...
According to the feature of palette image, a chaotic encryption algorithm for image of palette format is proposed in this paper. In the algorithm, the index matrix of pixel and the palette are both encrypted. In the encryption procedure of the index matrix, the position and value of an index are both encrypted, after multi-rounds, the ciphered index matrix is obtained, and in the masking procedure of palette, the masking operation performed only on the values for the purpose of efficiency. The e...
Weak key analysis is a key issue in the design of chaotic ciphers. While most of the existing research focusing on the degradation of the chaotic sequences which causes weak keys, we point out that the parameters for which the chaotic sequences do not degrade are still possible to be weak keys. In this paper, we propose a new approach based on the rigorous statistical test to improve the weak key analysis. The weak keys of a specific chaotic cipher are investigated by using our method and a larg...
#1Chung-Yi Li (NTHU: National Tsing Hua University)H-Index: 8
#2Yuan-Ho Chen (NTHU: National Tsing Hua University)H-Index: 11
Last. Kiwing ToH-Index: 14
view all 5 authors...
We present a new reseeding-mixing method to extend the system period length and to enhance the statistical properties of a chaos-based logistic map pseudo random number generator (PRNG). The reseeding method removes the short periods of the digitized logistic map and the mixing method extends the system period length to 2253 by 鈥渪oring鈥 with a DX generator. When implemented in the TSMC 0.18- 渭m 1P6M CMOS process, the new reseeding-mixing PRNG (RM-PRNG) attains the best throughput rate of 6.4 Gb/...
#1Ruming Yin (THU: Tsinghua University)H-Index: 5
#2Jian Yuan (THU: Tsinghua University)H-Index: 31
Last. Xiqin Wang (THU: Tsinghua University)H-Index: 21
view all 5 authors...
Coupled map lattices (CML) have been recently used to construct ciphers. However, the complicated operations on real numbers make these CML-based ciphers difficult to analyze. This paper presents a new stream cipher with the discretized CML which operates on binary numbers. When discretizing the CML, the effective network structure is explicitly preserved to improve the confusion and diffusion. The proposed cipher can be easily analyzed using proper cryptographic techniques and has good security...
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.