一种基于NTRU算法的秘密共享方案  

Secret Sharing Scheme Based on NTRU Algorithm

作　　者：步山岳[1] 于昆[1] 王汝传[2] 

机构地区：[1]淮阴工学院计算机工程学院,江苏淮安223002 [2]南京邮电大学计算机学院,江苏南京210003

出　　处：《小型微型计算机系统》2009年第10期1985-1987,共3页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60573141;60773041)资助;江苏省高校自然科学基金项目(08KJD520014;07KJD520021)资助

摘　　要：在已公开的秘密共享方案中,方案的安全性大都是建立在离散对数求解和大数因式分解的数学难题上,方案占用的资源较多,速度慢.提出一种新的秘密共享方案,该方案是在shamir秘密共享方案的基础上,利用NTUR算法和单向函数hash进行数据合法性验证.方案的安全性是建立在快速、高效的NTRU算法基础上,方案可以使用公开信道发布信息,能有效检测出各种欺骗、伪造行为,确保恢复的秘密是可信的.In the secret sharing schemes already published, the security of the scheme is mostly established upon difficult mathematical problems such as the solution of discrete logarithm and the factoring of large number. However, such schemes take up lots of resources while result in low speed. In this paper we propose a new secret-sharing scheme, which is based on shamir secret sharing scheme and use the NTRU and one-way hashing function to verify the validity of data. The security of our scheme is built on quick and efficient NTRU algorithm. It can use the public channel to issue information, detect effectively a variety of cheating or forgery behaviors, and ensure the credibility of resumption of secret.

关 键 词：秘密共享 NTUR算法 欺骗 公开信道 

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