Stream Cipher Design based on Jumping Finite State Machines

@article{Jansen2005StreamCD,
  title={Stream Cipher Design based on Jumping Finite State Machines},
  author={Cees J. A. Jansen},
  journal={IACR Cryptology ePrint Archive},
  year={2005},
  volume={2005},
  pages={267}
}
This paper presents a new way of constructing binary cascade clock-controlled LFSR sequence generators as building blocks for stream ciphers. In these constructions the bottleneck of multiple clocking shift registers is removed, resulting in so called jump-controlled sequence generators, that operate in a single clock pulse and are most efficient to implement. The constructions make use of special properties of irreducible polynomials over finite fields. This paper also aims at giving insight… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

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

Partitions of Polynomials: Stream Ciphers based on Jumping Shift Registers

  • C.J.A. Jansen
  • Twenty-sixth Symposium on Information Theory in…
  • 2005
2 Excerpts

Stream Cipher Design: Make your LFSRs jump

  • C.J.A. Jansen
  • Workshop Record ECRYPT-State of the Art of Stream…
  • 2004
1 Excerpt

Modern Stream Cipher Design: A new view on multiple clocking and irreducible polynomials

  • C.J.A. Jansen
  • Actas de la VII Reunión Española sobre Criptolo…
  • 2002
1 Excerpt

Stream Ciphers and Number Theory

  • T. W. Cusick, C. Ding, A. Renvall
  • North-Holland Mathematical Library, Elsevier…
  • 1998

Finite Fields, Encyclopedia of Mathematics and its Aplications 20

  • R. Lidl, H. Niederreiter
  • 1997

Clock-controlled Shift Registers in Binary Sequence Generators

  • W. G. Chambers
  • IEE Proceedings, vol. 135, Part E, no. 1
  • 1988

Similar Papers

Loading similar papers…