论文信息 - On the Linear Complexity of the Naor–Reingold Pseudo-random Function from Elliptic Curves

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

We show that the elliptic curve analogue of the pseudo-random number function, introduced recently by M. Naor and O. Reingold, produces a sequence with large linear complexity. This result generalizes a similar result of F. Griffin and I. E. Shparlinski for the linear complexity of the original function of M. Naor and O. Reingold. The proof is based on some results about the distribution of subset-products in finite fields and some properties of division polynomials of elliptic curves.

Igor E. Shparlinski | Joseph H. Silverman | J. Silverman | I. Shparlinski

[1] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

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

[3] Sean Hallgren,et al. Linear Congruential Generators Over Elliptic Curves , 2001 .

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

[5] Rudolf Lide,et al. Finite fields , 1983 .

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

[7] Guang Gong,et al. Elliptic Curve Pseudorandom Sequence Generators , 1999, Selected Areas in Cryptography.

[8] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

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

[10] Igor E. Shparlinski,et al. Non-linear Complexity of the Naor-Reingold Pseudo-random Function , 1999, ICISC.

[11] I. Vinogradov,et al. Elements of number theory , 1954 .

[12] Igor E. Shparlinski,et al. On the Uniformity of Distribution of the Naor-Reingold Pseudo-Random Function , 2001 .

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