单调关联系统的条件失效元件数量

Coherent systems are very important in reliability,survival analysis and other life sciences.In this paper,we consider the number of failed components in an(n-k+1)-out-of-n system,given that at least m(m相似文献   

基于身份认证的无线安全密钥交换

认证密钥协商使得通信双方在共享一个安全会话密钥的同时实现相互认证。针对无线网络,基于口令认证的密钥协商算法也许能降低系统资源开销,但通常不能有效抵抗字典攻击。针对无线设备的资源有限性,文中提出一种可证安全的、基于身份的、认证的密钥协商方案,所提出方案需要计算量少,能够抵抗冒充攻击并且满足密钥协商协议所要求的其它安全属性。     

基于无线局域网的椭圆曲线数字签名改进算法

文章在研究椭圆曲线密码体制的基础上,针对无线局域网计算能力有限的特点,改进了椭圆曲线数字签名算法,并对其进行了正确性验证和安全性分析。将改进算法与传统算法对比,结果表明,改进算法签名方不需要进行求逆运算,比传统算法具有更少的时间复杂度。     

RSA非对称加密算法在数字签名中的应用研究

随着计算机网络通信技术的发展,对信息安全的要求也越来越高,信息加密技术也需进一步的提高。为了提高数据在计算机网络传输过程中的安全性,文中应用了RSA非对称加密算法及RSA操作和RSA填充问题,并给出了RSA非对称加密算法在数字签名中的应用方案,经过测试证明该方案能够进一步提高数据在网络传输过程中的安全性。     

基于环Zn上的圆锥曲线的代理盲签名方案

文中提出了一个基于环Zn上的圆锥曲线的代理盲签名,并对该方案做了分析。该方案的安全性是基于大整数的因数分解困难性和有限群上计算离散对数问题的困难性,由于阶的运算以及点的运算在Cn（a,b）上比较容易,且通过引进标准二进制计算群元素的整数倍的算法,使该方案具有运算速度快,易于实现等优点。     

Construction of proxy blind signature scheme based on multi-linear transform

A general method of constructing proxy blind signature is proposed based on multilinear transform. Based on this method, the four proxy blind signature schemes are correspondently generated with four different signature equations, and each of them has four forms of variations of signs. Hence there are sixteen signatures in all, and all of them are proxy stronglyblind signature schemes. Furthermore, the two degenerated situations of multi-linear transform are discussed. Their corresponding proxy blind signature schemes are shown, too. But some schemes come from one of these degenerate situations are proxy weakly-blind signature scheme. The security for proposed scheme is analyzed in details, The results indicate that these signature schemes have many good properties such as unforgeability, distinguish-ability of proxy signature, non-repudiation and extensive value of application etc.     

Signature Inversion in Odd-odd Nuclei

Signature inversion in odd-odd nuclei is investigated by using a proton and a neutron coupling to the coherent state of the core.Two parameters are employed in the Hamiltonian to set the energy scales of rotation,neutron-proton coupling and their competition.Typical level staggering is extracted from the calculated level energies.The calculation can approximately reproduce experimental signature inversion.Signature inversion is attributed to the rotational motion and neutronproton residual interaction having reversed signature splitting rules.It is found signature inversion can appear at axially symmetric shape and high-K band.     

3F-L数字签名方案的分析与改进

本文对3F-L数字签名方案进行分析,给出了对该方案的一般性签名伪造攻击;针对该方案签名数据太长的缺点,基于GF(p³)上离散对数的计算困难性,提出了一个Nyberg-Rueppel型的修改方案,其签名规模由5log(p)比特约减为2log(p)比特;并对改进方案的计算效率进行了分析。     

保护隐私的数字产品网上交易方案

电子商务中需要尽可能地保护用户隐私,而密码技术则是这一需求的重要保障.在安全的1/2不经意传输存在这一假设下,本文提出了一个安全且具隐私保护的数字产品网上交易方案.方案很好的考虑了实际交易中可能出现的情况,并针对可能出现的种种欺诈行为(如:商家以次充好,买家一次消费多次交易等问题)给予了有效的解决.同时结合匿名支付和匿名通信技术保证了用户交易的匿名性.     

ID-based authentication scheme combined with identity-based encryption with fingerprint hashing

Current identity-based （ID） cryptosystem lacks the mechanisms of two-party authentication and user＇s private key distribution. Some ID-based signcryption schemes and ID-based authenticated key agreement protocols have been presented, but they cannot solve the problem completely. A novel ID-based authentication scheme based on ID-based encrypfion （IBE） and fingerprint hashing method is proposed to solve the difficulties in the IBE scheme, which includes message receiver authenticating the sender, the trusted authority （TA） authenticating the users and transmitting the private key to them. Furthermore, the scheme extends the application of fingerprint authentication from terminal to network and protects against fingerprint data fabrication. The fingerprint authentication method consists of two factors. This method combines a token key, for example, the USB key, with the user＇s fingerprint hash by mixing a pseudo-random number with the fingerprint feature. The security and experimental efficiency meet the requirements of practical applications.