Paper 2024/632
Further Investigations on Nonlinear Complexity of Periodic Binary Sequences
Abstract
Nonlinear complexity is an important measure for assessing the randomness of sequences. In this paper we investigate how circular shifts affect the nonlinear complexities of finite-length binary sequences and then reveal a more explicit relation between nonlinear complexities of finite-length binary sequences and their corresponding periodic sequences. Based on the relation, we propose two algorithms that can generate all periodic binary sequences with any prescribed nonlinear complexity.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- Periodic sequencenonlinear complexityrandomness.
- Contact author(s)
-
yuanqin2020 @ aliyun com
chunlei li @ uib no
xiangyongzeng @ aliyun com
tor helleseth @ uib no
hedebiao @ whu edu cn - History
- 2024-04-26: approved
- 2024-04-25: received
- See all versions
- Short URL
- https://ia.cr/2024/632
- License
-
CC BY-NC-ND
BibTeX
@misc{cryptoeprint:2024/632,
author = {Qin Yuan and Chunlei Li and Xiangyong Zeng and Tor Helleseth and Debiao He},
title = {Further Investigations on Nonlinear Complexity of Periodic Binary Sequences},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/632},
year = {2024},
url = {https://eprint.iacr.org/2024/632}
}
