ECC在WSN分簇密钥管理方案中的应用

现有的无线传感器网络(WSN)密钥管理方案大都采用对称密钥管理体制,在安全性方面均存在不足。为了提高W SN密钥管理方案的安全性,将椭圆曲线密码体制(ECC)应用到无线传感器网络中,并具体分析了该方案的通信过程。最后通过与其它方案进行比较,验证了该方案的安全性以及存储开销等方面的优势。     

基于RSA体制的数字移动通信系统用户认证方案

设计了一种基于RSA体制的数字移动通信系统的用户身份认证方案.其安全性基于大整数的分解难题,能抵抗包括网内攻击的多种攻击.用户请求采用预计算的方式,有效减少了实时计算量,满足移动通信系统中用户请求的实时性要求.与基于离散对数的方案相比,本方案用户端和网络中心的计算量与存储量少,能高效实现连续请求.理论分析表明:本方案安全性高,计算复杂性和通信量低,网络中心存储量低,符合数字移动通信系统要求.     

On the Equivalent Keys in Multivariate Cryptosystems

The number of equivalent keys in multivariate cryptosystem is closely related to the scheme security. This study analyzes the structure of the private key space in some multivariate schemes.The result gives the lower bounds on the number of equivalent keys of some variants of the hidden field equation (HFE) scheme including plus, minus-plus, embedding, and internal perturbation. This method estimates the number of invertible transformations which maintain the form of the central map invariant. Furthermore,a formal proof shows that the two modifications of fixing and embedding are equivalent in security analyses of multivariate schemes. Also this paper corrects previous proofs in Wolf’s work on the number of equivalent keys in HFEv,the unbalanced oil and vinegar (UOV) scheme, and the stepwise triangular systems (STS).     

基于离散对数的无证书群签名方案

在基于求解离散对数困难的基础上,设计了一种新的无证书群签名方案,它可以抵抗伪造攻击,还具有不可链接性和匿名性.     

复合加密的公开钥密码系统

我们讨论了复合加密的公开钥密码系统,并给出了两个例子。     

DF肯包公钥密码体制

本文根据中国剩余定理提出了一种丢番图方程型（简称ＤＦ）背包公钥密码体制．采用非超上升序列作为背包向量，防止了Ｓｈａｍｉｒ的攻击方法；扩大明文组（ｘ１，ｘ２…，ｘｎ）加密基本元ｘ１，进一步提高了体制的安全性和传信率．     

Polynomial Analysis of DH Secrete Key and Bit Security

In this paper, we lower the upper bound of the number of solutions of oracle transformation polynomial F(x) over GF(q). So one can also recover all the secrete keys with fewer calls. We use our generalized ““““““““even-and-odd test““““““““ method to recover the least significant p-adic ‘bits‘ of representations of the Lucas Cryptosystem secret keys x. Finally, we analyze the Efficient Compact Subgroup Trace Representation (XTR) Diffie-Hellmen secrete keys and point out that if the order of XTR subgroup has a special form then all the bits of the secrete key of XTR can be recovered form any bit of the exponent x.     

A Secure Public-key Image Authentication Plan

Digital watermark can be used for image ownership verification or authentication. In this paper, we propose a new image authentication plan concentrating on its security performance. Digital watermark is first turbo coded, scaled and then processed in wavelet domain. To enhance security level, public key cryptosystem is utilized to replace traditional watermark key. Sinmlation results are finally given by experiment.     

New Public Key Cryptosystems from Combinatorial Group Theory

0 IntroductionThe security of most commonly used cryptographicschemesis essentially based onthree families of compu-tational problems :the integer factoring problem(RSAprob-lem) ,the Diffie-Hell man problemand the discrete logarithmproblem,andthe elliptic curve variants thereof .Inthe middleof 1990s , Shor[1], Bonehet al[2]presented some remarkablequantumalgorithms which can solveinteger factoring problemand discrete logarithmproblemover any group including Ga-lois fields and elliptic curve…