论文信息 - Non-linear Complexity of the Naor-Reingold Pseudo-random Function

Non-linear Complexity of the Naor-Reingold Pseudo-random Function

We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of the lower bound on the linear complexity of this function that has been obtained by F. Griffin and I. E. Shparlinski.

[1] C. Ding,et al. Stream Ciphers and Number Theory , 1998 .

[2] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[3] Harald Niederreiter,et al. Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles , 1997, J. Complex..

[4] Igor E. Shparlinski,et al. On the Naor–Reingold Pseudo-Random Function from Elliptic Curves , 2000, Applicable Algebra in Engineering, Communication and Computing.

[5] Harald Niederreiter,et al. Some Computable Complexity Measures for Binary Sequences , 1998, SETA.