On stern's attack against secret truncated linear congruential generators

摘要: In 1987, Stern showed how the parameters for secret truncated linear congruential generators could be derived in polynomial time. Here, we present a modification to that algorithm which makes it simpler, more robust, and require less data. We then careful analysis of algorithm, establish some limits its applicability. Thus, may not necessarily insecure properly chosen parameters. Unfortunately, as original all results remain heuristic, however numerical experiments support our conclusions.