New arbitrated quantum signature of classical messages against collective amplitude damping noise

Recently, Chong et al. [Opt. Comm. 284, (2011) 893-895] pointed out that a dishonest party in Yang and Wen's arbitrated quantum signature scheme [Opt. Comm. 283, (2010) 3198-3201] is able to reveal the other party's secret key without being detected by using the Trojan-horse attacks. However, the solution to avoid the attack still remains open. This work further points out that in Yang and Wen's scheme, the arbitrator is unable to arbitrate the dispute between two users. Consequently, a user can deny that he/she has signed or verified a signature without performing a Trojan-horse attack. A solution is proposed to solve this problem as well as the open problem mentioned earlier.     

Properties of the πh_(9/2)  νi_(13/2) band in odd-odd ~(188)Au

A new rotational band has been identified and assigned to 188Au for the first time using the 173Yb(19F,4nγ) reaction at the beam energies of 86 and 90 MeV. This band is proposed to be built on the πh9/2  νi13/2 configuration by comparing the band properties with known bands in neighboring nuclei. The prolate-to-oblate shape transition through triaxial shape has been proposed to occur around 188Au for the πh9/2  νi13/2 bands in odd-odd Au isotopes on the basis of total Routhian surface (TRS) calculations.     

Properties of the 3/2~-[521] band in the odd-N rare-earth nuclei

High-spin states in 161Er have been studied experimentally via the 150Nd(16O, 5n) reaction at a beam energy of 86 MeV. Three rotational bands built on the 5/2+[642], 3/2-[521], and 11/2-[505] configurations have been extended up to high-spin states, and particularly, the α = -1/2 branch of the ground state 3/2-[521] band has been revised significantly. It is found that signature inversion occurs in the 3/2-[521] band after the band crossing in 161Er. The systematics of the signature inversion associated wit...     

最优(m,n,4,1)光正交签名码的进一步结果

为支持高速多址网络中二维图像的传输,Kitayama首次提出码分多址并行图像传输系统的概念.作为码分多址并行图像传输系统的首选光地址码,光正交签名码(OOSPC)是一族具有良好相关性的Hamming重量为k的m×n(0,1)-矩阵.用Θ(m,n,k,λ)表示所有参数为(m,n,k,λ)的OOSPC中码字容量可能的最大值,则称码字容量为Θ(m,n,k,λ)的(m,n,k,λ)-OOSPC是最优的.本文将针对满足下列条件之一的正整数m和n:(1)mn≡8,16(mod 24),gcd(m,n,2)=2,且mn≡16(mod 32)和gcd(m,n,4)=2不同时成立,其中m和n的所有奇素因子均模6余1;(2)mn≡0(mod 24)且gcd(m,n,6)=2,证明Θ(m,n,4,1)=|mn-1/12|,即构造码字容量为|mn-1/12|的最优(m,n,4,1)-OOSPC.     

Cryptanalysis of an extended MQ signature system HTTM

Since Multivatriate Quadratic （MQ）-based Public Key Cryptosystem （MPKC） has been one of the hot research fields of post-quantum cryptography, it becomes important to analyze the security of new MPKC schemes. Wang et al. proposed a novel multivariate signature scheme with Hash-based Tame Transformation and Minus （HTTM） in 2011. For this extended MQ-based signature, we can transform it into an SFLASH variant by splitting and merging HT transformation, and solve an equivalent private key corresponding to the public key of HTTM. Thus, the adversary can forge legitimate signature for any message by using this equivalent private key.     

不定Sturm—Liouville算子的特征函数的振荡问题

研究了定义在有限区间（0，l）上的具有一般分离型边条件的不定Sturm—Liouville算子的特征函数的振荡问题．利用Prufer变换，给出了上述Sturm-Liouville算子特征值的符号指标的具体形式；得到了特征值的符号指标与Weyl函数以及Prufer角在该特征值处的罗朗展式（泰勒展式）的首项系数的符号之间的关系；最后，在上述两个结果的基础上给出了上述Sturm—Liouville算子的第n个正特征值所对应的特征函数在[0，l]内的零点个数的计算公式．     

A NEW ANONYMITY CONTROLLED E－CASH SCHEME

E-cash is a type of very important electronic payment systems.The complete anonymity of E-cash can be used for criminal activities,so E-cash should be anonymity controlled.Moreover,Elliptic Curve Cryptography(ECC)has been regard as the mainstream of current public cryptography.In this paper,a new anonymity controlled E-cash scheme based on ECC for the first time and using a new technology-one-time key pairs digital signature is designed,and its security and efficiency are analyzed.In our scheme,the coin tracing ,and owner tracing can be implemented.     

Aliasing probability transients

Test data reduction for digital systems is often accomplished through the use of a feedback shift register. This method, known as signature analysis, can exhibit error masking or aliasing. Recent analysis has shown that the use of a primitive polynomial for the register feedback can reduce the probability of aliasing. In this work we demonstrate that not all primitive polynomials are created equal. Some primitive polynomials can have very large transients in their aliasing probability. For example, 1 +X ¹³ +X ³³ can exhibit an aliasing probability more than a million times larger than its asymptotic value of 2^–33. An evaluation procedure is presented which can identify polynomials with good transient characteristics. Some recommended feedback polynomials are given.