On pseudorandomness of families of binary sequences
From MaRDI portal
Publication:516796
DOI10.1016/J.DAM.2015.07.031zbMATH Open1372.11083OpenAlexW1176406287MaRDI QIDQ516796FDOQ516796
Authors: András Sárközy
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.031
Recommendations
- Families of Pseudorandom Binary Sequences with Low Cross-Correlation Measure
- Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- Measures of pseudorandomness of families of binary lattices. II: A further construction
- Collision and avalanche effect in families of pseudorandom binary sequences
cross-correlation measurefamily complexitypseudorandomcollisionavalanche effectdistance minimumfamily of binary sequences
Cites Work
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Title not available (Why is that?)
- On the complexity of a family related to the Legendre symbol
- A complexity measure for families of binary sequences
- On the complexity of a family of Legendre sequences with irreducible polynomials
- Family complexity and cross-correlation measure for families of binary sequences
- The cross-correlation measure for families of binary sequences
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Title not available (Why is that?)
- Construction of large families of pseudorandom binary sequences
- Cryptographic Boolean functions and applications.
- Arithmetic crosscorrelations of feedback with carry shift register sequences
- On finite pseudorandom binary sequences VII: The measures of pseudorandomness
- 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
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- Measures of pseudorandomness of families of binary lattices. I: Definitions, a construction using quadratic characters
- Title not available (Why is that?)
- On a family of pseudorandom binary sequences
- On the complexity of families of pseudo-random subsets
- A family of pseudorandom binary sequences constructed by the multiplicative inverse
- Advances in the merit factor problem for binary sequences
- Extension of the notion of collision and avalanche effect to sequences of \(k\) symbols
- On pseudorandomness in families of sequences derived from the Legendre symbol
- Title not available (Why is that?)
- Structured Design of Substitution-Permutation Encryption Networks
- Family complexity and VC-dimension
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part I
- A one-way function based on norm form equations
- Collision and avalanche effect in families of pseudorandom binary sequences
- The study of collision and avalanche effect in a family of pseudorandom binary sequences
Cited In (16)
- Collision and avalanche effect in families of pseudorandom binary sequences
- Families of Pseudorandom Binary Sequences with Low Cross-Correlation Measure
- Binary sequence family with both small cross-correlation and large family complexity
- A new lower bound on the family complexity of Legendre sequences
- Title not available (Why is that?)
- On an inequality between pseudorandom measures of lattices
- On the complexity of a family of Legendre sequences with irreducible polynomials
- On finite pseudorandom binary sequences and their applications in cryptography
- Measures of pseudorandomness of families of binary lattices. II: A further construction
- Title not available (Why is that?)
- On the measures of pseudorandomness of binary sequences.
- On \(p\)-pseudorandom binary sequences
- On the lifetime of a random binary sequence
- On a pseudorandom property of binary sequences
- Large Families of Pseudorandom Sequences of k Symbols and Their Complexity – Part II
- On the pseudorandomness of binary and quaternary sequences linked by the Gray mapping
This page was built for publication: On pseudorandomness of families of binary sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516796)