基于对角自同构群的离散对数问题的盲签名方案  

Blind signature based on the discrete logarithm over diagonal automorphism group

作　　者：潘平[1] 洪歧[1] PAN Ping HONG Qi(School of Mathematics and Computer Science, Shaanxi Sci-Tech University, Hanzhong 723000, Chin)

机构地区：[1]陕西理工大学数学与计算机科学学院,陕西汉中723000

出　　处：《陕西理工学院学报（自然科学版）》2017年第1期71-75,92,共6页Journal of Shananxi University of Technology:Natural Science Edition

基　　金：国家自然科学基金资助项目(61370194);陕西省教育厅自然科学研究基金资助项目(2013JK0598;16JK1163);陕西理工学院博士科研基金资助项目(SLGQD13-24)

摘　　要：为了能够抵抗已知的量子算法攻击,非交换密码已成为后量子密码时代的研究方向之一。采用非交换群构造了一个签名方案,并在此基础上设计了一个盲签名方案。新方案的安全性依赖于单位三角矩阵群的对角自同构群上的离散对数问题。新的盲签名方案满足盲性和多一不可伪造性安全,并且只需要更短的公钥和更少的存储空间;采用平方-乘算法计算两个自同构的乘积,减少了计算成本。In order to resist currently known quantum algorithm attacks, non-commutative cryptography has become one of research directions in post-quantum cryptography era. A signature scheme over non-com- mutative group is proposed. Based on the signature scheme, a blind signature scheme is presented. The secur- ity of the schemes relies on the discrete logarithm problem over the diagonal automorphism group of the group of unitriangnlar matrices. The new blind signature scheme satisfies blinding and one-more unforgery, and only requires shorter public keys and smaller storage space. Since the multiplication of two automorphisms is com- puted using the square and multiply algorithm, the computing cost is reduced.

关 键 词：非交换群 对角自同构群 离散对数 盲签名 

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