Bound for linear complexity of BBS sequences
F. Montoya Vitini, J. Muñoz Masqué, Alberto Peinado Domínguez · Electronics Letters · 1998
Pseudorandom sequences produced by the Blum-Blum-Shub generator are seen to be useful in a wide range of applications. Recently, much attention has been paid to their linear complexity. The authors present a lower bound on the linear complexity for binary BBS sequences of maximal period.