Studies on the distribution of the shortest linear recurring sequences

被引:0
|
作者
Yin, Qian [1 ]
Yuan, Zhi-Yong [2 ]
Guo, Ping [1 ]
机构
[1] Beijing Normal Univ, Image Proc & Pattern Recognit Lab, Beijing 100875, Peoples R China
[2] Wuhan Univ, Sch Comp Sci, Wuhan 430079, Peoples R China
基金
中国国家自然科学基金;
关键词
Stream cipher; Matrix-representation method; Berlekamp-Massey algorithm; Distribution regulation; Shortest linear recurring sequences; SHIFT-REGISTER SYNTHESIS; STREAM CIPHERS; ALGORITHM;
D O I
10.1016/j.ins.2009.01.042
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The distribution of the shortest linear recurrence (SLR) sequences in the Z/(p) field and over the Z/(p(e)) ring is studied. It is found that the length of the shortest linear recurrent (SLRL) is always equal to n/2, if n is even and n/2 + 1 if n is odd in the Z/(p) field, respectively. On the other hand, over the Z/(p(e)) ring, the number of sequences with length n can also be calculated. The recurring distribution regulation of the shortest linear recurring sequences is also found. To solve the problem of calculating the SLRL, a new simple representation of the Berlekamp-Massey algorithm is developed as well. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:2379 / 2389
页数:11
相关论文
共 50 条