On the linear complexity of the Naor-- Reingold pseudo-random function (1999) [11 citations — 9 self]
Download:
|
|
by Igor E. Shparlinski, Joseph H. Silverman
Proc. 2nd Intern. Conf. on Information and Communication Security
http://www.comp.mq.edu.au/~igor/NR-Gen-EC-LinComp.ps
Add To MetaCart
Abstract:
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. Gri#n 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 subsetproducts in finite fields and some properties of division polynomials of elliptic curves. 1
Citations
| 321 | The Arithmetic of Elliptic Curves – Silverman - 1986 |
| 318 | Finite Fields – Lidl, Niederreiter |
| 42 | Reingold O., “Number-Theoretic constructions of efficient pseudorandom functions – Naor - 1997 |
| 16 | Stream Ciphers, Contemporary Cryptology: The Science of Information Integrity – Rueppel - 1992 |
| 13 | Elliptic curve pseudorandom sequence generators – Gong, Berson, et al. - 2000 |
| 10 | Some computable complexity measures for binary sequences – Niederreiter - 1999 |
| 9 | Linear congruential generators over elliptic curves – Hallgren - 1994 |
| 8 | On the Naor--Reingold pseudo-random number function from elliptic curves – Shparlinski - 2000 |
| 7 | Elements of number theory, Dover Publ – Vinogradov - 1954 |
| 6 | On the uniformity of distribution of the Naor-- Reingold pseudo-random function', Finite Fields and Their Appl – Shparlinski |
| 3 | Linear complexity profiles: Hausdor # dimension for almost perfect profiles and measures for general profiles – Niederreiter, Vielhaber - 1996 |
