无碰撞组合公钥的种子密钥矩阵的优化设计方案  

Optimized construction scheme of seeded-key matrices of collision-free combined public key

作　　者：李涛[1,2] 张海英[3] 杨骏[2,3] 余丹[1] 

机构地区：[1]中国科学院大学工程管理与信息技术学院,北京100043 [2]南京中科微电子有限公司,南京210042 [3]中国科学院微电子研究所,北京100029

出　　处：《计算机应用》2015年第1期83-87,共5页journal of Computer Applications

基　　金：中国科学院院地合作重大专项(Y2YH01A001)

摘　　要：针对组合公钥(CPK)中的密钥碰撞和种子密钥矩阵的存储空间问题,提出了一种系数重映射方法,并设计了种子矩阵因子的选取规则。首先,在标识映射环节后,把产生的二进制比特流划分为系数序列和行序列;然后,按照重映射规则对系数序列进行映射,消除值为0的系数,削减了种子矩阵的存储空间;其次,在种子矩阵生成环节,基于系数重映射方法设计选取矩阵因子的规则,使产生的密钥不会发生碰撞;最后,根据行序列以及递增的列序列,选取公、私钥因子,并依据系数序列和公、私钥因子,计算公私钥。理论分析结果表明可以优化存储空间,解决密钥碰撞问题。Concerning the problem of key collision and the storage space of matrices of seeded-key in Combined Public Key（ CPK）, a method of coefficient remapping was proposed and the rules of selecting the elements of seeded matrices were designed. Firstly, in the phase of identification mapping, the binary bit streams were produced, and they were divided into coefficient sequence and row sequence. Then the coefficient sequence was remapped according to the remapping rules, which could avoid that the coefficient was zero. So the storage space of the matrices was reduced by the coefficient remapping.Secondly, in the generation step of seeded-key matrix, based on the coefficient remapping, some rules were specified to choose elements to create matrices of seeded-key to ensure that the generated keys were exclusive. Finally, the elements of the matrices were selected according to the row sequence and the increasing column sequence. Then the public key and the private key were generated on the basis of the coefficient sequence and the selected elements. The theoretical analysis results suggest that the proposed scheme can optimize the storage of matrices and solve the key collision problem.

关 键 词：组合公钥 种子密钥矩阵 标识密钥 系数重映射 无碰撞 存储空间 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]