NTRU的有效实现方案研究  

Research on efficient NTRU implementations scheme

作　　者：尹强[1] 李新社[1] 

机构地区：[1]第二炮兵工程学院,陕西西安710025

出　　处：《计算机工程与设计》2007年第6期1309-1312,共4页Computer Engineering and Design

摘　　要：NTRU是Jeffrey Hoffstein等在1996年提出的一种新的公钥密码体制,其安全性基于大维数格中寻找最短向量的数学难题。NTRU公开密钥体制算法主要对象是对N-1次多项式进行加、减、乘、模运算,所以该加密解密的速度比RSA等著名算法快得多,和椭圆曲线密码体制一起,成为新一代最优秀的公钥密码体制。对NTRU的设计原理以独特的思维方法进行了分析,并对主要算法进行了优化设计和实现分析。特别地,给出了算法的优化分析及完整实现方案,大大提高了系统的性能。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.

关 键 词：NTRU公钥密码体制 多项式截断环 格 模运算 卷积运算 

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