Cryptology ePrint Archive: Report 2014/658
A Class of FSRs and Their Adjacency Graphs
Ming Li and Dongdai Lin
Abstract: In this paper, We find a way to construct FSRs. The constructed FSRs can be depicted in many ways.
They are just the FSRs whose characteristic polynomial can be written as $g=(x_0+x_1)*f$ for some $f$.
Their adjacency graphs do not contain self-loops. Further more, we can divide the vertexes in their adjacency graphs into two sets such that
the edges are all between the two sets. The number of this class of FSRs is also considered. Besides, some applications in
LFSRs and constructing full cycles are presented.
Category / Keywords: secret-key cryptography / cycle structure, adjacency graph, FSR
Date: received 24 Aug 2014
Contact author: liming at iie ac cn
Available format(s): PDF | BibTeX Citation
Version: 20140827:074541 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]