**The Adjacency Graphs of Some Feedback Shift Registers**

*Ming Li and Yupeng Jiang and Dongdai Lin*

**Abstract: **The adjacency graphs of feedback shift registers (FSRs) with characteristic function of the form g=(x_0+x_1)*f are considered in this paper. Some properties about these FSRs are given. It is proved that these FSRs contains only prime cycles and these cycles can be divided into two sets such that each set contains no adjacent cycles. When f is a linear function, more properties about these FSRs are derived. It is shown that, when f is a linear function and contains an odd number of terms, the adjacency graph of \mathrm{FSR}((x_0+x_1)*f) can be determined directly from the adjacency graph of \mathrm{FSR}(f). As an application of these results, we determine the adjacency graphs of \mathrm{FSR}((1+x)^4p(x)) and \mathrm{FSR}((1+x)^5p(x)), where p(x) is a primitive polynomial, and construct a large class of de Bruijn sequences from them.

**Category / Keywords: **secret-key cryptography / cycle structure, adjacency graph, FSR

**Date: **received 24 Aug 2014, last revised 5 Nov 2015

**Contact author: **liming at iie ac cn

**Available format(s): **PDF | BibTeX Citation

**Version: **20151105:102814 (All versions of this report)

**Short URL: **ia.cr/2014/658

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]