Cu掺杂β-Si3N4的力学性能和电子结构的第一性原理研究

采用基于密度泛函的第一性原理方法研究了(Si_3-xCu_x)N₄(x=0,0.25,0.5,0.75,1)晶体的稳定性、力学性能和电子结构,分析了Cu掺杂对β-Si₃N₄力学性能的影响机制.结果表明,(Si_3-xCu_x)N₄为热力学稳定结构,Cu掺杂降低了β-Si₃N₄的稳定性.由弹性常数和Voigt-Reuss-Hill近似看出,(Si_3-xCu_x)N₄满足波恩力学稳定性判据,Cu掺杂使得β-Si₃N₄的体模量、剪切模量和杨氏模量降低,当x=0时,(Si_3-xCu_x)N₄的体模量、剪切模量和杨氏模量最大,分别为234.3 GPa、126.7 GPa和322.1 GPa.根据泊松比和G/B值判断出(...     

基于二维超混沌映射的单向Hash函数构造

快速有效的单向Hash函数的设计是现代密码学研究的一个热点.提出了一种基于二维超混沌映射的单向Hash函数的构造方法.该方法将原始输入报文按字节进行线性变换以及混沌映射，在所产生的混沌序列中选值作为二维超混沌映射的初始值，对迭代后所得的超混沌信号经过调制构造单向Hash函数.实验与分析结果表明，这种构造方法实现简单、对初值有高度敏感性、具有很好的单向性、弱碰撞性和保密性能. 关键词： 单向Hash函数 二维超混沌 混沌映射     

Application of periodic orbit theory in chaos-based security analysis

Chaos-based encryption schemes have been studied extensively, while the security analysis methods for them are still problems to be resolved. Based on the periodic orbit theory, this paper proposes a novel security analysis method. The periodic orbits theory indicates that the fundamental frequency of the spiraling orbits is the natural frequency of associated linearized system, which is decided by the parameters of the chaotic system. Thus, it is possible to recover the plaintext of secure communication systems based on chaotic shift keying by getting the average time on the spiraling orbits. Analysis and simulation results show that the security analysis method can break chaos shift keying secure communication systems, which use the parameters as keys.     

Constructing a one-way hash function based on the unified chaotic system

A new one-way hash function based on the unified chaotic system is constructed. With different values of a key parameter, the unified chaotic system represents different chaotic systems, based on which the one-way hash function algorithm is constructed with three round operations and an initial vector on an input message. In each round operation, the parameters are processed by three different chaotic systems generated from the unified chaotic system. Feed-forwards are used at the end of each round operation and at the end of each element of the message processing. Meanwhile, in each round operation, parameter-exchanging operations are implemented. Then, the hash value of length 160 bits is obtained from the last six parameters. Simulation and analysis both demonstrate that the algorithm has great flexibility, satisfactory hash performance, weak collision property, and high security.