On a Fast Version of a Pseudorandom Generator
In an earlier paper I constructed a large family of pseudorandom sequences by using the discrete logarithm. While the sequences in this construction have strong pseudorandom properties, they can be generated very slowly since no fast algorithm is known to compute ind n. The purpose of this paper is to modify this family slightly so that the members of the new family can be generated much faster, and they have almost as good pseudorandom properties as the sequences in the original family.
KeywordsBinary Sequence Correlation Measure Discrete Logarithm Irreducible Polynomial Primitive Root
Unable to display preview. Download preview PDF.
- 1.Ahlswede, R., Mauduit, C., Sárközy, A.: Large families of pseudorandom sequences of k symbols and their complexity, Part I, Part II. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 293–307, 308–325. Springer, Heidelberg (2006)Google Scholar
- 13.Weil, A.: Sur les courbes algébriques et les variétés qui s’en déduisent. Act. Sci. Ind. 1041, Hermann, Paris (1948)Google Scholar