A. Fúster-Sabater
Applied Mathematics Letters. vol. 17, no. 6, pp. 739-740
In these comments, it is shown that the family of keystream generators, lower bound on the linear complexity and computation procedure followed by the authors in [1] coincide with the family of keystream generators, lower bound on the linear complexity nd computation procedure previously followed by Rueppel in [2].
