作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2021, Vol. 47 ›› Issue (10): 111-115,124. doi: 10.19678/j.issn.1000-3428.0059258

• 网络空间安全 • 上一篇    下一篇

一种基于异或运算的(k,n)门限秘密共享算法

夏高, 何成万   

  1. 武汉工程大学 计算机科学与工程学院, 武汉 430205
  • 收稿日期:2020-08-14 修回日期:2020-10-14 发布日期:2020-10-27
  • 作者简介:夏高(1995-),男,硕士研究生,主研方向为秘密共享算法;何成万,教授、博士。
  • 基金资助:
    国家自然科学基金(61272115)。

A (k,n)-Threshold Secret Sharing Algorithm Based on XOR Operation

XIA Gao, HE Chengwan   

  1. School of Computer Science and Engineering, Wuhan Institute of Technology, Wuhan 430205, China
  • Received:2020-08-14 Revised:2020-10-14 Published:2020-10-27

摘要: 现有典型的秘密共享算法多基于SHAMIR算法构建,涉及复杂的多项式计算,数据处理速度较慢。为提高计算效率,提出一种仅基于异或运算的秘密共享算法。根据kn输入值计算待生成的线索个数,通过与随机二进制序列进行连续异或运算生成算法所需的全部线索,并借助排列组合将所有线索进行分组形成影子秘密。实验结果表明,该算法能够实现任意份额(k,n)门限秘密共享,相较于SHAMIR算法处理速度得到大幅提升,且不存在部分秘密信息泄露的安全隐患。

关键词: 异或运算, 秘密共享, 排列组合, 信息安全, 攻击者

Abstract: Most of the existing secret sharing algorithms are constructed based on the SHAMIR algorithm, and involve complex polynomial calculations, which slows down data processing.In order to improve computational efficiency, a new secret sharing algorithm is proposed based on XOR operation.The number of clues to be generated is calculated according to the input values of k and n.Then all the clues required by the algorithm are generated by continuous XOR operation on a random binary sequence, and the clues are grouped in permutation and combinations to form a shadow secret.Experimental results show that the algorithm can realize arbitrary (k, n)-threshold secret sharing, and greatly improves the processing speed compared with the SHAMIR algorithm, while avoding the security risk of partial secret information disclosure.

Key words: XOR operation, secret sharing, permutation and combination, information safety, attacker

中图分类号: