Linear Feedback Shift Registers

Andreas Klein
Additional contact information
Andreas Klein: State University of Ghent, Dept. of Pure Mathem. & Computer Algebra

Chapter Chapter 2 in Stream Ciphers, 2013, pp 17-58 from Springer

Abstract: Abstract Linear Feedback Shift Registers (LFSRs) have nice statistical properties and a well developed theory. They are also cheap and fast. This makes them attractive as basis for ciphers. In this chapter we will review the part of the theory we will need. A focus lies on the algorithmic parts.

Keywords: Linear Complexity; Shift Register; Stream Cipher; Multiple Root; Bend Function (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4471-5079-4_2

Ordering information: This item can be ordered from
http://www.springer.com/9781447150794

DOI: 10.1007/978-1-4471-5079-4_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().