|
|
|
| A fast algorithm for determing the linear complexity of a pseudo-random sequence with periodic n2v |
| Cai Mian①②; Wang Hong②; Xiao Guozhen② |
| ①National Key Laboratory of Integrated Services Networks and Research Inst. of Information Security Xidian Univ., Xi' an 710071 China; ②National Key Laboratory of Information Security The Graduate School of the Chinese Academy of Sciences Beijing 100039 |
|
|
|
|
Abstract A generalized discrete Fourier transfom is used to give a fast algorithm for determing the linear complexity of a pseudo-random sequence with periodic n2v, and a new conclusion of Hasse derivatives of polynoimial on GF(2) are proposed.
|
|
Received: 01 September 2000
|
|
|
|
|
|
|
|
|
2002, Vol. 24 
