Binary Sequences Derived From Differences of Consecutive Primitive Roots
From MaRDI portal
Publication:4958230
DOI10.1109/TIT.2021.3088143zbMATH Open1486.11155arXiv2105.08003OpenAlexW3170761584MaRDI QIDQ4958230FDOQ4958230
Publication date: 7 September 2021
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Let be the ordered primitive roots modulo~. We study the pseudorandomness of the binary sequence defined by , . In particular, we study the balance, linear complexity and -adic complexity of . We show that for a typical the sequence is quite unbalanced. However, there are still infinitely many such that is very balanced. We also prove similar results for the distribution of longer patterns. Moreover, we give general lower bounds on the linear complexity and -adic complexity of~ and state sufficient conditions for attaining their maximums. Hence, for carefully chosen , these sequences are attractive candidates for cryptographic applications.
Full work available at URL: https://arxiv.org/abs/2105.08003
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Pseudo-random numbers; Monte Carlo methods (11K45)
Cited In (4)
- Balance and pattern distribution of sequences derived from pseudorandom subsets of \(\mathbb{Z}_q\)
- Balance, pattern distribution and linear complexity of \(M\)-ary sequences from Sidel'nikov sequences
- Binary sequences derived from differences of consecutive quadratic residues
- On the Distinctness of Binary Sequences Derived From Primitive Sequences Modulo Square-Free Odd Integers
This page was built for publication: Binary Sequences Derived From Differences of Consecutive Primitive Roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958230)