| NTRU比特安全性的简单证明 |
| |
| 作者姓名： | 赵永斌 范通让 |
| |
| 作者单位： | 石家庄铁道大学,石家庄 050043 |
| |
| 基金项目： | 河北省自然科学基金(F2009000927)资助 |
| |
| 摘 要： | 根据NTRU加密算法的可延展性,在简单的确定性模型下证明了它的比特安全性.若预言机能够输出询问密文对应的明文多项式所有系数之和的奇偶性时,则预言机可以通过一系列的询问获得对应的明文.与Mats等人的证明相比,文中的模型更简单,更切合实际中NTRU解密机工作的情形.最后,分析了比特安全性与不可区分性之间的关系,指出形式化强安全定义将具有更高的实用性.
|
| 关 键 词： | 公钥密码 比特安全 NTRU 可展性 预言机 |
| 收稿时间： | 2010-06-14 |
| 修稿时间： | 2010-09-03 |
Simple proof of bit security for NTRU |
| |
| Authors: | ZHAO Yong-Bin FAN Tong-Rang |
| |
| Institution: | Shijiazhuang Tiedao University, Shijiazhuang 050043, China |
| |
| Abstract: | Based on the malleability, the bit security for NTRU is proved in a simplified decision model. In the model, the oracle can obtain the goal plain text through a sequence of queries if the oracle can output the parity of summation of coefficients in the goal plain text. Compared to the work of Mats, the model is simple and consistent with the decryption process of NTRU. Finally, the relationship between bit security and indistinguishability of encryption scheme is analyzed and the result shows that the formal definition of strong security is of great practicability. |
| |
| Keywords: | public key cryptography bit security NTRU malleability oracle |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
|
