Hot answers tagged algorithm-design
If, as can be reasonably inferred from the question, a fresh random $k$ is chosen on each invocation of $G$, then $G$ is not a pseudorandom generator because it is not deterministic. (A pseudorandom generator by definition is a deterministic algorithm.) If $k$ is fixed, then more information would be needed. For example, is $k$ always the same, or is a ...
Only top voted, non community-wiki answers of a minimum length are eligible