Modular constructions of pseudorandom binary sequences with composite moduli
\textit{C. Mauduit} and \textit{A. Sarközy} [Acta Arith. 82, No. 4, 365--377 (1997; Zbl 0886.11048)] introduced (and analyzed in a series of papers partly with coauthors) three measures of randomness for a finite binary sequence \(E_N\) of length \(N\), the well-distribution measure \(W(E_N)\), the correlation measure \(C_k(E_N)\) of order \(k\), and the normality measure of order \(k\). In this paper the authors investigate the Jacobi sequences with polynomial argument for a modulus \(m=pq\) with two odd primes \(p<q\) showing that \(W(E_N)\) and \(C_2(E_N)\) are small but \(C_4(E_N)\) is large. They also extend and analyze the constructions of \textit{C. Mauduit} and the authors [Monatsh. Math. 141, No. 3, 197--208 (2004; Zbl 1110.11024)] and \textit{C. Mauduit} and \textit{A. Sárközy} [Acta Math. Hung. 108, No. 3, 239--252 (2005; Zbl 1102.11038)] to composite \(m=pq\).
- A note on certain modular constructions of pseudorandom binary sequences with composite moduli
- Pseudorandom binary sequences with composite moduli
- On the correlation of pseudorandom binary sequences with composite moduli
- Pseudorandom subsets with composite moduli
- Construction of pseudorandom binary sequences by using the multiplicative inverse
- Pseudorandom subsets formed by power residues with composite moduli
- Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
- Pseudorandom Bit Generators That Fool Modular Sums
- On pseudorandom binary sequences constructed by using finite fields
- On p-pseudorandom binary sequences
- On pseudo-random subsets of \({\mathbb{Z}}_n\)
- Concatenation of pseudorandom binary sequences
- On the \(N\)th linear complexity of automatic sequences
- On the correlation measures of subsets
- Sequences related to Legendre/Jacobi sequences
- Pseudo-randomness of certain sequences of k symbols with length pq
- The truncated sum-of-digits function of powers
- Exponential sums with Piatetski-Shapiro sequences and their application to modular hyperbolas
- Large family of pseudorandom subsets of the set of the integers not exceeding N
- On the limit distribution of the normality measure of random binary sequences
- On the distribution of consecutive square-free primitive roots modulo \(p\).
- On pseudorandom binary sequences constructed by using finite fields
- Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq
- On the correlation of pseudorandom binary sequences with composite moduli
- On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences
- Critical distances in pseudorandom sequences generated with composite moduli
- On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function
- Elliptic curve analogues of a pseudorandom generator
- A note on certain modular constructions of pseudorandom binary sequences with composite moduli
- Pseudorandom binary sequences with composite moduli
- On a problem of D. H. Lehmer
- Large families of pseudo-random subsets formed by generalized cyclotomic classes
- Large families of pseudorandom binary sequences constructed by using Fermat quotients
- Kloosterman sums with Beatty sequences and application
- Binary sequence family with both small cross-correlation and large family complexity
- Correlation measures of binary sequences using additive characters
- On the distribution of consecutive (k, r)-integer primitive roots modulo p
- Modular hyperbolas over the intersection of Beatty sequences and Piatetski-Shapiro sequences
- Bounds for exponential sums over integers with restricted digits
- Elliptic curve analogue of Legendre sequences
- Finite binary sequences constructed by explicit inversive methods
This page was built for publication: Modular constructions of pseudorandom binary sequences with composite moduli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495706)
