Construction of pseudorandom binary sequences using additive characters
From MaRDI portal
Recommendations
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- A construction of pseudorandom binary sequences using rational functions
- Construction of large families of pseudorandom binary sequences
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
Cited in
(38)- Construction of large families of pseudorandom binary sequences
- Design of long period pseudo-random sequences from the addition of \(m\)-sequences over \({\mathbb F}_p\)
- Large families of pseudorandom sequences of k symbols and their complexity, Part I
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- Binary sequence family with both small cross-correlation and large family complexity
- On the correlation of families of pseudorandom sequences of \(k\) symbols
- Elliptic curve analogue of Legendre sequences
- Sequences related to Legendre/Jacobi sequences
- A construction of pseudorandom binary sequences using rational functions
- On the correlation of pseudorandom binary sequences using additive characters
- Construction of large families of pseudorandom binary sequences
- On large families of subsets of the set of the integers not exceeding \(N\)
- Gowers uniformity norm and pseudorandom measures of the pseudorandom binary sequences
- A Study on the Pseudorandom Properties of Sequences Generated Via the Additive Order
- Extension of the notion of collision and avalanche effect to sequences of \(k\) symbols
- Elliptic curve analogues of a pseudorandom generator
- On a problem of D.H. Lehmer and pseudorandom binary sequences
- Pseudorandomness of binary sequences derived from linear recursions
- A note on certain modular constructions of pseudorandom binary sequences with composite moduli
- Correlation measures of binary sequences using additive characters
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\). II
- Kloosterman sums with Beatty sequences and application
- On the symmetry measure of pseudorandom subsets
- On pseudo-random subsets of \({\mathbb{Z}}_n\)
- Construction of pseudorandom binary lattices based on multiplicative characters
- On the correlation measures of subsets
- Construction of pseudorandom binary sequences using additive characters over \(GF(2^k)\)
- A large family of pseudorandom binary lattices
- Modified constructions of binary sequences using multiplicative inverse
- Concatenation of pseudorandom binary sequences
- On the complexity of families of pseudo-random subsets
- A construction of pseudorandom binary sequences using both additive and multiplicative characters
- The truncated sum-of-digits function of powers
- More constructions of pseudorandom lattices of \(k\) symbols
- Finite binary sequences constructed by explicit inversive methods
- On pseudorandomness of families of binary sequences
- Large families of pseudorandom sequences of k symbols and their complexity, Part II
- More constructions of pseudorandom sequences of \(k\) symbols
This page was built for publication: Construction of pseudorandom binary sequences using additive characters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881645)
