Binary Sequences Derived From Differences of Consecutive Primitive Roots

From MaRDI portal
Publication:4958230

DOI10.1109/TIT.2021.3088143zbMATH Open1486.11155arXiv2105.08003OpenAlexW3170761584MaRDI QIDQ4958230FDOQ4958230

Zibi Xiao, Arne Winterhof

Publication date: 7 September 2021

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

Abstract: Let 1<g1<ldots<gvarphi(p1)<p1 be the ordered primitive roots modulo~p. We study the pseudorandomness of the binary sequence (sn) defined by , n=0,1,ldots. In particular, we study the balance, linear complexity and 2-adic complexity of (sn). We show that for a typical p the sequence (sn) is quite unbalanced. However, there are still infinitely many p such that (sn) 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 2-adic complexity of~(sn) and state sufficient conditions for attaining their maximums. Hence, for carefully chosen p, these sequences are attractive candidates for cryptographic applications.


Full work available at URL: https://arxiv.org/abs/2105.08003






Cited In (4)






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)