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

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

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...

Full description

Bibliographic Details
Main Authors: Yuhua Sun, Qiuyan Wang, Tongjiang Yan, Chun'E Zhao
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">p</italic>-ary <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">m</italic>-sequence
LSB sequence
autocorrelation
2-adic complexity
Online Access:https://ieeexplore.ieee.org/document/9154692/

Internet

https://ieeexplore.ieee.org/document/9154692/

Similar Items