On linear recursion and pseudorandomness
From MaRDI portal
Recommendations
- Pseudorandomness of binary sequences derived from linear recursions
- On a family of pseudorandom binary sequences
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- On pseudorandom binary sequences constructed by using finite fields
- Measures of pseudorandomness for binary sequences constructed using finite fields
Cited in
(18)- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Concatenation of pseudorandom binary sequences
- Linear complexity profile of binary sequences with small correlation measure
- On a family of pseudorandom binary sequences
- On the d-ary generalized Legendre-Sidelnikov sequence
- Pseudorandomness of binary sequences derived from linear recursions
- Pseudorandomness for Linear Length Branching Programs and Stack Machines
- Multiplicative character sums of a class of nonlinear recurrence vector sequences
- scientific article; zbMATH DE number 5619271 (Why is no real title available?)
- scientific article; zbMATH DE number 2051228 (Why is no real title available?)
- Elliptic curve analogues of a pseudorandom generator
- Measures of pseudorandomness: arithmetic autocorrelation and correlation measure
- New sequences of period \(p^n\) and \(p^n+1\) via projective linear groups
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- On Pseudorandom Sequences and Their Application
- On the pseudorandom properties of k-ary Sidel'nikov sequences
- Linear recursion properties of uncorrelated binary sequences
- A technique to study the correlation measures of binary sequences
This page was built for publication: On linear recursion and pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315177)