Abstract
We estimate character sums with inversive and nonlinear recurring sequences ‘on average’ over all initial values and obtain much stronger bounds than known for ‘individual’ sequences. As a consequence, we present results ’on average’ about the distribution of power residues and primitive elements in such sequences.
On the one hand our bounds can be regarded as results on the pseudorandomness of inversive and nonlinear recurring sequences. On the other hand they shall provide a further step to efficient deterministic algorithms for finding non-powers and primitive elements in a finite field.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bach, E., Shallit, J.: Algorithmic number theory. Efficient algorithms. Foundations of Computing Series, vol. 1. MIT Press, Cambridge (1996)
Gomez, D., Winterhof, A.: Character sums for sequences of iterations of Dickson polynomials. In: Mullen, G., et al. (eds.) Finite Fields and Applications Fq8, Contemporary Mathematics (to appear)
Gomez, D., Winterhof, A.: Multiplicative Character Sums of Recurring Sequences with Rédei Functions. In: Proceedings SETA 2008 (to appear, 2008)
Gutierrez, J., Shparlinski, I.E.: Winterhof, Arne On the linear and nonlinear complexity profile of nonlinear pseudorandom number-generators. IEEE Trans. Inform. Theory 49(1), 60–64 (2003)
Jungnickel, D.: Finite fields. Structure and arithmetics. Bibliographisches Institut, Mannheim (1993)
Lidl, R., Niederreiter, H.: Finite fields. Encyclopedia of Mathematics and its Applications, vol. 20. Cambridge University Press, Cambridge (1997)
Niederreiter, H., Shparlinski, I.E.: On the distribution and lattice structure of nonlinear congruential pseudorandom numbers. Finite Fields Appl. 5(3), 246–253 (1999)
Niederreiter, H., Shparlinski, I.E.: On the distribution of pseudorandom numbers and vectors generated by inversive methods. Appl. Algebra Engrg. Comm. Comput. 10(3), 189–202 (2000)
Niederreiter, H., Shparlinski, I.E.: On the average distribution of inversive pseudorandom numbers. Finite Fields Appl. 8(4), 491–503 (2002)
Niederreiter, H., Shparlinski, I.E.: On the distribution of power residues and primitive elements in some nonlinear recurring sequences. Bull. London Math. Soc. 35(4), 522–528 (2003)
Niederreiter, H., Winterhof, A.: Multiplicative character sums for nonlinear recurring sequences. Acta Arith. 111(3), 299–305 (2004)
Shoup, V.: Searching for primitive roots in finite fields. Math. Comp. 58, 369–380 (1992)
Shparlinski, I.E.: Finite fields: theory and computation. The meeting point of number theory, computer science, coding theory and cryptography. Mathematics and its Applications, vol. 477. Kluwer Academic Publishers, Dordrecht (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Çeşmelioğlu, A., Winterhof, A. (2008). On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-85912-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85911-6
Online ISBN: 978-3-540-85912-3
eBook Packages: Computer ScienceComputer Science (R0)