Design and ARM-embedded implementation of a chaotic secure communication scheme based on H.264 selective encryption

Nonlinear Dynamics - In this paper, a novel video chaotic secure communication scheme and its ARM-embedded hardware implementation are investigated, based on the H.264 selective encryption and...     

L~p空间的另一组特征不等式

对应于文［１］所建立的Ｌｐ空间的二次特征不等式，本文建立了Ｌｐ，空间的ｐ次特征不等式，该不等式将Ｈｉｌｂｅｒｔ空间平行四边形律和极化等式推广到了Ｌｐ（１＜ ｐ＜ ∞） Ｂａｎａｃｈ空间．     

Dynamical analysis of dendritic mixed bursting within the pre-Bötzinger complex

Nonlinear Dynamics - A special class of neurons within the brainstem pre-Bötzinger complex (pre-BötC) may perform diversified electrical actions, which are closely related to the...     

Security performance analysis of a chaotic stream cipher

In this paper, the security performance analysis for a self-synchronization and closed-loop feedback-based chaotic stream cipher is given. According to the chosen-ciphertext attack method, it is found that under the condition of selecting the ciphertext as fixed value, the original chaotic iterative equation is degenerated into an asymptotically stable iterative one, so that the explicit function of state variables and key parameters can be obtained. Based on this idea, and according to the chosen-ciphertext attack method, a single key decipher algorithm is further investigated. Firstly, multiple pairs of plaintext–ciphertext are obtained by choosing the corresponding multiple frames of ciphertext as fixed values. Secondly, a set of possible estimated values for this single key is acquired by utilizing among one pair of plaintext–ciphertext. Finally, the only estimated value that satisfies all the conditions of multiple pairs of plaintext–ciphertext is determined, as an estimated value from the set of all possible estimated values. Security performance analysis results have shown that, under the condition that only one unknown key needs to be deciphered while the remaining keys are all known, the proposed algorithm can, respectively, decipher each individual key accurately. In addition, the attack complexity of the proposed method is lower than that of the exhaustive attack.