有限域切比雪夫多项式算法性能测试与分析

The Arithmetic Performance Test and Analysis on Finite Fields Chebyshev Polynomials

本文在有限域切比雪夫多项式算法的基础上,分别对其密钥协商、公钥加密和数字签名算法进行编程测试。然后结合有限域切比雪夫多项式的性质对实验数据进行分析,并与公钥体系中常用的RSA、Elgamal和ECC算法进行比较,总结出有限域切比雪夫多项式算法具有加密简单,计算量小,处理速度快,存储空间占用小的优势,更加适合于无线公钥加密系统。

Based on finite fields Chebyshev polynomials arithmetic,this paper dose performance test by programming for public key cipher,digit signature and key negotiation arithmetic.Afterwards,combined with the characteristics of finite fields Chebyshev polynomials,analysis of experiment data has been done.And then the results are compared with RSA,Elgamal and ECC which are universally used in PKI,followed by the advantages that ciphering simply,processing quickly,needing little memory etc.At last,it is concluded that finite fields Chebyshev polynomials are more compatible for WPKI than the three illustrated above.