NTRUsign式计算量分析

Analysis of Computational Complexity of Resultant of NTRUsign

介绍了NTRUsign签名算法的密钥生成过程,其在实现的过程中需要进行上百位的大数运算问题,这些数字远远超出了普通电脑存贮范围。而要进行大数运算,就得用数组存贮,进行模拟运算,这就大大增加了运算量。文中分析了这个算法实现过程中的运算量,分析结果说明NTRUsign的运算量过大,以致实际并非一个实用算法。

This paper introduces the generation of NTRUsign key, which involves the computation of so great numbers that they overflow. An analysis of the amount of computation of the NTRUsign algorism is made, which indicates that the computation amount is so huge for the algorism to be of practical use