Title :
Bound for linear complexity of BBS sequences [comment]
Author_Institution :
Inf. Security Group, London Univ., UK
fDate :
5/28/1998 12:00:00 AM
Abstract :
For original paper see ibid., vol. 34, p. 450-51 (1998). A lower bound was given for the linear complexity of Blum-Blum-Shubb sequences. This result is shown to be incorrect
Keywords :
binary sequences; computational complexity; polynomials; BBS sequences; Blum-Blum-Shubb sequences; linear complexity bound; polynomials;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19980770
