| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429162 | Information Processing Letters | 2008 | 4 Pages |
Abstract
In this paper we study the period of the Naor–Reingold sequence. We prove that if the parameters used to define the sequence are chosen uniformly at random, then it reaches the maximum period on average.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
