Abstract
We prove a bound on sums of products of multiplicative characters of shifted Fermat quotients modulo p. From this bound we derive results on the pseudorandomness of sequences of modular discrete logarithms of Fermat quotients modulo p: bounds on the well-distribution measure, the correlation measure of order ℓ, and the linear complexity.
Similar content being viewed by others
References
H. Aly and A. Winterhof, Boolean functions derived from Fermat quotients, Cryptogr. Commun., 3 (2011), 165–174.
N. Brandstätter and A. Winterhof, Linear complexity profile of binary sequences with small correlation measure, Period. Math. Hungar., 52 (2006), 1–8.
Z. Chen, A. Ostafe and A. Winterhof, Structure of pseudorandom numbers derived from Fermat quotients, WAIFI 2010, Lecture Notes in Comput. Sci. 6087, 2010, 73–85.
Z. Chen and A. Winterhof, Linear complexity profile of m-ary pseudorandom sequences with small correlation measure, Indag. Math. (N.S.), 20 (2009), 631–640.
Z. Chen and A. Winterhof, On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients, Int. J. Number Theory, 8 (2012), 631–641.
R. Ernvall and T. Metsänkylä, On the p-divisibility of Fermat quotients, Math. Comp., 66 (1997), 1353–1365.
A. Granville, Some conjectures related to Fermat’s Last Theorem, Number Theory (Banff, 1988) de Gruyter, NY, 1990, 177–192.
R. Heath-Brown, An estimate for Heilbronn’s exponential sum, Analytic Number Theory, Vol. 2, Progr. Math. 139, 1996, 451–463.
H. Iwaniec and E. Kowalski, Analytic number theory, American Mathematical Society Colloquium Publications 53, American Mathematical Society, Providence, RI, 2004.
C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences I: Measures of pseudorandomness, the Legendre symbol, Acta Arith., 82 (1997), 365–377.
C. Mauduit and A. Sárközy, On finite pseudorandom sequences of k symbols, Indag. Math. (N.S.), 13 (2002), 89–101.
H. Niederreiter, Linear complexity and related complexity measures for sequences, Progress in Cryptology—INDOCRYPT 2003, Lecture Notes in Comput. Sci. 2904, 2003, 1–17.
A. Ostafe and I. E. Shparlinski, Pseudorandomness and dynamics of Fermat quotients, SIAM J. Discrete Math., 25 (2011), 50–71.
I. Shparlinski, Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness, Birkhäuser, 2003.
I. E. Shparlinski, Character sums with Fermat quotients, Q. J. Math., 62 (2011), 1031–1043.
A. Topuzoğlu and A. Winterhof, Pseudorandom sequences, Topics in geometry, coding theory and cryptography, Algebr. Appl. 6, Springer, Dordrecht, 2007, 135–166.
A. Winterhof, Linear complexity and related complexity measures, Selected topics in information and coding theory, World Scientific, 2010, 3–40.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gomez, D., Winterhof, A. Multiplicative character sums of Fermat quotients and pseudorandom sequences. Period Math Hung 64, 161–168 (2012). https://doi.org/10.1007/s10998-012-3747-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-012-3747-1