You are looking at a specific version 20140827:074541 of this paper. See the latest version.

Paper 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.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
cycle structureadjacency graphFSR
Contact author(s)
liming @ iie ac cn
History
2015-11-05: revised
2014-08-27: received
See all versions
Short URL
https://ia.cr/2014/658
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.