On the linear complexity of binary threshold sequences derived from Fermat quotients
From MaRDI portal
Recommendations
- An extension of binary threshold sequences from Fermat quotients
- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- Linear complexity of binary sequences derived from polynomial quotients
- Linear complexity of binary threshold sequences derived from generalized polynomial quotient with prime-power modulus
- The linear complexity of binary sequences with period (2/sup n/-1)/sup k/
Cites work
- A search for Wieferich and Wilson primes
- Additive character sums of polynomial quotients
- Autocorrelation values of generalized cyclotomic sequences of order two
- Bounds of multiplicative character sums with Fermat quotients of primes
- Character sums with Fermat quotients
- Fermat quotients for composite moduli
- Fermat quotients: exponential sums, value set and primitive roots
- How many bits have to be changed to decrease the linear complexity?
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 4150268 (Why is no real title available?)
- scientific article; zbMATH DE number 3616509 (Why is no real title available?)
- Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences
- On the k-error linear complexity of cyclotomic sequences
- On the 𝑝-divisibility of Fermat quotients
- Pseudorandomness and dynamics of Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
Cited in
(17)- 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 error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
- Trace representation of the binary \(pq^2\)-periodic sequences derived from Euler quotients
- Additive character sums of polynomial quotients
- Linear complexity of binary sequences derived from polynomial quotients
- An extension of binary threshold sequences from Fermat quotients
- 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
- On the k-error linear complexity of binary sequences derived from polynomial 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
- On the correlation measures of orders 3 and 4 of binary sequence of period p^2 derived from Fermat quotients
- Large families of pseudorandom binary sequences constructed by using Fermat quotients
- Linear complexity of r-ary sequences derived from Euler quotient modulo pq
- Trace representation of pseudorandom binary sequences derived from Euler quotients
This page was built for publication: On the linear complexity of binary threshold sequences derived from Fermat quotients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949234)
