摘要
本文对有限域Fp上本原多项式的判别算法进行了程序上的优化,C语言实现了Fp上本原多项式的搜索算法,并搜索到若干F231-1上的本原多项式,这些多项式可以应用到实际的序列密码方案设计当中。
This paper optimizes the search algorithm of primitive polynomial in finite fields. As an example,for p is equal to 231-1,we have searched a number of primitive polynomials over Fp,these primitive polynomials are useful for designing stream cipher.
出处
《北京电子科技学院学报》
2014年第4期34-37,共4页
Journal of Beijing Electronic Science And Technology Institute