Pseudorandomness of binary sequences derived from linear recursions
From MaRDI portal
Recommendations
- On linear recursion and pseudorandomness
- Measures of pseudorandomness for binary sequences constructed using finite fields
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- On the measures of pseudorandomness of binary sequences.
- On a pseudorandom property of binary sequences
Cites work
- Construction of pseudorandom binary lattices based on multiplicative characters
- Construction of pseudorandom binary sequences using additive characters
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- Measures of pseudorandomness for finite sequences: typical values
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On linear recursion and pseudorandomness
Cited in
(7)- scientific article; zbMATH DE number 3866254 (Why is no real title available?)
- On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
- On a pseudorandom property of binary sequences
- scientific article; zbMATH DE number 3949403 (Why is no real title available?)
- Measures of pseudorandomness for binary sequences constructed using finite fields
- scientific article; zbMATH DE number 2051228 (Why is no real title available?)
- On linear recursion and pseudorandomness
This page was built for publication: Pseudorandomness of binary sequences derived from linear recursions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313462)
