Shihong Wang, Gang Hu
A revised self-synchronizing stream cipher based on chaotic coupled maps is proposed. This system adds input and output functions aim to strengthen its security. The system performs basic floating-point analytical computation on real numbers, incorporating auxiliarily with algebraic operations on integer numbers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
A new self-synchronizing stream cipher (SSSC) is proposed based on one-way and nearest neighbor coupled integer maps. Some ideas of spatiotemporal chaos synchronization and chaotic cryptography are applied in this new SSSC system. Several principles of constructing optimal SSSC are discussed, and the methods realizing these principles are specified. This SSSC is compared with several SSSC systems in security by applying chosen-ciphertext attacks. It is shown that our new system can provide SSSC with high security and fairly fast performance.
Unimodal maps have been broadly used as a base of new encryption strategies. Recently, a stream cipher has been proposed in the literature, whose keystream is basically a symbolic sequence of the (one-parameter) logistic map or of the tent map. In the present work a thorough analysis of the keystream is made which reveals the existence of some serious security problems
The combinative applications of one-way coupled map lattice (OCML) and some simple algebraic operations have demonstrated to be able to construct the best known chaotic cryptosystem with high practical security, fast encryption speed, and excellent robustness against channel noise. In this paper, we propose a differential-like chosen cipher attack to break the prototypical system cooperating with INT and MOD operations. This cryptographic method exploits the weakness that the high-dimensional cryptosystem degenerates to be one-dimensional under constant driving, therefore, is no more sensitive…
Recently, Pareek et al. proposed a symmetric key block cipher using multiple one-dimensional chaotic maps. This paper reports some new findings on the security problems of this kind of chaotic cipher: 1) a number of weak keys exists; 2) some important intermediate data of the cipher are not sufficiently random; 3) the whole secret key can be broken by a known-plaintext attack with only 120 consecutive known plain-bytes in one known plaintext. In addition, it is pointed out that an improved version of the chaotic cipher proposed by Wei et al. still suffers from all the same security defects.
In ISNN'04, a novel symmetric cipher was proposed, by combining a chaotic signal and a clipped neural network (CNN) for encryption. The present paper analyzes the security of this chaotic cipher against chosen-plaintext attacks, and points out that this cipher can be broken by a chosen-plaintext attack. Experimental analyses are given to support the feasibility of the proposed attack.
In cryptography, block ciphers are the most fundamental elements in many symmetric-key encryption systems. The Cipher Block Chaining, denoted CBC, presents one of the most famous mode of operation that uses a block cipher to provide confidentiality or authenticity. In this research work, we intend to summarize our results that have been detailed in our previous series of articles. The goal of this series has been to obtain a complete topological study of the CBC block cipher mode of operation after proving his chaotic behavior according to the reputed definition of Devaney.
Two-dimensional one-way coupled map lattices are used for cryptograph where multiple space units produce chaotic outputs in parallel. One of the outputs plays the role of driving for synchronization of the decryption system while the others perform the function of information encoding. With this separation of functions the receiver can establish a self-checking and self-correction mechanism, and enjoys the advantages of both synchronous and self-synchronizing schemes. A comparison between the present system with the system of Advanced Encryption Standard, AES, is presented in the aspect of cha…
We present a stream cipher based on a chaotic dynamical system. Using a chaotic trajectory sampled under certain rules in order to avoid any attempt to reconstruct the original one, we create a binary pseudo-random keystream that can only be exactly reproduced by someone that has fully knowledge of the communication system parameters formed by a transmitter and a receiver and sharing the same initial conditions. The plaintext is XORed with the keystream creating the ciphertext, the encrypted message. This keystream passes the NISTs randomness test and has been implemented in a videoconference …
Security of information has become a major issue during the last decades. New algorithms based on chaotic maps were suggested for protection of different types of multimedia data, especially digital images and videos in this period. However, many of them fundamentally were flawed by a lack of robustness and security. For getting higher security and higher complexity, in the current paper, we introduce a new kind of symmetric key block cipher algorithm that is based on \emph{tripled chaotic maps}. In this algorithm, the utilization of two coupling parameters, as well as the increased complexity…
This paper presents a comprehensive analysis on the security of the Yi-Tan-Siew chaotic cipher proposed in [IEEE TCAS-I 49(12):1826-1829 (2002)]. A differential chosen-plaintext attack and a differential chosen-ciphertext attack are suggested to break the sub-key K, under the assumption that the time stamp can be altered by the attacker, which is reasonable in such attacks. Also, some security Problems about the sub-keys $α$ and $β$ are clarified, from both theoretical and experimental points of view. Further analysis shows that the security of this cipher is independent of the use of the chao…
Pseudo-Random Bit Generation (PRBG) is required in many aspects of cryptography as well as in other applications of modern security engineering. In this work, PRBG based on 2D symmetrical chaotic mappings of logistic type is considered. The sequences generated with a chaotic PRBG of this type, are statistically tested and the computational effectiveness of the generators is estimated. Considering this PRBG valid for cryptography, the size of the available key space is also calculated. Different cryptographic applications can be suitable to this PRBG, being a stream cipher probably the most imm…
The synchronization behavior of delay coupled chaotic smooth unimodal maps over a ring network with stochastic switching of links at every time step is reported in this paper. It is observed that spatiotemporal synchronization never appears for nearest neighbor connections; however, stochastic switching of connections with homogeneous delay $(τ)$ is capable of synchronizing the network to homogeneous steady state or periodic orbit or synchronized chaotically oscillating state depending on the delay parameter, stochasticity parameter and map parameters. Linear stability analysis of the synchron…
We show that universality in chaotic elements can be lifted to that in complex systems. We construct a globally coupled Flow lattice (GCFL), an analog of a globally coupled Map lattice (GCML). We find that Duffing GCFL shows the same behavior with GCML; population ratio between synchronizing clusters acts as a bifurcation parameter. Lorenz GCFL exhibits interesting two quasi-clusters in an opposite phase motion. Each of them looks like Will o' the wisp; they dance around in opposite phase.
Networks of chaotic coupled maps are considered as string and language generators. It is shown that such networks can be used as encrypting systems where the ciphertext contains information about the evolution of the network and also about the way to select the plaintext symbols from the string associated to the network evolution. The secret key provides the network parameters, such as the coupling strengths.
The synchronization of loosely coupled chaotic oscillators, a phenomenon investigated intensively for the last two decades, may realize the philosophical notion of synchronicity. Effectively unpredictable chaotic systems, coupled through only a few variables, commonly exhibit a predictable relationship that can be highly intermittent. We argue that the phenomenon closely resembles the notion of meaningful synchronicity put forward by Jung and Pauli if one identifies "meaningfulness" with internal synchronization, since the latter seems necessary for synchronizability with an external system. J…
The problem of synchronization of coupled Hamiltonian systems exhibits interesting features due to the non-uniform or mixed nature (regular and chaotic) of the phase space. We study these features by investigating the synchronization of unidirectionally coupled area-preserving maps coupled by the Pecora-Carroll method. We find that coupled standard maps show complete synchronization for values of the nonlinearity parameter at which regular structures are still present in phase space. The distribution of synchronization times has a power law tail indicating long synchronization times for at lea…
Large communities of biological oscillators show a prevalent tendency to self-organize in time. This cooperative phenomenon inspired Winfree to formulate a mathematical model that originated the theory of macroscopic synchronization. Despite its fundamental importance, a complete mathematical analysis of the model proposed by Winfree ---consisting of a large population of all-to-all pulse-coupled oscillators--- is still missing. Here we show that the dynamics of the Winfree model evolves into the so-called Ott-Antonsen manifold. This important property allows for an exact description of this h…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。