Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2011, Vol. 34 ›› Issue (6): 47-50.doi: 10.13190/jbupt.201106.47.lizhh

• Papers • Previous Articles     Next Articles

Improved algorithm for Computation of Chebyshev polynomial over finite field

  

  • Received:2011-01-19 Revised:2011-08-27 Online:2011-12-28 Published:2011-10-18
  • Contact: Zhi-Hui LI E-mail:lizhihui8601@gmail.com

Abstract:

A Characteristic polynomial algorithm 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 to reduce the average time cost on a multiplication, by avoiding the division operation in modular arithmetic. Second, the procedure of Montgomery modular square algorithm is modified to reduce the required number of single-precision multiplications. The simulation results show that the modified algorithm is faster than the original one.

CLC Number: