Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (13): 90-92.DOI: 10.3778/j.issn.1002-8331.2009.13.027
• 网络、通信、安全 • Previous Articles Next Articles
QI Chuan-da1,LI Gang2
Received:
Revised:
Online:
Published:
Contact:
祁传达1,李 刚2
通讯作者:
Abstract: The problem of generation trinomials for GMW-sequences is studied.The structure and count of generation trinomials for GMW-sequences is presented.It is proved that the amount of generation trinomials for GMW-sequences is less than m-sequences with the same period.It is explained that intensity of GMW-sequences resist the fast correlation attacks is greater than m-sequences with the same period.
Key words: GMW sequences, m-sequences, auto-correlate function, trace function
摘要： 研究了GMW-序列的三项生成多项式问题，给出了其三项生成多项式的结构和计数，证明了其三项生成多项式个数远远少于同周期的m-序列，这说明GMW-序列在抵抗快速相关攻击的能力方面要强于同周期的m-序列。
关键词: GMW-序列, m-序列, 自相关函数, 迹函数
QI Chuan-da1,LI Gang2. Generation trinomials of GMW-sequences[J]. Computer Engineering and Applications, 2009, 45(13): 90-92.
祁传达1,李 刚2. GMW-序列的三项生成多项式[J]. 计算机工程与应用, 2009, 45(13): 90-92.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.13.027
http://cea.ceaj.org/EN/Y2009/V45/I13/90
