Welcome to the resource topic for 2020/1416
Title:
Further on the Construction of Feedback Shift Registers with Maximum Strong Linear Complexity
Authors: Congwei Zhou, Bin Hu, 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.
ePrint: https://eprint.iacr.org/2020/1416
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .