English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encryption Standard. Therefore, analyzing the statistical properties (for example, autocorrelation, linear complexity and 2-adic complexity) of these sequences becomes an important research topic. In this article, we first reduce the autocorrelation distribution of the LSB sequence of a p-ary m-sequence with period p<sup>n</sup>-1 for any order n≥2 to the autocorrelation distribution of a corresponding Costas sequence with period p-1, and from the computing of which by computer, we obtain the explicit autocorrelation distribution of the LSB sequence for each prime p<; 100. In addition, we give a lower bound on the 2-adic complexity of each of these LSB sequences for all primes p<; 20, which proves to be large enough to resist the analysis of RAA (Rational Approximation Algorithm) for FCSRs (Feedback with Carry Shift Registers). In particular, for a Mersenne prime p=2<sup>k</sup>-1 (i.e., k is a prime such that p is also a prime), our results hold for all its bit-component sequences since they are shift equivalent to the LSB sequence.

Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-Ary m-Sequence