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

Designs, Codes, and Cryptography

Volumn 24, Issue 3, 2001, Pages 279-289

  Shparlinski, Igor E ^a   Silverman, Joseph H ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b BROWN UNIVERSITY   (United States)

Author keywords

Elliptic curves; Linear complexity; Naor Reingold pseudo random function

Indexed keywords

EID: 0035546532     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011223204345     Document Type: Article

References (15)

1. W. Banks, F. Griffin, D. Lieman and I. E. Shparlinski, Non-linear complexity of the Naor-Reingold pseudo-random function. In Proceedings the 2nd International Conference on Information Security and Cryptology, Seoul, Vol. 1787, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin (2000) pp. 53-59.
2. T. W. Cusick, C. Ding and A. Renvall, Stream Ciphers and Number Theory, Elsevier, Amsterdam (1998).
3. G. Gong, T. A. Bernson and D. A. Stinson, Elliptic curve pseudorandom sequence generators, Research Report CORR-98-53, Faculty of Mathematics, University of Waterloo (1998) pp. 1-21.
4. F. Griffin and I. E. Shparlinski, On the linear complexity of the Naor-Reingold pseudo-random function. In Proceedings 2nd International Conference on Information and Communication Security, Sydney, volume 1726, Lecture Notes in Computer Science, Springer-Verlag, Berlin (1999) pp. 301-308.
5. S. Hallgren, Linear congruential generators over elliptic curves, Preprint CS-94-143, Department of Computer Science, Cornegie Mellon University (1994) pp. 1-10.
6. R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge (1997).
7. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, FL (1996).
8. M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions. In Proceedings 38th IEEE Symposium on Foundations of Computer Science (1997) pp. 458-467.
9. H. Niederreiter, Some computable complexity measures for binary sequences. In Proceedings International Conference on Sequences and Their Applications (SETA'98), Singapore, Springer-Verlag, London (1999) pp. 67-78.
10. H. Niederreiter and M. Vielhaber, Linear complexity profiles: Hausdorff dimension for almost perfect profiles and measures for general profiles, J. Compl., Vol. 13 (1996) pp. 353-383.
11. R. A. Rueppel, Stream ciphers, Contemporary Cryptology: The Science of Information Integrity, IEEE Press, NY (1992) pp. 65-134.
12. I. E. Shparlinski, On the uniformity of distribution of the Naor-Reingold pseudo-random function, Finite Fields and Their Appl., Vol. 7 (2001) pp. 318-326.
13. I. E. Shparlinski, On the Naor-Reingold pseudo-random number function from elliptic curves, Appl. Algebra Engin., Commun. Comput., Vol. 11 (2001) pp. 27-34.
14. J. H. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, Berlin (1995).
15. I. M. Vinogradov, Elements of Number Theory, Dover Publishers, New York (1954).