Paper 2020/1416
Further on the Construction of Feedback Shift Registers with Maximum Strong Linear Complexity
Congwei Zhou, Bin Hu, and Jie Guan
Abstract
In this paper, we present the more accurate definition of strong linear complexity of feedback shift registers based on Boolean algebraic than before, and analyze the bound of strong linear complexity by the fixed feedback function. Furthermore, the feedback shift registers with maximum strong linear complexity are constructed, whose feedback functions require the least number of monomials. We also show that the conclusions provide particular ideas and criteria for the design of feedback shift registers.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint. MINOR revision.
- Keywords
- Feedback shift register，Strong linear complexity，Non-singular，$r - $cycle
- Contact author(s)
- zhoucongwei @ qq com
- History
- 2020-11-15: received
- Short URL
- https://ia.cr/2020/1416
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1416,
author = {Congwei Zhou and Bin Hu and Jie Guan},
title = {Further on the Construction of Feedback Shift Registers with Maximum Strong Linear Complexity},
howpublished = {Cryptology ePrint Archive, Paper 2020/1416},
year = {2020},
note = {\url{https://eprint.iacr.org/2020/1416}},
url = {https://eprint.iacr.org/2020/1416}
}
