Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
From MaRDI portal
Recommendations
- Linear complexity of a class of pseudorandom sequences over a general finite field
- Linear complexity of pseudorandom sequences based on summation of polynomial quotients
- On \(k\)-error linear complexity of pseudorandom binary sequences derived from Euler quotients
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On k-error linear complexity of some explicit nonlinear pseudorandom sequences
- Pseudorandomness and dynamics of Fermat quotients
- scientific article; zbMATH DE number 2124952
- On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders
- On the linear complexity and lattice test of nonlinear pseudorandom number generators
Cites work
- A remark on Artin's conjecture
- Additive character sums of polynomial quotients
- ARTIN'S CONJECTURE FOR PRIMITIVE ROOTS
- Bounds of multiplicative character sums with Fermat quotients of primes
- Character sums with Fermat quotients
- Fermat quotients: exponential sums, value set and primitive roots
- 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 47996 (Why is no real title available?)
- Multiplicative character sums of Fermat quotients and pseudorandom sequences
- On primes in arithmetic progression having a prescribed primitive root
- On the value set of Fermat quotients
- On the 𝑝-divisibility of Fermat quotients
- Pseudorandomness and dynamics of Fermat quotients
- Solutions of the congruence 𝑎^{𝑝-1}≡1 (mod 𝑝^{𝑟})
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- Theory of transformation groups of polynomials over \(\mathrm{GF}(2)\) with applications to linear shift register sequences
Cited in
(18)- Trace representation and linear complexity of binary sequences derived from Fermat quotients
- On error linear complexity of new generalized cyclotomic binary sequences of period \(p^2\)
- On the linear complexity of binary threshold sequences derived from Fermat quotients
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Additive character sums of polynomial quotients
- Linear complexity of pseudorandom sequences based on summation of polynomial quotients
- Pseudorandomness and dynamics of Fermat quotients
- Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)
- An extension of binary threshold sequences from Fermat quotients
- Structure of Pseudorandom Numbers Derived from Fermat Quotients
- Linear complexity of binary sequences derived from Euler quotients with prime-power modulus
- scientific article; zbMATH DE number 2051228 (Why is no real title available?)
- 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
- Trace representation of pseudorandom binary sequences derived from Euler quotients
This page was built for publication: Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q437681)
