On the Naor-Reingold pseudo-random function from elliptic curves

Applicable Algebra in Engineering, Communications and Computing

Volumn 11, Issue 1, 2000, Pages 27-34

  Shparlinski, Igor E ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; RANDOM PROCESSES;

ELLIPTIC CURVES; PSEUDO-RANDOM FUNCTIONS;

SET THEORY;

EID: 0033711416     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000000023     Document Type: Article

References (15)

1. Drmota, M., Tichy, R.: Sequences, discrepancies and applications, Berlin: Springer, 1997
2. Griffin, F., Shparlinski, I. E.: 'On the linear complexity of the Naor-Reingold pseudo-random number function', Proc. 2nd Intern. Conf. on Information and Communication Security, Sydney, 1999, Lect. Notes in Comp. Sci. vol 1726 pp. 301-308. Berlin: Springer, 1999
3. Griffin, F., Shparlinski, I. E.: 'On the linear complexity of the Naor-Reingold pseudo-random number function', Proc. 2nd Intern. Conf. on Information and Communication Security, Sydney, 1999, Lect. Notes in Comp. Sci. vol 1726 pp. 301-308. Berlin: Springer, 1999
4. Banks, W., Griffin, F., Lieman, D., Shparlinski, I. E.: Non-linear complexity of the Naor-Reingold pseudo-random function, Proc. the 2nd Intern. Conf. on Information Security and Cryptology, Seoul, 1999, Lect. Notes in Comp. Sci., Berlin: Springer (to appear)
5. Kohel, D. R., Shparlinski, I. E.: Exponential sums and group generators for elliptic curves over finite fields, Proc. the 4th Algorithmic Number Theory Symp., Leiden, 2000, Lect. Notes in Comp. Sci., Berlin: Springer (to appear)
6. Konyagin, S. V., Shparlinski, I. E.: Character sums with exponential functions and their applications, Cambridge: Cambridge Univ. Press, 1999
7. Korobov, N. M.: On the distribution of digits in periodic fractions, Math. USSR - Sbornik, 18, 659-676 (1972)
8. Korobov, N. M.: Exponential sums and their applications, Dordrecht: Kluwer, 1992
9. Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions', Proc. 38th IEEE Symp. on Foundations of Comp. Sci., 458-467 (1997)
10. Niederreiter, H.: Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc., 84, 957-1041 (1978)
11. Niederreiter, H.: Random number generation and quasi-Monte Carlo methods, SIAM, Philadelphia, 1992
12. Shparlinski, I. E.: On Gaussian sums for finite fields and elliptic curves, Lect. Notes in Comp. Sci. vol 573, pp. 5-15 Berlin: Springer, 1992
13. Shparlinski, I. E.: On the uniformity of distribution of the Naor-Reingold pseudo-random function', Finite Fields and Their Appl. (to appear)
14. Shparlinski, I. E., Silverman, J. H.: Linear complexity of the Naor-Reingold pseudo-random number function from elliptic curves, Preprint, 1999, pp. 1-14
15. Silverman, J. H.: The arithmetic of elliptic curves, Berlin: Springer, 1995