Linear complexity of the Naor-Reingold pseudo-random function

Information Processing Letters

Volumn 76, Issue 3, 2000, Pages 95-99

  Shparlinski, Igor E ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; THEOREM PROVING;

NOAR-REINGOLD PSEUDO-RANDOM FUNCTIONS;

NUMBER THEORY;

EID: 0034546183     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(00)00133-2     Document Type: Article

References (12)

1. Banks W., Griffin F., Lieman D., Shparlinski I.E. Non-linear complexity of the Naor-Reingold pseudo-random function. Proc. 2nd Internat. Conf. on Information Security and Cryptology, Seoul. Lecture Notes in Comput. Sci. 1999;Springer, Berlin.
2. Cusick T.W., Ding C., Renvall A. Stream Ciphers and Number Theory. 1998;Elsevier, Amsterdam.
3. Griffin F., Shparlinski I.E. On the linear complexity of the Naor-Reingold pseudo-random function. Proc. 2nd Internat. Conf. on Information and Communication Security, Sydney. Lecture Notes in Comput. Sci. Vol. 1726:1999;301-308 Springer, Berlin.
4. Lidl R., Niederreiter H. Finite Fields. 1997;Cambridge University Press, Cambridge.
5. Menezes A.J., van Oorschot P.C., Vanstone S.A. Handbook of Applied Cryptography. 1996;CRC Press, Boca Raton, FL.
6. Naor M., Reingold O. Number-theoretic constructions of efficient pseudo-random functions. Proc. 38th IEEE Symp. on Foundations of Comput. Sci. 1997;458-467.
7. Niederreiter H. Some computable complexity measures for binary sequences. Proc. Internat. Conf. on Sequences and their Applications (SETA'98), Singapore. 1999;67-78 Springer, London.
8. Niederreiter H., Vielhaber M. Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles. J. Complexity. Vol. 13:1997;353-383.
9. Rueppel R.A. Stream ciphers. Contemporary Cryptology: The Science of Information Integrity. 1992;65-134 IEEE Press, New York.
10. I.E. Shparlinski, On the uniformity of distribution of the Naor-Reingold pseudo-random function, in: Finite Fields and their Appl. (to appear).
11. I.E. Shparlinski, On the Naor-Reingold pseudo-random number function from elliptic curves, Appl. Algebra in Engin., Commun. and Computing (to appear).
12. Shparlinski I.E., Silverman J.H. On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves. Preprint:2000;. pp. 1-14.