Comments on “a family of keystream generators with large linear complexity” Original Research Article

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].