进位返加与逐位模2加及模2n加的相容程度分析

深入分析了进位返加运算与逐位模2加运算及模2^n加运算的相容程度,给出了它们的相容概率的计算公式．结论表明,进位返加运算与逐位模2加运算的相容概率尽管很小,但远大于理想值2^-n;进位返加运算与模2^n加运算的相容概率很大,近似为2／3．     

变进位记数制与伪随机序列的产生

本文提出了一种通用的变进位记数制 ,以及其中的一种进位制──自然进位制 .并方便地用于解决序列的全排列问题 .在此基础上 ,提出了两种产生伪随机数序列的方法 :码控字节交换法和码控位交换法 .作者希望这种变进位记数制能在其它应用领域发挥其作用 .     

具有限制性的代理签名方案

针对现有的限制性代理方案尚不能有效地对时间和次数同时控制这个问题,基于一次性代理签名方案和前向安全技术,提出了一个新的具有次数和时间限制的代理签名方案。方案在离散对数和大数分解计算困难下是安全的,并且满足代理签名的所有性质。     

一种改进的RSA算法的研究与实现

RSA算法被普遍认为是目前最优秀的公钥方案之一,但RSA也存在运算代价高,速度较慢等缺点.本文提出了一种改进的RSA算法并在Java平台中得到了很好的应用.     

针对减宽SHA-1算法的模差分攻击分析

模差分攻击技术是SHA-1随机碰撞攻击中重要分析方法之一.针对减宽的SHA-1算法,该文得出了减宽的部分碰撞定理并给出了减宽SHA-1算法单一部分碰撞的概率,证明了模差分攻击技术同样适用于减宽的SHA-1算法.通过理论分析和计算机搜索,该文证明了对于宽为n比特的SHA-1算法,当且仅当n3时,最优扰动向量的汉明重为25;当且仅当n8时,最优扰动向量只有type-I与type-II两个等价类.     

Addition Sequence Method of Scalar Multiplication of Elliptic Curve over OEF

A new elliptic curve scalar multiplication algorithm is proposed. The algorithm uses the Frobenius map on optimal extension field (OEF) and addition sequence. We introduce a new algorithm on generating addition sequence efficiently and also give some analysis about it. Based on this algorithm, a new method of computing scalar multiplication of elliptic curve over an ()EF is presented. The new method is more efficient than the traditional scalar multiplication algorithms of elliptic curve over OEF. The comparisons of traditional method and the new method are also given.     

A General Decomposition Construction for Incomplete Secret Sharing Schemes

A secret sharing scheme for an incomplete access structure (,) is a method of distributing information about a secret among a group of participants in such a way that sets of participants in can reconstruct the secret and sets of participants in can not obtain any new information about the secret. In this paper we present a more precise definition of secret sharing schemes in terms of information theory, and a new decomposition theorem. This theorem generalizes previous decomposition theorems and also works for a more general class of access structures. We demonstrate some applications of the theorem.     

轮换矩阵密码学性质

从AES中的列混淆出发,研究了有限域上轮换矩阵的一些性质,给出了轮换矩阵求逆算法和生成分支数最大的四阶轮换矩阵算法;讨论了轮换正形矩阵及轮换对合矩阵的一些性质,给出生成分支数达最大的四阶轮换正形矩阵的算法,得到了分支数最大的轮换对合矩阵不存在的结论.     

椭圆曲线加密算法与FPGA硬件实现

文章系统阐述了基于椭圆算法的椭圆曲线加密技术(ECC),并将其与当今国内流行的RSA加密技术进行比较,指出了ECC加密算法的优越性和可实现性;同时文中给出了PFGA硬件实现的方案,提出ECC加密技术是未来密码技术发展的方向。     

Research of the Kernel Operator Library Based on Cryptographic Algorithm

The variety of encryption mechanism and algorithms which were conventionally used have some limitations. The kernel operator library based on Cryptographic algorithm is put forward. Owing to the impenetrability of algorithm, the data transfer system with the cryptographic algorithm library has many remarkable advantages in algorithm rebuilding and optimization, easily adding and deleting algorithm, and improving the security power over the traditional algorithm. The user can choose any one in all algorithms with the method against any attack because the cryptographic algorithm library is extensible.