对计算有限域上切比雪夫多项式的特征多项式算法(CPA)进行了改进,以提高算法的执行速度.首先用蒙哥马利模乘代替原有算法中的普通模乘运算,从而降低单次模乘运算的平均运行时间;其次对蒙哥马利模平方运算的算法流程进行了优化,减少其中单精度乘法的执行次数.仿真结果表明,改进后的CPA其运行速度有了很大提高.
A characteristic polynomial algorithm (CPA) for computation of Chebyshev polynomial over finite field is modified to achieve faster execution speed. First, the Montgomery modular multiplication is introduced to replace the classical modular multiplication, and reduce the average time cost of one multi- plication. Second, the procedure of Montgomery modular square algorithm is optimized to reduce the required number of single-precision multiplications. Simulations show that the modified algorithm is faster than the original one.