Pseudorandomness of binary sequences derived from linear recursions
From MaRDI portal
Publication:313462
DOI10.1007/S10998-015-0085-0zbMATH Open1363.11076OpenAlexW2183750860MaRDI QIDQ313462FDOQ313462
Authors: László Mérai 
Publication date: 9 September 2016
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-015-0085-0
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
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Measures of pseudorandomness for finite sequences: typical values
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- Construction of pseudorandom binary sequences using additive characters
- On linear recursion and pseudorandomness
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- Construction of pseudorandom binary lattices based on multiplicative characters
Cited In (7)
- On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
- Title not available (Why is that?)
- On linear recursion and pseudorandomness
- Measures of pseudorandomness for binary sequences constructed using finite fields
- On a pseudorandom property of binary sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
