Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p -Ary m -Sequence
| Autor: | Chun'e Zhao, Qiuyan Wang, Tongjiang Yan, Yuhua Sun |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
Discrete mathematics Sequence General Computer Science Information Theory (cs.IT) Computer Science - Information Theory Mersenne prime Autocorrelation autocorrelation General Engineering Approximation algorithm LSB sequence Upper and lower bounds Prime (order theory) 2-adic complexity Least significant bit General Materials Science lcsh:Electrical engineering. Electronics. Nuclear engineering Stream cipher lcsh:TK1-9971 Mathematics |
| Zdroj: | IEEE Access, Vol 8, Pp 151415-151425 (2020) |
| ISSN: | 2169-3536 |
| Popis: | 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 paper, we first reduce the autocorrelation distribution of the LSB sequence of a $p$-ary $m$-sequence with period $p^n-1$ for any order $n\geq2$ 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 16 pages. arXiv admin note: text overlap with arXiv:1701.03766 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|