Revisiting LFSRs for Cryptographic Applications

@article{Arnault2011RevisitingLF,
  title={Revisiting LFSRs for Cryptographic Applications},
  author={François Arnault and Thierry P. Berger and Marine Minier and Benjamin Pousse},
  journal={IEEE Transactions on Information Theory},
  year={2011},
  volume={57},
  pages={8095-8113}
}
Linear finite state machines (LFSMs) are particular primitives widely used in information theory, coding theory and cryptography. Among those linear automata, a particular case of study is linear feedback shift registers (LFSRs) used in many cryptographic applications such as design of stream ciphers or pseudo-random generation. LFSRs could be seen as particular LFSMs without inputs. In this paper, we first recall the description of LFSMs using traditional matrices representation. Then, we… CONTINUE READING
11 Extracted Citations
46 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 11 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 46 references

Specification of the bluetooth system, volu me 1: Core, v1.1

  • Bluetooth
  • Bluetooth SIG, February 2001.
  • 2001
Highly Influential
8 Excerpts

Golomb,Shift Register Sequences

  • S W.
  • Aegen Park Press,
  • 1981
Highly Influential
6 Excerpts

Algebraic shift register se qu nces

  • M. Goresky, A. Klapper
  • 2009, avalaible at http://cs.engr.uky.edu…
  • 2009
3 Excerpts

Similar Papers

Loading similar papers…