Security analysis of a multiple pseudorandom-bit generator based on a spatiotemporal chaotic map

<正>In this paper we analyse the security of a multiple pseudorandom-bit generator based on the coupled map lattice and suggest an improved model.Utilizing the error function attack,the multiple pseudorandom-bit generators which can be realized by the three digitization methods are analysed and the effective key spaces are estimated.We suggest an improved multiple pseudorandom-bit generator with 128-bit secret key,and analyse the key sensitivity and statistical properties of the system.     

Security analysis of a spatiotemporal-chaos-based cryptosystem

An S-box modified one-way coupled map lattice is applied as a chaotic cryptograph. The security of the system is evaluated from various attacks currently used, including those based on error function analysis, statistical property analysis, and known-plaintext and chosen-ciphertext analytical computations. It is found that none of the above attacks can be better than the brute force attack of which the cost is exhaustively quantitated by the key number in the key space. Also, the system has fairly fast encryption (decryption) speed, and has extremely long period for finite-precision computer realization of chaos. It is thus argued that this chaotic cryptosystem can be a hopeful candidate for realistic service of secure communications.     

Inferring interactions of time-delayed dynamic networks by random state variable resetting

Time delays exist widely in real systems, and time-delayed interactions can result in abundant dynamic behaviors and functions in dynamic networks. Inferring the time delays and interactions is challenging due to systematic nonlinearity, noises, a lack of information, and so on. Recently, Shi et al. proposed a random state variable resetting method to detect the interactions in a continuous-time dynamic network. By arbitrarily resetting the state variable of a driving node, the equivalent coupling functions of the driving node to any response node in the network can be reconstructed. In this paper, we introduce this method in time-delayed dynamic networks. To infer actual time delays, the nearest neighbor correlation (NNC) function for a given time delay is defined. The significant increments of NNC originate from the delayed effect. Based on the increments, the time delays can be reconstructed and the reconstruction errors depend on the sampling time interval. After time delays are accurately identified, the equivalent coupling functions can also be reconstructed. The numerical results have fully verified the validity of the theoretical analysis.     

利用周期信号驱动Chua电路实现相同步

我们在实验上和理论上对周期信号驱动的混沌电路的相同步问题进行了研究。我们选择三类周期信号作为驱动信号，包括Chua电路产生的周期信号，正弦信号和脉冲信号。改变驱动信号的频率、振幅和脉冲信号的占空比，在周期信号和混沌信号存在小的频率失配的条件下，驱动信号的振幅在适当的变化范围内，以及脉冲信号的占空比在适当的变化范围内，都可以获得相同步。甚至当占空比小到3%的情况下，仍然可以得到相同步。特别是这类脉冲信号的控制在实际中是有意义的。     

混沌专题系列研究性实验介绍

介绍了北京邮电大学物理实验中心在教学内容改革中开发的混沌专题系列实验.通过简单的、易于实现的力学和电路系统介绍混沌,将复杂的学术问题转化成了可以为不同层次学生所接受的研究性实验课题,激发了学生的实验兴趣,将科研成果直接转化为了教学实践.     

一种简单的基于蔡氏电路的数字加密通信实验

介绍一种简单的基于蔡氏电路的对数字信号进行加密传输以及解密的实验方法,以及该实验作为一个新的与前沿科学相结合的普通物理实验的优点.     

MECHANISM OF HOT ELECTRON GENERATION AND STIMULATED RAMAN SCATTERING IN LASER CAVITY TARGET PLASMA

Stimulated Raman Scattering (SRS) and X-ray spectrum emitted from many kinds of targets were experimentally investigated on the Nd:glass laser facility Shenguang-I in Shanghai, China. By theoretical analysis and computer simulation for these experiments, the result showed that the mechanism of hot electron generation in laser cavity target was mainly SRS, according to detailed comparison between the cavity target and the plane target. Other results, such as the energy fraction and temperatures of hot electron, energy and angular distribution and wave spectrum in SRS, were also presented in detail.     

激光靶等离子体受激Raman散射

用我们研制的一维半电磁粒子模拟程序数值模拟了神光12^#激光器(λ_L=1.053μm,τ=850ps,I_L=3×10¹⁴—3×10¹⁵W/cm²打靶的受激Raman散射。得到了散射光波、静电(Langmuir)波线性增长和非线性饱和的细致图象、热电子和超热电子分布函数随时间的发展以及超热电子的温度和份额。通过对散射光谱的分析得到晕区电子温度约为1.4—2.5keV,还得到靶等离 关键词：     

Security analysis of a one-way hash function based on spatiotemporal chaos

The collision and statistical properties of a one-way hash function based on spatiotemporal chaos are investigated. Analysis and simulation results indicate that collisions exist in the original algorithm and, therefore, the original algorithm is insecure and vulnerable. An improved algorithm is proposed to avoid the collisions.