Cryptology ePrint Archive: Report 2020/1416

Further on the Construction of Feedback Shift Registers with Maximum Strong Linear Complexity

Congwei Zhou and 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.

Category / Keywords: foundations / Feedback shift register,Strong linear complexity,Non-singular,$r - $cycle

Date: received 13 Nov 2020

Contact author: zhoucongwei at qq com

Available format(s): PDF | BibTeX Citation

Version: 20201115:073824 (All versions of this report)

Short URL: ia.cr/2020/1416


[ Cryptology ePrint archive ]