Non-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 1787, Issue , 2000, Pages 53-59

  Banks, William D ^a   Griffin, Frances ^b   Lieman, Daniel ^a   Shparlinski, Igor E ^b  

^a UNIVERSITY OF MISSOURI   (United States)

^b MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

LINEAR COMPLEXITY; LOWER BOUNDS; NON LINEAR; PSEUDO-RANDOM FUNCTIONS;

SECURITY OF DATA;

EID: 84958770143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10719994_5     Document Type: Conference Paper

References (9)

1. T. W. Cusick, C. Ding and A. Renvall, Stream Ciphers and Number Theory, Elsevier, Amsterdam, 1998.
2. F. Griffin and I. E. Shparlinski, ‘On the linear complexity of the Naor-Reingold pseudo-random function', Proc. 2nd Intern. Conf. on Information and Com-munication Security (ICICS'99), Sydney, Lect. Notes in Comp. Sci., v.1726, Springer-Verlag, Berlin, 1999, 301-308.
3. A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Cryptogra-phy, CRC Press, Boca Raton, FL, 1996.
4. M. Naor and O. Reingold, ‘Number-theoretic constructions of efficient pseudo-random functions', Proc. 38th IEEE Symp. on Foundations of Comp. Sci. (FOCS'97), Miami Beach, IEEE, 1997, 458-467.
5. H. Niederreiter, ‘Some computable complexity measures for binary sequences', Proc. Intern. Conf. on Sequences and their Applications (SETA'98), Singapore, C. Ding, T. Helleseth and H. Niederreiter (Eds.), Springer-Verlag, London, 1999, 67-78.
6. 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.
7. R. A. Rueppel, ‘Stream ciphers', Contemporary Cryptology: The Science of In-formation Integrity, IEEE Press, NY, 1992, 65-134.
8. I. E. Shparlinski, ‘On the uniformity of distribution of the Naor-Reingold pseudo-random function', Finite Fields and Their Appl. (to appear).
9. I. E. Shparlinski, ‘On the Naor-Reingold pseudo-random function from elliptic curves', Preprint, 1999, 1-9.