单项式多变量公钥密码算法的等价密钥问题  

Equivalent keys in multivariate public key cryptographic schemes based on a monomial

作　　者：魏占祯[1] 袁峰[2] 许盛伟[2] 江继军[2] 

机构地区：[1]北京电子科技学院通信工程系,北京100070 [2]北京电子科技学院信息安全研究所,北京100070

出　　处：《哈尔滨工程大学学报》2015年第8期1143-1146,共4页Journal of Harbin Engineering University

基　　金：国家自然科学基金青年科学基金资助项目(61103210);国家自然科学基金数学天元基金资助项目(11226274);中央高校基本科研业务费专项资金资助项目(YZDJ1102;YZDJ1103;2014XSYJ09;2014KYTD03;328201509);北京电子科技学院信息安全重点实验室资助项目(YQNJ1005)

摘　　要：对基于单项式的多变量公钥密码算法中的等价密钥问题进行了研究,利用保形变换和有限域方面的知识计算出了其等价密钥的数量。这是一个更一般的结论,是已有结论的推广形式。进一步地,C*,C*!和Square等算法中等价密钥的数量可以看作是该结论的特殊情形。研究结果表明:选私钥仿射结构具有稀疏特性的矩阵作为等价类的代表元,可以有效地节省存储空间、缩短操作时间。同时,多变量公钥密码算法要想达到预想的安全强度,就必须提高算法参数的大小。This paper investigates the problem of equivalent keys in multivariate public key cryptographic schemes based on a monomial, and applies sustaining transformation and finite field theory to compute the number of equivalent keys. This conclusion is more general, and is a generalized form of a conclusion that has been known. Accordingly, the number of equivalent keys of C＊ scheme, C ＊-scheme and square scheme can be regarded as a special case of the result computed above. The results show that the memory space and the operation time can be effectively reduced by choosing the sparse normal form matrix of affine transformations of private keys as the representative ele- ment of the equivalence class. Moreover, to achieve the expected security, larger system parameters should be cho- sen in multivariate public key cryptographic schemes.

关 键 词：公钥密码学 多变量 单项式 等价密钥 保形变换 有限域 

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