Abstract
We study the distribution of s-dimensional points of Fermat quotients modulo p with arbitrary lags. If no lags coincide modulo p the same technique as in [21] works. However, there are some interesting twists in the other case. We prove a discrepancy bound which is unconditional for s = 2 and needs restrictions on the lags for s > 2. We apply this bound to derive results on the pseudorandomness of the binary threshold sequence derived from Fermat quotients in terms of bounds on the well-distribution measure and the correlation measure of order 2, both introduced by Mauduit and Sárközy. We also prove a lower bound on its linear complexity profile. The proofs are based on bounds on exponential sums and earlier relations between discrepancy and both measures above shown by Mauduit, Niederreiter and Sárközy. Moreover, we analyze the lattice structure of Fermat quotients modulo p with arbitrary lags.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brandstätter, N., Winterhof, A.: Linear complexity profile of binary sequences with small correlation measure. Periodica Mathematica Hungarica 52(2), 1–8 (2006)
Cassaigne, J., Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences, VII: the measures of pseudorandomness. Acta Arithmetica 103, 97–118 (2002)
Dorfer, G.: Lattice profile and linear complexity profile of pseudorandom number sequences. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds.) Fq7 2003. LNCS, vol. 2948, pp. 69–78. Springer, Heidelberg (2004)
Dorfer, G., Meidl, W., Winterhof, A.: Counting functions and expected values for the lattice profile at n. Finite Fields Appl. 10, 636–652 (2004)
Dorfer, G., Winterhof, A.: Lattice structure and linear complexity profile of nonlinear pseudorandom number generators. Appl. Algebra Engrg. Comm. Comput. 13, 499–508 (2003)
Dorfer, G., Winterhof, A.: Lattice structure of nonlinear pseudorandom number generators in parts of the period. In: Niederreiter, H. (ed.) Monte Carlo and Quasi-Monte Carlo Methods 2002, pp. 199–211. Springer, Berlin (2004)
Drmota, M., Tichy, R.: Sequences, Discrepancies and Applications. Springer, Berlin (1997)
Ernvall, R., Metsänkylä, T.: On the p-divisibility of Fermat quotients. Math. Comp. 66, 1353–1365 (1997)
Fu, F.-W., Niederreiter, H.: On the counting function of the lattice profile of periodic sequences. J. Complexity 23, 423–435 (2007)
Granville, A.: Some conjectures related to Fermat’s Last Theorem. In: Number Theory W. de Gruyter, NY, pp. 177–192 (1990)
Heath-Brown, R.: An estimate for Heilbronn’s exponential sum. In: Analytic Number Theory: Proc. Conf. in honor of Heini Halberstam, Birkhäuser, Boston, pp. 451–463 (1996)
Iwaniec, H., Kowalski, E.: Analytic number theory. American Mathematical Society Colloquium Publications, vol. 53. American Mathematical Society, Providence (2004)
Marsaglia, G.: The structure of linear congruential sequences. In: Zaremba, S.K. (ed.) Applications of Number Theory to Numerical Analysis, pp. 249–285. Academic Press, New York (1972)
Mauduit, C., Niederreiter, H., Sárközy, A.: On pseudorandom (0,1) and binary sequences. Publ. Math. Debrecen 71(3-4), 305–324 (2007)
Mauduit, C., Sárközy, A.: On finite pseudorandom binary sequences I: measures of pseudorandomness, the Legendre symbol. Acta Arith. 82, 365–377 (1997)
Moreno, C.J., Moreno, O.: Exponential sums and Goppa codes. I. Proc. Amer. Math. Soc. 111, 523–531 (1991)
Niederreiter, H.: Random Number Generation and Quasi-Monte Carlo Methods. SIAM, Philadelphia (1992)
Niederreiter, H., Rivat, J.: On the correlation of pseudorandom numbers generated by inversive methods. Monatshefte für Mathematik 153(3), 251–264 (2008)
Niederreiter, H., Winterhof, A.: Lattice structure and linear complexity of nonlinear pseudorandom numbers. Appl. Algebra Engrg. Comm. Comput. 13, 319–326 (2002)
Niederreiter, H., Winterhof, A.: On the structure of inversive pseudorandom number generators. In: Boztaş, S., Lu, H.-F. (eds.) AAECC 2007. LNCS, vol. 4851, pp. 208–216. Springer, Heidelberg (2007)
Ostafe, A., Shparlinski, I.E.: Pseudorandomness and dynamics of Fermat quotients, 1–26 (preprint) (2009)
Wang, L.-P., Niederreiter, H.: Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences. J. Complexity 24, 144–153 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, Z., Ostafe, A., Winterhof, A. (2010). Structure of Pseudorandom Numbers Derived from Fermat Quotients. In: Hasan, M.A., Helleseth, T. (eds) Arithmetic of Finite Fields. WAIFI 2010. Lecture Notes in Computer Science, vol 6087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13797-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-13797-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13796-9
Online ISBN: 978-3-642-13797-6
eBook Packages: Computer ScienceComputer Science (R0)