On the linear complexity of the naor—reingold pseudo-random function

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1726, Issue , 1999, Pages 301-308

  Griffin, Frances ^a   Shparlinski, Igor E ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

LINEAR COMPLEXITY; PSEUDO-RANDOM FUNCTIONS; RESTRICTIVE CONDITIONS; USEFUL PROPERTIES;

ARTIFICIAL INTELLIGENCE;

EID: 0007057181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-47942-0_25     Document Type: Conference Paper

References (8)

1. T. W. Cusick, C. Ding and A. Renvall, Stream Ciphers and Number Theory, Elsevier, Amsterdam, 1998.
2. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Cryptography, CRC Press, Boca Raton, FL, 1996.
3. M. Naor and O. Reingold, 'Number-theoretic constructions of efficient pseudorandom functions', Proc. 38th IEEE Symp. on Foundations of Comp. Sci., 1997, 458-467.
4. H. Niederreiter, 'Some computable complexity measures for binary sequences', Proc. Intern. Conf. on Sequences and Their Applications, Singapore, 1998, (to appear).
5. H. Niederreiter and M. Vielhaber, 'Linear complexity profiles: Hausdorff dimension for almost perfect profiles and measures for general profiles', J. Compl., 13 (1996), 353-383.
6. R. A. Rueppel, 'Stream ciphers', Contemporary Cryptology: The Science of Information Integrity, IEEE Press, NY, 1992, 65-134.
7. I. E. Shparlinski, 'On the uniformity of distribution of the Naor-Reingold pseudo-random function', Preprint, 1999, 1-11.
8. I. E. Shparlinski, 'On the Naor-Reingold pseudo-random number generator from elliptic curves', Preprint, 1999, 1-9.