A fast algorithm for determining the linear complexity of a binary sequence with period 2~np~m |
| |
| Authors: | WEI Shimin XIAO Guozhen& CHEN Zhong Information Security Research Group |
| |
| Affiliation: | email: weism@jadebird.pku.edu.cn |
| |
| Abstract: | An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is a primitive root modulo p2. The new algorithm generalizes the algorithm for computing the linear complexity of a binary sequence with period 2" and the algorithm for computing the linear complexity of a binary sequence with period pn, where 2 is a primitive root modulo p2. |
| |
| Keywords: | cryptography periodic sequence linear complexity minimal polynomial fast algorithm. |
| 本文献已被 CNKI 等数据库收录！ |
