On the Uniformity of Distribution of the Naor-Reingold Pseudo-Random Function

Finite Fields and their Applications

Volumn 7, Issue 2, 2001, Pages 318-326

  Shparlinski, Igor E ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

character sums; discrepancy; exponential functions; Pseudo random numbers

Indexed keywords

EID: 0009125766     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.2000.0291     Document Type: Article

References (17)

1. Baker R. C., Harman G. Shifted primes without large prime factors. Acta Arith. 83:1998;331-361.
2. 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. 1787:2000;Springer-Verlag, Berlin. p. 53-59.
3. Davenport H. Multiplicative Number Theory. 1967;Markham, Chicago.
4. Griffin F., Shparlinski I. E. On the linear complexity of the Naor - Reingold pseudo-random function. Proc. 2nd Intern. Conf. on Information and Communication Security, Sydney, 1999. 1726:1999;Springer-Verlag, Berlin. p. 301-308.
5. Heath-Brown D. R. Zero-free regions for Dirichlet L-functions and the least prime in an arithmetic progression. Proc. London Math. Soc. 64:1991;265-338.
6. D. R. Heath-Brown, and, S. Konyagin, New bounds for Gauss sums derived from kth powers, and for Heilbronn's exponential sum, Quart. J. Math. Oxford, to appear.
7. Konyagin S. V., Shparlinski I. E. Character Sums with Exponential Functions and Their Applications. 1999;Cambridge Univ. Press, Cambridge.
8. Korobov N. M. On the distribution of digits in periodic fractions. Mat. Sb. 18:1972;659-676.
9. Korobov N. M. Exponential Sums and Their Applications. 1992;Kluwer Academic, Dordrecht.
10. Montgomery H. L. Ten Lectures on the Interface between Analytic Number Theory and Harmonic Analysis. 1994;Amer. Math. Soc., Providence.
11. M. Naor and O. Reingold, Number-theoretic constructions of efficient pseudo-random functions, inProc. 38th IEEE Symp. on Foundations of Comp. Sci., 1997, pp. 458-467.
12. Niederreiter H. Quasi-Monte Carlo methods and pseudo-random numbers. Bull. Amer. Math. Soc. 84:1978;957-1041.
13. Niederreiter H. Random Number Generation and Quasi-Monte Carlo Methods. 1992;SIAM, Philadelphia.
14. Prachar K. Primzahlverteilung. 1957;Springer-Verlag, Berlin.
15. Shparlinski I. E. On the Naor-Reingold Pseudo-random Number Function from Elliptic Curves. Appl. Algebra Engng. Comm. Comput. 11:2000;27-34.
16. Shparlinski I. E. Linear complexity of the Naor-Reingold pseudo-random function. Inform. Process Lett. 95:2000;95-99.
17. I. E. Shparlinski, and, J. H. Silverman, On the linear complexity of the Naor-Reingold pseudo-random function from elliptic curves, Des Codes Crytogr, to appear.