论文部分内容阅读
WG序列生成器由GF(2~n)上的线性反馈移位寄存器和一个WG变换组成.近几年来国内外的一些学者对WG序列的随机性和安全性方面取得了许多重要的结果,但是仍然有部分问题需要进一步研究和改善.由于在工程实现方面GF(2~n)上的实现不如GF(2)上的实现简便、高效.为了使得WG密码体制更高效的实现,本文利用GF(q~n)和GF(q)之间的关系提出一种改进的由GF(q)上的m序列生成GF(q~n)上的m序列的构造方法,然后将其运用到WG密码体制中取代GF(2~n)上的线性反馈移位寄存器.这样的一种改进可以使得WG密码体制的实现较为简单,计算量得到简化,并得到一些具有可行和实际意义的结果,从而有利于WG密码在GF(2)上的高效实现.通过分析实例WG7和WG8,比较WG7,WG8的两种实现方式,可以看到WG7,WG8使用新的方法实现较原来的WG7,WG8的实现在计算量上得到简化.最后说明使用改进的方法在WG密码体制中是可行的,并且有意义的.
WG sequence generator consists of a linear feedback shift register on GF (2 ~ n) and a WG transform. In recent years, some domestic and foreign scholars have made many important results on the randomness and security of WG sequences. However, Some problems still need to be further studied and improved.As the realization of GF (2 ~ n) is not as simple and efficient as the implementation of GF (2) in terms of project implementation.In order to make the WG cryptosystem more efficient, q ~ n) and GF (q), this paper proposes an improved construction method of generating m sequences on GF (q ~ n) from m sequences on GF (q), which is then applied to the WG cryptosystem Instead of the linear feedback shift register on GF (2 ~ n) .This kind of improvement can make the realization of WG cryptosystem simpler, the computational complexity is simplified, and some feasible and practical results are obtained, WG password in the GF (2) on the efficient realization of. By analyzing the case of WG7 and WG8, compare WG7, WG8 two ways to achieve, you can see WG7, WG8 using the new method to achieve the original WG7, WG8 in the calculation The amount is simplified. Finally, the use of improved methods in the WG password system Feasible and meaningful.