Fast algorithms for determining the linear complexity of period sequences | |
Xiao, GZ ; Wei, SM | |
2002 | |
关键词 | cryptography periodic sequence linear complexity k-error linear complexity fast algorithm |
英文摘要 | We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p(n) over GF(q), where p is an odd prime, q is a prime and a primitive root modulo p(2); and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p(m)q(n) over GF(q), the other is the algorithm for determining the k-error linear complexity of a sequence with period p(n) over GF(q), where p is an odd prime, q is a prime and a primitive root modulo p(2). The algorithm for determining the linear complexity and the minimal polynomial of a sequence with period 2p(n) over GF(q) is also introduced. where p and q are odd prime, and q is a primitive root (mod p(2)). These algorithms uses the fact that in these case the factorization of x(N) - 1 is especially simple for N = p(n), 2p(n), p(n)q(m).; Computer Science, Artificial Intelligence; SCI(E); CPCI-S(ISTP); 6 |
语种 | 英语 |
内容类型 | 其他 |
源URL | [http://ir.pku.edu.cn/handle/20.500.11897/388647] ![]() |
专题 | 信息科学技术学院 |
推荐引用方式 GB/T 7714 | Xiao, GZ,Wei, SM. Fast algorithms for determining the linear complexity of period sequences. 2002-01-01. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论