Abstract
We show that the new pseudo-random function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that, under a certain not too restrictive condition on the parameters of this function, for almost all seeds it produces a sequence with exponentially large linear complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. Elsevier, Amsterdam (1998)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Cryptography. CRC Press, Boca Raton (1996)
Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudorandom functions. In: Proc. 38th IEEE Symp. on Foundations of Comp. Sci, pp. 458–467 (1997)
Niederreiter, H.: Some computable complexity measures for binary sequences. In: Proc. Intern. Conf. on Sequences and Their Applications, Singapore (1998) (to appear)
Niederreiter, H., Vielhaber, M.: Linear complexity profiles: Hausdorff dimension for almost perfect profiles and measures for general profiles. J. Compl. 13, 353–383 (1996)
Rueppel, R.A.: Stream ciphers. In: Contemporary Cryptology: The Science of Information Integrity, pp. 65–134. IEEE Press, NY (1992)
Shparlinski, I.E.: On the uniformity of distribution of the Naor–Reingold pseudo-random function, 1–11 (1999) (preprint)
Shparlinski, I.E.: On the Naor–Reingold pseudo-random number generator from elliptic curves, 1–9 (1999) (preprint)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Griffin, F., Shparlinski, I.E. (1999). On the Linear Complexity of the Naor-Reingold Pseudo-Random Function. In: Varadharajan, V., Mu, Y. (eds) Information and Communication Security. ICICS 1999. Lecture Notes in Computer Science, vol 1726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47942-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-47942-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66682-0
Online ISBN: 978-3-540-47942-0
eBook Packages: Springer Book Archive