Calculation enhancement of Chebyshev polynomial over zp
It has been recommended that the safe size of the key space for any cryptosystem based on Chebyshev polynomial extended over the finite field Zp must be chosen such that p > 2^256 . For such size of p, the normal Chebyshev polynomial calculation speed will be slow and impractical. Thus, there is...
Main Author: | |
---|---|
Other Authors: | |
Format: | Journal |
Published: |
Malaysian Journal of Mathematical Sciences, Universiti Putra Malaysia
2013
|
Subjects: | |
Online Access: | http://www.myjurnal.my/public/article-view.php?id=78690 |