Character sums with Fermat quotients
From MaRDI portal
Publication:3103754
DOI10.1093/QMATH/HAQ028zbMATH Open1273.11126OpenAlexW2089489391MaRDI QIDQ3103754FDOQ3103754
Authors: Igor E. Shparlinski 
Publication date: 8 December 2011
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/haq028
Recommendations
Cited In (25)
- Polynomial quotients: Interpolation, value sets and Waring's problem
- Trace representation of pseudorandom binary sequences derived from Euler quotients
- On the distribution of pseudorandom numbers and vectors derived from Euler-Fermat quotients
- Fermat quotients: exponential sums, value set and primitive roots
- On vanishing Fermat quotients and a bound of the Ihara sum
- The composite character of the twenty-second Fermat number
- On the k-error linear complexity of binary sequences derived from polynomial quotients
- Boolean functions derived from Fermat quotients
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- Title not available (Why is that?)
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- An extension of binary threshold sequences from Fermat quotients
- On the value set of Fermat quotients
- Statistical distribution of Fermat quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- Short character sums with Fermat quotients
- Title not available (Why is that?)
- Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus
- Additive character sums of polynomial quotients
- On the correlation measures of orders \(3\) and \(4\) of binary sequence of period \(p^2\) derived from Fermat quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Bounds of multiplicative character sums with Fermat quotients of primes
- On the linear complexity of binary threshold sequences derived from Fermat quotients
This page was built for publication: Character sums with Fermat quotients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3103754)
