Measures of pseudorandomness for binary sequences constructed using finite fields
From MaRDI portal
Recommendations
- On pseudorandom binary sequences constructed by using finite fields
- Pseudorandomness of binary sequences derived from linear recursions
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
Cites work
- scientific article; zbMATH DE number 2127885 (Why is no real title available?)
- scientific article; zbMATH DE number 2124947 (Why is no real title available?)
- scientific article; zbMATH DE number 5247160 (Why is no real title available?)
- Construction of large families of pseudorandom binary sequences
- Incomplete character sums over finite fields and their application to the interpolation of the discrete logarithm by Boolean functions
- Lower bounds on the linear complexity of the discrete logarithm in finite fields
- Measures of pseudorandomness for finite sequences: typical values
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On the distribution of powers in finite fields
- On the measures of pseudorandomness of binary sequences.
- Some estimates for character sums and applications
Cited in
(22)- scientific article; zbMATH DE number 426145 (Why is no real title available?)
- Improving results on the pseudorandomness of sequences generated via the additive order of a finite field
- On the measures of pseudorandomness of binary sequences.
- On Pseudorandom Sequences and Their Application
- scientific article; zbMATH DE number 5619271 (Why is no real title available?)
- On pseudorandom properties of some Dirichlet characters
- Measures of pseudorandomness of finite binary lattices, I. The measures Qk, normality
- On the \(k\)-error linear complexity of binary sequences derived from the discrete logarithm in finite fields
- On pseudorandom sequences of \(k\) symbols constructed using finite fields
- scientific article; zbMATH DE number 3942590 (Why is no real title available?)
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Random polynomials in Legendre symbol sequences
- On the pseudorandomness of the Liouville function of polynomials over a finite field
- A finite pseudorandom binary sequence
- On pseudorandom binary sequences constructed by using finite fields
- Pseudorandomness of binary sequences derived from linear recursions
- Finite and infinite pseudorandom binary words
- Multiplicative character sums of a class of nonlinear recurrence vector sequences
- On the pseudorandomness of quaternary sequences derived from sequences over \(\mathbb{F}_4\)
- scientific article; zbMATH DE number 2051161 (Why is no real title available?)
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- On linear recursion and pseudorandomness
This page was built for publication: Measures of pseudorandomness for binary sequences constructed using finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024437)