一类细胞自动机的门限秘密共享方案  

A Threshold Secret Sharing scheme Based on A Type of Cellular Automata

作　　者：芦殿军[1] 李欣妍[2] 

机构地区：[1]青海师范大学数学与信息科学系,青海西宁810008 [2]长江师范学院数学系,重庆涪陵408100

出　　处：《长江大学学报（自科版）（上旬）》2008年第2期86-88,共3页JOURNAL OF YANGTZE UNIVERSITY (NATURAL SCIENCE EDITION) SCI ＆ ENG

基　　金：国家自然科学基金资助项目(10641003)

摘　　要：利用一维可逆线性记忆自动机的原理,提出了一种新的门限秘密共享方案。该方案以一维可逆线性记忆细胞自动机的原理为基础,利用中国剩余定理,将一个大秘密分解成若干子秘密;以二进制文本形式将这些子秘密分别作为k阶一维可逆线性记忆细胞自动机的k个初始配置之一,进化出秘密共享份额,通过其反向迭代功能恢复这些子秘密后进而重构大秘密。分析结果表明,该方案构建方法简单,易于实现,且在计算上是安全的。A new threshold secret sharing scheme was proposed based on one-dimensional memory cellular automata, a big secret was decomposed to some sub-secrets by using the Chinese remainder theorem.These sub-secrets in the form of binary texts are considered as one of the k initial configurations of the memory cellular automata of order k and then secret shares are evolved.The function of backward iteration of the cellular automata is used to recover these sub-secrets.Moreover, the shared secret can be reconstructed.Analyses show that the proposed scheme can be constructed quickly; it can be applied easily and computed securely.

关 键 词：密码学 秘密共享 门限方案 细胞自动机 中国剩余定理 

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