On Stern's attack against secret truncated linear congruential generators

Scott Contini, Igor E. Shparlinski

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)52-60
Number of pages9
JournalLecture Notes in Computer Science
Volume3574
DOIs
Publication statusPublished - 2005

Fingerprint Dive into the research topics of 'On Stern's attack against secret truncated linear congruential generators'. Together they form a unique fingerprint.

Cite this