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

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

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

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.