欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
NTRU是一种既速度快又结构紧凑的快速公钥体制，其安全性基于在有效时闭内不可能从一个大维格中找到一个短向量的数学困难问题．YU等对NTRU解密失败问题进行了详细论述和研究，并给出解决解密失败时的处理方案．本文通过实验和理论证明他们的处理理论和算法是错误的，并在此基础上给出了一个改进算法，该改进算法安全性与NTRU相同，可以解决NTRU解密失败问题．
英文摘要：
NTRU is one of the most compact and the fastest public-key-ciphers known. Its security is based on the hard mathematical problem of finding the shortest vector in a lattice of very high dimension in polynomial time. YU etc discussed and studied NTRU decrytion failure in detail, and gave its solved schemes. However, their theories and algorithms have proved false in terms of experimental data and the other theories in this paper. Finally, an improved algorithm is put forward, and not only its security is the same with NTRU but it can solve the problem of NTRU decrytion failure.
同期刊论文项目
同项目期刊论文
期刊信息
位置：