Low- x QCD physics from RHIC and HERA to the LHC

We present a summary of the physics of gluon saturation and non-linear QCD evolution at small values of the parton momentum fraction x in the proton and nucleus in the context of recent experimental results at HERA and RHIC. The rich physics potential of low-x studies at the LHC, especially in the forward region, is discussed and some benchmark measurements in pp, pA and AA collisions are introduced.     

椭圆曲线密码处理器的高效VLSI设计与实现

采用复合武硬件设计方法，通过数学公式推导和电路结构设计，完成了一款GF（2m）域椭圆曲线密码处理器的高效VLSI实现。以低成本为目标，对算术逻辑模块的乘法、约减、平方、求逆，以及控制电路模块都进行了优化设计。按照椭圆曲线密码的不同运算层次，设计了不同层次的控制电路。该处理器综合在中芯国际SMIC0．18μm标准工艺库上．比相关研究的芯片面积节省48％，同时保证了很快的速度。     

Madsen求阶算法的改进和推广

文章分析了仅适用于特征为2和3的域上的一种椭圆曲线求阶算法—Madsen求阶算法,并对此算法进行了改进和推广,提高了Madsen算法的运算速度。     

基于Arnold变换的量子图像混沌加密方法

在确保量子图像密码算法安全的基础上,为进一步优化解密图像质量及计算复杂度,该文提出一种基于Arnold变换的量子图像混沌加密方案。方案使用量子细胞神经网络产生的混沌信号来控制量子Arnold变换、量子交换(SWAP)和量子控制非操作(CNOT),然后将这些操作作用于量子明文图像中以获得相应的密文图像。研究结果表明：所提量子灰度图像加密方法具有高安全性、高解密图像质量及低计算复杂度的特点。     

Security Architecture on the Trusting Internet of Things

By analyzing existed Internet of Things' system security vulnerabilities, a security architecture on trusting one is constructed. In the infrastructure, an off-line identity authentication based on the combined public key (CPK) mechanism is proposed, which solves the problems about a mass amount of authentications and the cross-domain authentication by integrating nodes' validity of identity authentication and uniqueness of identification. Moreover, the proposal of constructing nodes' authentic identification, valid authentication and credible communication connection at the application layer through the perception layer impels the formation of trust chain and relationship among perceptional nodes. Consequently, a trusting environment of the Internet of Things is built, by which a guidance of designing the trusted one would be provided.     

低轮FOX分组密码的差分碰撞攻击

This paper presents a method for differential collision attack of reduced FOX block cipher based on 4-round distinguishing property. It can be used to attack 5, 6 and 7-round FOX64 and 5-round FOX128. Our attack has a precomputation phase, but it can be obtained before attack and computed once for all. This attack on the reduced to 4-round FOX64 requires only 7 chosen plaintexts, and performs 242 .84-round FOX64 encryptions. It could be extended to 5 (6, 7)-round FOX64 by a key exhaustive search behind the fourth round. The time complexities of 5, 6 and 7-round FOX64 are approximate to 2106 .8, 2170 .8and 2234 .8, respectively. The attack on reduced FOX128 demands 11 chosen plain-texts, requires 2192one round encryptions in precomputation, performs approximately 276 .5 one round encryptions on 4-round FOX128, and is 2204 .5against 5-round FOX128.     

基于单变量多项式表示的具有最大代数免疫度奇变元函数构造

To protect against algebraic attacks, a high algebraic immunity is now an important criterion for Boolean functions used in stream ciphers. In this paper, a new method based on a univariate polynomial representation of Boolean functions is proposed. The proposed method is used to construct Boolean functions with an odd number of variables and with maximum algebraic immunity. We also discuss the nonlinearity of the constructed functions. Moreover, a lower bound is determined for the number of Boolean functions with maximum algebraic immunity.     

Anonymous voting for multi-dimensional CV quantum system

We investigate the design of anonymous voting protocols,CV-based binary-valued ballot and CV-based multi-valued ballot with continuous variables(CV) in a multi-dimensional quantum cryptosystem to ensure the security of voting procedure and data privacy.The quantum entangled states are employed in the continuous variable quantum system to carry the voting information and assist information transmission,which takes the advantage of the GHZ-like states in terms of improving the utilization of quantum states by decreasing the number of required quantum states.It provides a potential approach to achieve the efficient quantum anonymous voting with high transmission security,especially in large-scale votes.