Additive character sums of polynomial quotients
From MaRDI portal
Publication:2869127
DOI10.1090/CONM/579/11519zbMath1306.11096OpenAlexW4229598223MaRDI QIDQ2869127
No author found.
Publication date: 3 January 2014
Published in: Theory and Applications of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/conm/579/11519
Exponential sums (11T23) Congruences; primitive roots; residue systems (11A07) Estimates on character sums (11L40)
Related Items (10)
Trace representation and linear complexity of binary sequences derived from Fermat quotients ⋮ On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients ⋮ On the k-error linear complexity of binary sequences derived from polynomial quotients ⋮ Trace representation of pseudorandom binary sequences derived from Euler quotients ⋮ On the linear complexity of binary threshold sequences derived from Fermat quotients ⋮ Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations ⋮ Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients ⋮ Polynomial quotients: Interpolation, value sets and Waring's problem ⋮ Linear Complexity of Binary Threshold Sequences Derived from Generalized Polynomial Quotient with Prime-Power Modulus ⋮ Additive character sums of polynomial quotients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The arithmetic of Carmichael quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- Boolean functions derived from Fermat quotients
- How many bits have to be changed to decrease the linear complexity?
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- The stability theory of stream ciphers
- Linear complexity of generalized cyclotomic binary sequences of order 2
- Fermat quotients for composite moduli
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Permutation polynomials, de Bruijn sequences, and linear complexity
- Distribution of values of polynomial Fermat quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the divisibility of Fermat quotients
- Additive character sums of polynomial quotients
- ON THE DISTRIBUTION OF PSEUDORANDOM NUMBERS AND VECTORS DERIVED FROM EULER–FERMAT QUOTIENTS
- Linear Complexity of Binary Sequences Derived from Polynomial Quotients
- BOUNDS OF MULTIPLICATIVE CHARACTER SUMS WITH FERMAT QUOTIENTS OF PRIMES
- Pseudorandomness and Dynamics of Fermat Quotients
- CHARACTER SUMS WITH FERMAT QUOTIENTS
- Fermat quotients: exponential sums, value set and primitive roots
- Short character sums with Fermat quotients
- 𝑘-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of period (pr – 1)/3
- Bounds on the Linear Complexity and the 1-Error Linear Complexity over F p of M-ary Sidel’nikov Sequences
- On the lower bound of the linear complexity over F/sub p/ of Sidelnikov sequences
- Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences
- On the Linear Complexity and $k$-Error Linear Complexity Over $ {\BBF }_{p}$ of the $d$-ary Sidel'nikov Sequence
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- On the 𝑝-divisibility of Fermat quotients
- Linear complexity over F/sub P/ and trace representation of Lempel-Cohn-Eastman sequences
- Autocorrelation values of generalized cyclotomic sequences of order two
- Properties of the Error Linear Complexity Spectrum
- Interpolation of Fermat Quotients
- On the value set of Fermat quotients
- On the k-error linear complexity of cyclotomic sequences
- One-Error Linear Complexity over F p of Sidelnikov Sequences
- Shift-register synthesis and BCH decoding
- A search for Wieferich and Wilson primes
This page was built for publication: Additive character sums of polynomial quotients
