Title: Calculation Enhancement of Chebyshev Polynomial over Zp
Abstract: It has been recommended that the safe size of the key space for any cryptosystem based on Chebyshev polynomial extended over the finite field �� must be chosen such that � � 2 ��� . For such size of �, the normal Chebyshev polynomial calculation speed will be slow and impractical. Thus, there is a need to improve the Chebyshev polynomial calculation before the polynomial can be used in mainstream cryptosystems. In this paper, two types of Chebyshev polynomial calculation models are being considered, the Matrix Algorithm and the Characteristic Polynomial Algorithm. This paper introduces new technique to improve both of these calculation models. Preliminary results show indications that the proposed technique is a reliable alternative for implementing Chebyshev polynomial calculation.
Publication Year: 2013
Publication Date: 2013-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot