在此基础上,借助于对比特级并行乘法器的复杂度的分析,给出了一个优化最大距离可分码的算法。
Based on these, an algorithm to optimize MDS codes is introduced by analyzing the complexity of bit parallel multipliers.
用最大距离可分码构造了一个理想门限体制,该体制中的秘密恢复算法可以正确地恢复秘密,并可检测出伪造的秘密份额,确定伪造者的身份。
An ideal threshold scheme is constructed from Maximum Distance Separable (MDS) codes, the recovery algorithm in this scheme can detect cheating, recover the correct secret and identify cheaters.
应用推荐