首页 | 本学科首页   官方微博 | 高级检索  
     

NTRU的有效实现方案研究
引用本文:尹强,李新社. NTRU的有效实现方案研究[J]. 计算机工程与设计, 2007, 28(6): 1309-1312
作者姓名:尹强  李新社
作者单位:第二炮兵工程学院,陕西,西安,710025;第二炮兵工程学院,陕西,西安,710025
摘    要:NTRU是Jeffrey Hoffstein等在1996年提出的一种新的公钥密码体制,其安全性基于大维数格中寻找最短向量的数学难题.NTRU公开密钥体制算法主要对象是对N-1次多项式进行加、减、乘、模运算,所以该加密解密的速度比RSA等著名算法快得多,和椭圆曲线密码体制一起,成为新一代最优秀的公钥密码体制.对NTRU的设计原理以独特的思维方法进行了分析,并对主要算法进行了优化设计和实现分析.特别地,给出了算法的优化分析及完整实现方案,大大提高了系统的性能.

关 键 词:NTRU公钥密码体制  多项式截断环    模运算  卷积运算
文章编号:1000-7024(2007)06-1309-04
修稿时间:2006-02-24

Research on efficient NTRU implementations scheme
YIN Qiang,LI Xin-she. Research on efficient NTRU implementations scheme[J]. Computer Engineering and Design, 2007, 28(6): 1309-1312
Authors:YIN Qiang  LI Xin-she
Abstract:The NTRU cryptosystem is a new public key cryptographic algorithm that is developed by J.Hoffstein,in 1996.Its security is based on the hard mathematical problem of finding the shortest vector in a lattice of very high dimension.The principal objects used by the NTRU PKCS are polynomial of degree N-1 having integer coefficient which are operated by addition,subtraction,multiplication and modular arithmetic.Encryption and decryption with NTRU are extremely faster than RSA,and together with ECC,will become the most excellent one of the new public key cryptosystems.The basic principle of NTRU is analyzed in a creative way,and then the main algorithm is analyzed and optimized,specially giving the analysis and integrated scheme,greatly improves the performance of this system.
Keywords:NTRU PCKS  truncated polynomial rings  lattice  modular arithmetic  convolution algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号