Some Notes on the Two-Prime Generator of Order<tex>$2$</tex>

DOI10.1109/TIT.2005.855615zbMath1282.94026MaRDI QIDQ3546605

Nina Brandstätter, Arne Winterhof

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2005.855615

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

Related Items

Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation, Linear complexity problem of binary Jacobi sequence, Autocorrelation of the Modified Binary Two-Prime Sidelnikov Sequence, Unnamed Item, Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length \(pq\), Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\), New \((q,K,\lambda)\)-ADFs via cyclotomy, A note on cyclic almost difference families, The existence of almost difference families, The existence of \((q,k,\lambda ,t)\)-ADFs for \(k=4,5,6\), Linear complexity of binary Whiteman generalized cyclotomic sequences of order \(2^k\), On the \(N\)th linear complexity of automatic sequences, Linear complexity of generalized cyclotomic sequences of order 4 over \(\mathbb{F}_l\), Constructions of \((q,K,\lambda, t,Q)\) almost difference families, Sequences related to Legendre/Jacobi sequences, Correlation of the two-prime Sidel'nikov sequence, Pseudo-randomness of certain sequences of \(k\) symbols with length \(pq\), Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\), The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function