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 present a more careful analysis of the algorithm, and establish some limits of its applicability. Thus, secret truncated linear congruential generators may not necessarily be insecure for properly chosen parameters. Unfortunately, as in the original algorithm, all the results remain heuristic, however we present results of numerical experiments which support our conclusions. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Contini, S., & Shparlinski, I. E. (2005). On Stern’s attack against secret truncated linear congruential generators. In Lecture Notes in Computer Science (Vol. 3574, pp. 52–60). Springer Verlag. https://doi.org/10.1007/11506157_5
Mendeley helps you to discover research relevant for your work.