TY - JOUR
T1 - On Stern's attack against secret truncated linear congruential generators
AU - Contini, Scott
AU - Shparlinski, Igor E.
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=26444449872&partnerID=8YFLogxK
U2 - 10.1007/11506157_5
DO - 10.1007/11506157_5
M3 - Article
AN - SCOPUS:26444449872
VL - 3574
SP - 52
EP - 60
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -