On the period of the Naor--Reingold sequence

Authors:
Álvar Ibeas Martín
Affiliations:
University of Cantabria, Spain
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 1

Random number generation and quasi-Monte Carlo methods

Random number generation and quasi-Monte Carlo methods
Period of the power generator and small values of Carmichael's function

Mathematics of Computation
On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves

Designs, Codes and Cryptography
Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM (JACM)
Dynamical systems generated by rational functions

AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
The Period Lengths of Inversive Pseudorandom Vector Generations

Finite Fields and Their Applications

On the linear complexity of the Naor-Reingold sequence with elliptic curves

Finite Fields and Their Applications

Quantified Score

Hi-index	0.89

Visualization

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.